@dynatrace/strato-components 3.12.2 → 3.13.2

package/esm/charts/sankey-chart/types/sankey-shape.js

@@ -0,0 +1 @@
+//# sourceMappingURL=sankey-shape.js.map

package/esm/charts/sankey-chart/types/sankey-state.js

@@ -0,0 +1 @@
+//# sourceMappingURL=sankey-state.js.map

package/esm/charts/sankey-chart/types/sankey-state.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": [],
+  "sourcesContent": [],
+  "mappings": "",
+  "names": []
+}

package/esm/charts/sankey-chart/utils/find-connected-shapes.js

@@ -0,0 +1,26 @@
+function findConnectedShapes(shape) {
+  if (shape.type === "link") {
+    return {
+      nodes: /* @__PURE__ */ new Set([shape.source, shape.target]),
+      links: /* @__PURE__ */ new Set([shape.link])
+    };
+  }
+  const { node } = shape;
+  const sourceLinks = node.sourceLinks ?? [];
+  const targetLinks = node.targetLinks ?? [];
+  const nodes = /* @__PURE__ */ new Set([node]);
+  const links = /* @__PURE__ */ new Set();
+  for (const link of sourceLinks) {
+    links.add(link);
+    nodes.add(link.target);
+  }
+  for (const link of targetLinks) {
+    links.add(link);
+    nodes.add(link.source);
+  }
+  return { nodes, links };
+}
+export {
+  findConnectedShapes
+};
+//# sourceMappingURL=find-connected-shapes.js.map

package/esm/charts/sankey-chart/utils/find-connected-shapes.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../../src/charts/sankey-chart/utils/find-connected-shapes.ts"],
+  "sourcesContent": ["import type {\n  SankeyLayoutLink,\n  SankeyLayoutNode,\n} from '../types/sankey-internal.js';\n\ninterface ConnectedShapes {\n  nodes: ReadonlySet<SankeyLayoutNode>;\n  links: ReadonlySet<SankeyLayoutLink>;\n}\n\n/**\n * A resolved layout selection ready for connected-shape computation.\n *\n * - `node`: the clicked layout node (source/target links are already\n *   populated by d3-sankey).\n * - `link`: the clicked layout link with its endpoint nodes already resolved\n *   to objects by the caller; callers must guard with `isResolvedNode` before\n *   passing here so the function never needs to cast.\n */\ntype ResolvedShape =\n  | { type: 'node'; node: SankeyLayoutNode }\n  | {\n      type: 'link';\n      link: SankeyLayoutLink;\n      source: SankeyLayoutNode;\n      target: SankeyLayoutNode;\n    };\n\n/**\n * Computes the 1-hop connected set for a resolved layout shape.\n *\n * - **Node**: the node, all of its direct source/target links, and the\n *   other-end nodes of those links. Does not traverse further hops.\n * - **Link**: the link and its two endpoint nodes.\n *\n * Handles isolated nodes (no `sourceLinks`/`targetLinks`) without throwing.\n */\nexport function findConnectedShapes(shape: ResolvedShape): ConnectedShapes {\n  if (shape.type === 'link') {\n    return {\n      nodes: new Set([shape.source, shape.target]),\n      links: new Set([shape.link]),\n    };\n  }\n\n  const { node } = shape;\n  const sourceLinks = node.sourceLinks ?? [];\n  const targetLinks = node.targetLinks ?? [];\n\n  const nodes = new Set<SankeyLayoutNode>([node]);\n  const links = new Set<SankeyLayoutLink>();\n\n  for (const link of sourceLinks) {\n    links.add(link);\n    nodes.add(link.target as SankeyLayoutNode);\n  }\n\n  for (const link of targetLinks) {\n    links.add(link);\n    nodes.add(link.source as SankeyLayoutNode);\n  }\n\n  return { nodes, links };\n}\n"],
+  "mappings": "AAqCO,SAAS,oBAAoB,OAAuC;AACzE,MAAI,MAAM,SAAS,QAAQ;AACzB,WAAO;AAAA,MACL,OAAO,oBAAI,IAAI,CAAC,MAAM,QAAQ,MAAM,MAAM,CAAC;AAAA,MAC3C,OAAO,oBAAI,IAAI,CAAC,MAAM,IAAI,CAAC;AAAA,IAC7B;AAAA,EACF;AAEA,QAAM,EAAE,KAAK,IAAI;AACjB,QAAM,cAAc,KAAK,eAAe,CAAC;AACzC,QAAM,cAAc,KAAK,eAAe,CAAC;AAEzC,QAAM,QAAQ,oBAAI,IAAsB,CAAC,IAAI,CAAC;AAC9C,QAAM,QAAQ,oBAAI,IAAsB;AAExC,aAAW,QAAQ,aAAa;AAC9B,UAAM,IAAI,IAAI;AACd,UAAM,IAAI,KAAK,MAA0B;AAAA,EAC3C;AAEA,aAAW,QAAQ,aAAa;AAC9B,UAAM,IAAI,IAAI;AACd,UAAM,IAAI,KAAK,MAA0B;AAAA,EAC3C;AAEA,SAAO,EAAE,OAAO,MAAM;AACxB;",
+  "names": []
+}

package/esm/charts/sankey-chart/utils/find-hovered-shape.js

@@ -1,4 +1,3 @@
-import { getRelatedSankeyFlow } from "./get-related-sankey-flow.js";
 import { isResolvedNode } from "./is-resolved-sankey-node.js";
 const BISECTION_ITERATIONS = 24;
 function isPointInNode(node, point) {
@@ -46,22 +45,16 @@ function isPointInLinkRibbon(link, point) {
 function findHoveredShape(layout, point) {
   for (const node of layout.nodes) {
     if (isPointInNode(node, point)) {
-      const { nodes: relatedNodes, links: relatedLinks } = getRelatedSankeyFlow(node);
-      return {
-        type: "node",
-        node,
-        relatedNodes,
-        relatedLinks
-      };
+      return { type: "node", nodeId: node.id };
     }
   }
   for (const link of layout.links) {
     if (isResolvedNode(link.source) && isResolvedNode(link.target) && isPointInLinkRibbon(link, point)) {
       return {
         type: "link",
-        link,
-        source: link.source,
-        target: link.target
+        sourceId: link.source.id,
+        targetId: link.target.id,
+        linkIndex: link.index ?? 0
       };
     }
   }

package/esm/charts/sankey-chart/utils/find-hovered-shape.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../../src/charts/sankey-chart/utils/find-hovered-shape.ts"],
-  "sourcesContent": ["import { getRelatedSankeyFlow } from './get-related-sankey-flow.js';\nimport { isResolvedNode } from './is-resolved-sankey-node.js';\nimport type { Point } from '../../core/types/point.js';\nimport type { SankeyHoveredShape } from '../types/sankey-hover.js';\nimport type {\n  SankeyLayoutLink,\n  SankeyLayoutModel,\n  SankeyLayoutNode,\n} from '../types/sankey-internal.js';\n\nconst BISECTION_ITERATIONS = 24;\n\nexport function isPointInNode(node: SankeyLayoutNode, point: Point): boolean {\n  const x0 = node.x0 ?? 0;\n  const x1 = node.x1 ?? 0;\n  const y0 = node.y0 ?? 0;\n  const y1 = node.y1 ?? 0;\n\n  return point.x >= x0 && point.x <= x1 && point.y >= y0 && point.y <= y1;\n}\n\nfunction cubicAt(\n  p0: number,\n  p1: number,\n  p2: number,\n  p3: number,\n  t: number,\n): number {\n  const oneMinusT = 1 - t;\n  return (\n    oneMinusT * oneMinusT * oneMinusT * p0 +\n    3 * oneMinusT * oneMinusT * t * p1 +\n    3 * oneMinusT * t * t * p2 +\n    t * t * t * p3\n  );\n}\n\nexport function isPointInLinkRibbon(\n  link: SankeyLayoutLink,\n  point: Point,\n): boolean {\n  if (!isResolvedNode(link.source) || !isResolvedNode(link.target)) {\n    return false;\n  }\n\n  const sx = link.source.x1 ?? 0;\n  const sy = link.y0 ?? 0;\n  const tx = link.target.x0 ?? 0;\n  const ty = link.y1 ?? 0;\n  const mx = (sx + tx) / 2;\n\n  if (sx === tx || point.x < sx || point.x > tx) {\n    return false;\n  }\n\n  // x(t) is monotone increasing for this control-point layout: the control\n  // points are (sx, mx, mx, tx), so x'(t) = 3 (mx - sx) ((1-t)^2 + t^2) and\n  // mx - sx = tx - mx > 0 (given sx < tx). That lets us bisect on t to find\n  // the point on the centerline directly below/above the cursor, rather than\n  // solving the cubic in closed form.\n  let lo = 0;\n  let hi = 1;\n  for (let i = 0; i < BISECTION_ITERATIONS; i++) {\n    const mid = (lo + hi) / 2;\n    const x = cubicAt(sx, mx, mx, tx, mid);\n    if (x < point.x) {\n      lo = mid;\n    } else {\n      hi = mid;\n    }\n  }\n  const t = (lo + hi) / 2;\n\n  const cy = cubicAt(sy, sy, ty, ty, t);\n  const dxdt = 3 * (mx - sx) * ((1 - t) * (1 - t) + t * t);\n  const dydt = 6 * t * (1 - t) * (ty - sy);\n  const slope = dxdt === 0 ? 0 : dydt / dxdt;\n\n  const halfWidth = Math.max(link.width ?? 0, 1) / 2;\n  // The centerline's slope stretches the vertical footprint of a\n  // perpendicular band of half-width `halfWidth`; multiplying by\n  // hypot(1, slope) converts back to a vertical tolerance so the hit test\n  // matches the stroked band rather than over-reporting on steep sections.\n  return Math.abs(point.y - cy) <= halfWidth * Math.hypot(1, slope);\n}\n\n/**\n * Finds the sankey shape under `point`, if any.\n *\n * Nodes are tested before links: node rects are small, deliberate targets\n * that the wider ribbons converging on them would otherwise swallow. Within\n * each category, the first match in layout order wins.\n */\nexport function findHoveredShape(\n  layout: SankeyLayoutModel,\n  point: Point,\n): SankeyHoveredShape | undefined {\n  for (const node of layout.nodes) {\n    if (isPointInNode(node, point)) {\n      const { nodes: relatedNodes, links: relatedLinks } =\n        getRelatedSankeyFlow(node);\n      return {\n        type: 'node',\n        node,\n        relatedNodes,\n        relatedLinks,\n      };\n    }\n  }\n\n  for (const link of layout.links) {\n    if (\n      isResolvedNode(link.source) &&\n      isResolvedNode(link.target) &&\n      isPointInLinkRibbon(link, point)\n    ) {\n      return {\n        type: 'link',\n        link,\n        source: link.source,\n        target: link.target,\n      };\n    }\n  }\n\n  return undefined;\n}\n"],
-  "mappings": "AAAA,SAAS,4BAA4B;AACrC,SAAS,sBAAsB;AAS/B,MAAM,uBAAuB;AAEtB,SAAS,cAAc,MAAwB,OAAuB;AAC3E,QAAM,KAAK,KAAK,MAAM;AACtB,QAAM,KAAK,KAAK,MAAM;AACtB,QAAM,KAAK,KAAK,MAAM;AACtB,QAAM,KAAK,KAAK,MAAM;AAEtB,SAAO,MAAM,KAAK,MAAM,MAAM,KAAK,MAAM,MAAM,KAAK,MAAM,MAAM,KAAK;AACvE;AAEA,SAAS,QACP,IACA,IACA,IACA,IACA,GACQ;AACR,QAAM,YAAY,IAAI;AACtB,SACE,YAAY,YAAY,YAAY,KACpC,IAAI,YAAY,YAAY,IAAI,KAChC,IAAI,YAAY,IAAI,IAAI,KACxB,IAAI,IAAI,IAAI;AAEhB;AAEO,SAAS,oBACd,MACA,OACS;AACT,MAAI,CAAC,eAAe,KAAK,MAAM,KAAK,CAAC,eAAe,KAAK,MAAM,GAAG;AAChE,WAAO;AAAA,EACT;AAEA,QAAM,KAAK,KAAK,OAAO,MAAM;AAC7B,QAAM,KAAK,KAAK,MAAM;AACtB,QAAM,KAAK,KAAK,OAAO,MAAM;AAC7B,QAAM,KAAK,KAAK,MAAM;AACtB,QAAM,MAAM,KAAK,MAAM;AAEvB,MAAI,OAAO,MAAM,MAAM,IAAI,MAAM,MAAM,IAAI,IAAI;AAC7C,WAAO;AAAA,EACT;AAOA,MAAI,KAAK;AACT,MAAI,KAAK;AACT,WAAS,IAAI,GAAG,IAAI,sBAAsB,KAAK;AAC7C,UAAM,OAAO,KAAK,MAAM;AACxB,UAAM,IAAI,QAAQ,IAAI,IAAI,IAAI,IAAI,GAAG;AACrC,QAAI,IAAI,MAAM,GAAG;AACf,WAAK;AAAA,IACP,OAAO;AACL,WAAK;AAAA,IACP;AAAA,EACF;AACA,QAAM,KAAK,KAAK,MAAM;AAEtB,QAAM,KAAK,QAAQ,IAAI,IAAI,IAAI,IAAI,CAAC;AACpC,QAAM,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,IAAI,KAAK,IAAI;AACtD,QAAM,OAAO,IAAI,KAAK,IAAI,MAAM,KAAK;AACrC,QAAM,QAAQ,SAAS,IAAI,IAAI,OAAO;AAEtC,QAAM,YAAY,KAAK,IAAI,KAAK,SAAS,GAAG,CAAC,IAAI;AAKjD,SAAO,KAAK,IAAI,MAAM,IAAI,EAAE,KAAK,YAAY,KAAK,MAAM,GAAG,KAAK;AAClE;AASO,SAAS,iBACd,QACA,OACgC;AAChC,aAAW,QAAQ,OAAO,OAAO;AAC/B,QAAI,cAAc,MAAM,KAAK,GAAG;AAC9B,YAAM,EAAE,OAAO,cAAc,OAAO,aAAa,IAC/C,qBAAqB,IAAI;AAC3B,aAAO;AAAA,QACL,MAAM;AAAA,QACN;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,aAAW,QAAQ,OAAO,OAAO;AAC/B,QACE,eAAe,KAAK,MAAM,KAC1B,eAAe,KAAK,MAAM,KAC1B,oBAAoB,MAAM,KAAK,GAC/B;AACA,aAAO;AAAA,QACL,MAAM;AAAA,QACN;AAAA,QACA,QAAQ,KAAK;AAAA,QACb,QAAQ,KAAK;AAAA,MACf;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;",
+  "sourcesContent": ["import { isResolvedNode } from './is-resolved-sankey-node.js';\nimport type { Point } from '../../core/types/point.js';\nimport type {\n  SankeyLayoutLink,\n  SankeyLayoutModel,\n  SankeyLayoutNode,\n} from '../types/sankey-internal.js';\nimport type { SankeyShape } from '../types/sankey-shape.js';\n\nconst BISECTION_ITERATIONS = 24;\n\nexport function isPointInNode(node: SankeyLayoutNode, point: Point): boolean {\n  const x0 = node.x0 ?? 0;\n  const x1 = node.x1 ?? 0;\n  const y0 = node.y0 ?? 0;\n  const y1 = node.y1 ?? 0;\n\n  return point.x >= x0 && point.x <= x1 && point.y >= y0 && point.y <= y1;\n}\n\nfunction cubicAt(\n  p0: number,\n  p1: number,\n  p2: number,\n  p3: number,\n  t: number,\n): number {\n  const oneMinusT = 1 - t;\n  return (\n    oneMinusT * oneMinusT * oneMinusT * p0 +\n    3 * oneMinusT * oneMinusT * t * p1 +\n    3 * oneMinusT * t * t * p2 +\n    t * t * t * p3\n  );\n}\n\nexport function isPointInLinkRibbon(\n  link: SankeyLayoutLink,\n  point: Point,\n): boolean {\n  if (!isResolvedNode(link.source) || !isResolvedNode(link.target)) {\n    return false;\n  }\n\n  const sx = link.source.x1 ?? 0;\n  const sy = link.y0 ?? 0;\n  const tx = link.target.x0 ?? 0;\n  const ty = link.y1 ?? 0;\n  const mx = (sx + tx) / 2;\n\n  if (sx === tx || point.x < sx || point.x > tx) {\n    return false;\n  }\n\n  // x(t) is monotone increasing for this control-point layout: the control\n  // points are (sx, mx, mx, tx), so x'(t) = 3 (mx - sx) ((1-t)^2 + t^2) and\n  // mx - sx = tx - mx > 0 (given sx < tx). That lets us bisect on t to find\n  // the point on the centerline directly below/above the cursor, rather than\n  // solving the cubic in closed form.\n  let lo = 0;\n  let hi = 1;\n  for (let i = 0; i < BISECTION_ITERATIONS; i++) {\n    const mid = (lo + hi) / 2;\n    const x = cubicAt(sx, mx, mx, tx, mid);\n    if (x < point.x) {\n      lo = mid;\n    } else {\n      hi = mid;\n    }\n  }\n  const t = (lo + hi) / 2;\n\n  const cy = cubicAt(sy, sy, ty, ty, t);\n  const dxdt = 3 * (mx - sx) * ((1 - t) * (1 - t) + t * t);\n  const dydt = 6 * t * (1 - t) * (ty - sy);\n  const slope = dxdt === 0 ? 0 : dydt / dxdt;\n\n  const halfWidth = Math.max(link.width ?? 0, 1) / 2;\n  // The centerline's slope stretches the vertical footprint of a\n  // perpendicular band of half-width `halfWidth`; multiplying by\n  // hypot(1, slope) converts back to a vertical tolerance so the hit test\n  // matches the stroked band rather than over-reporting on steep sections.\n  return Math.abs(point.y - cy) <= halfWidth * Math.hypot(1, slope);\n}\n\n/**\n * Finds the sankey shape under `point`, if any.\n *\n * Nodes are tested before links: node rects are small, deliberate targets\n * that the wider ribbons converging on them would otherwise swallow. Within\n * each category, the first match in layout order wins.\n */\nexport function findHoveredShape(\n  layout: SankeyLayoutModel,\n  point: Point,\n): SankeyShape | undefined {\n  for (const node of layout.nodes) {\n    if (isPointInNode(node, point)) {\n      return { type: 'node', nodeId: node.id };\n    }\n  }\n\n  for (const link of layout.links) {\n    if (\n      isResolvedNode(link.source) &&\n      isResolvedNode(link.target) &&\n      isPointInLinkRibbon(link, point)\n    ) {\n      return {\n        type: 'link',\n        sourceId: link.source.id,\n        targetId: link.target.id,\n        linkIndex: link.index ?? 0,\n      };\n    }\n  }\n\n  return undefined;\n}\n"],
+  "mappings": "AAAA,SAAS,sBAAsB;AAS/B,MAAM,uBAAuB;AAEtB,SAAS,cAAc,MAAwB,OAAuB;AAC3E,QAAM,KAAK,KAAK,MAAM;AACtB,QAAM,KAAK,KAAK,MAAM;AACtB,QAAM,KAAK,KAAK,MAAM;AACtB,QAAM,KAAK,KAAK,MAAM;AAEtB,SAAO,MAAM,KAAK,MAAM,MAAM,KAAK,MAAM,MAAM,KAAK,MAAM,MAAM,KAAK;AACvE;AAEA,SAAS,QACP,IACA,IACA,IACA,IACA,GACQ;AACR,QAAM,YAAY,IAAI;AACtB,SACE,YAAY,YAAY,YAAY,KACpC,IAAI,YAAY,YAAY,IAAI,KAChC,IAAI,YAAY,IAAI,IAAI,KACxB,IAAI,IAAI,IAAI;AAEhB;AAEO,SAAS,oBACd,MACA,OACS;AACT,MAAI,CAAC,eAAe,KAAK,MAAM,KAAK,CAAC,eAAe,KAAK,MAAM,GAAG;AAChE,WAAO;AAAA,EACT;AAEA,QAAM,KAAK,KAAK,OAAO,MAAM;AAC7B,QAAM,KAAK,KAAK,MAAM;AACtB,QAAM,KAAK,KAAK,OAAO,MAAM;AAC7B,QAAM,KAAK,KAAK,MAAM;AACtB,QAAM,MAAM,KAAK,MAAM;AAEvB,MAAI,OAAO,MAAM,MAAM,IAAI,MAAM,MAAM,IAAI,IAAI;AAC7C,WAAO;AAAA,EACT;AAOA,MAAI,KAAK;AACT,MAAI,KAAK;AACT,WAAS,IAAI,GAAG,IAAI,sBAAsB,KAAK;AAC7C,UAAM,OAAO,KAAK,MAAM;AACxB,UAAM,IAAI,QAAQ,IAAI,IAAI,IAAI,IAAI,GAAG;AACrC,QAAI,IAAI,MAAM,GAAG;AACf,WAAK;AAAA,IACP,OAAO;AACL,WAAK;AAAA,IACP;AAAA,EACF;AACA,QAAM,KAAK,KAAK,MAAM;AAEtB,QAAM,KAAK,QAAQ,IAAI,IAAI,IAAI,IAAI,CAAC;AACpC,QAAM,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,IAAI,KAAK,IAAI;AACtD,QAAM,OAAO,IAAI,KAAK,IAAI,MAAM,KAAK;AACrC,QAAM,QAAQ,SAAS,IAAI,IAAI,OAAO;AAEtC,QAAM,YAAY,KAAK,IAAI,KAAK,SAAS,GAAG,CAAC,IAAI;AAKjD,SAAO,KAAK,IAAI,MAAM,IAAI,EAAE,KAAK,YAAY,KAAK,MAAM,GAAG,KAAK;AAClE;AASO,SAAS,iBACd,QACA,OACyB;AACzB,aAAW,QAAQ,OAAO,OAAO;AAC/B,QAAI,cAAc,MAAM,KAAK,GAAG;AAC9B,aAAO,EAAE,MAAM,QAAQ,QAAQ,KAAK,GAAG;AAAA,IACzC;AAAA,EACF;AAEA,aAAW,QAAQ,OAAO,OAAO;AAC/B,QACE,eAAe,KAAK,MAAM,KAC1B,eAAe,KAAK,MAAM,KAC1B,oBAAoB,MAAM,KAAK,GAC/B;AACA,aAAO;AAAA,QACL,MAAM;AAAA,QACN,UAAU,KAAK,OAAO;AAAA,QACtB,UAAU,KAAK,OAAO;AAAA,QACtB,WAAW,KAAK,SAAS;AAAA,MAC3B;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;",
   "names": []
 }

package/esm/charts/sankey-chart/utils/generate-sankey-layout.js

@@ -1,3 +1,4 @@
+import { primeLayoutIndex } from "./layout-index.js";
 import {
   DEFAULT_NODE_PADDING,
   DEFAULT_NODE_WIDTH,
@@ -22,10 +23,18 @@ const generateSankeyLayout = (graph, width, height, nodeWidth = DEFAULT_NODE_WID
     [LAYOUT_MARGIN, LAYOUT_MARGIN],
     [width - LAYOUT_MARGIN, height - LAYOUT_MARGIN]
   ]).nodeAlign(alignmentMap[nodeAlignment ?? "justify"]);
-  return generator({
+  const layout = generator({
     nodes: graph.nodes.map((node) => ({ ...node })),
     links: graph.links.map((link) => ({ ...link }))
   });
+  const indexed = layout;
+  if (indexed.nodeById && indexed.linkBySource) {
+    primeLayoutIndex(layout, {
+      nodesById: indexed.nodeById,
+      linksBySource: indexed.linkBySource
+    });
+  }
+  return layout;
 };
 export {
   generateSankeyLayout

package/esm/charts/sankey-chart/utils/generate-sankey-layout.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../../src/charts/sankey-chart/utils/generate-sankey-layout.ts"],
-  "sourcesContent": ["import {\n  DEFAULT_NODE_PADDING,\n  DEFAULT_NODE_WIDTH,\n  LAYOUT_MARGIN,\n} from '../constants.js';\nimport type {\n  SankeyGraphModel,\n  SankeyGraphNode,\n  SankeyLayoutModel,\n} from '../types/sankey-internal.js';\nimport type { SankeyNodeAlignment } from '../types/sankey.js';\nimport {\n  sankey,\n  sankeyJustify,\n  sankeyLeft,\n  sankeyRight,\n} from '../vendor/d3-sankey/index.js';\n\nconst alignmentMap = {\n  left: sankeyLeft,\n  right: sankeyRight,\n  justify: sankeyJustify,\n} as const;\n\nexport const generateSankeyLayout = (\n  graph: SankeyGraphModel,\n  width: number,\n  height: number,\n  nodeWidth: number = DEFAULT_NODE_WIDTH,\n  nodeAlignment?: SankeyNodeAlignment,\n): SankeyLayoutModel => {\n  if (graph.nodes.length === 0) {\n    return { nodes: [], links: [] };\n  }\n\n  const generator = sankey<SankeyGraphNode, { value: number }>()\n    .nodeId((node) => node.id)\n    .nodeWidth(nodeWidth)\n    .nodePadding(DEFAULT_NODE_PADDING)\n    .extent([\n      [LAYOUT_MARGIN, LAYOUT_MARGIN],\n      [width - LAYOUT_MARGIN, height - LAYOUT_MARGIN],\n    ])\n    .nodeAlign(alignmentMap[nodeAlignment ?? 'justify']);\n\n  // d3-sankey mutates the objects it is given, so fresh copies of the nodes and\n  // links are passed in.\n  return generator({\n    nodes: graph.nodes.map((node) => ({ ...node })),\n    links: graph.links.map((link) => ({ ...link })),\n  });\n};\n"],
-  "mappings": "AAAA;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,OACK;AAOP;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AAEP,MAAM,eAAe;AAAA,EACnB,MAAM;AAAA,EACN,OAAO;AAAA,EACP,SAAS;AACX;AAEO,MAAM,uBAAuB,CAClC,OACA,OACA,QACA,YAAoB,oBACpB,kBACsB;AACtB,MAAI,MAAM,MAAM,WAAW,GAAG;AAC5B,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,EAAE;AAAA,EAChC;AAEA,QAAM,YAAY,OAA2C,EAC1D,OAAO,CAAC,SAAS,KAAK,EAAE,EACxB,UAAU,SAAS,EACnB,YAAY,oBAAoB,EAChC,OAAO;AAAA,IACN,CAAC,eAAe,aAAa;AAAA,IAC7B,CAAC,QAAQ,eAAe,SAAS,aAAa;AAAA,EAChD,CAAC,EACA,UAAU,aAAa,iBAAiB,SAAS,CAAC;AAIrD,SAAO,UAAU;AAAA,IACf,OAAO,MAAM,MAAM,IAAI,CAAC,UAAU,EAAE,GAAG,KAAK,EAAE;AAAA,IAC9C,OAAO,MAAM,MAAM,IAAI,CAAC,UAAU,EAAE,GAAG,KAAK,EAAE;AAAA,EAChD,CAAC;AACH;",
+  "sourcesContent": ["import { primeLayoutIndex } from './layout-index.js';\nimport {\n  DEFAULT_NODE_PADDING,\n  DEFAULT_NODE_WIDTH,\n  LAYOUT_MARGIN,\n} from '../constants.js';\nimport type {\n  SankeyGraphModel,\n  SankeyGraphNode,\n  SankeyLayoutLink,\n  SankeyLayoutModel,\n  SankeyLayoutNode,\n} from '../types/sankey-internal.js';\nimport type { SankeyNodeAlignment } from '../types/sankey.js';\nimport {\n  sankey,\n  sankeyJustify,\n  sankeyLeft,\n  sankeyRight,\n} from '../vendor/d3-sankey/index.js';\n\n/**\n * The id indexes d3-sankey attaches to the layout during its own single pass\n * over the graph (see the LOCAL ADDITION in `vendor/d3-sankey/sankey.ts`). Node\n * ids are strings in this chart's domain, so the `string | number` keys the\n * generic algorithm uses are narrowed here at the one boundary that reads them.\n */\ninterface IndexedLayout {\n  nodeById?: Map<string, SankeyLayoutNode>;\n  linkBySource?: Map<string, Map<string, SankeyLayoutLink[]>>;\n}\n\nconst alignmentMap = {\n  left: sankeyLeft,\n  right: sankeyRight,\n  justify: sankeyJustify,\n} as const;\n\nexport const generateSankeyLayout = (\n  graph: SankeyGraphModel,\n  width: number,\n  height: number,\n  nodeWidth: number = DEFAULT_NODE_WIDTH,\n  nodeAlignment?: SankeyNodeAlignment,\n): SankeyLayoutModel => {\n  if (graph.nodes.length === 0) {\n    return { nodes: [], links: [] };\n  }\n  const generator = sankey<SankeyGraphNode, { value: number }>()\n    .nodeId((node) => node.id)\n    .nodeWidth(nodeWidth)\n    .nodePadding(DEFAULT_NODE_PADDING)\n    .extent([\n      [LAYOUT_MARGIN, LAYOUT_MARGIN],\n      [width - LAYOUT_MARGIN, height - LAYOUT_MARGIN],\n    ])\n    .nodeAlign(alignmentMap[nodeAlignment ?? 'justify']);\n\n  // d3-sankey mutates the objects it is given, so fresh copies of the nodes and\n  // links are passed in.\n  const layout = generator({\n    nodes: graph.nodes.map((node) => ({ ...node })),\n    links: graph.links.map((link) => ({ ...link })),\n  }) as SankeyLayoutModel;\n\n  // Reuse the id indexes d3-sankey built during its own pass instead of\n  // re-scanning the graph, so downstream hit-testing resolves ids in O(1).\n  const indexed = layout as IndexedLayout;\n  if (indexed.nodeById && indexed.linkBySource) {\n    primeLayoutIndex(layout, {\n      nodesById: indexed.nodeById,\n      linksBySource: indexed.linkBySource,\n    });\n  }\n\n  return layout;\n};\n"],
+  "mappings": "AAAA,SAAS,wBAAwB;AACjC;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,OACK;AASP;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AAaP,MAAM,eAAe;AAAA,EACnB,MAAM;AAAA,EACN,OAAO;AAAA,EACP,SAAS;AACX;AAEO,MAAM,uBAAuB,CAClC,OACA,OACA,QACA,YAAoB,oBACpB,kBACsB;AACtB,MAAI,MAAM,MAAM,WAAW,GAAG;AAC5B,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,EAAE;AAAA,EAChC;AACA,QAAM,YAAY,OAA2C,EAC1D,OAAO,CAAC,SAAS,KAAK,EAAE,EACxB,UAAU,SAAS,EACnB,YAAY,oBAAoB,EAChC,OAAO;AAAA,IACN,CAAC,eAAe,aAAa;AAAA,IAC7B,CAAC,QAAQ,eAAe,SAAS,aAAa;AAAA,EAChD,CAAC,EACA,UAAU,aAAa,iBAAiB,SAAS,CAAC;AAIrD,QAAM,SAAS,UAAU;AAAA,IACvB,OAAO,MAAM,MAAM,IAAI,CAAC,UAAU,EAAE,GAAG,KAAK,EAAE;AAAA,IAC9C,OAAO,MAAM,MAAM,IAAI,CAAC,UAAU,EAAE,GAAG,KAAK,EAAE;AAAA,EAChD,CAAC;AAID,QAAM,UAAU;AAChB,MAAI,QAAQ,YAAY,QAAQ,cAAc;AAC5C,qBAAiB,QAAQ;AAAA,MACvB,WAAW,QAAQ;AAAA,MACnB,eAAe,QAAQ;AAAA,IACzB,CAAC;AAAA,EACH;AAEA,SAAO;AACT;",
   "names": []
 }

package/esm/charts/sankey-chart/utils/get-active-connected-set.js

@@ -0,0 +1,59 @@
+import { findConnectedShapes } from "./find-connected-shapes.js";
+import { getRelatedSankeyFlow } from "./get-related-sankey-flow.js";
+import { resolveLayoutLink, resolveLayoutNode } from "./layout-index.js";
+function resolveSelectedSet(layout, selected) {
+  if (selected.type === "node") {
+    const node = resolveLayoutNode(layout, selected.nodeId);
+    if (!node) {
+      return void 0;
+    }
+    const { nodes, links } = getRelatedSankeyFlow(node);
+    return { nodes: [node, ...nodes], links };
+  }
+  const resolved = resolveLayoutLink(
+    layout,
+    selected.sourceId,
+    selected.targetId,
+    selected.linkIndex
+  );
+  if (!resolved) {
+    return void 0;
+  }
+  const connected = findConnectedShapes({ type: "link", ...resolved });
+  return { nodes: [...connected.nodes], links: [...connected.links] };
+}
+function resolveHoveredSet(layout, hovered) {
+  if (hovered.type === "node") {
+    const node = resolveLayoutNode(layout, hovered.nodeId);
+    if (!node) {
+      return void 0;
+    }
+    const connected = findConnectedShapes({ type: "node", node });
+    const relatedNodes = [...connected.nodes].filter((n) => n !== node);
+    return { nodes: [node, ...relatedNodes], links: [...connected.links] };
+  }
+  const resolved = resolveLayoutLink(
+    layout,
+    hovered.sourceId,
+    hovered.targetId,
+    hovered.linkIndex
+  );
+  if (!resolved) {
+    return void 0;
+  }
+  return {
+    nodes: [resolved.source, resolved.target],
+    links: [resolved.link]
+  };
+}
+function getActiveConnectedSet(layout, selected, hovered) {
+  const selectedSet = selected ? resolveSelectedSet(layout, selected) : void 0;
+  if (selectedSet) {
+    return selectedSet;
+  }
+  return hovered ? resolveHoveredSet(layout, hovered) : void 0;
+}
+export {
+  getActiveConnectedSet
+};
+//# sourceMappingURL=get-active-connected-set.js.map

package/esm/charts/sankey-chart/utils/get-active-connected-set.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../../src/charts/sankey-chart/utils/get-active-connected-set.ts"],
+  "sourcesContent": ["import { findConnectedShapes } from './find-connected-shapes.js';\nimport { getRelatedSankeyFlow } from './get-related-sankey-flow.js';\nimport { resolveLayoutLink, resolveLayoutNode } from './layout-index.js';\nimport type {\n  SankeyLayoutLink,\n  SankeyLayoutModel,\n  SankeyLayoutNode,\n} from '../types/sankey-internal.js';\nimport type { SankeyShape } from '../types/sankey-shape.js';\n\n/**\n * The set of nodes and links that should be visually emphasized in the active\n * interaction state. All other nodes and links are dimmed.\n */\nexport interface ActiveConnectedSet {\n  nodes: SankeyLayoutNode[];\n  links: SankeyLayoutLink[];\n}\n\n/**\n * The click-selection set:\n * - **node**: the full transitive data-flow via `getRelatedSankeyFlow` (every\n *   upstream/downstream node and every link crossed), including the node.\n * - **link**: 1-hop \u2014 the link and its two endpoint nodes.\n *\n * Returns `undefined` when the selected identity is not present in the current\n * layout (e.g. a data change dropped it).\n */\nfunction resolveSelectedSet(\n  layout: SankeyLayoutModel,\n  selected: SankeyShape,\n): ActiveConnectedSet | undefined {\n  if (selected.type === 'node') {\n    const node = resolveLayoutNode(layout, selected.nodeId);\n    if (!node) {\n      return undefined;\n    }\n    const { nodes, links } = getRelatedSankeyFlow(node);\n    return { nodes: [node, ...nodes], links };\n  }\n\n  const resolved = resolveLayoutLink(\n    layout,\n    selected.sourceId,\n    selected.targetId,\n    selected.linkIndex,\n  );\n  if (!resolved) {\n    return undefined;\n  }\n  const connected = findConnectedShapes({ type: 'link', ...resolved });\n  return { nodes: [...connected.nodes], links: [...connected.links] };\n}\n\n/**\n * The hover set (1-hop for both variants):\n * - **node**: the node, its directly connected links, and the opposite-end\n *   nodes of those links.\n * - **link**: the link, its source, and its target.\n *\n * Returns `undefined` when the hovered identity is not present in the current\n * layout.\n */\nfunction resolveHoveredSet(\n  layout: SankeyLayoutModel,\n  hovered: SankeyShape,\n): ActiveConnectedSet | undefined {\n  if (hovered.type === 'node') {\n    const node = resolveLayoutNode(layout, hovered.nodeId);\n    if (!node) {\n      return undefined;\n    }\n    const connected = findConnectedShapes({ type: 'node', node });\n    const relatedNodes = [...connected.nodes].filter((n) => n !== node);\n    return { nodes: [node, ...relatedNodes], links: [...connected.links] };\n  }\n\n  const resolved = resolveLayoutLink(\n    layout,\n    hovered.sourceId,\n    hovered.targetId,\n    hovered.linkIndex,\n  );\n  if (!resolved) {\n    return undefined;\n  }\n  return {\n    nodes: [resolved.source, resolved.target],\n    links: [resolved.link],\n  };\n}\n\n/**\n * Resolves the active visual connected set from the current click-selection and\n * hover state, applying click-over-hover precedence.\n *\n * Click selection always takes visual precedence: when `selected` is defined\n * and its identity resolves in the current `layout`, `hovered` is ignored for\n * visual rendering purposes. When the selected identity is no longer present\n * (data changed), the function falls through to hover state so the pointer can\n * recover visually without requiring an explicit deselect. With neither\n * interaction it returns `undefined` (no dimming).\n *\n * Both `selected` and `hovered` carry only stable ids (not layout-object\n * references) so this function always reads from the current layout, never\n * stale geometry.\n */\nexport function getActiveConnectedSet(\n  layout: SankeyLayoutModel,\n  selected: SankeyShape | undefined,\n  hovered: SankeyShape | undefined,\n): ActiveConnectedSet | undefined {\n  const selectedSet = selected\n    ? resolveSelectedSet(layout, selected)\n    : undefined;\n  if (selectedSet) {\n    return selectedSet;\n  }\n\n  return hovered ? resolveHoveredSet(layout, hovered) : undefined;\n}\n"],
+  "mappings": "AAAA,SAAS,2BAA2B;AACpC,SAAS,4BAA4B;AACrC,SAAS,mBAAmB,yBAAyB;AA0BrD,SAAS,mBACP,QACA,UACgC;AAChC,MAAI,SAAS,SAAS,QAAQ;AAC5B,UAAM,OAAO,kBAAkB,QAAQ,SAAS,MAAM;AACtD,QAAI,CAAC,MAAM;AACT,aAAO;AAAA,IACT;AACA,UAAM,EAAE,OAAO,MAAM,IAAI,qBAAqB,IAAI;AAClD,WAAO,EAAE,OAAO,CAAC,MAAM,GAAG,KAAK,GAAG,MAAM;AAAA,EAC1C;AAEA,QAAM,WAAW;AAAA,IACf;AAAA,IACA,SAAS;AAAA,IACT,SAAS;AAAA,IACT,SAAS;AAAA,EACX;AACA,MAAI,CAAC,UAAU;AACb,WAAO;AAAA,EACT;AACA,QAAM,YAAY,oBAAoB,EAAE,MAAM,QAAQ,GAAG,SAAS,CAAC;AACnE,SAAO,EAAE,OAAO,CAAC,GAAG,UAAU,KAAK,GAAG,OAAO,CAAC,GAAG,UAAU,KAAK,EAAE;AACpE;AAWA,SAAS,kBACP,QACA,SACgC;AAChC,MAAI,QAAQ,SAAS,QAAQ;AAC3B,UAAM,OAAO,kBAAkB,QAAQ,QAAQ,MAAM;AACrD,QAAI,CAAC,MAAM;AACT,aAAO;AAAA,IACT;AACA,UAAM,YAAY,oBAAoB,EAAE,MAAM,QAAQ,KAAK,CAAC;AAC5D,UAAM,eAAe,CAAC,GAAG,UAAU,KAAK,EAAE,OAAO,CAAC,MAAM,MAAM,IAAI;AAClE,WAAO,EAAE,OAAO,CAAC,MAAM,GAAG,YAAY,GAAG,OAAO,CAAC,GAAG,UAAU,KAAK,EAAE;AAAA,EACvE;AAEA,QAAM,WAAW;AAAA,IACf;AAAA,IACA,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,QAAQ;AAAA,EACV;AACA,MAAI,CAAC,UAAU;AACb,WAAO;AAAA,EACT;AACA,SAAO;AAAA,IACL,OAAO,CAAC,SAAS,QAAQ,SAAS,MAAM;AAAA,IACxC,OAAO,CAAC,SAAS,IAAI;AAAA,EACvB;AACF;AAiBO,SAAS,sBACd,QACA,UACA,SACgC;AAChC,QAAM,cAAc,WAChB,mBAAmB,QAAQ,QAAQ,IACnC;AACJ,MAAI,aAAa;AACf,WAAO;AAAA,EACT;AAEA,SAAO,UAAU,kBAAkB,QAAQ,OAAO,IAAI;AACxD;",
+  "names": []
+}

package/esm/charts/sankey-chart/utils/is-same-sankey-shape.js

@@ -0,0 +1,19 @@
+function isSameSankeyShape(prev, next) {
+  if (prev === next) {
+    return true;
+  }
+  if (prev === void 0 || next === void 0) {
+    return false;
+  }
+  if (prev.type === "node" && next.type === "node") {
+    return prev.nodeId === next.nodeId;
+  }
+  if (prev.type === "link" && next.type === "link") {
+    return prev.sourceId === next.sourceId && prev.targetId === next.targetId && prev.linkIndex === next.linkIndex;
+  }
+  return false;
+}
+export {
+  isSameSankeyShape
+};
+//# sourceMappingURL=is-same-sankey-shape.js.map

package/esm/charts/sankey-chart/utils/is-same-sankey-shape.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../../src/charts/sankey-chart/utils/is-same-sankey-shape.ts"],
+  "sourcesContent": ["import type { SankeyShape } from '../types/sankey-shape.js';\n\nexport function isSameSankeyShape(\n  prev: SankeyShape | undefined,\n  next: SankeyShape | undefined,\n): boolean {\n  if (prev === next) {\n    return true;\n  }\n  if (prev === undefined || next === undefined) {\n    return false;\n  }\n  if (prev.type === 'node' && next.type === 'node') {\n    return prev.nodeId === next.nodeId;\n  }\n  if (prev.type === 'link' && next.type === 'link') {\n    return (\n      prev.sourceId === next.sourceId &&\n      prev.targetId === next.targetId &&\n      prev.linkIndex === next.linkIndex\n    );\n  }\n  return false;\n}\n"],
+  "mappings": "AAEO,SAAS,kBACd,MACA,MACS;AACT,MAAI,SAAS,MAAM;AACjB,WAAO;AAAA,EACT;AACA,MAAI,SAAS,UAAa,SAAS,QAAW;AAC5C,WAAO;AAAA,EACT;AACA,MAAI,KAAK,SAAS,UAAU,KAAK,SAAS,QAAQ;AAChD,WAAO,KAAK,WAAW,KAAK;AAAA,EAC9B;AACA,MAAI,KAAK,SAAS,UAAU,KAAK,SAAS,QAAQ;AAChD,WACE,KAAK,aAAa,KAAK,YACvB,KAAK,aAAa,KAAK,YACvB,KAAK,cAAc,KAAK;AAAA,EAE5B;AACA,SAAO;AACT;",
+  "names": []
+}

package/esm/charts/sankey-chart/utils/layout-index.js

@@ -0,0 +1,66 @@
+import { isResolvedNode } from "./is-resolved-sankey-node.js";
+const indexCache = /* @__PURE__ */ new WeakMap();
+function addLink(linksBySource, sourceId, targetId, link) {
+  let byTarget = linksBySource.get(sourceId);
+  if (!byTarget) {
+    byTarget = /* @__PURE__ */ new Map();
+    linksBySource.set(sourceId, byTarget);
+  }
+  const links = byTarget.get(targetId);
+  if (links) {
+    links.push(link);
+  } else {
+    byTarget.set(targetId, [link]);
+  }
+}
+function buildIndex(layout) {
+  const nodesById = /* @__PURE__ */ new Map();
+  for (const node of layout.nodes) {
+    nodesById.set(node.id, node);
+  }
+  const linksBySource = /* @__PURE__ */ new Map();
+  for (const link of layout.links) {
+    const sourceId = String(
+      isResolvedNode(link.source) ? link.source.id : link.source
+    );
+    const targetId = String(
+      isResolvedNode(link.target) ? link.target.id : link.target
+    );
+    addLink(linksBySource, sourceId, targetId, link);
+  }
+  return { nodesById, linksBySource };
+}
+function primeLayoutIndex(layout, index) {
+  indexCache.set(layout, index);
+}
+function getLayoutIndex(layout) {
+  const cached = indexCache.get(layout);
+  if (cached) {
+    return cached;
+  }
+  const index = buildIndex(layout);
+  indexCache.set(layout, index);
+  return index;
+}
+function resolveLayoutNode(layout, nodeId) {
+  return getLayoutIndex(layout).nodesById.get(nodeId);
+}
+function resolveLayoutLink(layout, sourceId, targetId, linkIndex) {
+  const links = getLayoutIndex(layout).linksBySource.get(sourceId)?.get(targetId);
+  const link = links?.find((candidate) => (candidate.index ?? 0) === linkIndex);
+  if (!link) {
+    return void 0;
+  }
+  const source = isResolvedNode(link.source) ? link.source : void 0;
+  const target = isResolvedNode(link.target) ? link.target : void 0;
+  if (!source || !target) {
+    return void 0;
+  }
+  return { link, source, target };
+}
+export {
+  primeLayoutIndex,
+  resolveLayoutLink,
+  resolveLayoutNode
+};
+//# sourceMappingURL=layout-index.js.map

package/esm/charts/sankey-chart/utils/layout-index.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../../src/charts/sankey-chart/utils/layout-index.ts"],
+  "sourcesContent": ["import { isResolvedNode } from './is-resolved-sankey-node.js';\nimport type {\n  SankeyLayoutLink,\n  SankeyLayoutModel,\n  SankeyLayoutNode,\n} from '../types/sankey-internal.js';\n\n/**\n * Id lookups for a single layout. `linksBySource` maps `sourceId` \u2192 `targetId`\n * \u2192 the links between that pair. That array holds a single link in the normal\n * case; it holds more only for parallel links (multiple links between the same\n * node pair), which are rare. Resolving one of those by its `linkIndex` with a\n * short `find` reads more simply than a third nested map and, given the array\n * is almost always length one, is effectively just as fast.\n */\nexport interface SankeyLayoutIndex {\n  nodesById: Map<string, SankeyLayoutNode>;\n  linksBySource: Map<string, Map<string, SankeyLayoutLink[]>>;\n}\n\n/**\n * Per-layout indexes cached against the layout object itself. A layout rebuilt\n * on resize or data change is a new object, so it misses the cache and gets a\n * fresh index; the previous layout and its index become unreachable together\n * and are garbage-collected. The `WeakMap` is what makes that automatic \u2014 a\n * lookup can never hand back a node or link from a stale layout, and no manual\n * cache invalidation is needed.\n */\nconst indexCache = new WeakMap<SankeyLayoutModel, SankeyLayoutIndex>();\n\nfunction addLink(\n  linksBySource: Map<string, Map<string, SankeyLayoutLink[]>>,\n  sourceId: string,\n  targetId: string,\n  link: SankeyLayoutLink,\n): void {\n  let byTarget = linksBySource.get(sourceId);\n  if (!byTarget) {\n    byTarget = new Map<string, SankeyLayoutLink[]>();\n    linksBySource.set(sourceId, byTarget);\n  }\n  const links = byTarget.get(targetId);\n  if (links) {\n    links.push(link);\n  } else {\n    byTarget.set(targetId, [link]);\n  }\n}\n\n/**\n * Fallback index build, used for layouts not produced by\n * `generateSankeyLayout` (e.g. hand-built test fixtures) and the empty-graph\n * case. The primary path reuses d3-sankey's own pass \u2014 see `primeLayoutIndex`.\n */\nfunction buildIndex(layout: SankeyLayoutModel): SankeyLayoutIndex {\n  const nodesById = new Map<string, SankeyLayoutNode>();\n  for (const node of layout.nodes) {\n    nodesById.set(node.id, node);\n  }\n\n  const linksBySource = new Map<string, Map<string, SankeyLayoutLink[]>>();\n  for (const link of layout.links) {\n    const sourceId = String(\n      isResolvedNode(link.source) ? link.source.id : link.source,\n    );\n    const targetId = String(\n      isResolvedNode(link.target) ? link.target.id : link.target,\n    );\n    addLink(linksBySource, sourceId, targetId, link);\n  }\n\n  return { nodesById, linksBySource };\n}\n\n/**\n * Seeds the cache with an index that `generateSankeyLayout` collected during\n * d3-sankey's own single pass over the graph, so the resolvers stay `O(1)`\n * without `buildIndex` ever re-scanning the nodes and links.\n */\nexport function primeLayoutIndex(\n  layout: SankeyLayoutModel,\n  index: SankeyLayoutIndex,\n): void {\n  indexCache.set(layout, index);\n}\n\nfunction getLayoutIndex(layout: SankeyLayoutModel): SankeyLayoutIndex {\n  const cached = indexCache.get(layout);\n  if (cached) {\n    return cached;\n  }\n  const index = buildIndex(layout);\n  indexCache.set(layout, index);\n  return index;\n}\n\n/**\n * Resolves a node by id against the current layout in `O(1)`, or `undefined`\n * when the id is absent (e.g. after a data change dropped it).\n */\nexport function resolveLayoutNode(\n  layout: SankeyLayoutModel,\n  nodeId: string,\n): SankeyLayoutNode | undefined {\n  return getLayoutIndex(layout).nodesById.get(nodeId);\n}\n\n/**\n * Resolves a link by its source/target ids and per-layout link index against\n * the current layout, together with both resolved endpoint nodes. Returns\n * `undefined` when the link is absent or either endpoint is unresolved. The\n * `linkIndex` discriminant picks the right link when parallel links share the\n * same source and target ids; with the usual single link per pair it simply\n * matches that one.\n */\nexport function resolveLayoutLink(\n  layout: SankeyLayoutModel,\n  sourceId: string,\n  targetId: string,\n  linkIndex: number,\n):\n  | {\n      link: SankeyLayoutLink;\n      source: SankeyLayoutNode;\n      target: SankeyLayoutNode;\n    }\n  | undefined {\n  const links = getLayoutIndex(layout)\n    .linksBySource.get(sourceId)\n    ?.get(targetId);\n  const link = links?.find((candidate) => (candidate.index ?? 0) === linkIndex);\n  if (!link) {\n    return undefined;\n  }\n\n  const source = isResolvedNode(link.source) ? link.source : undefined;\n  const target = isResolvedNode(link.target) ? link.target : undefined;\n  if (!source || !target) {\n    return undefined;\n  }\n\n  return { link, source, target };\n}\n"],
+  "mappings": "AAAA,SAAS,sBAAsB;AA4B/B,MAAM,aAAa,oBAAI,QAA8C;AAErE,SAAS,QACP,eACA,UACA,UACA,MACM;AACN,MAAI,WAAW,cAAc,IAAI,QAAQ;AACzC,MAAI,CAAC,UAAU;AACb,eAAW,oBAAI,IAAgC;AAC/C,kBAAc,IAAI,UAAU,QAAQ;AAAA,EACtC;AACA,QAAM,QAAQ,SAAS,IAAI,QAAQ;AACnC,MAAI,OAAO;AACT,UAAM,KAAK,IAAI;AAAA,EACjB,OAAO;AACL,aAAS,IAAI,UAAU,CAAC,IAAI,CAAC;AAAA,EAC/B;AACF;AAOA,SAAS,WAAW,QAA8C;AAChE,QAAM,YAAY,oBAAI,IAA8B;AACpD,aAAW,QAAQ,OAAO,OAAO;AAC/B,cAAU,IAAI,KAAK,IAAI,IAAI;AAAA,EAC7B;AAEA,QAAM,gBAAgB,oBAAI,IAA6C;AACvE,aAAW,QAAQ,OAAO,OAAO;AAC/B,UAAM,WAAW;AAAA,MACf,eAAe,KAAK,MAAM,IAAI,KAAK,OAAO,KAAK,KAAK;AAAA,IACtD;AACA,UAAM,WAAW;AAAA,MACf,eAAe,KAAK,MAAM,IAAI,KAAK,OAAO,KAAK,KAAK;AAAA,IACtD;AACA,YAAQ,eAAe,UAAU,UAAU,IAAI;AAAA,EACjD;AAEA,SAAO,EAAE,WAAW,cAAc;AACpC;AAOO,SAAS,iBACd,QACA,OACM;AACN,aAAW,IAAI,QAAQ,KAAK;AAC9B;AAEA,SAAS,eAAe,QAA8C;AACpE,QAAM,SAAS,WAAW,IAAI,MAAM;AACpC,MAAI,QAAQ;AACV,WAAO;AAAA,EACT;AACA,QAAM,QAAQ,WAAW,MAAM;AAC/B,aAAW,IAAI,QAAQ,KAAK;AAC5B,SAAO;AACT;AAMO,SAAS,kBACd,QACA,QAC8B;AAC9B,SAAO,eAAe,MAAM,EAAE,UAAU,IAAI,MAAM;AACpD;AAUO,SAAS,kBACd,QACA,UACA,UACA,WAOY;AACZ,QAAM,QAAQ,eAAe,MAAM,EAChC,cAAc,IAAI,QAAQ,GACzB,IAAI,QAAQ;AAChB,QAAM,OAAO,OAAO,KAAK,CAAC,eAAe,UAAU,SAAS,OAAO,SAAS;AAC5E,MAAI,CAAC,MAAM;AACT,WAAO;AAAA,EACT;AAEA,QAAM,SAAS,eAAe,KAAK,MAAM,IAAI,KAAK,SAAS;AAC3D,QAAM,SAAS,eAAe,KAAK,MAAM,IAAI,KAAK,SAAS;AAC3D,MAAI,CAAC,UAAU,CAAC,QAAQ;AACtB,WAAO;AAAA,EACT;AAEA,SAAO,EAAE,MAAM,QAAQ,OAAO;AAChC;",
+  "names": []
+}

package/esm/charts/sankey-chart/vendor/d3-sankey/sankey.js

@@ -54,6 +54,7 @@ function Sankey() {
     const nodeById = new Map(
       graph.nodes.map((d) => [idAccessor(d), d])
     );
+    const linkBySource = /* @__PURE__ */ new Map();
     const unresolvedLinks = graph.links;
     for (const [i, link] of unresolvedLinks.entries()) {
       link.index = i;
@@ -63,8 +64,23 @@ function Sankey() {
       if (typeof link.target !== "object") {
         link.target = findNode(nodeById, link.target);
       }
-      link.source.sourceLinks.push(link);
-      link.target.targetLinks.push(link);
+      const source = link.source;
+      const target = link.target;
+      source.sourceLinks.push(link);
+      target.targetLinks.push(link);
+      const sourceId = idAccessor(source);
+      const targetId = idAccessor(target);
+      let byTarget = linkBySource.get(sourceId);
+      if (!byTarget) {
+        byTarget = /* @__PURE__ */ new Map();
+        linkBySource.set(sourceId, byTarget);
+      }
+      const links = byTarget.get(targetId);
+      if (links) {
+        links.push(link);
+      } else {
+        byTarget.set(targetId, [link]);
+      }
     }
     if (linkSortFn !== null && linkSortFn !== void 0) {
       for (const { sourceLinks, targetLinks } of graph.nodes) {
@@ -72,6 +88,8 @@ function Sankey() {
         targetLinks.sort(linkSortFn);
       }
     }
+    graph.nodeById = nodeById;
+    graph.linkBySource = linkBySource;
   }
   function computeNodeValues({ nodes }) {
     for (const node of nodes) {

package/esm/charts/sankey-chart/vendor/d3-sankey/sankey.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../../../src/charts/sankey-chart/vendor/d3-sankey/sankey.ts"],
-  "sourcesContent": ["// Copyright 2015, Mike Bostock\n// BSD 3-Clause License \u2014 https://github.com/d3/d3-sankey/blob/main/LICENSE\n// Vendored from d3-sankey@0.12.3 \u2014 https://github.com/d3/d3-sankey\n\nimport { max, min, sum } from 'd3-array';\n\nimport { justify } from './align.js';\nimport constant from './constant.js';\nimport type {\n  SankeyExtraProperties,\n  SankeyGraph,\n  SankeyLayout,\n} from './types.js';\n\n// Internal working types \u2014 the algorithm mutates input objects in place to add geometry fields.\n\ninterface WorkingNode {\n  index: number;\n  depth: number;\n  height: number;\n  layer: number;\n  x0: number;\n  x1: number;\n  y0: number;\n  y1: number;\n  value: number;\n  fixedValue?: number;\n  sourceLinks: WorkingLink[];\n  targetLinks: WorkingLink[];\n  [key: string]: unknown;\n}\n\n// Before computeNodeLinks resolves source/target ids, they may still be strings or numbers.\ninterface UnresolvedLink {\n  index: number;\n  source: WorkingNode | string | number;\n  target: WorkingNode | string | number;\n  value: number;\n  y0: number;\n  y1: number;\n  width: number;\n  [key: string]: unknown;\n}\n\ninterface WorkingLink extends UnresolvedLink {\n  source: WorkingNode;\n  target: WorkingNode;\n}\n\ninterface WorkingGraph {\n  nodes: WorkingNode[];\n  links: WorkingLink[];\n}\n\nfunction ascendingSourceBreadth(a: WorkingLink, b: WorkingLink): number {\n  return a.source.y0 - b.source.y0 || a.index - b.index;\n}\n\nfunction ascendingTargetBreadth(a: WorkingLink, b: WorkingLink): number {\n  return a.target.y0 - b.target.y0 || a.index - b.index;\n}\n\nfunction nodeValue(d: WorkingNode): number {\n  return d.value;\n}\n\nfunction linkValue(d: WorkingLink): number {\n  return d.value;\n}\n\nfunction findNode(\n  nodeById: Map<string | number, WorkingNode>,\n  id: string | number,\n): WorkingNode {\n  const node = nodeById.get(id);\n  if (!node) {\n    throw new Error('missing: ' + id);\n  }\n  return node;\n}\n\nfunction computeLinkBreadths({ nodes }: WorkingGraph): void {\n  for (const node of nodes) {\n    let y0 = node.y0;\n    let y1 = y0;\n    for (const link of node.sourceLinks) {\n      link.y0 = y0 + link.width / 2;\n      y0 += link.width;\n    }\n    for (const link of node.targetLinks) {\n      link.y1 = y1 + link.width / 2;\n      y1 += link.width;\n    }\n  }\n}\n\nexport default function Sankey<\n  N extends SankeyExtraProperties,\n  L extends SankeyExtraProperties,\n>(): SankeyLayout<SankeyGraph<N, L>, N, L> {\n  let bx0 = 0,\n    by0 = 0,\n    bx1 = 1,\n    by1 = 1;\n  let dx = 24;\n  let dy = 8,\n    py = 8;\n  let idAccessor: (d: WorkingNode) => string | number = (d) => d.index;\n  let alignFn: (node: WorkingNode, n: number) => number = justify;\n  let sortFn: ((a: WorkingNode, b: WorkingNode) => number) | undefined | null;\n  let linkSortFn:\n    | ((a: WorkingLink, b: WorkingLink) => number)\n    | undefined\n    | null;\n  let nodesAccessor: (data: SankeyGraph<N, L>) => WorkingNode[] = (g) =>\n    g.nodes as unknown as WorkingNode[];\n  let linksAccessor: (data: SankeyGraph<N, L>) => WorkingLink[] = (g) =>\n    g.links as unknown as WorkingLink[];\n  let iterations = 6;\n\n  function computeNodeLinks(graph: WorkingGraph): void {\n    for (const [i, node] of graph.nodes.entries()) {\n      node.index = i;\n      node.sourceLinks = [];\n      node.targetLinks = [];\n    }\n    const nodeById = new Map<string | number, WorkingNode>(\n      graph.nodes.map((d) => [idAccessor(d), d]),\n    );\n    const unresolvedLinks = graph.links as unknown as UnresolvedLink[];\n    for (const [i, link] of unresolvedLinks.entries()) {\n      link.index = i;\n      if (typeof link.source !== 'object') {\n        link.source = findNode(nodeById, link.source);\n      }\n      if (typeof link.target !== 'object') {\n        link.target = findNode(nodeById, link.target);\n      }\n      (link.source as WorkingNode).sourceLinks.push(link as WorkingLink);\n      (link.target as WorkingNode).targetLinks.push(link as WorkingLink);\n    }\n    if (linkSortFn !== null && linkSortFn !== undefined) {\n      for (const { sourceLinks, targetLinks } of graph.nodes) {\n        sourceLinks.sort(linkSortFn);\n        targetLinks.sort(linkSortFn);\n      }\n    }\n  }\n\n  function computeNodeValues({ nodes }: WorkingGraph): void {\n    for (const node of nodes) {\n      node.value =\n        node.fixedValue === undefined\n          ? Math.max(\n              sum(node.sourceLinks, linkValue),\n              sum(node.targetLinks, linkValue),\n            )\n          : node.fixedValue;\n    }\n  }\n\n  function computeNodeDepths({ nodes }: WorkingGraph): void {\n    const n = nodes.length;\n    let current = new Set(nodes);\n    let next = new Set<WorkingNode>();\n    let x = 0;\n    let iterations = 0;\n    while (current.size) {\n      let maxPinnedDepth = -1;\n      for (const node of current) {\n        node.depth = typeof node['column'] === 'number' ? node['column'] : x;\n        if (\n          typeof node['column'] === 'number' &&\n          node['column'] > maxPinnedDepth\n        ) {\n          maxPinnedDepth = node['column'];\n        }\n        for (const { target } of node.sourceLinks) {\n          next.add(target);\n        }\n      }\n      if (++iterations > n) {\n        throw new Error('circular link');\n      }\n      x = Math.max(x + 1, maxPinnedDepth + 1);\n      current = next;\n      next = new Set();\n    }\n  }\n\n  function computeNodeHeights({ nodes }: WorkingGraph): void {\n    const n = nodes.length;\n    let current = new Set(nodes);\n    let next = new Set<WorkingNode>();\n    let x = 0;\n    while (current.size) {\n      for (const node of current) {\n        node.height = x;\n        for (const { source } of node.targetLinks) {\n          next.add(source);\n        }\n      }\n      if (++x > n) {\n        throw new Error('circular link');\n      }\n      current = next;\n      next = new Set();\n    }\n  }\n\n  function computeNodeLayers({ nodes }: WorkingGraph): WorkingNode[][] {\n    const x = (max(nodes, (d) => d.depth) ?? 0) + 1;\n    const kx = (bx1 - bx0 - dx) / (x - 1);\n    const columns = new Array<WorkingNode[]>(x);\n    for (const node of nodes) {\n      const i = Math.max(0, Math.min(x - 1, Math.floor(alignFn(node, x))));\n      node.layer = i;\n      node.x0 = bx0 + i * kx;\n      node.x1 = node.x0 + dx;\n      if (columns[i]) {\n        columns[i].push(node);\n      } else {\n        columns[i] = [node];\n      }\n    }\n    // alignFn may remap nodes so that some indices in the sparse array remain empty.\n    // Filter before downstream passes to prevent crashes on undefined column entries.\n    const compact = columns.filter((c): c is WorkingNode[] => c !== undefined);\n    if (sortFn) {\n      for (const column of compact) {\n        column.sort(sortFn);\n      }\n    }\n    return compact;\n  }\n\n  function initializeNodeBreadths(columns: WorkingNode[][]): void {\n    const ky =\n      min(\n        columns,\n        (c) => (by1 - by0 - (c.length - 1) * py) / sum(c, nodeValue),\n      ) ?? 0;\n    for (const nodes of columns) {\n      let y = by0;\n      for (const node of nodes) {\n        node.y0 = y;\n        node.y1 = y + node.value * ky;\n        y = node.y1 + py;\n        for (const link of node.sourceLinks) {\n          link.width = link.value * ky;\n        }\n      }\n      y = (by1 - y + py) / (nodes.length + 1);\n      for (let i = 0; i < nodes.length; ++i) {\n        const node = nodes[i];\n        node.y0 += y * (i + 1);\n        node.y1 += y * (i + 1);\n      }\n      reorderLinks(nodes);\n    }\n  }\n\n  function computeNodeBreadths(graph: WorkingGraph): void {\n    const columns = computeNodeLayers(graph);\n    py = Math.min(dy, (by1 - by0) / ((max(columns, (c) => c.length) ?? 1) - 1));\n    initializeNodeBreadths(columns);\n    for (let i = 0; i < iterations; ++i) {\n      const alpha = Math.pow(0.99, i);\n      const beta = Math.max(1 - alpha, (i + 1) / iterations);\n      relaxRightToLeft(columns, alpha, beta);\n      relaxLeftToRight(columns, alpha, beta);\n    }\n  }\n\n  function relaxLeftToRight(\n    columns: WorkingNode[][],\n    alpha: number,\n    beta: number,\n  ): void {\n    for (let i = 1, n = columns.length; i < n; ++i) {\n      const column = columns[i];\n      for (const target of column) {\n        let y = 0;\n        let w = 0;\n        for (const { source, value } of target.targetLinks) {\n          const v = value * (target.layer - source.layer);\n          y += targetTop(source, target) * v;\n          w += v;\n        }\n        if (!(w > 0)) {\n          continue;\n        }\n        const dy = (y / w - target.y0) * alpha;\n        target.y0 += dy;\n        target.y1 += dy;\n        reorderNodeLinks(target);\n      }\n      if (sortFn === undefined) {\n        column.sort(ascendingBreadth);\n      }\n      resolveCollisions(column, beta);\n    }\n  }\n\n  function relaxRightToLeft(\n    columns: WorkingNode[][],\n    alpha: number,\n    beta: number,\n  ): void {\n    for (let n = columns.length, i = n - 2; i >= 0; --i) {\n      const column = columns[i];\n      for (const source of column) {\n        let y = 0;\n        let w = 0;\n        for (const { target, value } of source.sourceLinks) {\n          const v = value * (target.layer - source.layer);\n          y += sourceTop(source, target) * v;\n          w += v;\n        }\n        if (!(w > 0)) {\n          continue;\n        }\n        const dy = (y / w - source.y0) * alpha;\n        source.y0 += dy;\n        source.y1 += dy;\n        reorderNodeLinks(source);\n      }\n      if (sortFn === undefined) {\n        column.sort(ascendingBreadth);\n      }\n      resolveCollisions(column, beta);\n    }\n  }\n\n  function ascendingBreadth(a: WorkingNode, b: WorkingNode): number {\n    return a.y0 - b.y0;\n  }\n\n  function resolveCollisions(nodes: WorkingNode[], alpha: number): void {\n    const i = nodes.length >> 1;\n    const subject = nodes[i];\n    resolveCollisionsBottomToTop(nodes, subject.y0 - py, i - 1, alpha);\n    resolveCollisionsTopToBottom(nodes, subject.y1 + py, i + 1, alpha);\n    resolveCollisionsBottomToTop(nodes, by1, nodes.length - 1, alpha);\n    resolveCollisionsTopToBottom(nodes, by0, 0, alpha);\n  }\n\n  function resolveCollisionsTopToBottom(\n    nodes: WorkingNode[],\n    y: number,\n    i: number,\n    alpha: number,\n  ): void {\n    for (; i < nodes.length; ++i) {\n      const node = nodes[i];\n      const dy = (y - node.y0) * alpha;\n      if (dy > 1e-6) {\n        node.y0 += dy;\n        node.y1 += dy;\n      }\n      y = node.y1 + py;\n    }\n  }\n\n  function resolveCollisionsBottomToTop(\n    nodes: WorkingNode[],\n    y: number,\n    i: number,\n    alpha: number,\n  ): void {\n    for (; i >= 0; --i) {\n      const node = nodes[i];\n      const dy = (node.y1 - y) * alpha;\n      if (dy > 1e-6) {\n        node.y0 -= dy;\n        node.y1 -= dy;\n      }\n      y = node.y0 - py;\n    }\n  }\n\n  function reorderNodeLinks({ sourceLinks, targetLinks }: WorkingNode): void {\n    if (linkSortFn === undefined) {\n      for (const {\n        source: { sourceLinks: sl },\n      } of targetLinks) {\n        sl.sort(ascendingTargetBreadth);\n      }\n      for (const {\n        target: { targetLinks: tl },\n      } of sourceLinks) {\n        tl.sort(ascendingSourceBreadth);\n      }\n    }\n  }\n\n  function reorderLinks(nodes: WorkingNode[]): void {\n    if (linkSortFn === undefined) {\n      for (const { sourceLinks, targetLinks } of nodes) {\n        sourceLinks.sort(ascendingTargetBreadth);\n        targetLinks.sort(ascendingSourceBreadth);\n      }\n    }\n  }\n\n  function targetTop(source: WorkingNode, target: WorkingNode): number {\n    let y = source.y0 - ((source.sourceLinks.length - 1) * py) / 2;\n    for (const { target: node, width } of source.sourceLinks) {\n      if (node === target) {\n        break;\n      }\n      y += width + py;\n    }\n    for (const { source: node, width } of target.targetLinks) {\n      if (node === source) {\n        break;\n      }\n      y -= width;\n    }\n    return y;\n  }\n\n  function sourceTop(source: WorkingNode, target: WorkingNode): number {\n    let y = target.y0 - ((target.targetLinks.length - 1) * py) / 2;\n    for (const { source: node, width } of target.targetLinks) {\n      if (node === source) {\n        break;\n      }\n      y += width + py;\n    }\n    for (const { target: node, width } of source.sourceLinks) {\n      if (node === target) {\n        break;\n      }\n      y -= width;\n    }\n    return y;\n  }\n\n  function runLayout(data: SankeyGraph<N, L>): SankeyGraph<N, L> {\n    const graph: WorkingGraph = {\n      nodes: nodesAccessor(data),\n      links: linksAccessor(data),\n    };\n    computeNodeLinks(graph);\n    computeNodeValues(graph);\n    computeNodeDepths(graph);\n    computeNodeHeights(graph);\n    computeNodeBreadths(graph);\n    computeLinkBreadths(graph);\n    return graph as unknown as SankeyGraph<N, L>;\n  }\n\n  // Build the fluent SankeyLayout object using Object.assign on the callable.\n  // The type assertion at the return bridges the simplified optional-parameter\n  // method signatures to the overloaded SankeyLayout interface.\n  const layout = Object.assign(runLayout, {\n    update(graph: SankeyGraph<N, L>): SankeyGraph<N, L> {\n      computeLinkBreadths(graph as unknown as WorkingGraph);\n      return graph;\n    },\n\n    nodeId(fn?: (node: WorkingNode) => string | number) {\n      if (fn === undefined) {\n        return idAccessor;\n      }\n      idAccessor = fn;\n      return layout;\n    },\n\n    nodeAlign(fn?: (node: WorkingNode, n: number) => number) {\n      if (fn === undefined) {\n        return alignFn;\n      }\n      alignFn = typeof fn === 'function' ? fn : constant(fn)();\n      return layout;\n    },\n\n    nodeSort(fn?: ((a: WorkingNode, b: WorkingNode) => number) | null) {\n      if (arguments.length === 0) {\n        return sortFn;\n      }\n      sortFn = fn;\n      return layout;\n    },\n\n    nodeWidth(w?: number) {\n      if (w === undefined) {\n        return dx;\n      }\n      dx = +w;\n      return layout;\n    },\n\n    nodePadding(p?: number) {\n      if (p === undefined) {\n        return dy;\n      }\n      dy = py = +p;\n      return layout;\n    },\n\n    nodes(\n      accessor?:\n        | Array<SankeyGraph<N, L>['nodes'][number]>\n        | ((data: SankeyGraph<N, L>) => WorkingNode[]),\n    ) {\n      if (accessor === undefined) {\n        return nodesAccessor;\n      }\n      nodesAccessor =\n        typeof accessor === 'function'\n          ? accessor\n          : constant(accessor as unknown as WorkingNode[]);\n      return layout;\n    },\n\n    links(\n      accessor?:\n        | Array<SankeyGraph<N, L>['links'][number]>\n        | ((data: SankeyGraph<N, L>) => WorkingLink[]),\n    ) {\n      if (accessor === undefined) {\n        return linksAccessor;\n      }\n      linksAccessor =\n        typeof accessor === 'function'\n          ? accessor\n          : constant(accessor as unknown as WorkingLink[]);\n      return layout;\n    },\n\n    linkSort(fn?: ((a: WorkingLink, b: WorkingLink) => number) | null) {\n      if (arguments.length === 0) {\n        return linkSortFn;\n      }\n      linkSortFn = fn;\n      return layout;\n    },\n\n    size(s?: [number, number]) {\n      if (s === undefined) {\n        return [bx1 - bx0, by1 - by0] as [number, number];\n      }\n      bx0 = by0 = 0;\n      bx1 = +s[0];\n      by1 = +s[1];\n      return layout;\n    },\n\n    extent(e?: [[number, number], [number, number]]) {\n      if (e === undefined) {\n        return [\n          [bx0, by0],\n          [bx1, by1],\n        ] as [[number, number], [number, number]];\n      }\n      bx0 = +e[0][0];\n      bx1 = +e[1][0];\n      by0 = +e[0][1];\n      by1 = +e[1][1];\n      return layout;\n    },\n\n    iterations(n?: number) {\n      if (n === undefined) {\n        return iterations;\n      }\n      iterations = +n;\n      return layout;\n    },\n  });\n\n  return layout as unknown as SankeyLayout<SankeyGraph<N, L>, N, L>;\n}\n"],
-  "mappings": "AAIA,SAAS,KAAK,KAAK,WAAW;AAE9B,SAAS,eAAe;AACxB,OAAO,cAAc;AA+CrB,SAAS,uBAAuB,GAAgB,GAAwB;AACtE,SAAO,EAAE,OAAO,KAAK,EAAE,OAAO,MAAM,EAAE,QAAQ,EAAE;AAClD;AAEA,SAAS,uBAAuB,GAAgB,GAAwB;AACtE,SAAO,EAAE,OAAO,KAAK,EAAE,OAAO,MAAM,EAAE,QAAQ,EAAE;AAClD;AAEA,SAAS,UAAU,GAAwB;AACzC,SAAO,EAAE;AACX;AAEA,SAAS,UAAU,GAAwB;AACzC,SAAO,EAAE;AACX;AAEA,SAAS,SACP,UACA,IACa;AACb,QAAM,OAAO,SAAS,IAAI,EAAE;AAC5B,MAAI,CAAC,MAAM;AACT,UAAM,IAAI,MAAM,cAAc,EAAE;AAAA,EAClC;AACA,SAAO;AACT;AAEA,SAAS,oBAAoB,EAAE,MAAM,GAAuB;AAC1D,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,KAAK;AACd,QAAI,KAAK;AACT,eAAW,QAAQ,KAAK,aAAa;AACnC,WAAK,KAAK,KAAK,KAAK,QAAQ;AAC5B,YAAM,KAAK;AAAA,IACb;AACA,eAAW,QAAQ,KAAK,aAAa;AACnC,WAAK,KAAK,KAAK,KAAK,QAAQ;AAC5B,YAAM,KAAK;AAAA,IACb;AAAA,EACF;AACF;AAEe,SAAR,SAGoC;AACzC,MAAI,MAAM,GACR,MAAM,GACN,MAAM,GACN,MAAM;AACR,MAAI,KAAK;AACT,MAAI,KAAK,GACP,KAAK;AACP,MAAI,aAAkD,CAAC,MAAM,EAAE;AAC/D,MAAI,UAAoD;AACxD,MAAI;AACJ,MAAI;AAIJ,MAAI,gBAA4D,CAAC,MAC/D,EAAE;AACJ,MAAI,gBAA4D,CAAC,MAC/D,EAAE;AACJ,MAAI,aAAa;AAEjB,WAAS,iBAAiB,OAA2B;AACnD,eAAW,CAAC,GAAG,IAAI,KAAK,MAAM,MAAM,QAAQ,GAAG;AAC7C,WAAK,QAAQ;AACb,WAAK,cAAc,CAAC;AACpB,WAAK,cAAc,CAAC;AAAA,IACtB;AACA,UAAM,WAAW,IAAI;AAAA,MACnB,MAAM,MAAM,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;AAAA,IAC3C;AACA,UAAM,kBAAkB,MAAM;AAC9B,eAAW,CAAC,GAAG,IAAI,KAAK,gBAAgB,QAAQ,GAAG;AACjD,WAAK,QAAQ;AACb,UAAI,OAAO,KAAK,WAAW,UAAU;AACnC,aAAK,SAAS,SAAS,UAAU,KAAK,MAAM;AAAA,MAC9C;AACA,UAAI,OAAO,KAAK,WAAW,UAAU;AACnC,aAAK,SAAS,SAAS,UAAU,KAAK,MAAM;AAAA,MAC9C;AACA,MAAC,KAAK,OAAuB,YAAY,KAAK,IAAmB;AACjE,MAAC,KAAK,OAAuB,YAAY,KAAK,IAAmB;AAAA,IACnE;AACA,QAAI,eAAe,QAAQ,eAAe,QAAW;AACnD,iBAAW,EAAE,aAAa,YAAY,KAAK,MAAM,OAAO;AACtD,oBAAY,KAAK,UAAU;AAC3B,oBAAY,KAAK,UAAU;AAAA,MAC7B;AAAA,IACF;AAAA,EACF;AAEA,WAAS,kBAAkB,EAAE,MAAM,GAAuB;AACxD,eAAW,QAAQ,OAAO;AACxB,WAAK,QACH,KAAK,eAAe,SAChB,KAAK;AAAA,QACH,IAAI,KAAK,aAAa,SAAS;AAAA,QAC/B,IAAI,KAAK,aAAa,SAAS;AAAA,MACjC,IACA,KAAK;AAAA,IACb;AAAA,EACF;AAEA,WAAS,kBAAkB,EAAE,MAAM,GAAuB;AACxD,UAAM,IAAI,MAAM;AAChB,QAAI,UAAU,IAAI,IAAI,KAAK;AAC3B,QAAI,OAAO,oBAAI,IAAiB;AAChC,QAAI,IAAI;AACR,QAAIA,cAAa;AACjB,WAAO,QAAQ,MAAM;AACnB,UAAI,iBAAiB;AACrB,iBAAW,QAAQ,SAAS;AAC1B,aAAK,QAAQ,OAAO,KAAK,QAAQ,MAAM,WAAW,KAAK,QAAQ,IAAI;AACnE,YACE,OAAO,KAAK,QAAQ,MAAM,YAC1B,KAAK,QAAQ,IAAI,gBACjB;AACA,2BAAiB,KAAK,QAAQ;AAAA,QAChC;AACA,mBAAW,EAAE,OAAO,KAAK,KAAK,aAAa;AACzC,eAAK,IAAI,MAAM;AAAA,QACjB;AAAA,MACF;AACA,UAAI,EAAEA,cAAa,GAAG;AACpB,cAAM,IAAI,MAAM,eAAe;AAAA,MACjC;AACA,UAAI,KAAK,IAAI,IAAI,GAAG,iBAAiB,CAAC;AACtC,gBAAU;AACV,aAAO,oBAAI,IAAI;AAAA,IACjB;AAAA,EACF;AAEA,WAAS,mBAAmB,EAAE,MAAM,GAAuB;AACzD,UAAM,IAAI,MAAM;AAChB,QAAI,UAAU,IAAI,IAAI,KAAK;AAC3B,QAAI,OAAO,oBAAI,IAAiB;AAChC,QAAI,IAAI;AACR,WAAO,QAAQ,MAAM;AACnB,iBAAW,QAAQ,SAAS;AAC1B,aAAK,SAAS;AACd,mBAAW,EAAE,OAAO,KAAK,KAAK,aAAa;AACzC,eAAK,IAAI,MAAM;AAAA,QACjB;AAAA,MACF;AACA,UAAI,EAAE,IAAI,GAAG;AACX,cAAM,IAAI,MAAM,eAAe;AAAA,MACjC;AACA,gBAAU;AACV,aAAO,oBAAI,IAAI;AAAA,IACjB;AAAA,EACF;AAEA,WAAS,kBAAkB,EAAE,MAAM,GAAkC;AACnE,UAAM,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,KAAK,KAAK,KAAK;AAC9C,UAAM,MAAM,MAAM,MAAM,OAAO,IAAI;AACnC,UAAM,UAAU,IAAI,MAAqB,CAAC;AAC1C,eAAW,QAAQ,OAAO;AACxB,YAAM,IAAI,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,MAAM,QAAQ,MAAM,CAAC,CAAC,CAAC,CAAC;AACnE,WAAK,QAAQ;AACb,WAAK,KAAK,MAAM,IAAI;AACpB,WAAK,KAAK,KAAK,KAAK;AACpB,UAAI,QAAQ,CAAC,GAAG;AACd,gBAAQ,CAAC,EAAE,KAAK,IAAI;AAAA,MACtB,OAAO;AACL,gBAAQ,CAAC,IAAI,CAAC,IAAI;AAAA,MACpB;AAAA,IACF;AAGA,UAAM,UAAU,QAAQ,OAAO,CAAC,MAA0B,MAAM,MAAS;AACzE,QAAI,QAAQ;AACV,iBAAW,UAAU,SAAS;AAC5B,eAAO,KAAK,MAAM;AAAA,MACpB;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,WAAS,uBAAuB,SAAgC;AAC9D,UAAM,KACJ;AAAA,MACE;AAAA,MACA,CAAC,OAAO,MAAM,OAAO,EAAE,SAAS,KAAK,MAAM,IAAI,GAAG,SAAS;AAAA,IAC7D,KAAK;AACP,eAAW,SAAS,SAAS;AAC3B,UAAI,IAAI;AACR,iBAAW,QAAQ,OAAO;AACxB,aAAK,KAAK;AACV,aAAK,KAAK,IAAI,KAAK,QAAQ;AAC3B,YAAI,KAAK,KAAK;AACd,mBAAW,QAAQ,KAAK,aAAa;AACnC,eAAK,QAAQ,KAAK,QAAQ;AAAA,QAC5B;AAAA,MACF;AACA,WAAK,MAAM,IAAI,OAAO,MAAM,SAAS;AACrC,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,EAAE,GAAG;AACrC,cAAM,OAAO,MAAM,CAAC;AACpB,aAAK,MAAM,KAAK,IAAI;AACpB,aAAK,MAAM,KAAK,IAAI;AAAA,MACtB;AACA,mBAAa,KAAK;AAAA,IACpB;AAAA,EACF;AAEA,WAAS,oBAAoB,OAA2B;AACtD,UAAM,UAAU,kBAAkB,KAAK;AACvC,SAAK,KAAK,IAAI,KAAK,MAAM,SAAS,IAAI,SAAS,CAAC,MAAM,EAAE,MAAM,KAAK,KAAK,EAAE;AAC1E,2BAAuB,OAAO;AAC9B,aAAS,IAAI,GAAG,IAAI,YAAY,EAAE,GAAG;AACnC,YAAM,QAAQ,KAAK,IAAI,MAAM,CAAC;AAC9B,YAAM,OAAO,KAAK,IAAI,IAAI,QAAQ,IAAI,KAAK,UAAU;AACrD,uBAAiB,SAAS,OAAO,IAAI;AACrC,uBAAiB,SAAS,OAAO,IAAI;AAAA,IACvC;AAAA,EACF;AAEA,WAAS,iBACP,SACA,OACA,MACM;AACN,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,IAAI,GAAG,EAAE,GAAG;AAC9C,YAAM,SAAS,QAAQ,CAAC;AACxB,iBAAW,UAAU,QAAQ;AAC3B,YAAI,IAAI;AACR,YAAI,IAAI;AACR,mBAAW,EAAE,QAAQ,MAAM,KAAK,OAAO,aAAa;AAClD,gBAAM,IAAI,SAAS,OAAO,QAAQ,OAAO;AACzC,eAAK,UAAU,QAAQ,MAAM,IAAI;AACjC,eAAK;AAAA,QACP;AACA,YAAI,EAAE,IAAI,IAAI;AACZ;AAAA,QACF;AACA,cAAMC,OAAM,IAAI,IAAI,OAAO,MAAM;AACjC,eAAO,MAAMA;AACb,eAAO,MAAMA;AACb,yBAAiB,MAAM;AAAA,MACzB;AACA,UAAI,WAAW,QAAW;AACxB,eAAO,KAAK,gBAAgB;AAAA,MAC9B;AACA,wBAAkB,QAAQ,IAAI;AAAA,IAChC;AAAA,EACF;AAEA,WAAS,iBACP,SACA,OACA,MACM;AACN,aAAS,IAAI,QAAQ,QAAQ,IAAI,IAAI,GAAG,KAAK,GAAG,EAAE,GAAG;AACnD,YAAM,SAAS,QAAQ,CAAC;AACxB,iBAAW,UAAU,QAAQ;AAC3B,YAAI,IAAI;AACR,YAAI,IAAI;AACR,mBAAW,EAAE,QAAQ,MAAM,KAAK,OAAO,aAAa;AAClD,gBAAM,IAAI,SAAS,OAAO,QAAQ,OAAO;AACzC,eAAK,UAAU,QAAQ,MAAM,IAAI;AACjC,eAAK;AAAA,QACP;AACA,YAAI,EAAE,IAAI,IAAI;AACZ;AAAA,QACF;AACA,cAAMA,OAAM,IAAI,IAAI,OAAO,MAAM;AACjC,eAAO,MAAMA;AACb,eAAO,MAAMA;AACb,yBAAiB,MAAM;AAAA,MACzB;AACA,UAAI,WAAW,QAAW;AACxB,eAAO,KAAK,gBAAgB;AAAA,MAC9B;AACA,wBAAkB,QAAQ,IAAI;AAAA,IAChC;AAAA,EACF;AAEA,WAAS,iBAAiB,GAAgB,GAAwB;AAChE,WAAO,EAAE,KAAK,EAAE;AAAA,EAClB;AAEA,WAAS,kBAAkB,OAAsB,OAAqB;AACpE,UAAM,IAAI,MAAM,UAAU;AAC1B,UAAM,UAAU,MAAM,CAAC;AACvB,iCAA6B,OAAO,QAAQ,KAAK,IAAI,IAAI,GAAG,KAAK;AACjE,iCAA6B,OAAO,QAAQ,KAAK,IAAI,IAAI,GAAG,KAAK;AACjE,iCAA6B,OAAO,KAAK,MAAM,SAAS,GAAG,KAAK;AAChE,iCAA6B,OAAO,KAAK,GAAG,KAAK;AAAA,EACnD;AAEA,WAAS,6BACP,OACA,GACA,GACA,OACM;AACN,WAAO,IAAI,MAAM,QAAQ,EAAE,GAAG;AAC5B,YAAM,OAAO,MAAM,CAAC;AACpB,YAAMA,OAAM,IAAI,KAAK,MAAM;AAC3B,UAAIA,MAAK,MAAM;AACb,aAAK,MAAMA;AACX,aAAK,MAAMA;AAAA,MACb;AACA,UAAI,KAAK,KAAK;AAAA,IAChB;AAAA,EACF;AAEA,WAAS,6BACP,OACA,GACA,GACA,OACM;AACN,WAAO,KAAK,GAAG,EAAE,GAAG;AAClB,YAAM,OAAO,MAAM,CAAC;AACpB,YAAMA,OAAM,KAAK,KAAK,KAAK;AAC3B,UAAIA,MAAK,MAAM;AACb,aAAK,MAAMA;AACX,aAAK,MAAMA;AAAA,MACb;AACA,UAAI,KAAK,KAAK;AAAA,IAChB;AAAA,EACF;AAEA,WAAS,iBAAiB,EAAE,aAAa,YAAY,GAAsB;AACzE,QAAI,eAAe,QAAW;AAC5B,iBAAW;AAAA,QACT,QAAQ,EAAE,aAAa,GAAG;AAAA,MAC5B,KAAK,aAAa;AAChB,WAAG,KAAK,sBAAsB;AAAA,MAChC;AACA,iBAAW;AAAA,QACT,QAAQ,EAAE,aAAa,GAAG;AAAA,MAC5B,KAAK,aAAa;AAChB,WAAG,KAAK,sBAAsB;AAAA,MAChC;AAAA,IACF;AAAA,EACF;AAEA,WAAS,aAAa,OAA4B;AAChD,QAAI,eAAe,QAAW;AAC5B,iBAAW,EAAE,aAAa,YAAY,KAAK,OAAO;AAChD,oBAAY,KAAK,sBAAsB;AACvC,oBAAY,KAAK,sBAAsB;AAAA,MACzC;AAAA,IACF;AAAA,EACF;AAEA,WAAS,UAAU,QAAqB,QAA6B;AACnE,QAAI,IAAI,OAAO,MAAO,OAAO,YAAY,SAAS,KAAK,KAAM;AAC7D,eAAW,EAAE,QAAQ,MAAM,MAAM,KAAK,OAAO,aAAa;AACxD,UAAI,SAAS,QAAQ;AACnB;AAAA,MACF;AACA,WAAK,QAAQ;AAAA,IACf;AACA,eAAW,EAAE,QAAQ,MAAM,MAAM,KAAK,OAAO,aAAa;AACxD,UAAI,SAAS,QAAQ;AACnB;AAAA,MACF;AACA,WAAK;AAAA,IACP;AACA,WAAO;AAAA,EACT;AAEA,WAAS,UAAU,QAAqB,QAA6B;AACnE,QAAI,IAAI,OAAO,MAAO,OAAO,YAAY,SAAS,KAAK,KAAM;AAC7D,eAAW,EAAE,QAAQ,MAAM,MAAM,KAAK,OAAO,aAAa;AACxD,UAAI,SAAS,QAAQ;AACnB;AAAA,MACF;AACA,WAAK,QAAQ;AAAA,IACf;AACA,eAAW,EAAE,QAAQ,MAAM,MAAM,KAAK,OAAO,aAAa;AACxD,UAAI,SAAS,QAAQ;AACnB;AAAA,MACF;AACA,WAAK;AAAA,IACP;AACA,WAAO;AAAA,EACT;AAEA,WAAS,UAAU,MAA4C;AAC7D,UAAM,QAAsB;AAAA,MAC1B,OAAO,cAAc,IAAI;AAAA,MACzB,OAAO,cAAc,IAAI;AAAA,IAC3B;AACA,qBAAiB,KAAK;AACtB,sBAAkB,KAAK;AACvB,sBAAkB,KAAK;AACvB,uBAAmB,KAAK;AACxB,wBAAoB,KAAK;AACzB,wBAAoB,KAAK;AACzB,WAAO;AAAA,EACT;AAKA,QAAM,SAAS,OAAO,OAAO,WAAW;AAAA,IACtC,OAAO,OAA6C;AAClD,0BAAoB,KAAgC;AACpD,aAAO;AAAA,IACT;AAAA,IAEA,OAAO,IAA6C;AAClD,UAAI,OAAO,QAAW;AACpB,eAAO;AAAA,MACT;AACA,mBAAa;AACb,aAAO;AAAA,IACT;AAAA,IAEA,UAAU,IAA+C;AACvD,UAAI,OAAO,QAAW;AACpB,eAAO;AAAA,MACT;AACA,gBAAU,OAAO,OAAO,aAAa,KAAK,SAAS,EAAE,EAAE;AACvD,aAAO;AAAA,IACT;AAAA,IAEA,SAAS,IAA0D;AACjE,UAAI,UAAU,WAAW,GAAG;AAC1B,eAAO;AAAA,MACT;AACA,eAAS;AACT,aAAO;AAAA,IACT;AAAA,IAEA,UAAU,GAAY;AACpB,UAAI,MAAM,QAAW;AACnB,eAAO;AAAA,MACT;AACA,WAAK,CAAC;AACN,aAAO;AAAA,IACT;AAAA,IAEA,YAAY,GAAY;AACtB,UAAI,MAAM,QAAW;AACnB,eAAO;AAAA,MACT;AACA,WAAK,KAAK,CAAC;AACX,aAAO;AAAA,IACT;AAAA,IAEA,MACE,UAGA;AACA,UAAI,aAAa,QAAW;AAC1B,eAAO;AAAA,MACT;AACA,sBACE,OAAO,aAAa,aAChB,WACA,SAAS,QAAoC;AACnD,aAAO;AAAA,IACT;AAAA,IAEA,MACE,UAGA;AACA,UAAI,aAAa,QAAW;AAC1B,eAAO;AAAA,MACT;AACA,sBACE,OAAO,aAAa,aAChB,WACA,SAAS,QAAoC;AACnD,aAAO;AAAA,IACT;AAAA,IAEA,SAAS,IAA0D;AACjE,UAAI,UAAU,WAAW,GAAG;AAC1B,eAAO;AAAA,MACT;AACA,mBAAa;AACb,aAAO;AAAA,IACT;AAAA,IAEA,KAAK,GAAsB;AACzB,UAAI,MAAM,QAAW;AACnB,eAAO,CAAC,MAAM,KAAK,MAAM,GAAG;AAAA,MAC9B;AACA,YAAM,MAAM;AACZ,YAAM,CAAC,EAAE,CAAC;AACV,YAAM,CAAC,EAAE,CAAC;AACV,aAAO;AAAA,IACT;AAAA,IAEA,OAAO,GAA0C;AAC/C,UAAI,MAAM,QAAW;AACnB,eAAO;AAAA,UACL,CAAC,KAAK,GAAG;AAAA,UACT,CAAC,KAAK,GAAG;AAAA,QACX;AAAA,MACF;AACA,YAAM,CAAC,EAAE,CAAC,EAAE,CAAC;AACb,YAAM,CAAC,EAAE,CAAC,EAAE,CAAC;AACb,YAAM,CAAC,EAAE,CAAC,EAAE,CAAC;AACb,YAAM,CAAC,EAAE,CAAC,EAAE,CAAC;AACb,aAAO;AAAA,IACT;AAAA,IAEA,WAAW,GAAY;AACrB,UAAI,MAAM,QAAW;AACnB,eAAO;AAAA,MACT;AACA,mBAAa,CAAC;AACd,aAAO;AAAA,IACT;AAAA,EACF,CAAC;AAED,SAAO;AACT;",
+  "sourcesContent": ["// Copyright 2015, Mike Bostock\n// BSD 3-Clause License \u2014 https://github.com/d3/d3-sankey/blob/main/LICENSE\n// Vendored from d3-sankey@0.12.3 \u2014 https://github.com/d3/d3-sankey\n\nimport { max, min, sum } from 'd3-array';\n\nimport { justify } from './align.js';\nimport constant from './constant.js';\nimport type {\n  SankeyExtraProperties,\n  SankeyGraph,\n  SankeyLayout,\n} from './types.js';\n\n// Internal working types \u2014 the algorithm mutates input objects in place to add geometry fields.\n\ninterface WorkingNode {\n  index: number;\n  depth: number;\n  height: number;\n  layer: number;\n  x0: number;\n  x1: number;\n  y0: number;\n  y1: number;\n  value: number;\n  fixedValue?: number;\n  sourceLinks: WorkingLink[];\n  targetLinks: WorkingLink[];\n  [key: string]: unknown;\n}\n\n// Before computeNodeLinks resolves source/target ids, they may still be strings or numbers.\ninterface UnresolvedLink {\n  index: number;\n  source: WorkingNode | string | number;\n  target: WorkingNode | string | number;\n  value: number;\n  y0: number;\n  y1: number;\n  width: number;\n  [key: string]: unknown;\n}\n\ninterface WorkingLink extends UnresolvedLink {\n  source: WorkingNode;\n  target: WorkingNode;\n}\n\ninterface WorkingGraph {\n  nodes: WorkingNode[];\n  links: WorkingLink[];\n  // LOCAL ADDITION (not in upstream d3-sankey@0.12.3): id indexes captured\n  // during computeNodeLinks so the chart's hit-testing can resolve node/link\n  // ids in O(1) by reusing that existing pass instead of scanning the graph\n  // again downstream. `nodeById` is the map the algorithm already builds;\n  // `linkBySource` (sourceId -> targetId -> links) is built in the same loop.\n  // The leaf is an array \u2014 one entry in the normal case, more only for the rare\n  // parallel links (multiple links between the same node pair).\n  nodeById?: Map<string | number, WorkingNode>;\n  linkBySource?: Map<string | number, Map<string | number, WorkingLink[]>>;\n}\n\nfunction ascendingSourceBreadth(a: WorkingLink, b: WorkingLink): number {\n  return a.source.y0 - b.source.y0 || a.index - b.index;\n}\n\nfunction ascendingTargetBreadth(a: WorkingLink, b: WorkingLink): number {\n  return a.target.y0 - b.target.y0 || a.index - b.index;\n}\n\nfunction nodeValue(d: WorkingNode): number {\n  return d.value;\n}\n\nfunction linkValue(d: WorkingLink): number {\n  return d.value;\n}\n\nfunction findNode(\n  nodeById: Map<string | number, WorkingNode>,\n  id: string | number,\n): WorkingNode {\n  const node = nodeById.get(id);\n  if (!node) {\n    throw new Error('missing: ' + id);\n  }\n  return node;\n}\n\nfunction computeLinkBreadths({ nodes }: WorkingGraph): void {\n  for (const node of nodes) {\n    let y0 = node.y0;\n    let y1 = y0;\n    for (const link of node.sourceLinks) {\n      link.y0 = y0 + link.width / 2;\n      y0 += link.width;\n    }\n    for (const link of node.targetLinks) {\n      link.y1 = y1 + link.width / 2;\n      y1 += link.width;\n    }\n  }\n}\n\nexport default function Sankey<\n  N extends SankeyExtraProperties,\n  L extends SankeyExtraProperties,\n>(): SankeyLayout<SankeyGraph<N, L>, N, L> {\n  let bx0 = 0,\n    by0 = 0,\n    bx1 = 1,\n    by1 = 1;\n  let dx = 24;\n  let dy = 8,\n    py = 8;\n  let idAccessor: (d: WorkingNode) => string | number = (d) => d.index;\n  let alignFn: (node: WorkingNode, n: number) => number = justify;\n  let sortFn: ((a: WorkingNode, b: WorkingNode) => number) | undefined | null;\n  let linkSortFn:\n    | ((a: WorkingLink, b: WorkingLink) => number)\n    | undefined\n    | null;\n  let nodesAccessor: (data: SankeyGraph<N, L>) => WorkingNode[] = (g) =>\n    g.nodes as unknown as WorkingNode[];\n  let linksAccessor: (data: SankeyGraph<N, L>) => WorkingLink[] = (g) =>\n    g.links as unknown as WorkingLink[];\n  let iterations = 6;\n\n  function computeNodeLinks(graph: WorkingGraph): void {\n    for (const [i, node] of graph.nodes.entries()) {\n      node.index = i;\n      node.sourceLinks = [];\n      node.targetLinks = [];\n    }\n    const nodeById = new Map<string | number, WorkingNode>(\n      graph.nodes.map((d) => [idAccessor(d), d]),\n    );\n    // LOCAL ADDITION: sourceId -> targetId -> links, built in the same loop that\n    // resolves each link's endpoints. The leaf array keeps parallel links\n    // (multiple links between the same node pair) individually addressable.\n    const linkBySource = new Map<\n      string | number,\n      Map<string | number, WorkingLink[]>\n    >();\n    const unresolvedLinks = graph.links as unknown as UnresolvedLink[];\n    for (const [i, link] of unresolvedLinks.entries()) {\n      link.index = i;\n      if (typeof link.source !== 'object') {\n        link.source = findNode(nodeById, link.source);\n      }\n      if (typeof link.target !== 'object') {\n        link.target = findNode(nodeById, link.target);\n      }\n      const source = link.source as WorkingNode;\n      const target = link.target as WorkingNode;\n      source.sourceLinks.push(link as WorkingLink);\n      target.targetLinks.push(link as WorkingLink);\n      // LOCAL ADDITION: index the resolved link by its endpoint ids, appending\n      // to the pair's array so parallel links remain individually addressable.\n      const sourceId = idAccessor(source);\n      const targetId = idAccessor(target);\n      let byTarget = linkBySource.get(sourceId);\n      if (!byTarget) {\n        byTarget = new Map<string | number, WorkingLink[]>();\n        linkBySource.set(sourceId, byTarget);\n      }\n      const links = byTarget.get(targetId);\n      if (links) {\n        links.push(link as WorkingLink);\n      } else {\n        byTarget.set(targetId, [link as WorkingLink]);\n      }\n    }\n    if (linkSortFn !== null && linkSortFn !== undefined) {\n      for (const { sourceLinks, targetLinks } of graph.nodes) {\n        sourceLinks.sort(linkSortFn);\n        targetLinks.sort(linkSortFn);\n      }\n    }\n    // LOCAL ADDITION: expose the indexes on the graph for O(1) reuse downstream.\n    graph.nodeById = nodeById;\n    graph.linkBySource = linkBySource;\n  }\n\n  function computeNodeValues({ nodes }: WorkingGraph): void {\n    for (const node of nodes) {\n      node.value =\n        node.fixedValue === undefined\n          ? Math.max(\n              sum(node.sourceLinks, linkValue),\n              sum(node.targetLinks, linkValue),\n            )\n          : node.fixedValue;\n    }\n  }\n\n  function computeNodeDepths({ nodes }: WorkingGraph): void {\n    const n = nodes.length;\n    let current = new Set(nodes);\n    let next = new Set<WorkingNode>();\n    let x = 0;\n    let iterations = 0;\n    while (current.size) {\n      let maxPinnedDepth = -1;\n      for (const node of current) {\n        node.depth = typeof node['column'] === 'number' ? node['column'] : x;\n        if (\n          typeof node['column'] === 'number' &&\n          node['column'] > maxPinnedDepth\n        ) {\n          maxPinnedDepth = node['column'];\n        }\n        for (const { target } of node.sourceLinks) {\n          next.add(target);\n        }\n      }\n      if (++iterations > n) {\n        throw new Error('circular link');\n      }\n      x = Math.max(x + 1, maxPinnedDepth + 1);\n      current = next;\n      next = new Set();\n    }\n  }\n\n  function computeNodeHeights({ nodes }: WorkingGraph): void {\n    const n = nodes.length;\n    let current = new Set(nodes);\n    let next = new Set<WorkingNode>();\n    let x = 0;\n    while (current.size) {\n      for (const node of current) {\n        node.height = x;\n        for (const { source } of node.targetLinks) {\n          next.add(source);\n        }\n      }\n      if (++x > n) {\n        throw new Error('circular link');\n      }\n      current = next;\n      next = new Set();\n    }\n  }\n\n  function computeNodeLayers({ nodes }: WorkingGraph): WorkingNode[][] {\n    const x = (max(nodes, (d) => d.depth) ?? 0) + 1;\n    const kx = (bx1 - bx0 - dx) / (x - 1);\n    const columns = new Array<WorkingNode[]>(x);\n    for (const node of nodes) {\n      const i = Math.max(0, Math.min(x - 1, Math.floor(alignFn(node, x))));\n      node.layer = i;\n      node.x0 = bx0 + i * kx;\n      node.x1 = node.x0 + dx;\n      if (columns[i]) {\n        columns[i].push(node);\n      } else {\n        columns[i] = [node];\n      }\n    }\n    // alignFn may remap nodes so that some indices in the sparse array remain empty.\n    // Filter before downstream passes to prevent crashes on undefined column entries.\n    const compact = columns.filter((c): c is WorkingNode[] => c !== undefined);\n    if (sortFn) {\n      for (const column of compact) {\n        column.sort(sortFn);\n      }\n    }\n    return compact;\n  }\n\n  function initializeNodeBreadths(columns: WorkingNode[][]): void {\n    const ky =\n      min(\n        columns,\n        (c) => (by1 - by0 - (c.length - 1) * py) / sum(c, nodeValue),\n      ) ?? 0;\n    for (const nodes of columns) {\n      let y = by0;\n      for (const node of nodes) {\n        node.y0 = y;\n        node.y1 = y + node.value * ky;\n        y = node.y1 + py;\n        for (const link of node.sourceLinks) {\n          link.width = link.value * ky;\n        }\n      }\n      y = (by1 - y + py) / (nodes.length + 1);\n      for (let i = 0; i < nodes.length; ++i) {\n        const node = nodes[i];\n        node.y0 += y * (i + 1);\n        node.y1 += y * (i + 1);\n      }\n      reorderLinks(nodes);\n    }\n  }\n\n  function computeNodeBreadths(graph: WorkingGraph): void {\n    const columns = computeNodeLayers(graph);\n    py = Math.min(dy, (by1 - by0) / ((max(columns, (c) => c.length) ?? 1) - 1));\n    initializeNodeBreadths(columns);\n    for (let i = 0; i < iterations; ++i) {\n      const alpha = Math.pow(0.99, i);\n      const beta = Math.max(1 - alpha, (i + 1) / iterations);\n      relaxRightToLeft(columns, alpha, beta);\n      relaxLeftToRight(columns, alpha, beta);\n    }\n  }\n\n  function relaxLeftToRight(\n    columns: WorkingNode[][],\n    alpha: number,\n    beta: number,\n  ): void {\n    for (let i = 1, n = columns.length; i < n; ++i) {\n      const column = columns[i];\n      for (const target of column) {\n        let y = 0;\n        let w = 0;\n        for (const { source, value } of target.targetLinks) {\n          const v = value * (target.layer - source.layer);\n          y += targetTop(source, target) * v;\n          w += v;\n        }\n        if (!(w > 0)) {\n          continue;\n        }\n        const dy = (y / w - target.y0) * alpha;\n        target.y0 += dy;\n        target.y1 += dy;\n        reorderNodeLinks(target);\n      }\n      if (sortFn === undefined) {\n        column.sort(ascendingBreadth);\n      }\n      resolveCollisions(column, beta);\n    }\n  }\n\n  function relaxRightToLeft(\n    columns: WorkingNode[][],\n    alpha: number,\n    beta: number,\n  ): void {\n    for (let n = columns.length, i = n - 2; i >= 0; --i) {\n      const column = columns[i];\n      for (const source of column) {\n        let y = 0;\n        let w = 0;\n        for (const { target, value } of source.sourceLinks) {\n          const v = value * (target.layer - source.layer);\n          y += sourceTop(source, target) * v;\n          w += v;\n        }\n        if (!(w > 0)) {\n          continue;\n        }\n        const dy = (y / w - source.y0) * alpha;\n        source.y0 += dy;\n        source.y1 += dy;\n        reorderNodeLinks(source);\n      }\n      if (sortFn === undefined) {\n        column.sort(ascendingBreadth);\n      }\n      resolveCollisions(column, beta);\n    }\n  }\n\n  function ascendingBreadth(a: WorkingNode, b: WorkingNode): number {\n    return a.y0 - b.y0;\n  }\n\n  function resolveCollisions(nodes: WorkingNode[], alpha: number): void {\n    const i = nodes.length >> 1;\n    const subject = nodes[i];\n    resolveCollisionsBottomToTop(nodes, subject.y0 - py, i - 1, alpha);\n    resolveCollisionsTopToBottom(nodes, subject.y1 + py, i + 1, alpha);\n    resolveCollisionsBottomToTop(nodes, by1, nodes.length - 1, alpha);\n    resolveCollisionsTopToBottom(nodes, by0, 0, alpha);\n  }\n\n  function resolveCollisionsTopToBottom(\n    nodes: WorkingNode[],\n    y: number,\n    i: number,\n    alpha: number,\n  ): void {\n    for (; i < nodes.length; ++i) {\n      const node = nodes[i];\n      const dy = (y - node.y0) * alpha;\n      if (dy > 1e-6) {\n        node.y0 += dy;\n        node.y1 += dy;\n      }\n      y = node.y1 + py;\n    }\n  }\n\n  function resolveCollisionsBottomToTop(\n    nodes: WorkingNode[],\n    y: number,\n    i: number,\n    alpha: number,\n  ): void {\n    for (; i >= 0; --i) {\n      const node = nodes[i];\n      const dy = (node.y1 - y) * alpha;\n      if (dy > 1e-6) {\n        node.y0 -= dy;\n        node.y1 -= dy;\n      }\n      y = node.y0 - py;\n    }\n  }\n\n  function reorderNodeLinks({ sourceLinks, targetLinks }: WorkingNode): void {\n    if (linkSortFn === undefined) {\n      for (const {\n        source: { sourceLinks: sl },\n      } of targetLinks) {\n        sl.sort(ascendingTargetBreadth);\n      }\n      for (const {\n        target: { targetLinks: tl },\n      } of sourceLinks) {\n        tl.sort(ascendingSourceBreadth);\n      }\n    }\n  }\n\n  function reorderLinks(nodes: WorkingNode[]): void {\n    if (linkSortFn === undefined) {\n      for (const { sourceLinks, targetLinks } of nodes) {\n        sourceLinks.sort(ascendingTargetBreadth);\n        targetLinks.sort(ascendingSourceBreadth);\n      }\n    }\n  }\n\n  function targetTop(source: WorkingNode, target: WorkingNode): number {\n    let y = source.y0 - ((source.sourceLinks.length - 1) * py) / 2;\n    for (const { target: node, width } of source.sourceLinks) {\n      if (node === target) {\n        break;\n      }\n      y += width + py;\n    }\n    for (const { source: node, width } of target.targetLinks) {\n      if (node === source) {\n        break;\n      }\n      y -= width;\n    }\n    return y;\n  }\n\n  function sourceTop(source: WorkingNode, target: WorkingNode): number {\n    let y = target.y0 - ((target.targetLinks.length - 1) * py) / 2;\n    for (const { source: node, width } of target.targetLinks) {\n      if (node === source) {\n        break;\n      }\n      y += width + py;\n    }\n    for (const { target: node, width } of source.sourceLinks) {\n      if (node === target) {\n        break;\n      }\n      y -= width;\n    }\n    return y;\n  }\n\n  function runLayout(data: SankeyGraph<N, L>): SankeyGraph<N, L> {\n    const graph: WorkingGraph = {\n      nodes: nodesAccessor(data),\n      links: linksAccessor(data),\n    };\n    computeNodeLinks(graph);\n    computeNodeValues(graph);\n    computeNodeDepths(graph);\n    computeNodeHeights(graph);\n    computeNodeBreadths(graph);\n    computeLinkBreadths(graph);\n    return graph as unknown as SankeyGraph<N, L>;\n  }\n\n  // Build the fluent SankeyLayout object using Object.assign on the callable.\n  // The type assertion at the return bridges the simplified optional-parameter\n  // method signatures to the overloaded SankeyLayout interface.\n  const layout = Object.assign(runLayout, {\n    update(graph: SankeyGraph<N, L>): SankeyGraph<N, L> {\n      computeLinkBreadths(graph as unknown as WorkingGraph);\n      return graph;\n    },\n\n    nodeId(fn?: (node: WorkingNode) => string | number) {\n      if (fn === undefined) {\n        return idAccessor;\n      }\n      idAccessor = fn;\n      return layout;\n    },\n\n    nodeAlign(fn?: (node: WorkingNode, n: number) => number) {\n      if (fn === undefined) {\n        return alignFn;\n      }\n      alignFn = typeof fn === 'function' ? fn : constant(fn)();\n      return layout;\n    },\n\n    nodeSort(fn?: ((a: WorkingNode, b: WorkingNode) => number) | null) {\n      if (arguments.length === 0) {\n        return sortFn;\n      }\n      sortFn = fn;\n      return layout;\n    },\n\n    nodeWidth(w?: number) {\n      if (w === undefined) {\n        return dx;\n      }\n      dx = +w;\n      return layout;\n    },\n\n    nodePadding(p?: number) {\n      if (p === undefined) {\n        return dy;\n      }\n      dy = py = +p;\n      return layout;\n    },\n\n    nodes(\n      accessor?:\n        | Array<SankeyGraph<N, L>['nodes'][number]>\n        | ((data: SankeyGraph<N, L>) => WorkingNode[]),\n    ) {\n      if (accessor === undefined) {\n        return nodesAccessor;\n      }\n      nodesAccessor =\n        typeof accessor === 'function'\n          ? accessor\n          : constant(accessor as unknown as WorkingNode[]);\n      return layout;\n    },\n\n    links(\n      accessor?:\n        | Array<SankeyGraph<N, L>['links'][number]>\n        | ((data: SankeyGraph<N, L>) => WorkingLink[]),\n    ) {\n      if (accessor === undefined) {\n        return linksAccessor;\n      }\n      linksAccessor =\n        typeof accessor === 'function'\n          ? accessor\n          : constant(accessor as unknown as WorkingLink[]);\n      return layout;\n    },\n\n    linkSort(fn?: ((a: WorkingLink, b: WorkingLink) => number) | null) {\n      if (arguments.length === 0) {\n        return linkSortFn;\n      }\n      linkSortFn = fn;\n      return layout;\n    },\n\n    size(s?: [number, number]) {\n      if (s === undefined) {\n        return [bx1 - bx0, by1 - by0] as [number, number];\n      }\n      bx0 = by0 = 0;\n      bx1 = +s[0];\n      by1 = +s[1];\n      return layout;\n    },\n\n    extent(e?: [[number, number], [number, number]]) {\n      if (e === undefined) {\n        return [\n          [bx0, by0],\n          [bx1, by1],\n        ] as [[number, number], [number, number]];\n      }\n      bx0 = +e[0][0];\n      bx1 = +e[1][0];\n      by0 = +e[0][1];\n      by1 = +e[1][1];\n      return layout;\n    },\n\n    iterations(n?: number) {\n      if (n === undefined) {\n        return iterations;\n      }\n      iterations = +n;\n      return layout;\n    },\n  });\n\n  return layout as unknown as SankeyLayout<SankeyGraph<N, L>, N, L>;\n}\n"],
+  "mappings": "AAIA,SAAS,KAAK,KAAK,WAAW;AAE9B,SAAS,eAAe;AACxB,OAAO,cAAc;AAwDrB,SAAS,uBAAuB,GAAgB,GAAwB;AACtE,SAAO,EAAE,OAAO,KAAK,EAAE,OAAO,MAAM,EAAE,QAAQ,EAAE;AAClD;AAEA,SAAS,uBAAuB,GAAgB,GAAwB;AACtE,SAAO,EAAE,OAAO,KAAK,EAAE,OAAO,MAAM,EAAE,QAAQ,EAAE;AAClD;AAEA,SAAS,UAAU,GAAwB;AACzC,SAAO,EAAE;AACX;AAEA,SAAS,UAAU,GAAwB;AACzC,SAAO,EAAE;AACX;AAEA,SAAS,SACP,UACA,IACa;AACb,QAAM,OAAO,SAAS,IAAI,EAAE;AAC5B,MAAI,CAAC,MAAM;AACT,UAAM,IAAI,MAAM,cAAc,EAAE;AAAA,EAClC;AACA,SAAO;AACT;AAEA,SAAS,oBAAoB,EAAE,MAAM,GAAuB;AAC1D,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,KAAK;AACd,QAAI,KAAK;AACT,eAAW,QAAQ,KAAK,aAAa;AACnC,WAAK,KAAK,KAAK,KAAK,QAAQ;AAC5B,YAAM,KAAK;AAAA,IACb;AACA,eAAW,QAAQ,KAAK,aAAa;AACnC,WAAK,KAAK,KAAK,KAAK,QAAQ;AAC5B,YAAM,KAAK;AAAA,IACb;AAAA,EACF;AACF;AAEe,SAAR,SAGoC;AACzC,MAAI,MAAM,GACR,MAAM,GACN,MAAM,GACN,MAAM;AACR,MAAI,KAAK;AACT,MAAI,KAAK,GACP,KAAK;AACP,MAAI,aAAkD,CAAC,MAAM,EAAE;AAC/D,MAAI,UAAoD;AACxD,MAAI;AACJ,MAAI;AAIJ,MAAI,gBAA4D,CAAC,MAC/D,EAAE;AACJ,MAAI,gBAA4D,CAAC,MAC/D,EAAE;AACJ,MAAI,aAAa;AAEjB,WAAS,iBAAiB,OAA2B;AACnD,eAAW,CAAC,GAAG,IAAI,KAAK,MAAM,MAAM,QAAQ,GAAG;AAC7C,WAAK,QAAQ;AACb,WAAK,cAAc,CAAC;AACpB,WAAK,cAAc,CAAC;AAAA,IACtB;AACA,UAAM,WAAW,IAAI;AAAA,MACnB,MAAM,MAAM,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;AAAA,IAC3C;AAIA,UAAM,eAAe,oBAAI,IAGvB;AACF,UAAM,kBAAkB,MAAM;AAC9B,eAAW,CAAC,GAAG,IAAI,KAAK,gBAAgB,QAAQ,GAAG;AACjD,WAAK,QAAQ;AACb,UAAI,OAAO,KAAK,WAAW,UAAU;AACnC,aAAK,SAAS,SAAS,UAAU,KAAK,MAAM;AAAA,MAC9C;AACA,UAAI,OAAO,KAAK,WAAW,UAAU;AACnC,aAAK,SAAS,SAAS,UAAU,KAAK,MAAM;AAAA,MAC9C;AACA,YAAM,SAAS,KAAK;AACpB,YAAM,SAAS,KAAK;AACpB,aAAO,YAAY,KAAK,IAAmB;AAC3C,aAAO,YAAY,KAAK,IAAmB;AAG3C,YAAM,WAAW,WAAW,MAAM;AAClC,YAAM,WAAW,WAAW,MAAM;AAClC,UAAI,WAAW,aAAa,IAAI,QAAQ;AACxC,UAAI,CAAC,UAAU;AACb,mBAAW,oBAAI,IAAoC;AACnD,qBAAa,IAAI,UAAU,QAAQ;AAAA,MACrC;AACA,YAAM,QAAQ,SAAS,IAAI,QAAQ;AACnC,UAAI,OAAO;AACT,cAAM,KAAK,IAAmB;AAAA,MAChC,OAAO;AACL,iBAAS,IAAI,UAAU,CAAC,IAAmB,CAAC;AAAA,MAC9C;AAAA,IACF;AACA,QAAI,eAAe,QAAQ,eAAe,QAAW;AACnD,iBAAW,EAAE,aAAa,YAAY,KAAK,MAAM,OAAO;AACtD,oBAAY,KAAK,UAAU;AAC3B,oBAAY,KAAK,UAAU;AAAA,MAC7B;AAAA,IACF;AAEA,UAAM,WAAW;AACjB,UAAM,eAAe;AAAA,EACvB;AAEA,WAAS,kBAAkB,EAAE,MAAM,GAAuB;AACxD,eAAW,QAAQ,OAAO;AACxB,WAAK,QACH,KAAK,eAAe,SAChB,KAAK;AAAA,QACH,IAAI,KAAK,aAAa,SAAS;AAAA,QAC/B,IAAI,KAAK,aAAa,SAAS;AAAA,MACjC,IACA,KAAK;AAAA,IACb;AAAA,EACF;AAEA,WAAS,kBAAkB,EAAE,MAAM,GAAuB;AACxD,UAAM,IAAI,MAAM;AAChB,QAAI,UAAU,IAAI,IAAI,KAAK;AAC3B,QAAI,OAAO,oBAAI,IAAiB;AAChC,QAAI,IAAI;AACR,QAAIA,cAAa;AACjB,WAAO,QAAQ,MAAM;AACnB,UAAI,iBAAiB;AACrB,iBAAW,QAAQ,SAAS;AAC1B,aAAK,QAAQ,OAAO,KAAK,QAAQ,MAAM,WAAW,KAAK,QAAQ,IAAI;AACnE,YACE,OAAO,KAAK,QAAQ,MAAM,YAC1B,KAAK,QAAQ,IAAI,gBACjB;AACA,2BAAiB,KAAK,QAAQ;AAAA,QAChC;AACA,mBAAW,EAAE,OAAO,KAAK,KAAK,aAAa;AACzC,eAAK,IAAI,MAAM;AAAA,QACjB;AAAA,MACF;AACA,UAAI,EAAEA,cAAa,GAAG;AACpB,cAAM,IAAI,MAAM,eAAe;AAAA,MACjC;AACA,UAAI,KAAK,IAAI,IAAI,GAAG,iBAAiB,CAAC;AACtC,gBAAU;AACV,aAAO,oBAAI,IAAI;AAAA,IACjB;AAAA,EACF;AAEA,WAAS,mBAAmB,EAAE,MAAM,GAAuB;AACzD,UAAM,IAAI,MAAM;AAChB,QAAI,UAAU,IAAI,IAAI,KAAK;AAC3B,QAAI,OAAO,oBAAI,IAAiB;AAChC,QAAI,IAAI;AACR,WAAO,QAAQ,MAAM;AACnB,iBAAW,QAAQ,SAAS;AAC1B,aAAK,SAAS;AACd,mBAAW,EAAE,OAAO,KAAK,KAAK,aAAa;AACzC,eAAK,IAAI,MAAM;AAAA,QACjB;AAAA,MACF;AACA,UAAI,EAAE,IAAI,GAAG;AACX,cAAM,IAAI,MAAM,eAAe;AAAA,MACjC;AACA,gBAAU;AACV,aAAO,oBAAI,IAAI;AAAA,IACjB;AAAA,EACF;AAEA,WAAS,kBAAkB,EAAE,MAAM,GAAkC;AACnE,UAAM,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,KAAK,KAAK,KAAK;AAC9C,UAAM,MAAM,MAAM,MAAM,OAAO,IAAI;AACnC,UAAM,UAAU,IAAI,MAAqB,CAAC;AAC1C,eAAW,QAAQ,OAAO;AACxB,YAAM,IAAI,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,MAAM,QAAQ,MAAM,CAAC,CAAC,CAAC,CAAC;AACnE,WAAK,QAAQ;AACb,WAAK,KAAK,MAAM,IAAI;AACpB,WAAK,KAAK,KAAK,KAAK;AACpB,UAAI,QAAQ,CAAC,GAAG;AACd,gBAAQ,CAAC,EAAE,KAAK,IAAI;AAAA,MACtB,OAAO;AACL,gBAAQ,CAAC,IAAI,CAAC,IAAI;AAAA,MACpB;AAAA,IACF;AAGA,UAAM,UAAU,QAAQ,OAAO,CAAC,MAA0B,MAAM,MAAS;AACzE,QAAI,QAAQ;AACV,iBAAW,UAAU,SAAS;AAC5B,eAAO,KAAK,MAAM;AAAA,MACpB;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,WAAS,uBAAuB,SAAgC;AAC9D,UAAM,KACJ;AAAA,MACE;AAAA,MACA,CAAC,OAAO,MAAM,OAAO,EAAE,SAAS,KAAK,MAAM,IAAI,GAAG,SAAS;AAAA,IAC7D,KAAK;AACP,eAAW,SAAS,SAAS;AAC3B,UAAI,IAAI;AACR,iBAAW,QAAQ,OAAO;AACxB,aAAK,KAAK;AACV,aAAK,KAAK,IAAI,KAAK,QAAQ;AAC3B,YAAI,KAAK,KAAK;AACd,mBAAW,QAAQ,KAAK,aAAa;AACnC,eAAK,QAAQ,KAAK,QAAQ;AAAA,QAC5B;AAAA,MACF;AACA,WAAK,MAAM,IAAI,OAAO,MAAM,SAAS;AACrC,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,EAAE,GAAG;AACrC,cAAM,OAAO,MAAM,CAAC;AACpB,aAAK,MAAM,KAAK,IAAI;AACpB,aAAK,MAAM,KAAK,IAAI;AAAA,MACtB;AACA,mBAAa,KAAK;AAAA,IACpB;AAAA,EACF;AAEA,WAAS,oBAAoB,OAA2B;AACtD,UAAM,UAAU,kBAAkB,KAAK;AACvC,SAAK,KAAK,IAAI,KAAK,MAAM,SAAS,IAAI,SAAS,CAAC,MAAM,EAAE,MAAM,KAAK,KAAK,EAAE;AAC1E,2BAAuB,OAAO;AAC9B,aAAS,IAAI,GAAG,IAAI,YAAY,EAAE,GAAG;AACnC,YAAM,QAAQ,KAAK,IAAI,MAAM,CAAC;AAC9B,YAAM,OAAO,KAAK,IAAI,IAAI,QAAQ,IAAI,KAAK,UAAU;AACrD,uBAAiB,SAAS,OAAO,IAAI;AACrC,uBAAiB,SAAS,OAAO,IAAI;AAAA,IACvC;AAAA,EACF;AAEA,WAAS,iBACP,SACA,OACA,MACM;AACN,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,IAAI,GAAG,EAAE,GAAG;AAC9C,YAAM,SAAS,QAAQ,CAAC;AACxB,iBAAW,UAAU,QAAQ;AAC3B,YAAI,IAAI;AACR,YAAI,IAAI;AACR,mBAAW,EAAE,QAAQ,MAAM,KAAK,OAAO,aAAa;AAClD,gBAAM,IAAI,SAAS,OAAO,QAAQ,OAAO;AACzC,eAAK,UAAU,QAAQ,MAAM,IAAI;AACjC,eAAK;AAAA,QACP;AACA,YAAI,EAAE,IAAI,IAAI;AACZ;AAAA,QACF;AACA,cAAMC,OAAM,IAAI,IAAI,OAAO,MAAM;AACjC,eAAO,MAAMA;AACb,eAAO,MAAMA;AACb,yBAAiB,MAAM;AAAA,MACzB;AACA,UAAI,WAAW,QAAW;AACxB,eAAO,KAAK,gBAAgB;AAAA,MAC9B;AACA,wBAAkB,QAAQ,IAAI;AAAA,IAChC;AAAA,EACF;AAEA,WAAS,iBACP,SACA,OACA,MACM;AACN,aAAS,IAAI,QAAQ,QAAQ,IAAI,IAAI,GAAG,KAAK,GAAG,EAAE,GAAG;AACnD,YAAM,SAAS,QAAQ,CAAC;AACxB,iBAAW,UAAU,QAAQ;AAC3B,YAAI,IAAI;AACR,YAAI,IAAI;AACR,mBAAW,EAAE,QAAQ,MAAM,KAAK,OAAO,aAAa;AAClD,gBAAM,IAAI,SAAS,OAAO,QAAQ,OAAO;AACzC,eAAK,UAAU,QAAQ,MAAM,IAAI;AACjC,eAAK;AAAA,QACP;AACA,YAAI,EAAE,IAAI,IAAI;AACZ;AAAA,QACF;AACA,cAAMA,OAAM,IAAI,IAAI,OAAO,MAAM;AACjC,eAAO,MAAMA;AACb,eAAO,MAAMA;AACb,yBAAiB,MAAM;AAAA,MACzB;AACA,UAAI,WAAW,QAAW;AACxB,eAAO,KAAK,gBAAgB;AAAA,MAC9B;AACA,wBAAkB,QAAQ,IAAI;AAAA,IAChC;AAAA,EACF;AAEA,WAAS,iBAAiB,GAAgB,GAAwB;AAChE,WAAO,EAAE,KAAK,EAAE;AAAA,EAClB;AAEA,WAAS,kBAAkB,OAAsB,OAAqB;AACpE,UAAM,IAAI,MAAM,UAAU;AAC1B,UAAM,UAAU,MAAM,CAAC;AACvB,iCAA6B,OAAO,QAAQ,KAAK,IAAI,IAAI,GAAG,KAAK;AACjE,iCAA6B,OAAO,QAAQ,KAAK,IAAI,IAAI,GAAG,KAAK;AACjE,iCAA6B,OAAO,KAAK,MAAM,SAAS,GAAG,KAAK;AAChE,iCAA6B,OAAO,KAAK,GAAG,KAAK;AAAA,EACnD;AAEA,WAAS,6BACP,OACA,GACA,GACA,OACM;AACN,WAAO,IAAI,MAAM,QAAQ,EAAE,GAAG;AAC5B,YAAM,OAAO,MAAM,CAAC;AACpB,YAAMA,OAAM,IAAI,KAAK,MAAM;AAC3B,UAAIA,MAAK,MAAM;AACb,aAAK,MAAMA;AACX,aAAK,MAAMA;AAAA,MACb;AACA,UAAI,KAAK,KAAK;AAAA,IAChB;AAAA,EACF;AAEA,WAAS,6BACP,OACA,GACA,GACA,OACM;AACN,WAAO,KAAK,GAAG,EAAE,GAAG;AAClB,YAAM,OAAO,MAAM,CAAC;AACpB,YAAMA,OAAM,KAAK,KAAK,KAAK;AAC3B,UAAIA,MAAK,MAAM;AACb,aAAK,MAAMA;AACX,aAAK,MAAMA;AAAA,MACb;AACA,UAAI,KAAK,KAAK;AAAA,IAChB;AAAA,EACF;AAEA,WAAS,iBAAiB,EAAE,aAAa,YAAY,GAAsB;AACzE,QAAI,eAAe,QAAW;AAC5B,iBAAW;AAAA,QACT,QAAQ,EAAE,aAAa,GAAG;AAAA,MAC5B,KAAK,aAAa;AAChB,WAAG,KAAK,sBAAsB;AAAA,MAChC;AACA,iBAAW;AAAA,QACT,QAAQ,EAAE,aAAa,GAAG;AAAA,MAC5B,KAAK,aAAa;AAChB,WAAG,KAAK,sBAAsB;AAAA,MAChC;AAAA,IACF;AAAA,EACF;AAEA,WAAS,aAAa,OAA4B;AAChD,QAAI,eAAe,QAAW;AAC5B,iBAAW,EAAE,aAAa,YAAY,KAAK,OAAO;AAChD,oBAAY,KAAK,sBAAsB;AACvC,oBAAY,KAAK,sBAAsB;AAAA,MACzC;AAAA,IACF;AAAA,EACF;AAEA,WAAS,UAAU,QAAqB,QAA6B;AACnE,QAAI,IAAI,OAAO,MAAO,OAAO,YAAY,SAAS,KAAK,KAAM;AAC7D,eAAW,EAAE,QAAQ,MAAM,MAAM,KAAK,OAAO,aAAa;AACxD,UAAI,SAAS,QAAQ;AACnB;AAAA,MACF;AACA,WAAK,QAAQ;AAAA,IACf;AACA,eAAW,EAAE,QAAQ,MAAM,MAAM,KAAK,OAAO,aAAa;AACxD,UAAI,SAAS,QAAQ;AACnB;AAAA,MACF;AACA,WAAK;AAAA,IACP;AACA,WAAO;AAAA,EACT;AAEA,WAAS,UAAU,QAAqB,QAA6B;AACnE,QAAI,IAAI,OAAO,MAAO,OAAO,YAAY,SAAS,KAAK,KAAM;AAC7D,eAAW,EAAE,QAAQ,MAAM,MAAM,KAAK,OAAO,aAAa;AACxD,UAAI,SAAS,QAAQ;AACnB;AAAA,MACF;AACA,WAAK,QAAQ;AAAA,IACf;AACA,eAAW,EAAE,QAAQ,MAAM,MAAM,KAAK,OAAO,aAAa;AACxD,UAAI,SAAS,QAAQ;AACnB;AAAA,MACF;AACA,WAAK;AAAA,IACP;AACA,WAAO;AAAA,EACT;AAEA,WAAS,UAAU,MAA4C;AAC7D,UAAM,QAAsB;AAAA,MAC1B,OAAO,cAAc,IAAI;AAAA,MACzB,OAAO,cAAc,IAAI;AAAA,IAC3B;AACA,qBAAiB,KAAK;AACtB,sBAAkB,KAAK;AACvB,sBAAkB,KAAK;AACvB,uBAAmB,KAAK;AACxB,wBAAoB,KAAK;AACzB,wBAAoB,KAAK;AACzB,WAAO;AAAA,EACT;AAKA,QAAM,SAAS,OAAO,OAAO,WAAW;AAAA,IACtC,OAAO,OAA6C;AAClD,0BAAoB,KAAgC;AACpD,aAAO;AAAA,IACT;AAAA,IAEA,OAAO,IAA6C;AAClD,UAAI,OAAO,QAAW;AACpB,eAAO;AAAA,MACT;AACA,mBAAa;AACb,aAAO;AAAA,IACT;AAAA,IAEA,UAAU,IAA+C;AACvD,UAAI,OAAO,QAAW;AACpB,eAAO;AAAA,MACT;AACA,gBAAU,OAAO,OAAO,aAAa,KAAK,SAAS,EAAE,EAAE;AACvD,aAAO;AAAA,IACT;AAAA,IAEA,SAAS,IAA0D;AACjE,UAAI,UAAU,WAAW,GAAG;AAC1B,eAAO;AAAA,MACT;AACA,eAAS;AACT,aAAO;AAAA,IACT;AAAA,IAEA,UAAU,GAAY;AACpB,UAAI,MAAM,QAAW;AACnB,eAAO;AAAA,MACT;AACA,WAAK,CAAC;AACN,aAAO;AAAA,IACT;AAAA,IAEA,YAAY,GAAY;AACtB,UAAI,MAAM,QAAW;AACnB,eAAO;AAAA,MACT;AACA,WAAK,KAAK,CAAC;AACX,aAAO;AAAA,IACT;AAAA,IAEA,MACE,UAGA;AACA,UAAI,aAAa,QAAW;AAC1B,eAAO;AAAA,MACT;AACA,sBACE,OAAO,aAAa,aAChB,WACA,SAAS,QAAoC;AACnD,aAAO;AAAA,IACT;AAAA,IAEA,MACE,UAGA;AACA,UAAI,aAAa,QAAW;AAC1B,eAAO;AAAA,MACT;AACA,sBACE,OAAO,aAAa,aAChB,WACA,SAAS,QAAoC;AACnD,aAAO;AAAA,IACT;AAAA,IAEA,SAAS,IAA0D;AACjE,UAAI,UAAU,WAAW,GAAG;AAC1B,eAAO;AAAA,MACT;AACA,mBAAa;AACb,aAAO;AAAA,IACT;AAAA,IAEA,KAAK,GAAsB;AACzB,UAAI,MAAM,QAAW;AACnB,eAAO,CAAC,MAAM,KAAK,MAAM,GAAG;AAAA,MAC9B;AACA,YAAM,MAAM;AACZ,YAAM,CAAC,EAAE,CAAC;AACV,YAAM,CAAC,EAAE,CAAC;AACV,aAAO;AAAA,IACT;AAAA,IAEA,OAAO,GAA0C;AAC/C,UAAI,MAAM,QAAW;AACnB,eAAO;AAAA,UACL,CAAC,KAAK,GAAG;AAAA,UACT,CAAC,KAAK,GAAG;AAAA,QACX;AAAA,MACF;AACA,YAAM,CAAC,EAAE,CAAC,EAAE,CAAC;AACb,YAAM,CAAC,EAAE,CAAC,EAAE,CAAC;AACb,YAAM,CAAC,EAAE,CAAC,EAAE,CAAC;AACb,YAAM,CAAC,EAAE,CAAC,EAAE,CAAC;AACb,aAAO;AAAA,IACT;AAAA,IAEA,WAAW,GAAY;AACrB,UAAI,MAAM,QAAW;AACnB,eAAO;AAAA,MACT;AACA,mBAAa,CAAC;AACd,aAAO;AAAA,IACT;AAAA,EACF,CAAC;AAED,SAAO;AACT;",
   "names": ["iterations", "dy"]
 }

package/esm/charts/single-value/SingleValue.css

@@ -1,4 +1,4 @@
-._1sfgzlg0-3-12-2 {
+._1sfgzlg0-3-13-2 {
   height: inherit;
   width: inherit;
 }

package/esm/charts/single-value/SingleValue.sty.js

@@ -1,5 +1,5 @@
 import "./SingleValue.css";
-var container = "_1sfgzlg0-3-12-2";
+var container = "_1sfgzlg0-3-13-2";
 export {
   container
 };

package/esm/charts/single-value/SingleValue.sty.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../src/charts/single-value/SingleValue.css.ts"],
-  "sourcesContent": ["import './SingleValue.css';\nexport var container = '_1sfgzlg0-3-12-2';"],
+  "sourcesContent": ["import './SingleValue.css';\nexport var container = '_1sfgzlg0-3-13-2';"],
   "mappings": "AAAA,OAAO;AACA,IAAI,YAAY;",
   "names": []
 }

package/esm/charts/single-value-grid/SingleValueGrid.css

@@ -1,7 +1,7 @@
-._1mx9zjb0-3-12-2 {
+._1mx9zjb0-3-13-2 {
   height: 100%;
   width: 100%;
 }
-._1mx9zjb0-3-12-2 > div {
+._1mx9zjb0-3-13-2 > div {
   overflow: hidden;
 }

package/esm/charts/single-value-grid/SingleValueGrid.sty.js

@@ -1,5 +1,5 @@
 import "./SingleValueGrid.css";
-var gridRows = "_1mx9zjb0-3-12-2";
+var gridRows = "_1mx9zjb0-3-13-2";
 export {
   gridRows
 };

package/esm/charts/single-value-grid/SingleValueGrid.sty.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../src/charts/single-value-grid/SingleValueGrid.css.ts"],
-  "sourcesContent": ["import './SingleValueGrid.css';\nexport var gridRows = '_1mx9zjb0-3-12-2';"],
+  "sourcesContent": ["import './SingleValueGrid.css';\nexport var gridRows = '_1mx9zjb0-3-13-2';"],
   "mappings": "AAAA,OAAO;AACA,IAAI,WAAW;",
   "names": []
 }

package/esm/charts/single-value-grid/components/GlobalFontSizeVariables.css

@@ -1,4 +1,4 @@
-._eom86z0-3-12-2 {
+._eom86z0-3-13-2 {
   position: relative;
   width: 100%;
   height: 100%;

package/esm/charts/single-value-grid/components/GlobalFontSizeVariables.sty.js

@@ -1,5 +1,5 @@
 import "./GlobalFontSizeVariables.css";
-var fontSizeWrapper = "_eom86z0-3-12-2";
+var fontSizeWrapper = "_eom86z0-3-13-2";
 export {
   fontSizeWrapper
 };

package/esm/charts/single-value-grid/components/GlobalFontSizeVariables.sty.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../../src/charts/single-value-grid/components/GlobalFontSizeVariables.css.ts"],
-  "sourcesContent": ["import './GlobalFontSizeVariables.css';\nexport var fontSizeWrapper = '_eom86z0-3-12-2';"],
+  "sourcesContent": ["import './GlobalFontSizeVariables.css';\nexport var fontSizeWrapper = '_eom86z0-3-13-2';"],
   "mappings": "AAAA,OAAO;AACA,IAAI,kBAAkB;",
   "names": []
 }