@dynatrace/strato-components 3.13.2 → 3.14.0

package/esm/charts/sankey-chart/components/SankeyLabelOverlay.sty.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../../src/charts/sankey-chart/components/SankeyLabelOverlay.css.ts"],
-  "sourcesContent": ["import './SankeyLabelOverlay.css';\nexport var dimmedLabel = '_1wbek5q8-3-13-2';\nexport var insideLabelPositioner = '_1wbek5q5-3-13-2';\nexport var insideZoneLabel = '_1wbek5q6-3-13-2';\nexport var insideZoneOverlay = '_1wbek5q4-3-13-2';\nexport var interactiveLabel = '_1wbek5q7-3-13-2';\nexport var leftZoneLabel = '_1wbek5q2-3-13-2';\nexport var rightZoneLabel = '_1wbek5q3-3-13-2';\nexport var sideLabelContainer = '_1wbek5q0-3-13-2';\nexport var sideLabelPositioner = '_1wbek5q1-3-13-2';"],
+  "sourcesContent": ["import './SankeyLabelOverlay.css';\nexport var dimmedLabel = '_1wbek5q8-3-14-0';\nexport var insideLabelPositioner = '_1wbek5q5-3-14-0';\nexport var insideZoneLabel = '_1wbek5q6-3-14-0';\nexport var insideZoneOverlay = '_1wbek5q4-3-14-0';\nexport var interactiveLabel = '_1wbek5q7-3-14-0';\nexport var leftZoneLabel = '_1wbek5q2-3-14-0';\nexport var rightZoneLabel = '_1wbek5q3-3-14-0';\nexport var sideLabelContainer = '_1wbek5q0-3-14-0';\nexport var sideLabelPositioner = '_1wbek5q1-3-14-0';"],
   "mappings": "AAAA,OAAO;AACA,IAAI,cAAc;AAClB,IAAI,wBAAwB;AAC5B,IAAI,kBAAkB;AACtB,IAAI,oBAAoB;AACxB,IAAI,mBAAmB;AACvB,IAAI,gBAAgB;AACpB,IAAI,iBAAiB;AACrB,IAAI,qBAAqB;AACzB,IAAI,sBAAsB;",
   "names": []
 }

package/esm/charts/sankey-chart/components/SankeyOverlay.css

@@ -1,4 +1,4 @@
-._r8i5hk0-3-13-2 {
+._r8i5hk0-3-14-0 {
   position: absolute;
   inset: 0;
 }

package/esm/charts/sankey-chart/components/SankeyOverlay.sty.js

@@ -1,5 +1,5 @@
 import "./SankeyOverlay.css";
-var overlay = "_r8i5hk0-3-13-2";
+var overlay = "_r8i5hk0-3-14-0";
 export {
   overlay
 };

package/esm/charts/sankey-chart/components/SankeyOverlay.sty.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../../src/charts/sankey-chart/components/SankeyOverlay.css.ts"],
-  "sourcesContent": ["import './SankeyOverlay.css';\nexport var overlay = '_r8i5hk0-3-13-2';"],
+  "sourcesContent": ["import './SankeyOverlay.css';\nexport var overlay = '_r8i5hk0-3-14-0';"],
   "mappings": "AAAA,OAAO;AACA,IAAI,UAAU;",
   "names": []
 }

package/esm/charts/sankey-chart/constants.js

@@ -5,18 +5,24 @@ const INITIAL_SANKEY_STATE = {
   selected: void 0
 };
 const DEFAULT_TRUNCATION_MODE = TRUNCATION_MODE.Middle;
+const DEFAULT_CHART_HEIGHT = 300;
 const DEFAULT_NODE_WIDTH = 20;
 const DEFAULT_NODE_PADDING = 20;
 const LAYOUT_MARGIN = 4;
 const FALLBACK_NODE_COLOR = "#888888";
 const NODE_BORDER_RADIUS = 4;
-const INSIDE_LABEL_PADDING = 8;
+const INSIDE_LABEL_PADDING = 4;
 const INSIDE_LABEL_WIDTH_RATIO = 0.8;
 const MAX_SIDE_LABEL_WIDTH_RATIO = 0.2;
 const DEFAULT_LINK_OPACITY = 0.3;
 const HIGHLIGHT_LINK_OPACITY = 0.6;
 const DIM_CANVAS_ALPHA = 0.5;
+const COLUMN_HEADER_HEIGHT = 40;
+const COLUMN_LABEL_HORIZONTAL_PADDING = 16;
 export {
+  COLUMN_HEADER_HEIGHT,
+  COLUMN_LABEL_HORIZONTAL_PADDING,
+  DEFAULT_CHART_HEIGHT,
   DEFAULT_LINK_OPACITY,
   DEFAULT_NODE_PADDING,
   DEFAULT_NODE_WIDTH,

package/esm/charts/sankey-chart/constants.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../src/charts/sankey-chart/constants.ts"],
-  "sourcesContent": ["import type { TruncationMode } from '../../typography/text-ellipsis/TextEllipsis.js';\nimport { TRUNCATION_MODE } from '../core/constants.js';\nimport type { SankeyState } from './types/sankey-state.js';\n\nexport const DISPLAY_NAME = 'SankeyChart';\n\nexport const INITIAL_SANKEY_STATE: SankeyState = {\n  hovered: undefined,\n  selected: undefined,\n};\n\nexport const DEFAULT_TRUNCATION_MODE: TruncationMode = TRUNCATION_MODE.Middle;\n\n/** d3-sankey node geometry defaults (visual tuning deferred). */\nexport const DEFAULT_NODE_WIDTH = 20;\nexport const DEFAULT_NODE_PADDING = 20;\nexport const LAYOUT_MARGIN = 4;\n\nexport const FALLBACK_NODE_COLOR = '#888888';\nexport const NODE_BORDER_RADIUS = 4;\n\nexport const INSIDE_LABEL_PADDING = 8;\nexport const INSIDE_LABEL_WIDTH_RATIO = 0.8;\nexport const MAX_SIDE_LABEL_WIDTH_RATIO = 0.2;\n\nexport const DEFAULT_LINK_OPACITY = 0.3;\nexport const HIGHLIGHT_LINK_OPACITY = 0.6;\nexport const DIM_CANVAS_ALPHA = 0.5;\n"],
-  "mappings": "AACA,SAAS,uBAAuB;AAGzB,MAAM,eAAe;AAErB,MAAM,uBAAoC;AAAA,EAC/C,SAAS;AAAA,EACT,UAAU;AACZ;AAEO,MAAM,0BAA0C,gBAAgB;AAGhE,MAAM,qBAAqB;AAC3B,MAAM,uBAAuB;AAC7B,MAAM,gBAAgB;AAEtB,MAAM,sBAAsB;AAC5B,MAAM,qBAAqB;AAE3B,MAAM,uBAAuB;AAC7B,MAAM,2BAA2B;AACjC,MAAM,6BAA6B;AAEnC,MAAM,uBAAuB;AAC7B,MAAM,yBAAyB;AAC/B,MAAM,mBAAmB;",
+  "sourcesContent": ["import type { TruncationMode } from '../../typography/text-ellipsis/TextEllipsis.js';\nimport { TRUNCATION_MODE } from '../core/constants.js';\nimport type { SankeyState } from './types/sankey-state.js';\n\nexport const DISPLAY_NAME = 'SankeyChart';\n\nexport const INITIAL_SANKEY_STATE: SankeyState = {\n  hovered: undefined,\n  selected: undefined,\n};\n\nexport const DEFAULT_TRUNCATION_MODE: TruncationMode = TRUNCATION_MODE.Middle;\n\nexport const DEFAULT_CHART_HEIGHT = 300;\n\n/** d3-sankey node geometry defaults (visual tuning deferred). */\nexport const DEFAULT_NODE_WIDTH = 20;\nexport const DEFAULT_NODE_PADDING = 20;\nexport const LAYOUT_MARGIN = 4;\n\nexport const FALLBACK_NODE_COLOR = '#888888';\nexport const NODE_BORDER_RADIUS = 4;\n\nexport const INSIDE_LABEL_PADDING = 4;\nexport const INSIDE_LABEL_WIDTH_RATIO = 0.8;\nexport const MAX_SIDE_LABEL_WIDTH_RATIO = 0.2;\n\nexport const DEFAULT_LINK_OPACITY = 0.3;\nexport const HIGHLIGHT_LINK_OPACITY = 0.6;\nexport const DIM_CANVAS_ALPHA = 0.5;\n\nexport const COLUMN_HEADER_HEIGHT = 40;\nexport const COLUMN_LABEL_HORIZONTAL_PADDING = 16;\n"],
+  "mappings": "AACA,SAAS,uBAAuB;AAGzB,MAAM,eAAe;AAErB,MAAM,uBAAoC;AAAA,EAC/C,SAAS;AAAA,EACT,UAAU;AACZ;AAEO,MAAM,0BAA0C,gBAAgB;AAEhE,MAAM,uBAAuB;AAG7B,MAAM,qBAAqB;AAC3B,MAAM,uBAAuB;AAC7B,MAAM,gBAAgB;AAEtB,MAAM,sBAAsB;AAC5B,MAAM,qBAAqB;AAE3B,MAAM,uBAAuB;AAC7B,MAAM,2BAA2B;AACjC,MAAM,6BAA6B;AAEnC,MAAM,uBAAuB;AAC7B,MAAM,yBAAyB;AAC/B,MAAM,mBAAmB;AAEzB,MAAM,uBAAuB;AAC7B,MAAM,kCAAkC;",
   "names": []
 }

package/esm/charts/sankey-chart/context/SankeyColumnLabels.context.js

@@ -0,0 +1,7 @@
+import { createContext } from "react";
+const SankeyColumnLabelsContext = createContext(void 0);
+SankeyColumnLabelsContext["displayName"] = "SankeyColumnLabelsContext";
+export {
+  SankeyColumnLabelsContext
+};
+//# sourceMappingURL=SankeyColumnLabels.context.js.map

package/esm/charts/sankey-chart/context/SankeyColumnLabels.context.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../../src/charts/sankey-chart/context/SankeyColumnLabels.context.ts"],
+  "sourcesContent": ["import { createContext } from 'react';\n\nexport const SankeyColumnLabelsContext = createContext<\n  Record<number, string> | undefined\n>(undefined);\n\nSankeyColumnLabelsContext['displayName'] = 'SankeyColumnLabelsContext';\n"],
+  "mappings": "AAAA,SAAS,qBAAqB;AAEvB,MAAM,4BAA4B,cAEvC,MAAS;AAEX,0BAA0B,aAAa,IAAI;",
+  "names": []
+}

package/esm/charts/sankey-chart/context/SankeyFormatter.context.js

@@ -1,7 +1,5 @@
 import { createContext } from "react";
-const SankeyFormatterContext = createContext(
-  String
-);
+const SankeyFormatterContext = createContext(String);
 export {
   SankeyFormatterContext
 };

package/esm/charts/sankey-chart/context/SankeyFormatter.context.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../../src/charts/sankey-chart/context/SankeyFormatter.context.ts"],
-  "sourcesContent": ["import { createContext } from 'react';\n\nexport const SankeyFormatterContext = createContext<(value: number) => string>(\n  String,\n);\n"],
-  "mappings": "AAAA,SAAS,qBAAqB;AAEvB,MAAM,yBAAyB;AAAA,EACpC;AACF;",
+  "sourcesContent": ["import { createContext } from 'react';\n\nexport const SankeyFormatterContext =\n  createContext<(value: number) => string>(String);\n"],
+  "mappings": "AAAA,SAAS,qBAAqB;AAEvB,MAAM,yBACX,cAAyC,MAAM;",
   "names": []
 }

package/esm/charts/sankey-chart/hooks/use-node-colors.js

@@ -3,16 +3,16 @@ import { getCanvasColor } from "../../core/components/canvas/utils/canvas-color.
 import { buildCategoricalColorScale } from "../../core/utils/build-categorical-color-scale.js";
 import { SankeyColorPaletteContext } from "../context/SankeyColorPalette.context.js";
 import { SankeyDataContext } from "../context/SankeyData.context.js";
-function buildPerNodeColorMap(nodes, colorPalette) {
+function buildPerNodeColorTokenMap(nodes, colorPalette) {
   const ids = nodes.map((n) => n.id);
   const scale = buildCategoricalColorScale(colorPalette, ids);
-  const colorMap = /* @__PURE__ */ new Map();
+  const tokenMap = /* @__PURE__ */ new Map();
   for (const node of nodes) {
-    colorMap.set(node.id, getCanvasColor(scale(node.id)));
+    tokenMap.set(node.id, scale(node.id));
   }
-  return colorMap;
+  return tokenMap;
 }
-function buildColumnColorMap(nodes, colorPalette) {
+function buildColumnColorTokenMap(nodes, colorPalette) {
   const uniqueColumns = [
     ...new Set(
       nodes.map((n) => n.column).filter((c) => c !== void 0)
@@ -20,20 +20,25 @@ function buildColumnColorMap(nodes, colorPalette) {
   ].sort((a, b) => a - b);
   const columnKeys = uniqueColumns.map(String);
   const scale = buildCategoricalColorScale(colorPalette, columnKeys);
-  const colorMap = /* @__PURE__ */ new Map();
+  const tokenMap = /* @__PURE__ */ new Map();
   for (const node of nodes) {
     const key = node.column !== void 0 ? String(node.column) : columnKeys[0] ?? "0";
-    colorMap.set(node.id, getCanvasColor(scale(key)));
+    tokenMap.set(node.id, scale(key));
   }
-  return colorMap;
+  return tokenMap;
 }
 function useNodeColors() {
   const { nodes } = useContext(SankeyDataContext);
   const colorPalette = useContext(SankeyColorPaletteContext);
-  return useMemo(() => {
+  const tokenMap = useMemo(() => {
     const hasColumnAssignment = nodes.some((n) => n.column !== void 0);
-    return hasColumnAssignment ? buildColumnColorMap(nodes, colorPalette) : buildPerNodeColorMap(nodes, colorPalette);
+    return hasColumnAssignment ? buildColumnColorTokenMap(nodes, colorPalette) : buildPerNodeColorTokenMap(nodes, colorPalette);
   }, [nodes, colorPalette]);
+  const colorMap = /* @__PURE__ */ new Map();
+  for (const [id, token] of tokenMap) {
+    colorMap.set(id, getCanvasColor(token));
+  }
+  return colorMap;
 }
 export {
   useNodeColors

package/esm/charts/sankey-chart/hooks/use-node-colors.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../../src/charts/sankey-chart/hooks/use-node-colors.ts"],
-  "sourcesContent": ["import { useContext, useMemo } from 'react';\n\nimport { getCanvasColor } from '../../core/components/canvas/utils/canvas-color.js';\nimport type {\n  ColorPalette,\n  CustomColorPalette,\n} from '../../core/types/color-palette.js';\nimport { buildCategoricalColorScale } from '../../core/utils/build-categorical-color-scale.js';\nimport { SankeyColorPaletteContext } from '../context/SankeyColorPalette.context.js';\nimport { SankeyDataContext } from '../context/SankeyData.context.js';\nimport type { SankeyGraphNode } from '../types/sankey-internal.js';\n\nfunction buildPerNodeColorMap(\n  nodes: SankeyGraphNode[],\n  colorPalette: ColorPalette | CustomColorPalette,\n): Map<string, string> {\n  const ids = nodes.map((n) => n.id);\n  const scale = buildCategoricalColorScale(colorPalette, ids);\n  const colorMap = new Map<string, string>();\n  for (const node of nodes) {\n    colorMap.set(node.id, getCanvasColor(scale(node.id)));\n  }\n  return colorMap;\n}\n\nfunction buildColumnColorMap(\n  nodes: SankeyGraphNode[],\n  colorPalette: ColorPalette | CustomColorPalette,\n): Map<string, string> {\n  const uniqueColumns = [\n    ...new Set(\n      nodes.map((n) => n.column).filter((c): c is number => c !== undefined),\n    ),\n  ].sort((a, b) => a - b);\n  const columnKeys = uniqueColumns.map(String);\n  const scale = buildCategoricalColorScale(colorPalette, columnKeys);\n\n  const colorMap = new Map<string, string>();\n  for (const node of nodes) {\n    const key =\n      node.column !== undefined ? String(node.column) : columnKeys[0] ?? '0';\n    colorMap.set(node.id, getCanvasColor(scale(key)));\n  }\n  return colorMap;\n}\n\n/**\n * Returns a map from node id to resolved hex color.\n *\n * When nodes carry an explicit column assignment (from `columnAccessor`), all\n * nodes in the same column receive the same categorical palette color so that\n * columns are visually grouped. Without column assignments each node receives\n * its own palette color in document order.\n */\nexport function useNodeColors(): Map<string, string> {\n  const { nodes } = useContext(SankeyDataContext);\n  const colorPalette = useContext(SankeyColorPaletteContext);\n\n  return useMemo(() => {\n    const hasColumnAssignment = nodes.some((n) => n.column !== undefined);\n    return hasColumnAssignment\n      ? buildColumnColorMap(nodes, colorPalette)\n      : buildPerNodeColorMap(nodes, colorPalette);\n  }, [nodes, colorPalette]);\n}\n"],
-  "mappings": "AAAA,SAAS,YAAY,eAAe;AAEpC,SAAS,sBAAsB;AAK/B,SAAS,kCAAkC;AAC3C,SAAS,iCAAiC;AAC1C,SAAS,yBAAyB;AAGlC,SAAS,qBACP,OACA,cACqB;AACrB,QAAM,MAAM,MAAM,IAAI,CAAC,MAAM,EAAE,EAAE;AACjC,QAAM,QAAQ,2BAA2B,cAAc,GAAG;AAC1D,QAAM,WAAW,oBAAI,IAAoB;AACzC,aAAW,QAAQ,OAAO;AACxB,aAAS,IAAI,KAAK,IAAI,eAAe,MAAM,KAAK,EAAE,CAAC,CAAC;AAAA,EACtD;AACA,SAAO;AACT;AAEA,SAAS,oBACP,OACA,cACqB;AACrB,QAAM,gBAAgB;AAAA,IACpB,GAAG,IAAI;AAAA,MACL,MAAM,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,MAAmB,MAAM,MAAS;AAAA,IACvE;AAAA,EACF,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AACtB,QAAM,aAAa,cAAc,IAAI,MAAM;AAC3C,QAAM,QAAQ,2BAA2B,cAAc,UAAU;AAEjE,QAAM,WAAW,oBAAI,IAAoB;AACzC,aAAW,QAAQ,OAAO;AACxB,UAAM,MACJ,KAAK,WAAW,SAAY,OAAO,KAAK,MAAM,IAAI,WAAW,CAAC,KAAK;AACrE,aAAS,IAAI,KAAK,IAAI,eAAe,MAAM,GAAG,CAAC,CAAC;AAAA,EAClD;AACA,SAAO;AACT;AAUO,SAAS,gBAAqC;AACnD,QAAM,EAAE,MAAM,IAAI,WAAW,iBAAiB;AAC9C,QAAM,eAAe,WAAW,yBAAyB;AAEzD,SAAO,QAAQ,MAAM;AACnB,UAAM,sBAAsB,MAAM,KAAK,CAAC,MAAM,EAAE,WAAW,MAAS;AACpE,WAAO,sBACH,oBAAoB,OAAO,YAAY,IACvC,qBAAqB,OAAO,YAAY;AAAA,EAC9C,GAAG,CAAC,OAAO,YAAY,CAAC;AAC1B;",
+  "sourcesContent": ["import { useContext, useMemo } from 'react';\n\nimport { getCanvasColor } from '../../core/components/canvas/utils/canvas-color.js';\nimport type {\n  ColorPalette,\n  CustomColorPalette,\n} from '../../core/types/color-palette.js';\nimport { buildCategoricalColorScale } from '../../core/utils/build-categorical-color-scale.js';\nimport { SankeyColorPaletteContext } from '../context/SankeyColorPalette.context.js';\nimport { SankeyDataContext } from '../context/SankeyData.context.js';\nimport type { SankeyGraphNode } from '../types/sankey-internal.js';\n\nfunction buildPerNodeColorTokenMap(\n  nodes: SankeyGraphNode[],\n  colorPalette: ColorPalette | CustomColorPalette,\n): Map<string, string> {\n  const ids = nodes.map((n) => n.id);\n  const scale = buildCategoricalColorScale(colorPalette, ids);\n  const tokenMap = new Map<string, string>();\n  for (const node of nodes) {\n    tokenMap.set(node.id, scale(node.id));\n  }\n  return tokenMap;\n}\n\nfunction buildColumnColorTokenMap(\n  nodes: SankeyGraphNode[],\n  colorPalette: ColorPalette | CustomColorPalette,\n): Map<string, string> {\n  const uniqueColumns = [\n    ...new Set(\n      nodes.map((n) => n.column).filter((c): c is number => c !== undefined),\n    ),\n  ].sort((a, b) => a - b);\n  const columnKeys = uniqueColumns.map(String);\n  const scale = buildCategoricalColorScale(colorPalette, columnKeys);\n\n  const tokenMap = new Map<string, string>();\n  for (const node of nodes) {\n    const key =\n      node.column !== undefined ? String(node.column) : (columnKeys[0] ?? '0');\n    tokenMap.set(node.id, scale(key));\n  }\n  return tokenMap;\n}\n\n/**\n * Returns a map from node id to resolved hex color.\n *\n * When nodes carry an explicit column assignment (from `columnAccessor`), all\n * nodes in the same column receive the same categorical palette color so that\n * columns are visually grouped. Without column assignments each node receives\n * its own palette color in document order.\n */\nexport function useNodeColors(): Map<string, string> {\n  const { nodes } = useContext(SankeyDataContext);\n  const colorPalette = useContext(SankeyColorPaletteContext);\n\n  // Only the id -> token mapping is memoized: it's a plain categorical scale\n  // and doesn't depend on the active theme. Resolving each token to a hex\n  // color via `getCanvasColor` happens on every call (as elsewhere in the\n  // charts codebase, e.g. BarLabelOverlay, draw-shape.ts) so it always reads\n  // the current `[data-theme]` from the DOM instead of baking in whatever\n  // theme happened to be applied the first time this map was built.\n  const tokenMap = useMemo(() => {\n    const hasColumnAssignment = nodes.some((n) => n.column !== undefined);\n    return hasColumnAssignment\n      ? buildColumnColorTokenMap(nodes, colorPalette)\n      : buildPerNodeColorTokenMap(nodes, colorPalette);\n  }, [nodes, colorPalette]);\n\n  const colorMap = new Map<string, string>();\n  for (const [id, token] of tokenMap) {\n    colorMap.set(id, getCanvasColor(token));\n  }\n  return colorMap;\n}\n"],
+  "mappings": "AAAA,SAAS,YAAY,eAAe;AAEpC,SAAS,sBAAsB;AAK/B,SAAS,kCAAkC;AAC3C,SAAS,iCAAiC;AAC1C,SAAS,yBAAyB;AAGlC,SAAS,0BACP,OACA,cACqB;AACrB,QAAM,MAAM,MAAM,IAAI,CAAC,MAAM,EAAE,EAAE;AACjC,QAAM,QAAQ,2BAA2B,cAAc,GAAG;AAC1D,QAAM,WAAW,oBAAI,IAAoB;AACzC,aAAW,QAAQ,OAAO;AACxB,aAAS,IAAI,KAAK,IAAI,MAAM,KAAK,EAAE,CAAC;AAAA,EACtC;AACA,SAAO;AACT;AAEA,SAAS,yBACP,OACA,cACqB;AACrB,QAAM,gBAAgB;AAAA,IACpB,GAAG,IAAI;AAAA,MACL,MAAM,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,MAAmB,MAAM,MAAS;AAAA,IACvE;AAAA,EACF,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AACtB,QAAM,aAAa,cAAc,IAAI,MAAM;AAC3C,QAAM,QAAQ,2BAA2B,cAAc,UAAU;AAEjE,QAAM,WAAW,oBAAI,IAAoB;AACzC,aAAW,QAAQ,OAAO;AACxB,UAAM,MACJ,KAAK,WAAW,SAAY,OAAO,KAAK,MAAM,IAAK,WAAW,CAAC,KAAK;AACtE,aAAS,IAAI,KAAK,IAAI,MAAM,GAAG,CAAC;AAAA,EAClC;AACA,SAAO;AACT;AAUO,SAAS,gBAAqC;AACnD,QAAM,EAAE,MAAM,IAAI,WAAW,iBAAiB;AAC9C,QAAM,eAAe,WAAW,yBAAyB;AAQzD,QAAM,WAAW,QAAQ,MAAM;AAC7B,UAAM,sBAAsB,MAAM,KAAK,CAAC,MAAM,EAAE,WAAW,MAAS;AACpE,WAAO,sBACH,yBAAyB,OAAO,YAAY,IAC5C,0BAA0B,OAAO,YAAY;AAAA,EACnD,GAAG,CAAC,OAAO,YAAY,CAAC;AAExB,QAAM,WAAW,oBAAI,IAAoB;AACzC,aAAW,CAAC,IAAI,KAAK,KAAK,UAAU;AAClC,aAAS,IAAI,IAAI,eAAe,KAAK,CAAC;AAAA,EACxC;AACA,SAAO;AACT;",
   "names": []
 }

package/esm/charts/sankey-chart/providers/SankeyConfigProvider.js

@@ -1,13 +1,15 @@
 import { jsx } from "react/jsx-runtime";
 import { SankeyColorPaletteContext } from "../context/SankeyColorPalette.context.js";
+import { SankeyColumnLabelsContext } from "../context/SankeyColumnLabels.context.js";
 import { SankeyNodesContext } from "../context/SankeyNodes.context.js";
 import { SankeyTruncationModeContext } from "../context/SankeyTruncationMode.context.js";
 const SankeyConfigProvider = ({
   nodesConfig,
   truncationMode,
   colorPalette,
+  columnLabels,
   children
-}) => /* @__PURE__ */ jsx(SankeyTruncationModeContext.Provider, { value: truncationMode, children: /* @__PURE__ */ jsx(SankeyColorPaletteContext.Provider, { value: colorPalette, children: /* @__PURE__ */ jsx(SankeyNodesContext.Provider, { value: nodesConfig, children }) }) });
+}) => /* @__PURE__ */ jsx(SankeyTruncationModeContext.Provider, { value: truncationMode, children: /* @__PURE__ */ jsx(SankeyColorPaletteContext.Provider, { value: colorPalette, children: /* @__PURE__ */ jsx(SankeyColumnLabelsContext.Provider, { value: columnLabels, children: /* @__PURE__ */ jsx(SankeyNodesContext.Provider, { value: nodesConfig, children }) }) }) });
 SankeyConfigProvider.displayName = "SankeyConfigProvider";
 export {
   SankeyConfigProvider

package/esm/charts/sankey-chart/providers/SankeyConfigProvider.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../../src/charts/sankey-chart/providers/SankeyConfigProvider.tsx"],
-  "sourcesContent": ["import { type PropsWithChildren } from 'react';\n\nimport type { TruncationMode } from '../../../typography/text-ellipsis/TextEllipsis.js';\nimport type {\n  ColorPalette,\n  CustomColorPalette,\n} from '../../core/types/color-palette.js';\nimport { SankeyColorPaletteContext } from '../context/SankeyColorPalette.context.js';\nimport { SankeyNodesContext } from '../context/SankeyNodes.context.js';\nimport { SankeyTruncationModeContext } from '../context/SankeyTruncationMode.context.js';\nimport type { SankeyChartNodesProps } from '../types/sankey-props.js';\n\ninterface SankeyConfigProviderProps {\n  nodesConfig: SankeyChartNodesProps;\n  truncationMode: TruncationMode;\n  colorPalette: ColorPalette | CustomColorPalette;\n}\n\nexport const SankeyConfigProvider = ({\n  nodesConfig,\n  truncationMode,\n  colorPalette,\n  children,\n}: PropsWithChildren<SankeyConfigProviderProps>) => (\n  <SankeyTruncationModeContext.Provider value={truncationMode}>\n    <SankeyColorPaletteContext.Provider value={colorPalette}>\n      <SankeyNodesContext.Provider value={nodesConfig}>\n        {children}\n      </SankeyNodesContext.Provider>\n    </SankeyColorPaletteContext.Provider>\n  </SankeyTruncationModeContext.Provider>\n);\n\nSankeyConfigProvider.displayName = 'SankeyConfigProvider';\n"],
-  "mappings": "AA0BM;AAnBN,SAAS,iCAAiC;AAC1C,SAAS,0BAA0B;AACnC,SAAS,mCAAmC;AASrC,MAAM,uBAAuB,CAAC;AAAA,EACnC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,MACE,oBAAC,4BAA4B,UAA5B,EAAqC,OAAO,gBAC3C,8BAAC,0BAA0B,UAA1B,EAAmC,OAAO,cACzC,8BAAC,mBAAmB,UAAnB,EAA4B,OAAO,aACjC,UACH,GACF,GACF;AAGF,qBAAqB,cAAc;",
+  "sourcesContent": ["import { type PropsWithChildren } from 'react';\n\nimport type { TruncationMode } from '../../../typography/text-ellipsis/TextEllipsis.js';\nimport type {\n  ColorPalette,\n  CustomColorPalette,\n} from '../../core/types/color-palette.js';\nimport { SankeyColorPaletteContext } from '../context/SankeyColorPalette.context.js';\nimport { SankeyColumnLabelsContext } from '../context/SankeyColumnLabels.context.js';\nimport { SankeyNodesContext } from '../context/SankeyNodes.context.js';\nimport { SankeyTruncationModeContext } from '../context/SankeyTruncationMode.context.js';\nimport type { SankeyChartNodesProps } from '../types/sankey-props.js';\n\ninterface SankeyConfigProviderProps {\n  nodesConfig: SankeyChartNodesProps;\n  truncationMode: TruncationMode;\n  colorPalette: ColorPalette | CustomColorPalette;\n  columnLabels: Record<number, string> | undefined;\n}\n\nexport const SankeyConfigProvider = ({\n  nodesConfig,\n  truncationMode,\n  colorPalette,\n  columnLabels,\n  children,\n}: PropsWithChildren<SankeyConfigProviderProps>) => (\n  <SankeyTruncationModeContext.Provider value={truncationMode}>\n    <SankeyColorPaletteContext.Provider value={colorPalette}>\n      <SankeyColumnLabelsContext.Provider value={columnLabels}>\n        <SankeyNodesContext.Provider value={nodesConfig}>\n          {children}\n        </SankeyNodesContext.Provider>\n      </SankeyColumnLabelsContext.Provider>\n    </SankeyColorPaletteContext.Provider>\n  </SankeyTruncationModeContext.Provider>\n);\n\nSankeyConfigProvider.displayName = 'SankeyConfigProvider';\n"],
+  "mappings": "AA8BQ;AAvBR,SAAS,iCAAiC;AAC1C,SAAS,iCAAiC;AAC1C,SAAS,0BAA0B;AACnC,SAAS,mCAAmC;AAUrC,MAAM,uBAAuB,CAAC;AAAA,EACnC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,MACE,oBAAC,4BAA4B,UAA5B,EAAqC,OAAO,gBAC3C,8BAAC,0BAA0B,UAA1B,EAAmC,OAAO,cACzC,8BAAC,0BAA0B,UAA1B,EAAmC,OAAO,cACzC,8BAAC,mBAAmB,UAAnB,EAA4B,OAAO,aACjC,UACH,GACF,GACF,GACF;AAGF,qBAAqB,cAAc;",
   "names": []
 }

package/esm/charts/sankey-chart/providers/SankeyFormatterProvider.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../../src/charts/sankey-chart/providers/SankeyFormatterProvider.tsx"],
-  "sourcesContent": ["import { type PropsWithChildren } from 'react';\n\nimport type { ConvertibleUnit, FormatOptions, Unit } from '@dynatrace-sdk/units';\n\nimport type { ChartUnit } from '../../core/types/chart-unit.js';\nimport type { Formatter } from '../../core/types/formatter.js';\nimport { SankeyFormatterContext } from '../context/SankeyFormatter.context.js';\nimport { useSankeyFormatter } from '../hooks/use-sankey-formatter.js';\n\ninterface SankeyFormatterProviderProps {\n  formatter?: Formatter | FormatOptions<Unit, ConvertibleUnit>;\n  unit?: ChartUnit;\n}\n\n/**\n * @internal\n */\nexport const SankeyFormatterProvider = ({\n  formatter,\n  unit,\n  children,\n}: PropsWithChildren<SankeyFormatterProviderProps>) => {\n  const resolvedFormatter = useSankeyFormatter(formatter, unit);\n  return (\n    <SankeyFormatterContext.Provider value={resolvedFormatter}>\n      {children}\n    </SankeyFormatterContext.Provider>\n  );\n};\n\nSankeyFormatterProvider.displayName = 'SankeyFormatterProvider';"],
-  "mappings": "AAwBI;AAlBJ,SAAS,8BAA8B;AACvC,SAAS,0BAA0B;AAU5B,MAAM,0BAA0B,CAAC;AAAA,EACtC;AAAA,EACA;AAAA,EACA;AACF,MAAuD;AACrD,QAAM,oBAAoB,mBAAmB,WAAW,IAAI;AAC5D,SACE,oBAAC,uBAAuB,UAAvB,EAAgC,OAAO,mBACrC,UACH;AAEJ;AAEA,wBAAwB,cAAc;",
+  "sourcesContent": ["import { type PropsWithChildren } from 'react';\n\nimport type {\n  ConvertibleUnit,\n  FormatOptions,\n  Unit,\n} from '@dynatrace-sdk/units';\n\nimport type { ChartUnit } from '../../core/types/chart-unit.js';\nimport type { Formatter } from '../../core/types/formatter.js';\nimport { SankeyFormatterContext } from '../context/SankeyFormatter.context.js';\nimport { useSankeyFormatter } from '../hooks/use-sankey-formatter.js';\n\ninterface SankeyFormatterProviderProps {\n  formatter?: Formatter | FormatOptions<Unit, ConvertibleUnit>;\n  unit?: ChartUnit;\n}\n\n/**\n * @internal\n */\nexport const SankeyFormatterProvider = ({\n  formatter,\n  unit,\n  children,\n}: PropsWithChildren<SankeyFormatterProviderProps>) => {\n  const resolvedFormatter = useSankeyFormatter(formatter, unit);\n  return (\n    <SankeyFormatterContext.Provider value={resolvedFormatter}>\n      {children}\n    </SankeyFormatterContext.Provider>\n  );\n};\n\nSankeyFormatterProvider.displayName = 'SankeyFormatterProvider';\n"],
+  "mappings": "AA4BI;AAlBJ,SAAS,8BAA8B;AACvC,SAAS,0BAA0B;AAU5B,MAAM,0BAA0B,CAAC;AAAA,EACtC;AAAA,EACA;AAAA,EACA;AACF,MAAuD;AACrD,QAAM,oBAAoB,mBAAmB,WAAW,IAAI;AAC5D,SACE,oBAAC,uBAAuB,UAAvB,EAAgC,OAAO,mBACrC,UACH;AAEJ;AAEA,wBAAwB,cAAc;",
   "names": []
 }

package/esm/charts/sankey-chart/utils/get-column-x-range.js

@@ -0,0 +1,55 @@
+function buildDepthToXRangeMap(nodes) {
+  const map = /* @__PURE__ */ new Map();
+  for (const node of nodes) {
+    const key = node.layer ?? node.depth;
+    if (key === void 0 || node.x0 === void 0 || node.x1 === void 0) {
+      continue;
+    }
+    const existing = map.get(key);
+    if (existing === void 0) {
+      map.set(key, { x0: node.x0, x1: node.x1 });
+    } else {
+      map.set(key, {
+        x0: Math.min(existing.x0, node.x0),
+        x1: Math.max(existing.x1, node.x1)
+      });
+    }
+  }
+  return map;
+}
+function getXRangeForDepth(depth, depthToXRange, sortedDepths = [...depthToXRange.keys()].sort(
+  (a, b) => a - b
+)) {
+  const direct = depthToXRange.get(depth);
+  if (direct !== void 0) {
+    return direct;
+  }
+  if (depthToXRange.size === 0) {
+    return void 0;
+  }
+  const minDepth = sortedDepths[0];
+  const maxDepth = sortedDepths[sortedDepths.length - 1];
+  if (depth < minDepth || depth > maxDepth) {
+    return void 0;
+  }
+  const leftDepth = sortedDepths.filter((d) => d < depth).at(-1);
+  const rightDepth = sortedDepths.find((d) => d > depth);
+  if (leftDepth === void 0 || rightDepth === void 0) {
+    return void 0;
+  }
+  const leftRange = depthToXRange.get(leftDepth);
+  const rightRange = depthToXRange.get(rightDepth);
+  if (leftRange === void 0 || rightRange === void 0) {
+    return void 0;
+  }
+  const t = (depth - leftDepth) / (rightDepth - leftDepth);
+  return {
+    x0: leftRange.x0 + (rightRange.x0 - leftRange.x0) * t,
+    x1: leftRange.x1 + (rightRange.x1 - leftRange.x1) * t
+  };
+}
+export {
+  buildDepthToXRangeMap,
+  getXRangeForDepth
+};
+//# sourceMappingURL=get-column-x-range.js.map

package/esm/charts/sankey-chart/utils/get-column-x-range.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../../src/charts/sankey-chart/utils/get-column-x-range.ts"],
+  "sourcesContent": ["interface XRange {\n  readonly x0: number;\n  readonly x1: number;\n}\n\ninterface NodeWithDepth {\n  readonly depth?: number;\n  /**\n   * The visual column index from the align function (e.g. sankeyJustify). Used\n   * as the map key when present so sink/source nodes repositioned by justify\n   * don't corrupt the x-range of their assigned depth column.\n   */\n  readonly layer?: number;\n  readonly x0?: number;\n  readonly x1?: number;\n}\n\n/**\n * Builds a map from visual column index to the x-range covering all nodes in\n * that column. Uses `layer` as the key when available (the actual column\n * assigned by the align function), falling back to `depth`. When multiple\n * nodes share the same column, the map stores the union of their x-extents.\n */\nexport function buildDepthToXRangeMap(\n  nodes: ReadonlyArray<NodeWithDepth>,\n): Map<number, XRange> {\n  const map = new Map<number, XRange>();\n\n  for (const node of nodes) {\n    const key = node.layer ?? node.depth;\n    if (key === undefined || node.x0 === undefined || node.x1 === undefined) {\n      continue;\n    }\n\n    const existing = map.get(key);\n    if (existing === undefined) {\n      map.set(key, { x0: node.x0, x1: node.x1 });\n    } else {\n      map.set(key, {\n        x0: Math.min(existing.x0, node.x0),\n        x1: Math.max(existing.x1, node.x1),\n      });\n    }\n  }\n\n  return map;\n}\n\n/**\n * Returns the x-range for the given column depth index.\n *\n * - If the depth has layout nodes, returns their x-range directly.\n * - If the depth is within the range of known depths but has no nodes,\n *   linearly interpolates between the nearest known neighbors.\n * - If the depth falls outside [minDepth, maxDepth], returns `undefined`\n *   so the caller can silently skip it\n */\nexport function getXRangeForDepth(\n  depth: number,\n  depthToXRange: Map<number, XRange>,\n  sortedDepths: ReadonlyArray<number> = [...depthToXRange.keys()].sort(\n    (a, b) => a - b,\n  ),\n): XRange | undefined {\n  const direct = depthToXRange.get(depth);\n  if (direct !== undefined) {\n    return direct;\n  }\n\n  if (depthToXRange.size === 0) {\n    return undefined;\n  }\n\n  const minDepth = sortedDepths[0];\n  const maxDepth = sortedDepths[sortedDepths.length - 1];\n\n  if (depth < minDepth || depth > maxDepth) {\n    return undefined;\n  }\n\n  const leftDepth = sortedDepths.filter((d) => d < depth).at(-1);\n  const rightDepth = sortedDepths.find((d) => d > depth);\n\n  if (leftDepth === undefined || rightDepth === undefined) {\n    return undefined;\n  }\n\n  const leftRange = depthToXRange.get(leftDepth);\n  const rightRange = depthToXRange.get(rightDepth);\n\n  if (leftRange === undefined || rightRange === undefined) {\n    return undefined;\n  }\n\n  const t = (depth - leftDepth) / (rightDepth - leftDepth);\n\n  return {\n    x0: leftRange.x0 + (rightRange.x0 - leftRange.x0) * t,\n    x1: leftRange.x1 + (rightRange.x1 - leftRange.x1) * t,\n  };\n}\n"],
+  "mappings": "AAuBO,SAAS,sBACd,OACqB;AACrB,QAAM,MAAM,oBAAI,IAAoB;AAEpC,aAAW,QAAQ,OAAO;AACxB,UAAM,MAAM,KAAK,SAAS,KAAK;AAC/B,QAAI,QAAQ,UAAa,KAAK,OAAO,UAAa,KAAK,OAAO,QAAW;AACvE;AAAA,IACF;AAEA,UAAM,WAAW,IAAI,IAAI,GAAG;AAC5B,QAAI,aAAa,QAAW;AAC1B,UAAI,IAAI,KAAK,EAAE,IAAI,KAAK,IAAI,IAAI,KAAK,GAAG,CAAC;AAAA,IAC3C,OAAO;AACL,UAAI,IAAI,KAAK;AAAA,QACX,IAAI,KAAK,IAAI,SAAS,IAAI,KAAK,EAAE;AAAA,QACjC,IAAI,KAAK,IAAI,SAAS,IAAI,KAAK,EAAE;AAAA,MACnC,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO;AACT;AAWO,SAAS,kBACd,OACA,eACA,eAAsC,CAAC,GAAG,cAAc,KAAK,CAAC,EAAE;AAAA,EAC9D,CAAC,GAAG,MAAM,IAAI;AAChB,GACoB;AACpB,QAAM,SAAS,cAAc,IAAI,KAAK;AACtC,MAAI,WAAW,QAAW;AACxB,WAAO;AAAA,EACT;AAEA,MAAI,cAAc,SAAS,GAAG;AAC5B,WAAO;AAAA,EACT;AAEA,QAAM,WAAW,aAAa,CAAC;AAC/B,QAAM,WAAW,aAAa,aAAa,SAAS,CAAC;AAErD,MAAI,QAAQ,YAAY,QAAQ,UAAU;AACxC,WAAO;AAAA,EACT;AAEA,QAAM,YAAY,aAAa,OAAO,CAAC,MAAM,IAAI,KAAK,EAAE,GAAG,EAAE;AAC7D,QAAM,aAAa,aAAa,KAAK,CAAC,MAAM,IAAI,KAAK;AAErD,MAAI,cAAc,UAAa,eAAe,QAAW;AACvD,WAAO;AAAA,EACT;AAEA,QAAM,YAAY,cAAc,IAAI,SAAS;AAC7C,QAAM,aAAa,cAAc,IAAI,UAAU;AAE/C,MAAI,cAAc,UAAa,eAAe,QAAW;AACvD,WAAO;AAAA,EACT;AAEA,QAAM,KAAK,QAAQ,cAAc,aAAa;AAE9C,SAAO;AAAA,IACL,IAAI,UAAU,MAAM,WAAW,KAAK,UAAU,MAAM;AAAA,IACpD,IAAI,UAAU,MAAM,WAAW,KAAK,UAAU,MAAM;AAAA,EACtD;AACF;",
+  "names": []
+}

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

@@ -1,10 +1,16 @@
 function justify(node, n) {
+  if (typeof node.column === "number") {
+    return node.column;
+  }
   return (node.sourceLinks?.length ?? 0) > 0 ? node.depth ?? 0 : n - 1;
 }
 function left(node) {
   return node.depth ?? 0;
 }
 function right(node, n) {
+  if (typeof node.column === "number") {
+    return node.column;
+  }
   return n - 1 - (node.height ?? 0);
 }
 export {

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

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../../../src/charts/sankey-chart/vendor/d3-sankey/align.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\n// All fields optional so SankeyNode<N,L> (which has optional geometry) is assignable here.\n// sourceLinks/targetLinks are ReadonlyArray<unknown> so SankeyLink<N,L>[] (where target can be\n// string | number | SankeyNode) satisfies the constraint via assignability to unknown.\ninterface NodeForAlign {\n  depth?: number;\n  height?: number;\n  sourceLinks?: ReadonlyArray<unknown>;\n  targetLinks?: ReadonlyArray<unknown>;\n}\n\nexport function justify(node: NodeForAlign, n: number): number {\n  return (node.sourceLinks?.length ?? 0) > 0 ? node.depth ?? 0 : n - 1;\n}\n\nexport function left(node: NodeForAlign): number {\n  return node.depth ?? 0;\n}\n\nexport function right(node: NodeForAlign, n: number): number {\n  return n - 1 - (node.height ?? 0);\n}\n"],
-  "mappings": "AAcO,SAAS,QAAQ,MAAoB,GAAmB;AAC7D,UAAQ,KAAK,aAAa,UAAU,KAAK,IAAI,KAAK,SAAS,IAAI,IAAI;AACrE;AAEO,SAAS,KAAK,MAA4B;AAC/C,SAAO,KAAK,SAAS;AACvB;AAEO,SAAS,MAAM,MAAoB,GAAmB;AAC3D,SAAO,IAAI,KAAK,KAAK,UAAU;AACjC;",
+  "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\n// All fields optional so SankeyNode<N,L> (which has optional geometry) is assignable here.\n// sourceLinks/targetLinks are ReadonlyArray<unknown> so SankeyLink<N,L>[] (where target can be\n// string | number | SankeyNode) satisfies the constraint via assignability to unknown.\ninterface NodeForAlign {\n  depth?: number;\n  height?: number;\n  column?: number;\n  sourceLinks?: ReadonlyArray<unknown>;\n  targetLinks?: ReadonlyArray<unknown>;\n}\n\n// LOCAL ADDITION (not in upstream d3-sankey@0.12.3): a node with a pinned\n// `column` (from `columnAccessor`) keeps that column under every alignment\n// mode. Upstream `justify` only honored `depth` (which already carries the\n// pinned column, see computeNodeDepths) for nodes with outgoing links, and\n// upstream `right` derived the column from `height` unconditionally \u2014 both\n// silently relocated pinned terminal/sink nodes.\nexport function justify(node: NodeForAlign, n: number): number {\n  if (typeof node.column === 'number') {\n    return node.column;\n  }\n  return (node.sourceLinks?.length ?? 0) > 0 ? (node.depth ?? 0) : n - 1;\n}\n\nexport function left(node: NodeForAlign): number {\n  return node.depth ?? 0;\n}\n\nexport function right(node: NodeForAlign, n: number): number {\n  if (typeof node.column === 'number') {\n    return node.column;\n  }\n  return n - 1 - (node.height ?? 0);\n}\n"],
+  "mappings": "AAqBO,SAAS,QAAQ,MAAoB,GAAmB;AAC7D,MAAI,OAAO,KAAK,WAAW,UAAU;AACnC,WAAO,KAAK;AAAA,EACd;AACA,UAAQ,KAAK,aAAa,UAAU,KAAK,IAAK,KAAK,SAAS,IAAK,IAAI;AACvE;AAEO,SAAS,KAAK,MAA4B;AAC/C,SAAO,KAAK,SAAS;AACvB;AAEO,SAAS,MAAM,MAAoB,GAAmB;AAC3D,MAAI,OAAO,KAAK,WAAW,UAAU;AACnC,WAAO,KAAK;AAAA,EACd;AACA,SAAO,IAAI,KAAK,KAAK,UAAU;AACjC;",
   "names": []
 }

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

@@ -101,27 +101,29 @@ function Sankey() {
   }
   function computeNodeDepths({ nodes }) {
     const n = nodes.length;
-    let current = new Set(nodes);
-    let next = /* @__PURE__ */ new Set();
-    let x = 0;
-    let iterations2 = 0;
-    while (current.size) {
-      let maxPinnedDepth = -1;
-      for (const node of current) {
-        node.depth = typeof node["column"] === "number" ? node["column"] : x;
-        if (typeof node["column"] === "number" && node["column"] > maxPinnedDepth) {
-          maxPinnedDepth = node["column"];
+    for (const node of nodes) {
+      node.depth = typeof node["column"] === "number" ? node["column"] : 0;
+    }
+    let changed = true;
+    let totalDepth = 0;
+    while (changed) {
+      changed = false;
+      for (const node of nodes) {
+        if (typeof node["column"] === "number") {
+          continue;
+        }
+        let floor = 0;
+        for (const { source } of node.targetLinks) {
+          floor = Math.max(floor, source.depth + 1);
         }
-        for (const { target } of node.sourceLinks) {
-          next.add(target);
+        if (floor > node.depth) {
+          node.depth = floor;
+          changed = true;
         }
       }
-      if (++iterations2 > n) {
+      if (++totalDepth > n) {
         throw new Error("circular link");
       }
-      x = Math.max(x + 1, maxPinnedDepth + 1);
-      current = next;
-      next = /* @__PURE__ */ new Set();
     }
   }
   function computeNodeHeights({ 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  // 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"]
+  "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  // LOCAL ADDITION (not in upstream d3-sankey@0.12.3): nodes with a pinned\n  // `column` keep that exact depth; every other node's depth is the longest\n  // path from its predecessors (standard longest-path relaxation), computed\n  // independently per node. A shared, globally-incrementing counter was used\n  // here previously, but any pin anywhere in the graph raised that counter\n  // for every node still being revisited that iteration \u2014 including nodes\n  // unrelated to that pin, sometimes pushing them past their own successors.\n  function computeNodeDepths({ nodes }: WorkingGraph): void {\n    const n = nodes.length;\n    for (const node of nodes) {\n      node.depth = typeof node['column'] === 'number' ? node['column'] : 0;\n    }\n\n    let changed = true;\n    let totalDepth = 0;\n    while (changed) {\n      changed = false;\n      for (const node of nodes) {\n        if (typeof node['column'] === 'number') {\n          continue;\n        }\n        let floor = 0;\n        for (const { source } of node.targetLinks) {\n          floor = Math.max(floor, source.depth + 1);\n        }\n        if (floor > node.depth) {\n          node.depth = floor;\n          changed = true;\n        }\n      }\n      if (++totalDepth > n) {\n        throw new Error('circular link');\n      }\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;AASA,WAAS,kBAAkB,EAAE,MAAM,GAAuB;AACxD,UAAM,IAAI,MAAM;AAChB,eAAW,QAAQ,OAAO;AACxB,WAAK,QAAQ,OAAO,KAAK,QAAQ,MAAM,WAAW,KAAK,QAAQ,IAAI;AAAA,IACrE;AAEA,QAAI,UAAU;AACd,QAAI,aAAa;AACjB,WAAO,SAAS;AACd,gBAAU;AACV,iBAAW,QAAQ,OAAO;AACxB,YAAI,OAAO,KAAK,QAAQ,MAAM,UAAU;AACtC;AAAA,QACF;AACA,YAAI,QAAQ;AACZ,mBAAW,EAAE,OAAO,KAAK,KAAK,aAAa;AACzC,kBAAQ,KAAK,IAAI,OAAO,OAAO,QAAQ,CAAC;AAAA,QAC1C;AACA,YAAI,QAAQ,KAAK,OAAO;AACtB,eAAK,QAAQ;AACb,oBAAU;AAAA,QACZ;AAAA,MACF;AACA,UAAI,EAAE,aAAa,GAAG;AACpB,cAAM,IAAI,MAAM,eAAe;AAAA,MACjC;AAAA,IACF;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,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,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": ["dy"]
 }

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

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

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

@@ -1,5 +1,5 @@
 import "./SingleValue.css";
-var container = "_1sfgzlg0-3-13-2";
+var container = "_1sfgzlg0-3-14-0";
 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-13-2';"],
+  "sourcesContent": ["import './SingleValue.css';\nexport var container = '_1sfgzlg0-3-14-0';"],
   "mappings": "AAAA,OAAO;AACA,IAAI,YAAY;",
   "names": []
 }

package/esm/charts/single-value/types/single-value-toolbar.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../../src/charts/single-value/types/single-value-toolbar.ts"],
-  "sourcesContent": ["import { IntentProps } from '../../../core/slots/Intent/Intent.js';\nimport {\n  BaseToolbarProps,\n  InternalChartToolbarConfig,\n} from '../../core/types/toolbar.js';\n\n/** Props for the ChartToolbar implementation in SingleValue\n * @public\n */\nexport interface SingleValueToolbarSlotProps extends BaseToolbarProps {\n  /** Decides if the toolbar is draggable\n   * @deprecated - Will be removed in next breaking version. Toolbar is always draggable.\n   * @defaultValue false\n   */\n  draggable?: boolean;\n}\n\n/** Internal props for the ChartToolbar implementation in SingleValue\n * @internal\n */\nexport interface SingleValueToolbarInternalProps\n  extends InternalChartToolbarConfig {\n  /** Intents to show in the toolbar */\n  intents?: Array<IntentProps>;\n  /** Decides if the toolbar is hidden */\n  hidden: boolean;\n}\n\nexport const defaultToolbarInternalConfig: SingleValueToolbarInternalProps = {\n  hidden: false,\n  intents: [],\n  placement: 'top-right',\n  collapsed: false,\n  draggable: false,\n};\n"],
-  "mappings": "AA4BO,MAAM,+BAAgE;AAAA,EAC3E,QAAQ;AAAA,EACR,SAAS,CAAC;AAAA,EACV,WAAW;AAAA,EACX,WAAW;AAAA,EACX,WAAW;AACb;",
+  "sourcesContent": ["import { IntentProps } from '../../../core/slots/Intent/Intent.js';\nimport {\n  BaseToolbarProps,\n  InternalChartToolbarConfig,\n} from '../../core/types/toolbar.js';\n\n/** Props for the ChartToolbar implementation in SingleValue\n * @public\n */\nexport interface SingleValueToolbarSlotProps extends BaseToolbarProps {\n  /** Decides if the toolbar is draggable\n   * @deprecated - Will be removed in next breaking version. Toolbar is always draggable.\n   * @defaultValue false\n   */\n  draggable?: boolean;\n}\n\n/** Internal props for the ChartToolbar implementation in SingleValue\n * @internal\n */\nexport interface SingleValueToolbarInternalProps extends InternalChartToolbarConfig {\n  /** Intents to show in the toolbar */\n  intents?: Array<IntentProps>;\n  /** Decides if the toolbar is hidden */\n  hidden: boolean;\n}\n\nexport const defaultToolbarInternalConfig: SingleValueToolbarInternalProps = {\n  hidden: false,\n  intents: [],\n  placement: 'top-right',\n  collapsed: false,\n  draggable: false,\n};\n"],
+  "mappings": "AA2BO,MAAM,+BAAgE;AAAA,EAC3E,QAAQ;AAAA,EACR,SAAS,CAAC;AAAA,EACV,WAAW;AAAA,EACX,WAAW;AAAA,EACX,WAAW;AACb;",
   "names": []
 }

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

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