minerva-design 1.3.0 → 1.4.0

package/dist/charts/engine/shapes/sunburst.d.ts

@@ -0,0 +1,6 @@
+import { LayoutContext, LayoutResult } from './scene.js';
+import { SunburstChartOptions } from './types.js';
+/** Valid part of a drill path (names from the root to a focusable parent) */
+export declare const resolveSunburstPath: (o: SunburstChartOptions, path: readonly string[], hidden: ReadonlySet<number>) => string[];
+export declare const sunburstValues: (o: SunburstChartOptions, hidden: ReadonlySet<number>, focusPath: readonly string[], out: Map<string, number>) => void;
+export declare const layoutSunburst: (o: SunburstChartOptions, c: LayoutContext) => LayoutResult;

package/dist/charts/engine/shapes/sunburst.js

@@ -0,0 +1,261 @@
+import { mix as e, toCss as t } from "../color.js";
+import { font as n } from "../overlay.js";
+import { interpolate as r } from "./labels.js";
+import { TAU as i, clamp as a, ellipsize as o, emptyLayout as s, finite as c, positive as l, readableFill as u, relativeLuminance as d, resolveWith as f, sum as p, textOn as m, uniqueKeys as h, upright as g } from "./scene.js";
+//#region src/engine/shapes/sunburst.ts
+var _ = 18, v = (e, t) => {
+	let n = 0, r = (e, i, a) => {
+		let o = h(e.map((e) => e.name));
+		return e.map((e, s) => {
+			let c = i ? a : s, u = {
+				node: e,
+				key: `${i?.key ?? ""}/${o[s]}`,
+				path: [...i?.path ?? [], e.name],
+				top: c,
+				index: n++,
+				depth: (i?.depth ?? 0) + 1,
+				target: 0,
+				parent: i,
+				children: []
+			};
+			return e.children?.length ? (u.children = r(e.children, u, c), u.target = p(u.children.map((e) => e.target))) : u.target = t.has(c) ? 0 : l(e.value), u;
+		});
+	};
+	return r(e ?? [], null, 0);
+}, y = (e, t) => {
+	let n = e, r = null;
+	for (let e of t) {
+		let t = n.find((t) => t.node.name === e && t.children.length && t.target > 0);
+		if (!t) break;
+		r = t, n = t.children;
+	}
+	return r;
+}, b = (e, t, n) => y(v(e.data, n), t)?.path ?? [], x = (e) => e.reduce((e, t) => t.target > 0 ? Math.max(e, t.children.length ? x(t.children) : t.depth) : e, 0), S = (e, t, n) => {
+	let r = p(e.map((e) => e.target)), i = t ? t.depth : 0, a = 0, o = 1;
+	if (t && r > 0) {
+		let n = 0;
+		for (let r = t; r; r = r.parent) {
+			let t = r.parent ? r.parent.children : e;
+			for (let e of t) {
+				if (e === r) break;
+				n += e.target;
+			}
+		}
+		a = n / r, o = a + t.target / r;
+	}
+	let s = Math.max(1, x(t ? t.children : e) - i);
+	return {
+		a0: a,
+		a1: o,
+		depth: i,
+		levels: Math.min(typeof n == "number" && n >= 1 ? Math.floor(n) : s, s)
+	};
+}, C = (e, t, n, r) => {
+	let i = v(e.data, t), a = (e) => e.forEach((e) => {
+		e.children.length ? a(e.children) : r.set(e.key, e.target);
+	});
+	a(i);
+	let o = S(i, y(i, n), e.levels);
+	r.set("@a0", o.a0), r.set("@a1", o.a1), r.set("@d", o.depth), r.set("@levels", o.levels);
+}, w = (l, h) => {
+	let { theme: b, area: x, measure: C, hidden: w } = h, T = v(l.data, w), E = p(T.map((e) => e.target)), D = /* @__PURE__ */ new Map(), O = (e) => {
+		let t = e.children.length ? p(e.children.map(O)) : Math.max(0, h.value(e.key, e.target));
+		return D.set(e, t), t;
+	}, k = p(T.map(O));
+	if (E <= 0 && k <= 1e-9) return s(h);
+	let A = y(T, h.focus), j = S(T, A, l.levels), M = h.value("@a0", j.a0), N = h.value("@a1", j.a1);
+	N - M > 1e-6 || (M = 0, N = 1);
+	let ee = h.value("@d", j.depth), P = x.x + x.width / 2, F = x.y + x.height / 2, I = Math.max(4, Math.min(x.width, x.height) / 2 - 2), L = I * a(c(l.innerRadius, .26), 0, .8), te = Math.max(1, Math.floor((I - L) / _)), ne = Math.max(1, h.value("@levels", j.levels)), R = (I - L) / Math.min(ne, te), re = a(h.enter, 0, 1), z = c(l.startAngle) * Math.PI / 180 - Math.PI / 2, B = (e) => z + a((e - M) / (N - M), 0, 1) * i * re, V = Math.max(0, c(l.padAngle, 1)), ie = Math.max(0, c(l.cornerRadius, 2)), H = l.labels ?? "auto", U = n(b, 11), ae = d(b.background) < .2, W = [], G = [], K = [], q = /* @__PURE__ */ new Map(), J = (e) => [e.index, ...e.children.flatMap(J)], oe = (e) => {
+		let t = [];
+		for (let n = e.parent; n; n = n.parent) t.push(n.index);
+		return t;
+	}, se = (e, t, n, r, i, s, c, l) => {
+		if (H === "none") return;
+		let u = n - t, d = i - r, f = (r + i) / 2, p = (t + n) / 2, h = C(e, U), _ = 0;
+		if (H !== "radial" && d >= 15) {
+			let e = (d - 11) / 2 - 1, t = 2 * f * Math.acos(a(1 - e / f, -1, 1));
+			_ = Math.max(0, Math.min(u * f - 8, t));
+		}
+		let v = 0;
+		H !== "tangential" && u * (r + 4) >= 13 && (v = Math.max(0, d - 10));
+		let y = _ > 0 && (h <= _ || _ >= v || H === "tangential"), b = y ? _ : v;
+		if (b <= 0) return;
+		let x = o(e, b, U, C);
+		!x || x !== e && x.length < 4 || G.push({
+			kind: "text",
+			x: P + f * Math.cos(p),
+			y: F + f * Math.sin(p),
+			text: x,
+			font: U,
+			color: m(s),
+			align: "center",
+			baseline: "middle",
+			rotate: g(y ? p + Math.PI / 2 : p),
+			hit: c.index,
+			also: l
+		});
+	}, Y = (t, n) => {
+		t.forEach((t, r) => {
+			let i = n ? t.node.color ? f(b, t.node.color, n) : e(n, b.background, .14 + r % 3 * .06) : h.color(t.node.color, t.top);
+			q.set(t, i), t.children.length && Y(t.children, i);
+		});
+	};
+	Y(T, null);
+	let X = /* @__PURE__ */ new Map(), Z = (e, t) => {
+		let n = t;
+		for (let t of e) X.set(t, n), t.children.length && Z(t.children, n), n += (D.get(t) ?? 0) / Math.max(1e-12, k);
+	};
+	Z(T, 0);
+	let Q = (n) => {
+		for (let i of n) {
+			let n = D.get(i) ?? 0;
+			if (n <= 1e-9) continue;
+			let a = X.get(i) ?? 0, o = a + n / Math.max(1e-12, k), s = B(a), c = B(o), l = i.depth - ee, d = Math.max(L, L + (l - 1) * R), f = Math.min(I, L + l * R);
+			if (c - s > 1e-4 && f - d > .5) {
+				let n = q.get(i) ?? b.primary, a = u(ae ? e(n, b.background, .12) : n, 3), o = [...oe(i), ...J(i).slice(1)];
+				if (W.push({
+					kind: "sector",
+					cx: P,
+					cy: F,
+					r0: d,
+					r1: f,
+					a0: s,
+					a1: c,
+					pad: V,
+					corner: ie,
+					fill: t(a),
+					hit: i.index,
+					also: o
+				}), se(i.node.name, s, c, d, f, a, i, o), i.target > 0) {
+					let e = E > 0 ? i.target / E : 0, n = i.parent?.target ?? 0, o = (d + f) / 2, l = (s + c) / 2;
+					K.push({
+						index: i.index,
+						name: i.node.name,
+						value: i.target,
+						percent: e,
+						share: h.percent(e),
+						color: t(a),
+						path: i.path,
+						x: P + o * Math.cos(l),
+						y: F + o * Math.sin(l),
+						rows: [
+							{
+								name: h.labels.value,
+								value: h.format(i.target)
+							},
+							{
+								name: h.labels.share,
+								value: h.percent(e)
+							},
+							...i.parent && n > 0 ? [{
+								name: r(h.labels.ofName, { name: i.parent.node.name }),
+								value: h.percent(i.target / n)
+							}] : []
+						],
+						...i.children.length ? { drill: i.path } : {}
+					});
+				}
+			}
+			i.children.length && f < I - .5 && Q(i.children);
+		}
+	};
+	Q(T), W.push(...G);
+	let $ = L - 3;
+	if ($ >= 14) {
+		let r = a($ * .3, 12, 24);
+		if (A) {
+			let r = q.get(A) ?? b.primary, i = t(e(r, b.background, .84)), s = t(r), c = A.children.flatMap(J);
+			W.push({
+				kind: "circle",
+				cx: P,
+				cy: F,
+				r: $,
+				fill: i,
+				stroke: t(r, .5),
+				lineWidth: 1,
+				hit: A.index,
+				also: c
+			});
+			let l = n(b, a($ * .2, 11, 14), 600), u = o(A.node.name, $ * 1.6, l, C), d = h.format(A.target), f = $ >= 30, p = f ? F - 2 : F + 4, m = p - (f ? 18 : 12);
+			$ >= 24 && W.push({
+				kind: "line",
+				points: [
+					P - 5,
+					m + 3,
+					P,
+					m - 2,
+					P + 5,
+					m + 3
+				],
+				color: t(b.textMuted),
+				width: 1.5,
+				hit: A.index,
+				also: c
+			}), u && W.push({
+				kind: "text",
+				x: P,
+				y: p,
+				text: u,
+				font: l,
+				color: t(b.text),
+				align: "center",
+				baseline: "middle",
+				hit: A.index,
+				also: c
+			}), f && W.push({
+				kind: "text",
+				x: P,
+				y: F + 16,
+				text: o(d, $ * 1.6, n(b, 12), C),
+				font: n(b, 12),
+				color: t(b.textMuted),
+				align: "center",
+				baseline: "middle",
+				hit: A.index,
+				also: c
+			});
+			let g = E > 0 ? A.target / E : 0;
+			K.push({
+				index: A.index,
+				name: A.node.name,
+				value: A.target,
+				percent: g,
+				share: h.percent(g),
+				color: s,
+				path: A.path,
+				x: P,
+				y: F,
+				rows: [{
+					name: h.labels.value,
+					value: h.format(A.target)
+				}, {
+					name: h.labels.share,
+					value: h.percent(g)
+				}],
+				drill: A.path.slice(0, -1)
+			});
+		} else if (E > 0) {
+			let e = n(b, r, 600), i = o(h.format(E), $ * 1.7, e, C);
+			i && W.push({
+				kind: "text",
+				x: P,
+				y: F,
+				text: i,
+				font: e,
+				color: t(b.text),
+				align: "center",
+				baseline: "middle"
+			});
+		}
+	}
+	return K.sort((e, t) => e.index - t.index), {
+		nodes: W,
+		items: K,
+		dim: .35,
+		empty: !1
+	};
+};
+//#endregion
+export { w as layoutSunburst, b as resolveSunburstPath, C as sunburstValues };
+
+//# sourceMappingURL=sunburst.js.map

package/dist/charts/engine/shapes/sunburst.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sunburst.js","names":["MIN_RING","build","count","walk","keys","uniqueKeys","nodes","nd","t","parent","top","j","b","node","sum","ch","hidden","positive","data","focusOf","list","tree","found","name","path","next","resolveSunburstPath","o","deepest","d","view","total","depth","focus","a0","a1","f","p","siblings","s","below","levels","sunburstValues","visit","out","v","focusPath","layoutSunburst","c","shown","measureShown","shownTotal","emptyLayout","target","w0","w1","cx","area","cy","R","R0","clamp","finite","fit","ring","enter","start","angle","TAU","pad","corner","mode","labelFont","font","theme","dark","relativeLuminance","labels","items","colorOf","subtree","ancestors","label","span","thick","r1","r0","rm","m","full","measure","tangential","sag","chord","radial","useTangential","room","text","ellipsize","textOn","fill","upright","color","parentColor","resolveWith","mix","fracStart","place","from","sectors","f0","f1","rel","base","readableFill","also","toCss","percent","interpolate","rc","valueSize","css","nameFont","value","showValue","nameY","chevronY","valueFont","a"],"sources":["../../../../../charts/src/engine/shapes/sunburst.ts"],"sourcesContent":["// Sunburst layout: the hierarchy as concentric rings around a center circle.\n// Drilling into a node animates the angular window (the node's share of the\n// root) and the depth: its children open to the full circle while the\n// ancestors slide into the center. Labels follow the arc or the radius,\n// whichever fits.\n\nimport { mix, toCss, type Rgba } from \"../color\";\nimport { font } from \"../overlay\";\nimport { interpolate } from \"./labels\";\nimport {\n  clamp,\n  ellipsize,\n  emptyLayout,\n  finite,\n  positive,\n  readableFill,\n  relativeLuminance,\n  resolveWith,\n  sum,\n  TAU,\n  textOn,\n  uniqueKeys,\n  upright,\n  type LayoutContext,\n  type LayoutResult,\n  type ShapeItem,\n  type ShapeNode,\n} from \"./scene\";\nimport type { SunburstChartOptions, TreemapNode } from \"./types\";\n\n/** Thinnest ring, in pixels (fewer levels are shown below) */\nconst MIN_RING = 18;\n\ninterface SNode {\n  node: TreemapNode;\n  key: string;\n  path: string[];\n  /** Index of the top-level ancestor (legend) */\n  top: number;\n  /** Depth-first index (hover `index`) */\n  index: number;\n  /** 1 for the top-level nodes */\n  depth: number;\n  target: number;\n  parent: SNode | null;\n  children: SNode[];\n}\n\n/** Tree with the target values; hidden top-level nodes count 0 */\nconst build = (\n  data: readonly TreemapNode[],\n  hidden: ReadonlySet<number>,\n): SNode[] => {\n  let count = 0;\n  const walk = (\n    nodes: readonly TreemapNode[],\n    parent: SNode | null,\n    top: number,\n  ): SNode[] => {\n    const keys = uniqueKeys(nodes.map((nd) => nd.name));\n    return nodes.map((node, j) => {\n      const t = parent ? top : j;\n      const b: SNode = {\n        node,\n        key: `${parent?.key ?? \"\"}/${keys[j]}`,\n        path: [...(parent?.path ?? []), node.name],\n        top: t,\n        index: count++,\n        depth: (parent?.depth ?? 0) + 1,\n        target: 0,\n        parent,\n        children: [],\n      };\n      if (node.children?.length) {\n        b.children = walk(node.children, b, t);\n        b.target = sum(b.children.map((ch) => ch.target));\n      } else b.target = hidden.has(t) ? 0 : positive(node.value);\n      return b;\n    });\n  };\n  return walk(data ?? [], null, 0);\n};\n\n/**\n * The deepest node of `path` that can be focused (a parent with a value),\n * `null` for the root\n */\nconst focusOf = (tree: SNode[], path: readonly string[]): SNode | null => {\n  let list = tree;\n  let found: SNode | null = null;\n  for (const name of path) {\n    const next = list.find(\n      (b) => b.node.name === name && b.children.length && b.target > 0,\n    );\n    if (!next) break;\n    found = next;\n    list = next.children;\n  }\n  return found;\n};\n\n/** Valid part of a drill path (names from the root to a focusable parent) */\nexport const resolveSunburstPath = (\n  o: SunburstChartOptions,\n  path: readonly string[],\n  hidden: ReadonlySet<number>,\n): string[] => focusOf(build(o.data, hidden), path)?.path ?? [];\n\nconst deepest = (list: readonly SNode[]): number =>\n  list.reduce(\n    (d, b) =>\n      b.target > 0\n        ? Math.max(d, b.children.length ? deepest(b.children) : b.depth)\n        : d,\n    0,\n  );\n\n/** Angular window of the focused node (shares of the root) and depths */\nconst view = (tree: SNode[], focus: SNode | null, levels?: number) => {\n  const total = sum(tree.map((b) => b.target));\n  const depth = focus ? focus.depth : 0;\n  let a0 = 0;\n  let a1 = 1;\n  if (focus && total > 0) {\n    // start: shares of the previous siblings of every ancestor\n    let f = 0;\n    for (let p: SNode | null = focus; p; p = p.parent) {\n      const siblings: SNode[] = p.parent ? p.parent.children : tree;\n      for (const s of siblings) {\n        if (s === p) break;\n        f += s.target;\n      }\n    }\n    a0 = f / total;\n    a1 = a0 + focus.target / total;\n  }\n  const below = Math.max(1, deepest(focus ? focus.children : tree) - depth);\n  const wanted =\n    typeof levels === \"number\" && levels >= 1 ? Math.floor(levels) : below;\n  return { a0, a1, depth, levels: Math.min(wanted, below) };\n};\n\nexport const sunburstValues = (\n  o: SunburstChartOptions,\n  hidden: ReadonlySet<number>,\n  focusPath: readonly string[],\n  out: Map<string, number>,\n) => {\n  const tree = build(o.data, hidden);\n  const visit = (nodes: SNode[]) =>\n    nodes.forEach((b) => {\n      if (b.children.length) visit(b.children);\n      else out.set(b.key, b.target);\n    });\n  visit(tree);\n  const v = view(tree, focusOf(tree, focusPath), o.levels);\n  out.set(\"@a0\", v.a0);\n  out.set(\"@a1\", v.a1);\n  out.set(\"@d\", v.depth);\n  out.set(\"@levels\", v.levels);\n};\n\nexport const layoutSunburst = (\n  o: SunburstChartOptions,\n  c: LayoutContext,\n): LayoutResult => {\n  const { theme, area, measure, hidden } = c;\n  const tree = build(o.data, hidden);\n  const total = sum(tree.map((b) => b.target));\n  // displayed (animated) values\n  const shown = new Map<SNode, number>();\n  const measureShown = (b: SNode): number => {\n    const v = b.children.length\n      ? sum(b.children.map(measureShown))\n      : Math.max(0, c.value(b.key, b.target));\n    shown.set(b, v);\n    return v;\n  };\n  const shownTotal = sum(tree.map(measureShown));\n  if (total <= 0 && shownTotal <= 1e-9) return emptyLayout(c);\n\n  const focus = focusOf(tree, c.focus);\n  const target = view(tree, focus, o.levels);\n  let w0 = c.value(\"@a0\", target.a0);\n  let w1 = c.value(\"@a1\", target.a1);\n  if (!(w1 - w0 > 1e-6)) {\n    w0 = 0;\n    w1 = 1;\n  }\n  const d = c.value(\"@d\", target.depth);\n  const cx = area.x + area.width / 2;\n  const cy = area.y + area.height / 2;\n  const R = Math.max(4, Math.min(area.width, area.height) / 2 - 2);\n  const R0 = R * clamp(finite(o.innerRadius, 0.26), 0, 0.8);\n  const fit = Math.max(1, Math.floor((R - R0) / MIN_RING));\n  const levels = Math.max(1, c.value(\"@levels\", target.levels));\n  const ring = (R - R0) / Math.min(levels, fit);\n  const enter = clamp(c.enter, 0, 1);\n  const start = (finite(o.startAngle) * Math.PI) / 180 - Math.PI / 2;\n  const angle = (f: number) =>\n    start + clamp((f - w0) / (w1 - w0), 0, 1) * TAU * enter;\n  const pad = Math.max(0, finite(o.padAngle, 1));\n  const corner = Math.max(0, finite(o.cornerRadius, 2));\n  const mode = o.labels ?? \"auto\";\n  const labelFont = font(theme, 11);\n  const dark = relativeLuminance(theme.background) < 0.2;\n\n  const nodes: ShapeNode[] = [];\n  const labels: ShapeNode[] = [];\n  const items: ShapeItem[] = [];\n  const colorOf = new Map<SNode, Rgba>();\n  const subtree = (b: SNode): number[] => [\n    b.index,\n    ...b.children.flatMap(subtree),\n  ];\n  const ancestors = (b: SNode) => {\n    const out: number[] = [];\n    for (let p = b.parent; p; p = p.parent) out.push(p.index);\n    return out;\n  };\n\n  const label = (\n    name: string,\n    a0: number,\n    a1: number,\n    r0: number,\n    r1: number,\n    fill: Rgba,\n    b: SNode,\n    also: number[],\n  ) => {\n    if (mode === \"none\") return;\n    const span = a1 - a0;\n    const thick = r1 - r0;\n    const rm = (r0 + r1) / 2;\n    const m = (a0 + a1) / 2;\n    const size = 11;\n    const full = measure(name, labelFont);\n    // tangential: straight text across the middle of the sector, its sag kept in the ring\n    let tangential = 0;\n    if (mode !== \"radial\" && thick >= size + 4) {\n      const sag = (thick - size) / 2 - 1;\n      const chord = 2 * rm * Math.acos(clamp(1 - sag / rm, -1, 1));\n      tangential = Math.max(0, Math.min(span * rm - 8, chord));\n    }\n    // radial: along the radius, the sector wide enough at its inner end\n    let radial = 0;\n    if (mode !== \"tangential\" && span * (r0 + 4) >= size + 2)\n      radial = Math.max(0, thick - 10);\n    const useTangential =\n      tangential > 0 &&\n      (full <= tangential || tangential >= radial || mode === \"tangential\");\n    const room = useTangential ? tangential : radial;\n    if (room <= 0) return;\n    const text = ellipsize(name, room, labelFont, measure);\n    if (!text || (text !== name && text.length < 4)) return;\n    labels.push({\n      kind: \"text\",\n      x: cx + rm * Math.cos(m),\n      y: cy + rm * Math.sin(m),\n      text,\n      font: labelFont,\n      color: textOn(fill),\n      align: \"center\",\n      baseline: \"middle\",\n      rotate: upright(useTangential ? m + Math.PI / 2 : m),\n      hit: b.index,\n      also,\n    });\n  };\n\n  const visit = (list: SNode[], parentColor: Rgba | null) => {\n    list.forEach((b, j) => {\n      const color = parentColor\n        ? b.node.color\n          ? resolveWith(theme, b.node.color, parentColor)\n          : mix(parentColor, theme.background, 0.14 + (j % 3) * 0.06)\n        : c.color(b.node.color, b.top);\n      colorOf.set(b, color);\n      if (b.children.length) visit(b.children, color);\n    });\n  };\n  visit(tree, null);\n\n  // fractions from the displayed values\n  const fracStart = new Map<SNode, number>();\n  const place = (list: SNode[], from: number) => {\n    let f = from;\n    for (const b of list) {\n      fracStart.set(b, f);\n      if (b.children.length) place(b.children, f);\n      f += (shown.get(b) ?? 0) / Math.max(1e-12, shownTotal);\n    }\n  };\n  place(tree, 0);\n\n  const sectors = (list: SNode[]) => {\n    for (const b of list) {\n      const v = shown.get(b) ?? 0;\n      if (v <= 1e-9) continue;\n      const f0 = fracStart.get(b) ?? 0;\n      const f1 = f0 + v / Math.max(1e-12, shownTotal);\n      const a0 = angle(f0);\n      const a1 = angle(f1);\n      const rel = b.depth - d;\n      const r0 = Math.max(R0, R0 + (rel - 1) * ring);\n      const r1 = Math.min(R, R0 + rel * ring);\n      if (a1 - a0 > 1e-4 && r1 - r0 > 0.5) {\n        const base = colorOf.get(b) ?? theme.primary;\n        const fill = readableFill(\n          dark ? mix(base, theme.background, 0.12) : base,\n          3,\n        );\n        const also = [...ancestors(b), ...subtree(b).slice(1)];\n        nodes.push({\n          kind: \"sector\",\n          cx,\n          cy,\n          r0,\n          r1,\n          a0,\n          a1,\n          pad,\n          corner,\n          fill: toCss(fill),\n          hit: b.index,\n          also,\n        });\n        label(b.node.name, a0, a1, r0, r1, fill, b, also);\n        if (b.target > 0) {\n          const percent = total > 0 ? b.target / total : 0;\n          const parent = b.parent?.target ?? 0;\n          const rm = (r0 + r1) / 2;\n          const m = (a0 + a1) / 2;\n          items.push({\n            index: b.index,\n            name: b.node.name,\n            value: b.target,\n            percent,\n            share: c.percent(percent),\n            color: toCss(fill),\n            path: b.path,\n            x: cx + rm * Math.cos(m),\n            y: cy + rm * Math.sin(m),\n            rows: [\n              { name: c.labels.value, value: c.format(b.target) },\n              { name: c.labels.share, value: c.percent(percent) },\n              ...(b.parent && parent > 0\n                ? [\n                    {\n                      name: interpolate(c.labels.ofName, {\n                        name: b.parent.node.name,\n                      }),\n                      value: c.percent(b.target / parent),\n                    },\n                  ]\n                : []),\n            ],\n            ...(b.children.length ? { drill: b.path } : {}),\n          });\n        }\n      }\n      if (b.children.length && r1 < R - 0.5) sectors(b.children);\n    }\n  };\n  sectors(tree);\n  nodes.push(...labels);\n\n  // center: the focused node (click to go up) or the total\n  const rc = R0 - 3;\n  if (rc >= 14) {\n    const valueSize = clamp(rc * 0.3, 12, 24);\n    if (focus) {\n      const base = colorOf.get(focus) ?? theme.primary;\n      const fill = toCss(mix(base, theme.background, 0.84));\n      const css = toCss(base);\n      const also = focus.children.flatMap(subtree);\n      nodes.push({\n        kind: \"circle\",\n        cx,\n        cy,\n        r: rc,\n        fill,\n        stroke: toCss(base, 0.5),\n        lineWidth: 1,\n        hit: focus.index,\n        also,\n      });\n      const nameFont = font(theme, clamp(rc * 0.2, 11, 14), 600);\n      const name = ellipsize(focus.node.name, rc * 1.6, nameFont, measure);\n      const value = c.format(focus.target);\n      const showValue = rc >= 30;\n      const nameY = showValue ? cy - 2 : cy + 4;\n      // chevron: \"go up\"\n      const chevronY = nameY - (showValue ? 18 : 12);\n      if (rc >= 24)\n        nodes.push({\n          kind: \"line\",\n          points: [\n            cx - 5,\n            chevronY + 3,\n            cx,\n            chevronY - 2,\n            cx + 5,\n            chevronY + 3,\n          ],\n          color: toCss(theme.textMuted),\n          width: 1.5,\n          hit: focus.index,\n          also,\n        });\n      if (name)\n        nodes.push({\n          kind: \"text\",\n          x: cx,\n          y: nameY,\n          text: name,\n          font: nameFont,\n          color: toCss(theme.text),\n          align: \"center\",\n          baseline: \"middle\",\n          hit: focus.index,\n          also,\n        });\n      if (showValue)\n        nodes.push({\n          kind: \"text\",\n          x: cx,\n          y: cy + 16,\n          text: ellipsize(value, rc * 1.6, font(theme, 12), measure),\n          font: font(theme, 12),\n          color: toCss(theme.textMuted),\n          align: \"center\",\n          baseline: \"middle\",\n          hit: focus.index,\n          also,\n        });\n      const percent = total > 0 ? focus.target / total : 0;\n      items.push({\n        index: focus.index,\n        name: focus.node.name,\n        value: focus.target,\n        percent,\n        share: c.percent(percent),\n        color: css,\n        path: focus.path,\n        x: cx,\n        y: cy,\n        rows: [\n          { name: c.labels.value, value: c.format(focus.target) },\n          { name: c.labels.share, value: c.percent(percent) },\n        ],\n        drill: focus.path.slice(0, -1),\n      });\n    } else if (total > 0) {\n      const valueFont = font(theme, valueSize, 600);\n      const text = ellipsize(c.format(total), rc * 1.7, valueFont, measure);\n      if (text)\n        nodes.push({\n          kind: \"text\",\n          x: cx,\n          y: cy,\n          text,\n          font: valueFont,\n          color: toCss(theme.text),\n          align: \"center\",\n          baseline: \"middle\",\n        });\n    }\n  }\n  items.sort((a, b) => a.index - b.index);\n\n  return { nodes, items, dim: 0.35, empty: false };\n};\n"],"mappings":";;;;;AA+BA,IAAMA,IAAW,IAkBXC,KACJ,GACA,MACY;CACZ,IAAIC,IAAQ,GACNC,KACJ,GACA,GACA,MACY;EACZ,IAAMC,IAAOC,EAAWC,EAAM,KAAK,MAAOC,EAAG,IAAI,CAAC;EAClD,OAAOD,EAAM,KAAK,GAAM,MAAM;GAC5B,IAAME,IAAIC,IAASC,IAAMC,GACnBC,IAAW;IACf;IACA,KAAK,GAAGH,GAAQ,OAAO,GAAG,GAAGL,EAAKO;IAClC,MAAM,CAAC,GAAIF,GAAQ,QAAQ,CAAC,GAAII,EAAK,IAAI;IACzC,KAAKL;IACL,OAAO;IACP,QAAQC,GAAQ,SAAS,KAAK;IAC9B,QAAQ;IACR;IACA,UAAU,CAAC;GACb;GAKA,OAJII,EAAK,UAAU,UACjB,EAAE,WAAWV,EAAKU,EAAK,UAAUD,GAAGJ,CAAC,GACrC,EAAE,SAASM,EAAIF,EAAE,SAAS,KAAK,MAAOG,EAAG,MAAM,CAAC,KAC3C,EAAE,SAASC,EAAO,IAAIR,CAAC,IAAI,IAAIS,EAASJ,EAAK,KAAK,GAClDD;EACT,CAAC;CACH;CACA,OAAOT,EAAKe,KAAQ,CAAC,GAAG,MAAM,CAAC;AACjC,GAMMC,KAAW,GAAe,MAA0C;CACxE,IAAIC,IAAOC,GACPC,IAAsB;CAC1B,KAAK,IAAMC,KAAQC,GAAM;EACvB,IAAMC,IAAOL,EAAK,MACf,MAAMR,EAAE,KAAK,SAASW,KAAQX,EAAE,SAAS,UAAUA,EAAE,SAAS,CACjE;EACA,IAAI,CAACa,GAAM;EAEX,AADA,IAAQA,GACR,IAAOA,EAAK;CACd;CACA,OAAOH;AACT,GAGaI,KACX,GACA,GACA,MACaP,EAAQlB,EAAM0B,EAAE,MAAMX,CAAM,GAAGQ,CAAI,CAAC,EAAE,QAAQ,CAAC,GAExDI,KAAW,MACfR,EAAK,QACF,GAAG,MACFR,EAAE,SAAS,IACP,KAAK,IAAIiB,GAAGjB,EAAE,SAAS,SAASgB,EAAQhB,EAAE,QAAQ,IAAIA,EAAE,KAAK,IAC7DiB,GACN,CACF,GAGIC,KAAQ,GAAe,GAAqB,MAAoB;CACpE,IAAMC,IAAQjB,EAAIO,EAAK,KAAK,MAAMT,EAAE,MAAM,CAAC,GACrCoB,IAAQC,IAAQA,EAAM,QAAQ,GAChCC,IAAK,GACLC,IAAK;CACT,IAAIF,KAASF,IAAQ,GAAG;EAEtB,IAAIK,IAAI;EACR,KAAK,IAAIC,IAAkBJ,GAAOI,GAAG,IAAIA,EAAE,QAAQ;GACjD,IAAMC,IAAoBD,EAAE,SAASA,EAAE,OAAO,WAAWhB;GACzD,KAAK,IAAMkB,KAAKD,GAAU;IACxB,IAAIC,MAAMF,GAAG;IACb,KAAKE,EAAE;GACT;EACF;EAEA,AADA,IAAKH,IAAIL,GACT,IAAKG,IAAKD,EAAM,SAASF;CAC3B;CACA,IAAMS,IAAQ,KAAK,IAAI,GAAGZ,EAAQK,IAAQA,EAAM,WAAWZ,CAAI,IAAIW,CAAK;CAGxE,OAAO;EAAE;EAAI;EAAI;EAAO,QAAQ,KAAK,IADnC,OAAOS,KAAW,YAAYA,KAAU,IAAI,KAAK,MAAMA,CAAM,IAAID,GAClBA,CAAK;CAAE;AAC1D,GAEaE,KACX,GACA,GACA,GACA,MACG;CACH,IAAMrB,IAAOpB,EAAM0B,EAAE,MAAMX,CAAM,GAC3B2B,KAAS,MACbrC,EAAM,SAAS,MAAM;EACnB,AAAIM,EAAE,SAAS,SAAQ+B,EAAM/B,EAAE,QAAQ,IAClCgC,EAAI,IAAIhC,EAAE,KAAKA,EAAE,MAAM;CAC9B,CAAC;CACH,EAAMS,CAAI;CACV,IAAMwB,IAAIf,EAAKT,GAAMF,EAAQE,GAAMyB,CAAS,GAAGnB,EAAE,MAAM;CAIvD,AAHAiB,EAAI,IAAI,OAAOC,EAAE,EAAE,GACnBD,EAAI,IAAI,OAAOC,EAAE,EAAE,GACnBD,EAAI,IAAI,MAAMC,EAAE,KAAK,GACrBD,EAAI,IAAI,WAAWC,EAAE,MAAM;AAC7B,GAEaE,KACX,GACA,MACiB;CACjB,IAAM,EAAE,UAAO,SAAM,YAAS,cAAWC,GACnC3B,IAAOpB,EAAM0B,EAAE,MAAMX,CAAM,GAC3Be,IAAQjB,EAAIO,EAAK,KAAK,MAAMT,EAAE,MAAM,CAAC,GAErCqC,oBAAQ,IAAI,IAAmB,GAC/BC,KAAgB,MAAqB;EACzC,IAAML,IAAIjC,EAAE,SAAS,SACjBE,EAAIF,EAAE,SAAS,IAAIsC,CAAY,CAAC,IAChC,KAAK,IAAI,GAAGF,EAAE,MAAMpC,EAAE,KAAKA,EAAE,MAAM,CAAC;EAExC,OADAqC,EAAM,IAAIrC,GAAGiC,CAAC,GACPA;CACT,GACMM,IAAarC,EAAIO,EAAK,IAAI6B,CAAY,CAAC;CAC7C,IAAInB,KAAS,KAAKoB,KAAc,MAAM,OAAOC,EAAYJ,CAAC;CAE1D,IAAMf,IAAQd,EAAQE,GAAM2B,EAAE,KAAK,GAC7BK,IAASvB,EAAKT,GAAMY,GAAON,EAAE,MAAM,GACrC2B,IAAKN,EAAE,MAAM,OAAOK,EAAO,EAAE,GAC7BE,IAAKP,EAAE,MAAM,OAAOK,EAAO,EAAE;CACjC,AAAME,IAAKD,IAAK,SACd,IAAK,GACL,IAAK;CAEP,IAAMzB,KAAImB,EAAE,MAAM,MAAMK,EAAO,KAAK,GAC9BG,IAAKC,EAAK,IAAIA,EAAK,QAAQ,GAC3BC,IAAKD,EAAK,IAAIA,EAAK,SAAS,GAC5BE,IAAI,KAAK,IAAI,GAAG,KAAK,IAAIF,EAAK,OAAOA,EAAK,MAAM,IAAI,IAAI,CAAC,GACzDG,IAAKD,IAAIE,EAAMC,EAAOnC,EAAE,aAAa,GAAI,GAAG,GAAG,EAAG,GAClDoC,KAAM,KAAK,IAAI,GAAG,KAAK,OAAOJ,IAAIC,KAAM5D,CAAQ,CAAC,GACjDyC,KAAS,KAAK,IAAI,GAAGO,EAAE,MAAM,WAAWK,EAAO,MAAM,CAAC,GACtDW,KAAQL,IAAIC,KAAM,KAAK,IAAInB,IAAQsB,EAAG,GACtCE,KAAQJ,EAAMb,EAAE,OAAO,GAAG,CAAC,GAC3BkB,IAASJ,EAAOnC,EAAE,UAAU,IAAI,KAAK,KAAM,MAAM,KAAK,KAAK,GAC3DwC,KAAS,MACbD,IAAQL,GAAOzB,IAAIkB,MAAOC,IAAKD,IAAK,GAAG,CAAC,IAAIc,IAAMH,IAC9CI,IAAM,KAAK,IAAI,GAAGP,EAAOnC,EAAE,UAAU,CAAC,CAAC,GACvC2C,KAAS,KAAK,IAAI,GAAGR,EAAOnC,EAAE,cAAc,CAAC,CAAC,GAC9C4C,IAAO5C,EAAE,UAAU,QACnB6C,IAAYC,EAAKC,GAAO,EAAE,GAC1BC,KAAOC,EAAkBF,EAAM,UAAU,IAAI,IAE7CpE,IAAqB,CAAC,GACtBuE,IAAsB,CAAC,GACvBC,IAAqB,CAAC,GACtBC,oBAAU,IAAI,IAAiB,GAC/BC,KAAW,MAAuB,CACtCpE,EAAE,OACF,GAAGA,EAAE,SAAS,QAAQoE,CAAO,CAC/B,GACMC,MAAa,MAAa;EAC9B,IAAMrC,IAAgB,CAAC;EACvB,KAAK,IAAIP,IAAIzB,EAAE,QAAQyB,GAAG,IAAIA,EAAE,QAAQ,EAAI,KAAKA,EAAE,KAAK;EACxD,OAAOO;CACT,GAEMsC,MACJ,GACA,GACA,GACA,GACA,GACA,GACA,GACA,MACG;EACH,IAAIX,MAAS,QAAQ;EACrB,IAAMY,IAAOhD,IAAKD,GACZkD,IAAQC,IAAKC,GACbC,KAAMD,IAAKD,KAAM,GACjBG,KAAKtD,IAAKC,KAAM,GAEhBsD,IAAOC,EAAQnE,GAAMiD,CAAS,GAEhCmB,IAAa;EACjB,IAAIpB,MAAS,YAAYa,KAAS,IAAU;GAC1C,IAAMQ,KAAOR,IAAQ,MAAQ,IAAI,GAC3BS,IAAQ,IAAIN,IAAK,KAAK,KAAK1B,EAAM,IAAI+B,IAAML,GAAI,IAAI,CAAC,CAAC;GAC3D,IAAa,KAAK,IAAI,GAAG,KAAK,IAAIJ,IAAOI,IAAK,GAAGM,CAAK,CAAC;EACzD;EAEA,IAAIC,IAAS;EACb,AAAIvB,MAAS,gBAAgBY,KAAQG,IAAK,MAAM,OAC9C,IAAS,KAAK,IAAI,GAAGF,IAAQ,EAAE;EACjC,IAAMW,IACJJ,IAAa,MACZF,KAAQE,KAAcA,KAAcG,KAAUvB,MAAS,eACpDyB,IAAOD,IAAgBJ,IAAaG;EAC1C,IAAIE,KAAQ,GAAG;EACf,IAAMC,IAAOC,EAAU3E,GAAMyE,GAAMxB,GAAWkB,CAAO;EACrD,AAAI,CAACO,KAASA,MAAS1E,KAAQ0E,EAAK,SAAS,KAC7CpB,EAAO,KAAK;GACV,MAAM;GACN,GAAGrB,IAAK+B,IAAK,KAAK,IAAIC,CAAC;GACvB,GAAG9B,IAAK6B,IAAK,KAAK,IAAIC,CAAC;GACvB;GACA,MAAMhB;GACN,OAAO2B,EAAOC,CAAI;GAClB,OAAO;GACP,UAAU;GACV,QAAQC,EAAQN,IAAgBP,IAAI,KAAK,KAAK,IAAIA,CAAC;GACnD,KAAK5E,EAAE;GACP;EACF,CAAC;CACH,GAEM+B,KAAS,GAAe,MAA6B;EACzD,EAAK,SAAS,GAAG,MAAM;GACrB,IAAM2D,IAAQC,IACV3F,EAAE,KAAK,QACL4F,EAAY9B,GAAO9D,EAAE,KAAK,OAAO2F,CAAW,IAC5CE,EAAIF,GAAa7B,EAAM,YAAY,MAAQ/D,IAAI,IAAK,GAAI,IAC1DqC,EAAE,MAAMpC,EAAE,KAAK,OAAOA,EAAE,GAAG;GAE/B,AADAmE,EAAQ,IAAInE,GAAG0F,CAAK,GAChB1F,EAAE,SAAS,UAAQ+B,EAAM/B,EAAE,UAAU0F,CAAK;EAChD,CAAC;CACH;CACA,EAAMjF,GAAM,IAAI;CAGhB,IAAMqF,oBAAY,IAAI,IAAmB,GACnCC,KAAS,GAAe,MAAiB;EAC7C,IAAIvE,IAAIwE;EACR,KAAK,IAAMhG,KAAKQ,GAGd,AAFAsF,EAAU,IAAI9F,GAAGwB,CAAC,GACdxB,EAAE,SAAS,UAAQ+F,EAAM/F,EAAE,UAAUwB,CAAC,GAC1C,MAAMa,EAAM,IAAIrC,CAAC,KAAK,KAAK,KAAK,IAAI,OAAOuC,CAAU;CAEzD;CACA,EAAM9B,GAAM,CAAC;CAEb,IAAMwF,KAAW,MAAkB;EACjC,KAAK,IAAMjG,KAAKQ,GAAM;GACpB,IAAMyB,IAAII,EAAM,IAAIrC,CAAC,KAAK;GAC1B,IAAIiC,KAAK,MAAM;GACf,IAAMiE,IAAKJ,EAAU,IAAI9F,CAAC,KAAK,GACzBmG,IAAKD,IAAKjE,IAAI,KAAK,IAAI,OAAOM,CAAU,GACxCjB,IAAKiC,EAAM2C,CAAE,GACb3E,IAAKgC,EAAM4C,CAAE,GACbC,IAAMpG,EAAE,QAAQiB,IAChByD,IAAK,KAAK,IAAI1B,GAAIA,KAAMoD,IAAM,KAAKhD,CAAI,GACvCqB,IAAK,KAAK,IAAI1B,GAAGC,IAAKoD,IAAMhD,CAAI;GACtC,IAAI7B,IAAKD,IAAK,QAAQmD,IAAKC,IAAK,IAAK;IACnC,IAAM2B,IAAOlC,EAAQ,IAAInE,CAAC,KAAK8D,EAAM,SAC/B0B,IAAOc,EACXvC,KAAO8B,EAAIQ,GAAMvC,EAAM,YAAY,GAAI,IAAIuC,GAC3C,CACF,GACME,IAAO,CAAC,GAAGlC,GAAUrE,CAAC,GAAG,GAAGoE,EAAQpE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IAgBrD,IAfAN,EAAM,KAAK;KACT,MAAM;KACN;KACA;KACA;KACA;KACA;KACA;KACA;KACA;KACA,MAAM8G,EAAMhB,CAAI;KAChB,KAAKxF,EAAE;KACP;IACF,CAAC,GACDsE,GAAMtE,EAAE,KAAK,MAAMsB,GAAIC,GAAImD,GAAID,GAAIe,GAAMxF,GAAGuG,CAAI,GAC5CvG,EAAE,SAAS,GAAG;KAChB,IAAMyG,IAAUtF,IAAQ,IAAInB,EAAE,SAASmB,IAAQ,GACzCtB,IAASG,EAAE,QAAQ,UAAU,GAC7B2E,KAAMD,IAAKD,KAAM,GACjBG,KAAKtD,IAAKC,KAAM;KACtB,EAAM,KAAK;MACT,OAAOvB,EAAE;MACT,MAAMA,EAAE,KAAK;MACb,OAAOA,EAAE;MACT;MACA,OAAOoC,EAAE,QAAQqE,CAAO;MACxB,OAAOD,EAAMhB,CAAI;MACjB,MAAMxF,EAAE;MACR,GAAG4C,IAAK+B,IAAK,KAAK,IAAIC,CAAC;MACvB,GAAG9B,IAAK6B,IAAK,KAAK,IAAIC,CAAC;MACvB,MAAM;OACJ;QAAE,MAAMxC,EAAE,OAAO;QAAO,OAAOA,EAAE,OAAOpC,EAAE,MAAM;OAAE;OAClD;QAAE,MAAMoC,EAAE,OAAO;QAAO,OAAOA,EAAE,QAAQqE,CAAO;OAAE;OAClD,GAAIzG,EAAE,UAAUH,IAAS,IACrB,CACE;QACE,MAAM6G,EAAYtE,EAAE,OAAO,QAAQ,EACjC,MAAMpC,EAAE,OAAO,KAAK,KACtB,CAAC;QACD,OAAOoC,EAAE,QAAQpC,EAAE,SAASH,CAAM;OACpC,CACF,IACA,CAAC;MACP;MACA,GAAIG,EAAE,SAAS,SAAS,EAAE,OAAOA,EAAE,KAAK,IAAI,CAAC;KAC/C,CAAC;IACH;GACF;GACA,AAAIA,EAAE,SAAS,UAAUyE,IAAK1B,IAAI,MAAKkD,EAAQjG,EAAE,QAAQ;EAC3D;CACF;CAEA,AADAiG,EAAQxF,CAAI,GACZf,EAAM,KAAK,GAAGuE,CAAM;CAGpB,IAAM0C,IAAK3D,IAAK;CAChB,IAAI2D,KAAM,IAAI;EACZ,IAAMC,IAAY3D,EAAM0D,IAAK,IAAK,IAAI,EAAE;EACxC,IAAItF,GAAO;GACT,IAAMgF,IAAOlC,EAAQ,IAAI9C,CAAK,KAAKyC,EAAM,SACnC0B,IAAOgB,EAAMX,EAAIQ,GAAMvC,EAAM,YAAY,GAAI,CAAC,GAC9C+C,IAAML,EAAMH,CAAI,GAChBE,IAAOlF,EAAM,SAAS,QAAQ+C,CAAO;GAC3C,EAAM,KAAK;IACT,MAAM;IACN;IACA;IACA,GAAGuC;IACH;IACA,QAAQH,EAAMH,GAAM,EAAG;IACvB,WAAW;IACX,KAAKhF,EAAM;IACX;GACF,CAAC;GACD,IAAMyF,IAAWjD,EAAKC,GAAOb,EAAM0D,IAAK,IAAK,IAAI,EAAE,GAAG,GAAG,GACnDhG,IAAO2E,EAAUjE,EAAM,KAAK,MAAMsF,IAAK,KAAKG,GAAUhC,CAAO,GAC7DiC,IAAQ3E,EAAE,OAAOf,EAAM,MAAM,GAC7B2F,IAAYL,KAAM,IAClBM,IAAQD,IAAYlE,IAAK,IAAIA,IAAK,GAElCoE,IAAWD,KAASD,IAAY,KAAK;GA8B3C,AA7BIL,KAAM,MACRjH,EAAM,KAAK;IACT,MAAM;IACN,QAAQ;KACNkD,IAAK;KACLsE,IAAW;KACXtE;KACAsE,IAAW;KACXtE,IAAK;KACLsE,IAAW;IACb;IACA,OAAOV,EAAM1C,EAAM,SAAS;IAC5B,OAAO;IACP,KAAKzC,EAAM;IACX;GACF,CAAC,GACCV,KACFjB,EAAM,KAAK;IACT,MAAM;IACN,GAAGkD;IACH,GAAGqE;IACH,MAAMtG;IACN,MAAMmG;IACN,OAAON,EAAM1C,EAAM,IAAI;IACvB,OAAO;IACP,UAAU;IACV,KAAKzC,EAAM;IACX;GACF,CAAC,GACC2F,KACFtH,EAAM,KAAK;IACT,MAAM;IACN,GAAGkD;IACH,GAAGE,IAAK;IACR,MAAMwC,EAAUyB,GAAOJ,IAAK,KAAK9C,EAAKC,GAAO,EAAE,GAAGgB,CAAO;IACzD,MAAMjB,EAAKC,GAAO,EAAE;IACpB,OAAO0C,EAAM1C,EAAM,SAAS;IAC5B,OAAO;IACP,UAAU;IACV,KAAKzC,EAAM;IACX;GACF,CAAC;GACH,IAAMoF,IAAUtF,IAAQ,IAAIE,EAAM,SAASF,IAAQ;GACnD,EAAM,KAAK;IACT,OAAOE,EAAM;IACb,MAAMA,EAAM,KAAK;IACjB,OAAOA,EAAM;IACb;IACA,OAAOe,EAAE,QAAQqE,CAAO;IACxB,OAAOI;IACP,MAAMxF,EAAM;IACZ,GAAGuB;IACH,GAAGE;IACH,MAAM,CACJ;KAAE,MAAMV,EAAE,OAAO;KAAO,OAAOA,EAAE,OAAOf,EAAM,MAAM;IAAE,GACtD;KAAE,MAAMe,EAAE,OAAO;KAAO,OAAOA,EAAE,QAAQqE,CAAO;IAAE,CACpD;IACA,OAAOpF,EAAM,KAAK,MAAM,GAAG,EAAE;GAC/B,CAAC;EACH,OAAO,IAAIF,IAAQ,GAAG;GACpB,IAAMgG,IAAYtD,EAAKC,GAAO8C,GAAW,GAAG,GACtCvB,IAAOC,EAAUlD,EAAE,OAAOjB,CAAK,GAAGwF,IAAK,KAAKQ,GAAWrC,CAAO;GACpE,AAAIO,KACF3F,EAAM,KAAK;IACT,MAAM;IACN,GAAGkD;IACH,GAAGE;IACH;IACA,MAAMqE;IACN,OAAOX,EAAM1C,EAAM,IAAI;IACvB,OAAO;IACP,UAAU;GACZ,CAAC;EACL;CACF;CAGA,OAFAI,EAAM,MAAM,GAAG,MAAMkD,EAAE,QAAQpH,EAAE,KAAK,GAE/B;EAAE;EAAO;EAAO,KAAK;EAAM,OAAO;CAAM;AACjD"}

package/dist/charts/engine/shapes/treemap.cjs

@@ -1,2 +1,2 @@
-const e=require("../color.cjs"),t=require("../overlay.cjs"),n=require("./scene.cjs");var r=20,i=(e,t)=>{let r=e.map(()=>({x:t.x,y:t.y,width:0,height:0})),i=n.sum(e.map(e=>Math.max(0,e)));if(i<=0||t.width<=0||t.height<=0)return r;let a=t.width*t.height/i,o=e.map(e=>Math.max(0,e)*a),{x:s,y:c,width:l,height:u}=t,d=(e,t,n,r)=>{let i=e*e,a=r*r;return Math.max(a*n/i,i/(a*t))},f=(e,t)=>{if(l>=u){let n=u>0?Math.min(l,t/u):0,i=c;for(let t of e){let e=n>0?o[t]/n:0;r[t]={x:s,y:i,width:n,height:e},i+=e}s+=n,l=Math.max(0,l-n)}else{let n=l>0?Math.min(u,t/l):0,i=s;for(let t of e){let e=n>0?o[t]/n:0;r[t]={x:i,y:c,width:e,height:n},i+=e}c+=n,u=Math.max(0,u-n)}},p=[],m=0,h=1/0,g=0;return o.forEach((e,t)=>{if(!(e<=0)){if(p.length){let t=Math.min(l,u);d(m+e,Math.min(h,e),Math.max(g,e),t)>d(m,h,g,t)&&(f(p,m),p=[],m=0,h=1/0,g=0)}p.push(t),m+=e,h=Math.min(h,e),g=Math.max(g,e)}}),p.length&&f(p,m),r},a=(e,t)=>{let r=0,i=(e,a,o,s)=>{let c=n.uniqueKeys(e.map(e=>e.name));return e.map((e,l)=>{let u=o.length?s:l,d=`${a}/${c[l]}`,f=[...o,e.name];if(e.children?.length){let t=i(e.children,d,f,u);return{node:e,key:d,path:f,top:u,leaf:-1,target:n.sum(t.map(e=>e.target)),children:t}}return{node:e,key:d,path:f,top:u,leaf:r++,target:t.has(u)?0:n.positive(e.value),children:[]}})};return i(e.data,``,[],0)},o=(e,t,n)=>{let r=e=>e.forEach(e=>{e.children.length?r(e.children):n.set(e.key,e.target)});r(a(e,t))},s=(e,t)=>({x:e.x+t,y:e.y+t,width:Math.max(0,e.width-2*t),height:Math.max(0,e.height-2*t)}),c=(o,c)=>{let{theme:l,area:u,measure:d,hidden:f}=c,p=a(o,f),m=n.sum(p.map(e=>e.target)),h=new Map,g=e=>{let t=e.children.length?n.sum(e.children.map(g)):Math.max(0,c.value(e.key,e.target));return h.set(e,t),t},_=n.sum(p.map(g));if(m<=0&&_<=1e-9)return n.emptyLayout(c);let v=Math.max(0,n.finite(o.gap,2)),y=o.headers!==!1,b=t.font(l,12,500),x=t.font(l,11),S=t.font(l,11,600),C=[],w=[],T=n.relativeLuminance(l.background)<.2,E=(t,a,o)=>{let u=t.filter(e=>(h.get(e)??0)>1e-9).sort((e,t)=>(h.get(t)??0)-(h.get(e)??0)),f=i(u.map(e=>h.get(e)??0),a),p=Math.min(.14,.5/Math.max(1,u.length-1));u.forEach((t,i)=>{let a=s(f[i],v/2);if(a.width<1||a.height<1)return;let u=o?t.node.color?n.resolveWith(l,t.node.color,o):e.mix(o,l.background,i*p):c.color(t.node.color,t.top);if(t.children.length){let i=a;if(y&&a.height>34&&a.width>36){C.push({kind:`rect`,x:a.x,y:a.y,width:a.width,height:a.height,radius:4,fill:e.toCss(u,.14)});let o=n.ellipsize(t.node.name,a.width-12,S,d);o&&C.push({kind:`text`,x:a.x+6,y:a.y+r/2+1,text:o,font:S,color:e.toCss(l.text,.85),align:`left`,baseline:`middle`}),i={x:a.x+2,y:a.y+r,width:a.width-4,height:a.height-r-2}}E(t.children,i,u);return}let h=n.readableFill(T?e.mix(u,l.background,.18):u),g=e.toCss(h);if(C.push({kind:`rect`,x:a.x,y:a.y,width:a.width,height:a.height,radius:Math.min(4,a.width/2,a.height/2),fill:g,hit:t.leaf,brighten:!0}),a.width>=36&&a.height>=22){let e=n.textOn(h),r=n.ellipsize(t.node.name,a.width-12,b,d);r&&C.push({kind:`text`,x:a.x+6,y:a.y+6,text:r,font:b,color:e,align:`left`,baseline:`top`,hit:t.leaf});let i=c.format(t.target);r&&a.height>=38&&d(i,x)<=a.width-12&&C.push({kind:`text`,x:a.x+6,y:a.y+22,text:i,font:x,color:e,align:`left`,baseline:`top`,hit:t.leaf})}if(t.target>0){let e=m>0?t.target/m:0;w.push({index:t.leaf,name:t.node.name,value:t.target,percent:e,share:c.percent(e),color:g,path:t.path,x:a.x+a.width/2,y:a.y+a.height/2,rows:[{name:`Value`,value:c.format(t.target)},{name:`Share`,value:c.percent(e)}]})}})};E(p,u,null),w.sort((e,t)=>e.index-t.index);let D=n.clamp(c.enter,0,1);return{nodes:C,items:w,dim:.55,empty:!1,...D<1?{enter:{alpha:D,scale:.94+.06*D,cx:u.x+u.width/2,cy:u.y+u.height/2}}:{}}};exports.layoutTreemap=c,exports.squarify=i,exports.treemapValues=o;
+const e=require("../color.cjs"),t=require("../overlay.cjs"),n=require("./scene.cjs");var r=20,i=(e,t)=>{let r=e.map(()=>({x:t.x,y:t.y,width:0,height:0})),i=n.sum(e.map(e=>Math.max(0,e)));if(i<=0||t.width<=0||t.height<=0)return r;let a=t.width*t.height/i,o=e.map(e=>Math.max(0,e)*a),{x:s,y:c,width:l,height:u}=t,d=(e,t,n,r)=>{let i=e*e,a=r*r;return Math.max(a*n/i,i/(a*t))},f=(e,t)=>{if(l>=u){let n=u>0?Math.min(l,t/u):0,i=c;for(let t of e){let e=n>0?o[t]/n:0;r[t]={x:s,y:i,width:n,height:e},i+=e}s+=n,l=Math.max(0,l-n)}else{let n=l>0?Math.min(u,t/l):0,i=s;for(let t of e){let e=n>0?o[t]/n:0;r[t]={x:i,y:c,width:e,height:n},i+=e}c+=n,u=Math.max(0,u-n)}},p=[],m=0,h=1/0,g=0;return o.forEach((e,t)=>{if(!(e<=0)){if(p.length){let t=Math.min(l,u);d(m+e,Math.min(h,e),Math.max(g,e),t)>d(m,h,g,t)&&(f(p,m),p=[],m=0,h=1/0,g=0)}p.push(t),m+=e,h=Math.min(h,e),g=Math.max(g,e)}}),p.length&&f(p,m),r},a=(e,t)=>{let r=0,i=(e,a,o,s)=>{let c=n.uniqueKeys(e.map(e=>e.name));return e.map((e,l)=>{let u=o.length?s:l,d=`${a}/${c[l]}`,f=[...o,e.name];if(e.children?.length){let t=i(e.children,d,f,u);return{node:e,key:d,path:f,top:u,leaf:-1,target:n.sum(t.map(e=>e.target)),children:t}}return{node:e,key:d,path:f,top:u,leaf:r++,target:t.has(u)?0:n.positive(e.value),children:[]}})};return i(e.data,``,[],0)},o=(e,t,n)=>{let r=e=>e.forEach(e=>{e.children.length?r(e.children):n.set(e.key,e.target)});r(a(e,t))},s=(e,t)=>({x:e.x+t,y:e.y+t,width:Math.max(0,e.width-2*t),height:Math.max(0,e.height-2*t)}),c=(o,c)=>{let{theme:l,area:u,measure:d,hidden:f}=c,p=a(o,f),m=n.sum(p.map(e=>e.target)),h=new Map,g=e=>{let t=e.children.length?n.sum(e.children.map(g)):Math.max(0,c.value(e.key,e.target));return h.set(e,t),t},_=n.sum(p.map(g));if(m<=0&&_<=1e-9)return n.emptyLayout(c);let v=Math.max(0,n.finite(o.gap,2)),y=o.headers!==!1,b=t.font(l,12,500),x=t.font(l,11),S=t.font(l,11,600),C=[],w=[],T=n.relativeLuminance(l.background)<.2,E=(t,a,o)=>{let u=t.filter(e=>(h.get(e)??0)>1e-9).sort((e,t)=>(h.get(t)??0)-(h.get(e)??0)),f=i(u.map(e=>h.get(e)??0),a),p=Math.min(.14,.5/Math.max(1,u.length-1));u.forEach((t,i)=>{let a=s(f[i],v/2);if(a.width<1||a.height<1)return;let u=o?t.node.color?n.resolveWith(l,t.node.color,o):e.mix(o,l.background,i*p):c.color(t.node.color,t.top);if(t.children.length){let i=a;if(y&&a.height>34&&a.width>36){C.push({kind:`rect`,x:a.x,y:a.y,width:a.width,height:a.height,radius:4,fill:e.toCss(u,.14)});let o=n.ellipsize(t.node.name,a.width-12,S,d);o&&C.push({kind:`text`,x:a.x+6,y:a.y+r/2+1,text:o,font:S,color:e.toCss(l.text,.85),align:`left`,baseline:`middle`}),i={x:a.x+2,y:a.y+r,width:a.width-4,height:a.height-r-2}}E(t.children,i,u);return}let h=n.readableFill(T?e.mix(u,l.background,.18):u),g=e.toCss(h);if(C.push({kind:`rect`,x:a.x,y:a.y,width:a.width,height:a.height,radius:Math.min(4,a.width/2,a.height/2),fill:g,hit:t.leaf,brighten:!0}),a.width>=36&&a.height>=22){let e=n.textOn(h),r=n.ellipsize(t.node.name,a.width-12,b,d);r&&C.push({kind:`text`,x:a.x+6,y:a.y+6,text:r,font:b,color:e,align:`left`,baseline:`top`,hit:t.leaf});let i=c.format(t.target);r&&a.height>=38&&d(i,x)<=a.width-12&&C.push({kind:`text`,x:a.x+6,y:a.y+22,text:i,font:x,color:e,align:`left`,baseline:`top`,hit:t.leaf})}if(t.target>0){let e=m>0?t.target/m:0;w.push({index:t.leaf,name:t.node.name,value:t.target,percent:e,share:c.percent(e),color:g,path:t.path,x:a.x+a.width/2,y:a.y+a.height/2,rows:[{name:c.labels.value,value:c.format(t.target)},{name:c.labels.share,value:c.percent(e)}]})}})};E(p,u,null),w.sort((e,t)=>e.index-t.index);let D=n.clamp(c.enter,0,1);return{nodes:C,items:w,dim:.55,empty:!1,...D<1?{enter:{alpha:D,scale:.94+.06*D,cx:u.x+u.width/2,cy:u.y+u.height/2}}:{}}};exports.layoutTreemap=c,exports.squarify=i,exports.treemapValues=o;
 //# sourceMappingURL=treemap.cjs.map

package/dist/charts/engine/shapes/treemap.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"treemap.cjs","names":["sum","uniqueKeys","positive","emptyLayout","finite","font","relativeLuminance","resolveWith","mix","toCss","ellipsize","readableFill","textOn","clamp","require_color","require_overlay","require_scene","HEADER","squarify","out","values","rect","total","v","scale","areas","w","h","worst","s2","s","side2","side","max","min","place","cw","yy","y","i","row","hh","rh","xx","x","ww","rowSum","rowMin","rowMax","a","build","leafCount","walk","keys","nodes","nd","t","parentPath","top","j","key","parentKey","path","node","children","ch","hidden","o","treemapValues","visit","b","shrink","r","d","layoutTreemap","tree","rootTotal","shown","measureShown","shownTotal","gap","headers","nameFont","theme","valueFont","headerFont","items","dark","level","sorted","list","rects","step","cell","color","parentColor","content","title","measure","fill","css","ink","name","value","percent","area","enter"],"sources":["../../../../../charts/src/engine/shapes/treemap.ts"],"sourcesContent":["// Treemap layout: squarified rectangles, parent headers, a palette color per\n// top-level node and lighter shades for its children.\n\nimport { mix, toCss, type Rgba } from \"../color\";\nimport { font } from \"../overlay\";\nimport {\n  clamp,\n  ellipsize,\n  emptyLayout,\n  finite,\n  positive,\n  readableFill,\n  relativeLuminance,\n  resolveWith,\n  sum,\n  textOn,\n  uniqueKeys,\n  type LayoutContext,\n  type LayoutResult,\n  type ShapeItem,\n  type ShapeNode,\n  type ShapeRect,\n} from \"./scene\";\nimport type { TreemapChartOptions, TreemapNode } from \"./types\";\n\nconst HEADER = 20;\n\n/**\n * Squarified treemap (Bruls et al.): rectangles of areas proportional to\n * `values` (best sorted descending) filling `rect`, with aspect ratios close to 1.\n */\nexport const squarify = (\n  values: readonly number[],\n  rect: ShapeRect,\n): ShapeRect[] => {\n  const out: ShapeRect[] = values.map(() => ({\n    x: rect.x,\n    y: rect.y,\n    width: 0,\n    height: 0,\n  }));\n  const total = sum(values.map((v) => Math.max(0, v)));\n  if (total <= 0 || rect.width <= 0 || rect.height <= 0) return out;\n  const scale = (rect.width * rect.height) / total;\n  const areas = values.map((v) => Math.max(0, v) * scale);\n  let { x, y, width: w, height: h } = rect;\n\n  const worst = (s: number, min: number, max: number, side: number) => {\n    const s2 = s * s;\n    const side2 = side * side;\n    return Math.max((side2 * max) / s2, s2 / (side2 * min));\n  };\n  const place = (row: number[], s: number) => {\n    if (w >= h) {\n      const cw = h > 0 ? Math.min(w, s / h) : 0;\n      let yy = y;\n      for (const i of row) {\n        const hh = cw > 0 ? areas[i] / cw : 0;\n        out[i] = { x, y: yy, width: cw, height: hh };\n        yy += hh;\n      }\n      x += cw;\n      w = Math.max(0, w - cw);\n    } else {\n      const rh = w > 0 ? Math.min(h, s / w) : 0;\n      let xx = x;\n      for (const i of row) {\n        const ww = rh > 0 ? areas[i] / rh : 0;\n        out[i] = { x: xx, y, width: ww, height: rh };\n        xx += ww;\n      }\n      y += rh;\n      h = Math.max(0, h - rh);\n    }\n  };\n\n  let row: number[] = [];\n  let rowSum = 0;\n  let rowMin = Infinity;\n  let rowMax = 0;\n  areas.forEach((a, i) => {\n    if (a <= 0) return;\n    if (row.length) {\n      const side = Math.min(w, h);\n      const next = worst(\n        rowSum + a,\n        Math.min(rowMin, a),\n        Math.max(rowMax, a),\n        side,\n      );\n      if (next > worst(rowSum, rowMin, rowMax, side)) {\n        place(row, rowSum);\n        row = [];\n        rowSum = 0;\n        rowMin = Infinity;\n        rowMax = 0;\n      }\n    }\n    row.push(i);\n    rowSum += a;\n    rowMin = Math.min(rowMin, a);\n    rowMax = Math.max(rowMax, a);\n  });\n  if (row.length) place(row, rowSum);\n  return out;\n};\n\ninterface Built {\n  node: TreemapNode;\n  key: string;\n  path: string[];\n  top: number;\n  /** Index in the flattened leaves (leaves only) */\n  leaf: number;\n  target: number;\n  children: Built[];\n}\n\n/** Tree with the target values; hidden top-level nodes count 0 */\nconst build = (\n  o: TreemapChartOptions,\n  hidden: ReadonlySet<number>,\n): Built[] => {\n  let leafCount = 0;\n  const walk = (\n    nodes: readonly TreemapNode[],\n    parentKey: string,\n    parentPath: string[],\n    top: number,\n  ): Built[] => {\n    const keys = uniqueKeys(nodes.map((nd) => nd.name));\n    return nodes.map((node, j) => {\n      const t = parentPath.length ? top : j;\n      const key = `${parentKey}/${keys[j]}`;\n      const path = [...parentPath, node.name];\n      if (node.children?.length) {\n        const children = walk(node.children, key, path, t);\n        return {\n          node,\n          key,\n          path,\n          top: t,\n          leaf: -1,\n          target: sum(children.map((ch) => ch.target)),\n          children,\n        };\n      }\n      return {\n        node,\n        key,\n        path,\n        top: t,\n        leaf: leafCount++,\n        target: hidden.has(t) ? 0 : positive(node.value),\n        children: [],\n      };\n    });\n  };\n  return walk(o.data, \"\", [], 0);\n};\n\nexport const treemapValues = (\n  o: TreemapChartOptions,\n  hidden: ReadonlySet<number>,\n  out: Map<string, number>,\n) => {\n  const visit = (nodes: Built[]) =>\n    nodes.forEach((b) => {\n      if (b.children.length) visit(b.children);\n      else out.set(b.key, b.target);\n    });\n  visit(build(o, hidden));\n};\n\n/** Leaves in the flattened order (the hover / click `index`) */\nexport const treemapLeaves = (data: readonly TreemapNode[]) => {\n  const leaves: { node: TreemapNode; path: string[] }[] = [];\n  const visit = (nodes: readonly TreemapNode[], path: string[]) =>\n    nodes.forEach((node) => {\n      const p = [...path, node.name];\n      if (node.children?.length) visit(node.children, p);\n      else leaves.push({ node, path: p });\n    });\n  visit(data, []);\n  return leaves;\n};\n\nconst shrink = (r: ShapeRect, d: number): ShapeRect => ({\n  x: r.x + d,\n  y: r.y + d,\n  width: Math.max(0, r.width - 2 * d),\n  height: Math.max(0, r.height - 2 * d),\n});\n\nexport const layoutTreemap = (\n  o: TreemapChartOptions,\n  c: LayoutContext,\n): LayoutResult => {\n  const { theme, area, measure, hidden } = c;\n  const tree = build(o, hidden);\n  const rootTotal = sum(tree.map((b) => b.target));\n  // displayed (animated) values\n  const shown = new Map<Built, number>();\n  const measureShown = (b: Built): number => {\n    const v = b.children.length\n      ? sum(b.children.map(measureShown))\n      : Math.max(0, c.value(b.key, b.target));\n    shown.set(b, v);\n    return v;\n  };\n  const shownTotal = sum(tree.map(measureShown));\n  if (rootTotal <= 0 && shownTotal <= 1e-9) return emptyLayout(c);\n\n  const gap = Math.max(0, finite(o.gap, 2));\n  const headers = o.headers !== false;\n  const nameFont = font(theme, 12, 500);\n  const valueFont = font(theme, 11);\n  const headerFont = font(theme, 11, 600);\n  const nodes: ShapeNode[] = [];\n  const items: ShapeItem[] = [];\n  // dark themes: fills slightly toward the background so that labels read well\n  const dark = relativeLuminance(theme.background) < 0.2;\n\n  const level = (list: Built[], rect: ShapeRect, parentColor: Rgba | null) => {\n    const sorted = list\n      .filter((b) => (shown.get(b) ?? 0) > 1e-9)\n      .sort((a, b) => (shown.get(b) ?? 0) - (shown.get(a) ?? 0));\n    const rects = squarify(\n      sorted.map((b) => shown.get(b) ?? 0),\n      rect,\n    );\n    const step = Math.min(0.14, 0.5 / Math.max(1, sorted.length - 1));\n    sorted.forEach((b, j) => {\n      const cell = shrink(rects[j], gap / 2);\n      if (cell.width < 1 || cell.height < 1) return;\n      const color = parentColor\n        ? b.node.color\n          ? resolveWith(theme, b.node.color, parentColor)\n          : mix(parentColor, theme.background, j * step)\n        : c.color(b.node.color, b.top);\n      if (b.children.length) {\n        let content = cell;\n        if (headers && cell.height > HEADER + 14 && cell.width > 36) {\n          nodes.push({\n            kind: \"rect\",\n            x: cell.x,\n            y: cell.y,\n            width: cell.width,\n            height: cell.height,\n            radius: 4,\n            fill: toCss(color, 0.14),\n          });\n          const title = ellipsize(\n            b.node.name,\n            cell.width - 12,\n            headerFont,\n            measure,\n          );\n          if (title)\n            nodes.push({\n              kind: \"text\",\n              x: cell.x + 6,\n              y: cell.y + HEADER / 2 + 1,\n              text: title,\n              font: headerFont,\n              color: toCss(theme.text, 0.85),\n              align: \"left\",\n              baseline: \"middle\",\n            });\n          content = {\n            x: cell.x + 2,\n            y: cell.y + HEADER,\n            width: cell.width - 4,\n            height: cell.height - HEADER - 2,\n          };\n        }\n        level(b.children, content, color);\n        return;\n      }\n      const fill = readableFill(\n        dark ? mix(color, theme.background, 0.18) : color,\n      );\n      const css = toCss(fill);\n      nodes.push({\n        kind: \"rect\",\n        x: cell.x,\n        y: cell.y,\n        width: cell.width,\n        height: cell.height,\n        radius: Math.min(4, cell.width / 2, cell.height / 2),\n        fill: css,\n        hit: b.leaf,\n        brighten: true,\n      });\n      if (cell.width >= 36 && cell.height >= 22) {\n        const ink = textOn(fill);\n        const name = ellipsize(b.node.name, cell.width - 12, nameFont, measure);\n        if (name)\n          nodes.push({\n            kind: \"text\",\n            x: cell.x + 6,\n            y: cell.y + 6,\n            text: name,\n            font: nameFont,\n            color: ink,\n            align: \"left\",\n            baseline: \"top\",\n            hit: b.leaf,\n          });\n        const value = c.format(b.target);\n        if (\n          name &&\n          cell.height >= 38 &&\n          measure(value, valueFont) <= cell.width - 12\n        )\n          nodes.push({\n            kind: \"text\",\n            x: cell.x + 6,\n            y: cell.y + 22,\n            text: value,\n            font: valueFont,\n            color: ink,\n            align: \"left\",\n            baseline: \"top\",\n            hit: b.leaf,\n          });\n      }\n      if (b.target > 0) {\n        const percent = rootTotal > 0 ? b.target / rootTotal : 0;\n        items.push({\n          index: b.leaf,\n          name: b.node.name,\n          value: b.target,\n          percent,\n          share: c.percent(percent),\n          color: css,\n          path: b.path,\n          x: cell.x + cell.width / 2,\n          y: cell.y + cell.height / 2,\n          rows: [\n            { name: \"Value\", value: c.format(b.target) },\n            { name: \"Share\", value: c.percent(percent) },\n          ],\n        });\n      }\n    });\n  };\n  level(tree, area, null);\n  items.sort((a, b) => a.index - b.index);\n\n  const enter = clamp(c.enter, 0, 1);\n  return {\n    nodes,\n    items,\n    dim: 0.55,\n    empty: false,\n    ...(enter < 1\n      ? {\n          enter: {\n            alpha: enter,\n            scale: 0.94 + 0.06 * enter,\n            cx: area.x + area.width / 2,\n            cy: area.y + area.height / 2,\n          },\n        }\n      : {}),\n  };\n};\n"],"mappings":"qFAyBA,IAAMiB,EAAS,GAMFC,GACX,EACA,IACgB,CAChB,IAAMC,EAAmBC,EAAO,SAAW,CACzC,EAAGC,EAAK,EACR,EAAGA,EAAK,EACR,MAAO,EACP,OAAQ,CACV,EAAE,EACIC,EAAQtB,EAAAA,IAAIoB,EAAO,IAAK,GAAM,KAAK,IAAI,EAAGG,CAAC,CAAC,CAAC,EACnD,GAAID,GAAS,GAAKD,EAAK,OAAS,GAAKA,EAAK,QAAU,EAAG,OAAOF,EAC9D,IAAMK,EAASH,EAAK,MAAQA,EAAK,OAAUC,EACrCG,EAAQL,EAAO,IAAK,GAAM,KAAK,IAAI,EAAGG,CAAC,EAAIC,CAAK,EAClD,CAAE,IAAG,IAAG,MAAOE,EAAG,OAAQC,GAAMN,EAE9BO,GAAS,EAAW,EAAa,EAAa,IAAiB,CACnE,IAAMC,EAAKC,EAAIA,EACTC,EAAQC,EAAOA,EACrB,OAAO,KAAK,IAAKD,EAAQE,EAAOJ,EAAIA,GAAME,EAAQG,EAAI,CACxD,EACMC,GAAS,EAAe,IAAc,CAC1C,GAAIT,GAAKC,EAAG,CACV,IAAMS,EAAKT,EAAI,EAAI,KAAK,IAAID,EAAGI,EAAIH,CAAC,EAAI,EACpCU,EAAKC,EACT,IAAK,IAAMC,KAAKC,EAAK,CACnB,IAAMC,EAAKL,EAAK,EAAIX,EAAMc,GAAKH,EAAK,EACpC,EAAIG,GAAK,CAAE,IAAG,EAAGF,EAAI,MAAOD,EAAI,OAAQK,CAAG,EAC3C,GAAMA,CACR,CACA,GAAKL,EACL,EAAI,KAAK,IAAI,EAAGV,EAAIU,CAAE,CACxB,KAAO,CACL,IAAMM,EAAKhB,EAAI,EAAI,KAAK,IAAIC,EAAGG,EAAIJ,CAAC,EAAI,EACpCiB,EAAKC,EACT,IAAK,IAAML,KAAKC,EAAK,CACnB,IAAMK,EAAKH,EAAK,EAAIjB,EAAMc,GAAKG,EAAK,EACpC,EAAIH,GAAK,CAAE,EAAGI,EAAI,IAAG,MAAOE,EAAI,OAAQH,CAAG,EAC3C,GAAMG,CACR,CACA,GAAKH,EACL,EAAI,KAAK,IAAI,EAAGf,EAAIe,CAAE,CACxB,CACF,EAEIF,EAAgB,CAAC,EACjBM,EAAS,EACTC,EAAS,IACTC,EAAS,EAyBb,OAxBAvB,EAAM,SAAS,EAAG,IAAM,CACtB,GAAI,KAAK,GACT,IAAIe,EAAI,OAAQ,CACd,IAAMR,EAAO,KAAK,IAAIN,EAAGC,CAAC,EACbC,EACXkB,EAASG,EACT,KAAK,IAAIF,EAAQE,CAAC,EAClB,KAAK,IAAID,EAAQC,CAAC,EAClBjB,CAEE,EAAOJ,EAAMkB,EAAQC,EAAQC,EAAQhB,CAAI,IAC3CG,EAAMK,EAAKM,CAAM,EACjB,EAAM,CAAC,EACP,EAAS,EACT,EAAS,IACT,EAAS,EAEb,CACAN,EAAI,KAAKD,CAAC,EACV,GAAUU,EACV,EAAS,KAAK,IAAIF,EAAQE,CAAC,EAC3B,EAAS,KAAK,IAAID,EAAQC,CAAC,CAJ3B,CAKF,CAAC,EACGT,EAAI,QAAQL,EAAMK,EAAKM,CAAM,EAC1B3B,CACT,EAcM+B,GACJ,EACA,IACY,CACZ,IAAIC,EAAY,EACVC,GACJ,EACA,EACA,EACA,IACY,CACZ,IAAMC,EAAOpD,EAAAA,WAAWqD,EAAM,IAAK,GAAOC,EAAG,IAAI,CAAC,EAClD,OAAOD,EAAM,KAAK,EAAM,IAAM,CAC5B,IAAME,EAAIC,EAAW,OAASC,EAAMC,EAC9BC,EAAM,GAAGC,EAAU,GAAGR,EAAKM,KAC3BG,EAAO,CAAC,GAAGL,EAAYM,EAAK,IAAI,EACtC,GAAIA,EAAK,UAAU,OAAQ,CACzB,IAAMC,EAAWZ,EAAKW,EAAK,SAAUH,EAAKE,EAAMN,CAAC,EACjD,MAAO,CACL,OACA,MACA,OACA,IAAKA,EACL,KAAM,GACN,OAAQxD,EAAAA,IAAIgE,EAAS,IAAK,GAAOC,EAAG,MAAM,CAAC,EAC3C,UACF,CACF,CACA,MAAO,CACL,OACA,MACA,OACA,IAAKT,EACL,KAAM,IACN,OAAQU,EAAO,IAAIV,CAAC,EAAI,EAAItD,EAAAA,SAAS6D,EAAK,KAAK,EAC/C,SAAU,CAAC,CACb,CACF,CAAC,CACH,EACA,OAAOX,EAAKe,EAAE,KAAM,GAAI,CAAC,EAAG,CAAC,CAC/B,EAEaC,GACX,EACA,EACA,IACG,CACH,IAAMC,EAAS,GACbf,EAAM,QAAS,GAAM,CACfgB,EAAE,SAAS,OAAQD,EAAMC,EAAE,QAAQ,EAClCnD,EAAI,IAAImD,EAAE,IAAKA,EAAE,MAAM,CAC9B,CAAC,EACHD,EAAMnB,EAAMiB,EAAGD,CAAM,CAAC,CACxB,EAeMK,GAAU,EAAc,KAA0B,CACtD,EAAGC,EAAE,EAAIC,EACT,EAAGD,EAAE,EAAIC,EACT,MAAO,KAAK,IAAI,EAAGD,EAAE,MAAQ,EAAIC,CAAC,EAClC,OAAQ,KAAK,IAAI,EAAGD,EAAE,OAAS,EAAIC,CAAC,CACtC,GAEaC,GACX,EACA,IACiB,CACjB,GAAM,CAAE,QAAO,OAAM,UAAS,UAAW,EACnCC,EAAOzB,EAAM,EAAGgB,CAAM,EACtBU,EAAY5E,EAAAA,IAAI2E,EAAK,IAAK,GAAML,EAAE,MAAM,CAAC,EAEzCO,EAAQ,IAAI,IACZC,EAAgB,GAAqB,CACzC,IAAMvD,EAAI+C,EAAE,SAAS,OACjBtE,EAAAA,IAAIsE,EAAE,SAAS,IAAIQ,CAAY,CAAC,EAChC,KAAK,IAAI,EAAG,EAAE,MAAMR,EAAE,IAAKA,EAAE,MAAM,CAAC,EAExC,OADAO,EAAM,IAAIP,EAAG/C,CAAC,EACPA,CACT,EACMwD,EAAa/E,EAAAA,IAAI2E,EAAK,IAAIG,CAAY,CAAC,EAC7C,GAAIF,GAAa,GAAKG,GAAc,KAAM,OAAO5E,EAAAA,YAAY,CAAC,EAE9D,IAAM6E,EAAM,KAAK,IAAI,EAAG5E,EAAAA,OAAO,EAAE,IAAK,CAAC,CAAC,EAClC6E,EAAU,EAAE,UAAY,GACxBC,EAAW7E,EAAAA,KAAK8E,EAAO,GAAI,GAAG,EAC9BC,EAAY/E,EAAAA,KAAK8E,EAAO,EAAE,EAC1BE,EAAahF,EAAAA,KAAK8E,EAAO,GAAI,GAAG,EAChC7B,EAAqB,CAAC,EACtBgC,EAAqB,CAAC,EAEtBC,EAAOjF,EAAAA,kBAAkB6E,EAAM,UAAU,EAAI,GAE7CK,GAAS,EAAe,EAAiB,IAA6B,CAC1E,IAAMC,EAASC,EACZ,OAAQ,IAAOb,EAAM,IAAIP,CAAC,GAAK,GAAK,IAAI,CAAC,CACzC,MAAM,EAAG,KAAOO,EAAM,IAAIP,CAAC,GAAK,IAAMO,EAAM,IAAI5B,CAAC,GAAK,EAAE,EACrD0C,EAAQzE,EACZuE,EAAO,IAAK,GAAMZ,EAAM,IAAIP,CAAC,GAAK,CAAC,EACnCjD,CACF,EACMuE,EAAO,KAAK,IAAI,IAAM,GAAM,KAAK,IAAI,EAAGH,EAAO,OAAS,CAAC,CAAC,EAChEA,EAAO,SAAS,EAAG,IAAM,CACvB,IAAMI,EAAOtB,EAAOoB,EAAMhC,GAAIqB,EAAM,CAAC,EACrC,GAAIa,EAAK,MAAQ,GAAKA,EAAK,OAAS,EAAG,OACvC,IAAMC,EAAQC,EACVzB,EAAE,KAAK,MACL/D,EAAAA,YAAY4E,EAAOb,EAAE,KAAK,MAAOyB,CAAW,EAC5CvF,EAAAA,IAAIuF,EAAaZ,EAAM,WAAYxB,EAAIiC,CAAI,EAC7C,EAAE,MAAMtB,EAAE,KAAK,MAAOA,EAAE,GAAG,EAC/B,GAAIA,EAAE,SAAS,OAAQ,CACrB,IAAI0B,EAAUH,EACd,GAAIZ,GAAWY,EAAK,OAAS,IAAeA,EAAK,MAAQ,GAAI,CAC3DvC,EAAM,KAAK,CACT,KAAM,OACN,EAAGuC,EAAK,EACR,EAAGA,EAAK,EACR,MAAOA,EAAK,MACZ,OAAQA,EAAK,OACb,OAAQ,EACR,KAAMpF,EAAAA,MAAMqF,EAAO,GAAI,CACzB,CAAC,EACD,IAAMG,EAAQvF,EAAAA,UACZ4D,EAAE,KAAK,KACPuB,EAAK,MAAQ,GACbR,EACAa,CACF,EACID,GACF3C,EAAM,KAAK,CACT,KAAM,OACN,EAAGuC,EAAK,EAAI,EACZ,EAAGA,EAAK,EAAI5E,EAAS,EAAI,EACzB,KAAMgF,EACN,KAAMZ,EACN,MAAO5E,EAAAA,MAAM0E,EAAM,KAAM,GAAI,EAC7B,MAAO,OACP,SAAU,QACZ,CAAC,EACH,EAAU,CACR,EAAGU,EAAK,EAAI,EACZ,EAAGA,EAAK,EAAI5E,EACZ,MAAO4E,EAAK,MAAQ,EACpB,OAAQA,EAAK,OAAS5E,EAAS,CACjC,CACF,CACAuE,EAAMlB,EAAE,SAAU0B,EAASF,CAAK,EAChC,MACF,CACA,IAAMK,EAAOxF,EAAAA,aACX4E,EAAO/E,EAAAA,IAAIsF,EAAOX,EAAM,WAAY,GAAI,EAAIW,CAC9C,EACMM,EAAM3F,EAAAA,MAAM0F,CAAI,EAYtB,GAXA7C,EAAM,KAAK,CACT,KAAM,OACN,EAAGuC,EAAK,EACR,EAAGA,EAAK,EACR,MAAOA,EAAK,MACZ,OAAQA,EAAK,OACb,OAAQ,KAAK,IAAI,EAAGA,EAAK,MAAQ,EAAGA,EAAK,OAAS,CAAC,EACnD,KAAMO,EACN,IAAK9B,EAAE,KACP,SAAU,EACZ,CAAC,EACGuB,EAAK,OAAS,IAAMA,EAAK,QAAU,GAAI,CACzC,IAAMQ,EAAMzF,EAAAA,OAAOuF,CAAI,EACjBG,EAAO5F,EAAAA,UAAU4D,EAAE,KAAK,KAAMuB,EAAK,MAAQ,GAAIX,EAAUgB,CAAO,EAClEI,GACFhD,EAAM,KAAK,CACT,KAAM,OACN,EAAGuC,EAAK,EAAI,EACZ,EAAGA,EAAK,EAAI,EACZ,KAAMS,EACN,KAAMpB,EACN,MAAOmB,EACP,MAAO,OACP,SAAU,MACV,IAAK/B,EAAE,IACT,CAAC,EACH,IAAMiC,EAAQ,EAAE,OAAOjC,EAAE,MAAM,EAE7BgC,GACAT,EAAK,QAAU,IACfK,EAAQK,EAAOnB,CAAS,GAAKS,EAAK,MAAQ,IAE1CvC,EAAM,KAAK,CACT,KAAM,OACN,EAAGuC,EAAK,EAAI,EACZ,EAAGA,EAAK,EAAI,GACZ,KAAMU,EACN,KAAMnB,EACN,MAAOiB,EACP,MAAO,OACP,SAAU,MACV,IAAK/B,EAAE,IACT,CAAC,CACL,CACA,GAAIA,EAAE,OAAS,EAAG,CAChB,IAAMkC,EAAU5B,EAAY,EAAIN,EAAE,OAASM,EAAY,EACvDU,EAAM,KAAK,CACT,MAAOhB,EAAE,KACT,KAAMA,EAAE,KAAK,KACb,MAAOA,EAAE,OACT,UACA,MAAO,EAAE,QAAQkC,CAAO,EACxB,MAAOJ,EACP,KAAM9B,EAAE,KACR,EAAGuB,EAAK,EAAIA,EAAK,MAAQ,EACzB,EAAGA,EAAK,EAAIA,EAAK,OAAS,EAC1B,KAAM,CACJ,CAAE,KAAM,QAAS,MAAO,EAAE,OAAOvB,EAAE,MAAM,CAAE,EAC3C,CAAE,KAAM,QAAS,MAAO,EAAE,QAAQkC,CAAO,CAAE,CAC7C,CACF,CAAC,CACH,CACF,CAAC,CACH,EACAhB,EAAMb,EAAM8B,EAAM,IAAI,EACtBnB,EAAM,MAAM,EAAG,IAAMrC,EAAE,MAAQqB,EAAE,KAAK,EAEtC,IAAMoC,EAAQ7F,EAAAA,MAAM,EAAE,MAAO,EAAG,CAAC,EACjC,MAAO,CACL,QACA,QACA,IAAK,IACL,MAAO,GACP,GAAI6F,EAAQ,EACR,CACE,MAAO,CACL,MAAOA,EACP,MAAO,IAAO,IAAOA,EACrB,GAAID,EAAK,EAAIA,EAAK,MAAQ,EAC1B,GAAIA,EAAK,EAAIA,EAAK,OAAS,CAC7B,CACF,EACA,CAAC,CACP,CACF"}
+{"version":3,"file":"treemap.cjs","names":["sum","uniqueKeys","positive","emptyLayout","finite","font","relativeLuminance","resolveWith","mix","toCss","ellipsize","readableFill","textOn","clamp","require_color","require_overlay","require_scene","HEADER","squarify","out","values","rect","total","v","scale","areas","w","h","worst","s2","s","side2","side","max","min","place","cw","yy","y","i","row","hh","rh","xx","x","ww","rowSum","rowMin","rowMax","a","build","leafCount","walk","keys","nodes","nd","t","parentPath","top","j","key","parentKey","path","node","children","ch","hidden","o","treemapValues","visit","b","shrink","r","d","layoutTreemap","tree","rootTotal","shown","measureShown","shownTotal","gap","headers","nameFont","theme","valueFont","headerFont","items","dark","level","sorted","list","rects","step","cell","color","parentColor","content","title","measure","fill","css","ink","name","value","percent","area","enter"],"sources":["../../../../../charts/src/engine/shapes/treemap.ts"],"sourcesContent":["// Treemap layout: squarified rectangles, parent headers, a palette color per\n// top-level node and lighter shades for its children.\n\nimport { mix, toCss, type Rgba } from \"../color\";\nimport { font } from \"../overlay\";\nimport {\n  clamp,\n  ellipsize,\n  emptyLayout,\n  finite,\n  positive,\n  readableFill,\n  relativeLuminance,\n  resolveWith,\n  sum,\n  textOn,\n  uniqueKeys,\n  type LayoutContext,\n  type LayoutResult,\n  type ShapeItem,\n  type ShapeNode,\n  type ShapeRect,\n} from \"./scene\";\nimport type { TreemapChartOptions, TreemapNode } from \"./types\";\n\nconst HEADER = 20;\n\n/**\n * Squarified treemap (Bruls et al.): rectangles of areas proportional to\n * `values` (best sorted descending) filling `rect`, with aspect ratios close to 1.\n */\nexport const squarify = (\n  values: readonly number[],\n  rect: ShapeRect,\n): ShapeRect[] => {\n  const out: ShapeRect[] = values.map(() => ({\n    x: rect.x,\n    y: rect.y,\n    width: 0,\n    height: 0,\n  }));\n  const total = sum(values.map((v) => Math.max(0, v)));\n  if (total <= 0 || rect.width <= 0 || rect.height <= 0) return out;\n  const scale = (rect.width * rect.height) / total;\n  const areas = values.map((v) => Math.max(0, v) * scale);\n  let { x, y, width: w, height: h } = rect;\n\n  const worst = (s: number, min: number, max: number, side: number) => {\n    const s2 = s * s;\n    const side2 = side * side;\n    return Math.max((side2 * max) / s2, s2 / (side2 * min));\n  };\n  const place = (row: number[], s: number) => {\n    if (w >= h) {\n      const cw = h > 0 ? Math.min(w, s / h) : 0;\n      let yy = y;\n      for (const i of row) {\n        const hh = cw > 0 ? areas[i] / cw : 0;\n        out[i] = { x, y: yy, width: cw, height: hh };\n        yy += hh;\n      }\n      x += cw;\n      w = Math.max(0, w - cw);\n    } else {\n      const rh = w > 0 ? Math.min(h, s / w) : 0;\n      let xx = x;\n      for (const i of row) {\n        const ww = rh > 0 ? areas[i] / rh : 0;\n        out[i] = { x: xx, y, width: ww, height: rh };\n        xx += ww;\n      }\n      y += rh;\n      h = Math.max(0, h - rh);\n    }\n  };\n\n  let row: number[] = [];\n  let rowSum = 0;\n  let rowMin = Infinity;\n  let rowMax = 0;\n  areas.forEach((a, i) => {\n    if (a <= 0) return;\n    if (row.length) {\n      const side = Math.min(w, h);\n      const next = worst(\n        rowSum + a,\n        Math.min(rowMin, a),\n        Math.max(rowMax, a),\n        side,\n      );\n      if (next > worst(rowSum, rowMin, rowMax, side)) {\n        place(row, rowSum);\n        row = [];\n        rowSum = 0;\n        rowMin = Infinity;\n        rowMax = 0;\n      }\n    }\n    row.push(i);\n    rowSum += a;\n    rowMin = Math.min(rowMin, a);\n    rowMax = Math.max(rowMax, a);\n  });\n  if (row.length) place(row, rowSum);\n  return out;\n};\n\ninterface Built {\n  node: TreemapNode;\n  key: string;\n  path: string[];\n  top: number;\n  /** Index in the flattened leaves (leaves only) */\n  leaf: number;\n  target: number;\n  children: Built[];\n}\n\n/** Tree with the target values; hidden top-level nodes count 0 */\nconst build = (\n  o: TreemapChartOptions,\n  hidden: ReadonlySet<number>,\n): Built[] => {\n  let leafCount = 0;\n  const walk = (\n    nodes: readonly TreemapNode[],\n    parentKey: string,\n    parentPath: string[],\n    top: number,\n  ): Built[] => {\n    const keys = uniqueKeys(nodes.map((nd) => nd.name));\n    return nodes.map((node, j) => {\n      const t = parentPath.length ? top : j;\n      const key = `${parentKey}/${keys[j]}`;\n      const path = [...parentPath, node.name];\n      if (node.children?.length) {\n        const children = walk(node.children, key, path, t);\n        return {\n          node,\n          key,\n          path,\n          top: t,\n          leaf: -1,\n          target: sum(children.map((ch) => ch.target)),\n          children,\n        };\n      }\n      return {\n        node,\n        key,\n        path,\n        top: t,\n        leaf: leafCount++,\n        target: hidden.has(t) ? 0 : positive(node.value),\n        children: [],\n      };\n    });\n  };\n  return walk(o.data, \"\", [], 0);\n};\n\nexport const treemapValues = (\n  o: TreemapChartOptions,\n  hidden: ReadonlySet<number>,\n  out: Map<string, number>,\n) => {\n  const visit = (nodes: Built[]) =>\n    nodes.forEach((b) => {\n      if (b.children.length) visit(b.children);\n      else out.set(b.key, b.target);\n    });\n  visit(build(o, hidden));\n};\n\n/** Leaves in the flattened order (the hover / click `index`) */\nexport const treemapLeaves = (data: readonly TreemapNode[]) => {\n  const leaves: { node: TreemapNode; path: string[] }[] = [];\n  const visit = (nodes: readonly TreemapNode[], path: string[]) =>\n    nodes.forEach((node) => {\n      const p = [...path, node.name];\n      if (node.children?.length) visit(node.children, p);\n      else leaves.push({ node, path: p });\n    });\n  visit(data, []);\n  return leaves;\n};\n\nconst shrink = (r: ShapeRect, d: number): ShapeRect => ({\n  x: r.x + d,\n  y: r.y + d,\n  width: Math.max(0, r.width - 2 * d),\n  height: Math.max(0, r.height - 2 * d),\n});\n\nexport const layoutTreemap = (\n  o: TreemapChartOptions,\n  c: LayoutContext,\n): LayoutResult => {\n  const { theme, area, measure, hidden } = c;\n  const tree = build(o, hidden);\n  const rootTotal = sum(tree.map((b) => b.target));\n  // displayed (animated) values\n  const shown = new Map<Built, number>();\n  const measureShown = (b: Built): number => {\n    const v = b.children.length\n      ? sum(b.children.map(measureShown))\n      : Math.max(0, c.value(b.key, b.target));\n    shown.set(b, v);\n    return v;\n  };\n  const shownTotal = sum(tree.map(measureShown));\n  if (rootTotal <= 0 && shownTotal <= 1e-9) return emptyLayout(c);\n\n  const gap = Math.max(0, finite(o.gap, 2));\n  const headers = o.headers !== false;\n  const nameFont = font(theme, 12, 500);\n  const valueFont = font(theme, 11);\n  const headerFont = font(theme, 11, 600);\n  const nodes: ShapeNode[] = [];\n  const items: ShapeItem[] = [];\n  // dark themes: fills slightly toward the background so that labels read well\n  const dark = relativeLuminance(theme.background) < 0.2;\n\n  const level = (list: Built[], rect: ShapeRect, parentColor: Rgba | null) => {\n    const sorted = list\n      .filter((b) => (shown.get(b) ?? 0) > 1e-9)\n      .sort((a, b) => (shown.get(b) ?? 0) - (shown.get(a) ?? 0));\n    const rects = squarify(\n      sorted.map((b) => shown.get(b) ?? 0),\n      rect,\n    );\n    const step = Math.min(0.14, 0.5 / Math.max(1, sorted.length - 1));\n    sorted.forEach((b, j) => {\n      const cell = shrink(rects[j], gap / 2);\n      if (cell.width < 1 || cell.height < 1) return;\n      const color = parentColor\n        ? b.node.color\n          ? resolveWith(theme, b.node.color, parentColor)\n          : mix(parentColor, theme.background, j * step)\n        : c.color(b.node.color, b.top);\n      if (b.children.length) {\n        let content = cell;\n        if (headers && cell.height > HEADER + 14 && cell.width > 36) {\n          nodes.push({\n            kind: \"rect\",\n            x: cell.x,\n            y: cell.y,\n            width: cell.width,\n            height: cell.height,\n            radius: 4,\n            fill: toCss(color, 0.14),\n          });\n          const title = ellipsize(\n            b.node.name,\n            cell.width - 12,\n            headerFont,\n            measure,\n          );\n          if (title)\n            nodes.push({\n              kind: \"text\",\n              x: cell.x + 6,\n              y: cell.y + HEADER / 2 + 1,\n              text: title,\n              font: headerFont,\n              color: toCss(theme.text, 0.85),\n              align: \"left\",\n              baseline: \"middle\",\n            });\n          content = {\n            x: cell.x + 2,\n            y: cell.y + HEADER,\n            width: cell.width - 4,\n            height: cell.height - HEADER - 2,\n          };\n        }\n        level(b.children, content, color);\n        return;\n      }\n      const fill = readableFill(\n        dark ? mix(color, theme.background, 0.18) : color,\n      );\n      const css = toCss(fill);\n      nodes.push({\n        kind: \"rect\",\n        x: cell.x,\n        y: cell.y,\n        width: cell.width,\n        height: cell.height,\n        radius: Math.min(4, cell.width / 2, cell.height / 2),\n        fill: css,\n        hit: b.leaf,\n        brighten: true,\n      });\n      if (cell.width >= 36 && cell.height >= 22) {\n        const ink = textOn(fill);\n        const name = ellipsize(b.node.name, cell.width - 12, nameFont, measure);\n        if (name)\n          nodes.push({\n            kind: \"text\",\n            x: cell.x + 6,\n            y: cell.y + 6,\n            text: name,\n            font: nameFont,\n            color: ink,\n            align: \"left\",\n            baseline: \"top\",\n            hit: b.leaf,\n          });\n        const value = c.format(b.target);\n        if (\n          name &&\n          cell.height >= 38 &&\n          measure(value, valueFont) <= cell.width - 12\n        )\n          nodes.push({\n            kind: \"text\",\n            x: cell.x + 6,\n            y: cell.y + 22,\n            text: value,\n            font: valueFont,\n            color: ink,\n            align: \"left\",\n            baseline: \"top\",\n            hit: b.leaf,\n          });\n      }\n      if (b.target > 0) {\n        const percent = rootTotal > 0 ? b.target / rootTotal : 0;\n        items.push({\n          index: b.leaf,\n          name: b.node.name,\n          value: b.target,\n          percent,\n          share: c.percent(percent),\n          color: css,\n          path: b.path,\n          x: cell.x + cell.width / 2,\n          y: cell.y + cell.height / 2,\n          rows: [\n            { name: c.labels.value, value: c.format(b.target) },\n            { name: c.labels.share, value: c.percent(percent) },\n          ],\n        });\n      }\n    });\n  };\n  level(tree, area, null);\n  items.sort((a, b) => a.index - b.index);\n\n  const enter = clamp(c.enter, 0, 1);\n  return {\n    nodes,\n    items,\n    dim: 0.55,\n    empty: false,\n    ...(enter < 1\n      ? {\n          enter: {\n            alpha: enter,\n            scale: 0.94 + 0.06 * enter,\n            cx: area.x + area.width / 2,\n            cy: area.y + area.height / 2,\n          },\n        }\n      : {}),\n  };\n};\n"],"mappings":"qFAyBA,IAAMiB,EAAS,GAMFC,GACX,EACA,IACgB,CAChB,IAAMC,EAAmBC,EAAO,SAAW,CACzC,EAAGC,EAAK,EACR,EAAGA,EAAK,EACR,MAAO,EACP,OAAQ,CACV,EAAE,EACIC,EAAQtB,EAAAA,IAAIoB,EAAO,IAAK,GAAM,KAAK,IAAI,EAAGG,CAAC,CAAC,CAAC,EACnD,GAAID,GAAS,GAAKD,EAAK,OAAS,GAAKA,EAAK,QAAU,EAAG,OAAOF,EAC9D,IAAMK,EAASH,EAAK,MAAQA,EAAK,OAAUC,EACrCG,EAAQL,EAAO,IAAK,GAAM,KAAK,IAAI,EAAGG,CAAC,EAAIC,CAAK,EAClD,CAAE,IAAG,IAAG,MAAOE,EAAG,OAAQC,GAAMN,EAE9BO,GAAS,EAAW,EAAa,EAAa,IAAiB,CACnE,IAAMC,EAAKC,EAAIA,EACTC,EAAQC,EAAOA,EACrB,OAAO,KAAK,IAAKD,EAAQE,EAAOJ,EAAIA,GAAME,EAAQG,EAAI,CACxD,EACMC,GAAS,EAAe,IAAc,CAC1C,GAAIT,GAAKC,EAAG,CACV,IAAMS,EAAKT,EAAI,EAAI,KAAK,IAAID,EAAGI,EAAIH,CAAC,EAAI,EACpCU,EAAKC,EACT,IAAK,IAAMC,KAAKC,EAAK,CACnB,IAAMC,EAAKL,EAAK,EAAIX,EAAMc,GAAKH,EAAK,EACpC,EAAIG,GAAK,CAAE,IAAG,EAAGF,EAAI,MAAOD,EAAI,OAAQK,CAAG,EAC3C,GAAMA,CACR,CACA,GAAKL,EACL,EAAI,KAAK,IAAI,EAAGV,EAAIU,CAAE,CACxB,KAAO,CACL,IAAMM,EAAKhB,EAAI,EAAI,KAAK,IAAIC,EAAGG,EAAIJ,CAAC,EAAI,EACpCiB,EAAKC,EACT,IAAK,IAAML,KAAKC,EAAK,CACnB,IAAMK,EAAKH,EAAK,EAAIjB,EAAMc,GAAKG,EAAK,EACpC,EAAIH,GAAK,CAAE,EAAGI,EAAI,IAAG,MAAOE,EAAI,OAAQH,CAAG,EAC3C,GAAMG,CACR,CACA,GAAKH,EACL,EAAI,KAAK,IAAI,EAAGf,EAAIe,CAAE,CACxB,CACF,EAEIF,EAAgB,CAAC,EACjBM,EAAS,EACTC,EAAS,IACTC,EAAS,EAyBb,OAxBAvB,EAAM,SAAS,EAAG,IAAM,CACtB,GAAI,KAAK,GACT,IAAIe,EAAI,OAAQ,CACd,IAAMR,EAAO,KAAK,IAAIN,EAAGC,CAAC,EACbC,EACXkB,EAASG,EACT,KAAK,IAAIF,EAAQE,CAAC,EAClB,KAAK,IAAID,EAAQC,CAAC,EAClBjB,CAEE,EAAOJ,EAAMkB,EAAQC,EAAQC,EAAQhB,CAAI,IAC3CG,EAAMK,EAAKM,CAAM,EACjB,EAAM,CAAC,EACP,EAAS,EACT,EAAS,IACT,EAAS,EAEb,CACAN,EAAI,KAAKD,CAAC,EACV,GAAUU,EACV,EAAS,KAAK,IAAIF,EAAQE,CAAC,EAC3B,EAAS,KAAK,IAAID,EAAQC,CAAC,CAJ3B,CAKF,CAAC,EACGT,EAAI,QAAQL,EAAMK,EAAKM,CAAM,EAC1B3B,CACT,EAcM+B,GACJ,EACA,IACY,CACZ,IAAIC,EAAY,EACVC,GACJ,EACA,EACA,EACA,IACY,CACZ,IAAMC,EAAOpD,EAAAA,WAAWqD,EAAM,IAAK,GAAOC,EAAG,IAAI,CAAC,EAClD,OAAOD,EAAM,KAAK,EAAM,IAAM,CAC5B,IAAME,EAAIC,EAAW,OAASC,EAAMC,EAC9BC,EAAM,GAAGC,EAAU,GAAGR,EAAKM,KAC3BG,EAAO,CAAC,GAAGL,EAAYM,EAAK,IAAI,EACtC,GAAIA,EAAK,UAAU,OAAQ,CACzB,IAAMC,EAAWZ,EAAKW,EAAK,SAAUH,EAAKE,EAAMN,CAAC,EACjD,MAAO,CACL,OACA,MACA,OACA,IAAKA,EACL,KAAM,GACN,OAAQxD,EAAAA,IAAIgE,EAAS,IAAK,GAAOC,EAAG,MAAM,CAAC,EAC3C,UACF,CACF,CACA,MAAO,CACL,OACA,MACA,OACA,IAAKT,EACL,KAAM,IACN,OAAQU,EAAO,IAAIV,CAAC,EAAI,EAAItD,EAAAA,SAAS6D,EAAK,KAAK,EAC/C,SAAU,CAAC,CACb,CACF,CAAC,CACH,EACA,OAAOX,EAAKe,EAAE,KAAM,GAAI,CAAC,EAAG,CAAC,CAC/B,EAEaC,GACX,EACA,EACA,IACG,CACH,IAAMC,EAAS,GACbf,EAAM,QAAS,GAAM,CACfgB,EAAE,SAAS,OAAQD,EAAMC,EAAE,QAAQ,EAClCnD,EAAI,IAAImD,EAAE,IAAKA,EAAE,MAAM,CAC9B,CAAC,EACHD,EAAMnB,EAAMiB,EAAGD,CAAM,CAAC,CACxB,EAeMK,GAAU,EAAc,KAA0B,CACtD,EAAGC,EAAE,EAAIC,EACT,EAAGD,EAAE,EAAIC,EACT,MAAO,KAAK,IAAI,EAAGD,EAAE,MAAQ,EAAIC,CAAC,EAClC,OAAQ,KAAK,IAAI,EAAGD,EAAE,OAAS,EAAIC,CAAC,CACtC,GAEaC,GACX,EACA,IACiB,CACjB,GAAM,CAAE,QAAO,OAAM,UAAS,UAAW,EACnCC,EAAOzB,EAAM,EAAGgB,CAAM,EACtBU,EAAY5E,EAAAA,IAAI2E,EAAK,IAAK,GAAML,EAAE,MAAM,CAAC,EAEzCO,EAAQ,IAAI,IACZC,EAAgB,GAAqB,CACzC,IAAMvD,EAAI+C,EAAE,SAAS,OACjBtE,EAAAA,IAAIsE,EAAE,SAAS,IAAIQ,CAAY,CAAC,EAChC,KAAK,IAAI,EAAG,EAAE,MAAMR,EAAE,IAAKA,EAAE,MAAM,CAAC,EAExC,OADAO,EAAM,IAAIP,EAAG/C,CAAC,EACPA,CACT,EACMwD,EAAa/E,EAAAA,IAAI2E,EAAK,IAAIG,CAAY,CAAC,EAC7C,GAAIF,GAAa,GAAKG,GAAc,KAAM,OAAO5E,EAAAA,YAAY,CAAC,EAE9D,IAAM6E,EAAM,KAAK,IAAI,EAAG5E,EAAAA,OAAO,EAAE,IAAK,CAAC,CAAC,EAClC6E,EAAU,EAAE,UAAY,GACxBC,EAAW7E,EAAAA,KAAK8E,EAAO,GAAI,GAAG,EAC9BC,EAAY/E,EAAAA,KAAK8E,EAAO,EAAE,EAC1BE,EAAahF,EAAAA,KAAK8E,EAAO,GAAI,GAAG,EAChC7B,EAAqB,CAAC,EACtBgC,EAAqB,CAAC,EAEtBC,EAAOjF,EAAAA,kBAAkB6E,EAAM,UAAU,EAAI,GAE7CK,GAAS,EAAe,EAAiB,IAA6B,CAC1E,IAAMC,EAASC,EACZ,OAAQ,IAAOb,EAAM,IAAIP,CAAC,GAAK,GAAK,IAAI,CAAC,CACzC,MAAM,EAAG,KAAOO,EAAM,IAAIP,CAAC,GAAK,IAAMO,EAAM,IAAI5B,CAAC,GAAK,EAAE,EACrD0C,EAAQzE,EACZuE,EAAO,IAAK,GAAMZ,EAAM,IAAIP,CAAC,GAAK,CAAC,EACnCjD,CACF,EACMuE,EAAO,KAAK,IAAI,IAAM,GAAM,KAAK,IAAI,EAAGH,EAAO,OAAS,CAAC,CAAC,EAChEA,EAAO,SAAS,EAAG,IAAM,CACvB,IAAMI,EAAOtB,EAAOoB,EAAMhC,GAAIqB,EAAM,CAAC,EACrC,GAAIa,EAAK,MAAQ,GAAKA,EAAK,OAAS,EAAG,OACvC,IAAMC,EAAQC,EACVzB,EAAE,KAAK,MACL/D,EAAAA,YAAY4E,EAAOb,EAAE,KAAK,MAAOyB,CAAW,EAC5CvF,EAAAA,IAAIuF,EAAaZ,EAAM,WAAYxB,EAAIiC,CAAI,EAC7C,EAAE,MAAMtB,EAAE,KAAK,MAAOA,EAAE,GAAG,EAC/B,GAAIA,EAAE,SAAS,OAAQ,CACrB,IAAI0B,EAAUH,EACd,GAAIZ,GAAWY,EAAK,OAAS,IAAeA,EAAK,MAAQ,GAAI,CAC3DvC,EAAM,KAAK,CACT,KAAM,OACN,EAAGuC,EAAK,EACR,EAAGA,EAAK,EACR,MAAOA,EAAK,MACZ,OAAQA,EAAK,OACb,OAAQ,EACR,KAAMpF,EAAAA,MAAMqF,EAAO,GAAI,CACzB,CAAC,EACD,IAAMG,EAAQvF,EAAAA,UACZ4D,EAAE,KAAK,KACPuB,EAAK,MAAQ,GACbR,EACAa,CACF,EACID,GACF3C,EAAM,KAAK,CACT,KAAM,OACN,EAAGuC,EAAK,EAAI,EACZ,EAAGA,EAAK,EAAI5E,EAAS,EAAI,EACzB,KAAMgF,EACN,KAAMZ,EACN,MAAO5E,EAAAA,MAAM0E,EAAM,KAAM,GAAI,EAC7B,MAAO,OACP,SAAU,QACZ,CAAC,EACH,EAAU,CACR,EAAGU,EAAK,EAAI,EACZ,EAAGA,EAAK,EAAI5E,EACZ,MAAO4E,EAAK,MAAQ,EACpB,OAAQA,EAAK,OAAS5E,EAAS,CACjC,CACF,CACAuE,EAAMlB,EAAE,SAAU0B,EAASF,CAAK,EAChC,MACF,CACA,IAAMK,EAAOxF,EAAAA,aACX4E,EAAO/E,EAAAA,IAAIsF,EAAOX,EAAM,WAAY,GAAI,EAAIW,CAC9C,EACMM,EAAM3F,EAAAA,MAAM0F,CAAI,EAYtB,GAXA7C,EAAM,KAAK,CACT,KAAM,OACN,EAAGuC,EAAK,EACR,EAAGA,EAAK,EACR,MAAOA,EAAK,MACZ,OAAQA,EAAK,OACb,OAAQ,KAAK,IAAI,EAAGA,EAAK,MAAQ,EAAGA,EAAK,OAAS,CAAC,EACnD,KAAMO,EACN,IAAK9B,EAAE,KACP,SAAU,EACZ,CAAC,EACGuB,EAAK,OAAS,IAAMA,EAAK,QAAU,GAAI,CACzC,IAAMQ,EAAMzF,EAAAA,OAAOuF,CAAI,EACjBG,EAAO5F,EAAAA,UAAU4D,EAAE,KAAK,KAAMuB,EAAK,MAAQ,GAAIX,EAAUgB,CAAO,EAClEI,GACFhD,EAAM,KAAK,CACT,KAAM,OACN,EAAGuC,EAAK,EAAI,EACZ,EAAGA,EAAK,EAAI,EACZ,KAAMS,EACN,KAAMpB,EACN,MAAOmB,EACP,MAAO,OACP,SAAU,MACV,IAAK/B,EAAE,IACT,CAAC,EACH,IAAMiC,EAAQ,EAAE,OAAOjC,EAAE,MAAM,EAE7BgC,GACAT,EAAK,QAAU,IACfK,EAAQK,EAAOnB,CAAS,GAAKS,EAAK,MAAQ,IAE1CvC,EAAM,KAAK,CACT,KAAM,OACN,EAAGuC,EAAK,EAAI,EACZ,EAAGA,EAAK,EAAI,GACZ,KAAMU,EACN,KAAMnB,EACN,MAAOiB,EACP,MAAO,OACP,SAAU,MACV,IAAK/B,EAAE,IACT,CAAC,CACL,CACA,GAAIA,EAAE,OAAS,EAAG,CAChB,IAAMkC,EAAU5B,EAAY,EAAIN,EAAE,OAASM,EAAY,EACvDU,EAAM,KAAK,CACT,MAAOhB,EAAE,KACT,KAAMA,EAAE,KAAK,KACb,MAAOA,EAAE,OACT,UACA,MAAO,EAAE,QAAQkC,CAAO,EACxB,MAAOJ,EACP,KAAM9B,EAAE,KACR,EAAGuB,EAAK,EAAIA,EAAK,MAAQ,EACzB,EAAGA,EAAK,EAAIA,EAAK,OAAS,EAC1B,KAAM,CACJ,CAAE,KAAM,EAAE,OAAO,MAAO,MAAO,EAAE,OAAOvB,EAAE,MAAM,CAAE,EAClD,CAAE,KAAM,EAAE,OAAO,MAAO,MAAO,EAAE,QAAQkC,CAAO,CAAE,CACpD,CACF,CAAC,CACH,CACF,CAAC,CACH,EACAhB,EAAMb,EAAM8B,EAAM,IAAI,EACtBnB,EAAM,MAAM,EAAG,IAAMrC,EAAE,MAAQqB,EAAE,KAAK,EAEtC,IAAMoC,EAAQ7F,EAAAA,MAAM,EAAE,MAAO,EAAG,CAAC,EACjC,MAAO,CACL,QACA,QACA,IAAK,IACL,MAAO,GACP,GAAI6F,EAAQ,EACR,CACE,MAAO,CACL,MAAOA,EACP,MAAO,IAAO,IAAOA,EACrB,GAAID,EAAK,EAAIA,EAAK,MAAQ,EAC1B,GAAIA,EAAK,EAAIA,EAAK,OAAS,CAC7B,CACF,EACA,CAAC,CACP,CACF"}

package/dist/charts/engine/shapes/treemap.js

@@ -182,10 +182,10 @@ var m = 20, h = (e, t) => {
 					x: o.x + o.width / 2,
 					y: o.y + o.height / 2,
 					rows: [{
-						name: "Value",
+						name: p.labels.value,
 						value: p.format(n.target)
 					}, {
-						name: "Share",
+						name: p.labels.share,
 						value: p.percent(e)
 					}]
 				});

package/dist/charts/engine/shapes/treemap.js.map

@@ -1 +1 @@
-{"version":3,"file":"treemap.js","names":["HEADER","squarify","out","values","rect","total","sum","v","scale","areas","w","h","worst","s2","s","side2","side","max","min","place","cw","yy","y","i","row","hh","rh","xx","x","ww","rowSum","rowMin","rowMax","a","build","leafCount","walk","keys","uniqueKeys","nodes","nd","t","parentPath","top","j","key","parentKey","path","node","children","ch","hidden","positive","o","treemapValues","visit","b","shrink","r","d","layoutTreemap","c","tree","rootTotal","shown","measureShown","shownTotal","emptyLayout","gap","finite","headers","nameFont","font","theme","valueFont","headerFont","items","dark","relativeLuminance","level","sorted","list","rects","step","cell","color","parentColor","resolveWith","mix","content","toCss","title","ellipsize","measure","fill","readableFill","css","ink","textOn","name","value","percent","area","enter","clamp"],"sources":["../../../../../charts/src/engine/shapes/treemap.ts"],"sourcesContent":["// Treemap layout: squarified rectangles, parent headers, a palette color per\n// top-level node and lighter shades for its children.\n\nimport { mix, toCss, type Rgba } from \"../color\";\nimport { font } from \"../overlay\";\nimport {\n  clamp,\n  ellipsize,\n  emptyLayout,\n  finite,\n  positive,\n  readableFill,\n  relativeLuminance,\n  resolveWith,\n  sum,\n  textOn,\n  uniqueKeys,\n  type LayoutContext,\n  type LayoutResult,\n  type ShapeItem,\n  type ShapeNode,\n  type ShapeRect,\n} from \"./scene\";\nimport type { TreemapChartOptions, TreemapNode } from \"./types\";\n\nconst HEADER = 20;\n\n/**\n * Squarified treemap (Bruls et al.): rectangles of areas proportional to\n * `values` (best sorted descending) filling `rect`, with aspect ratios close to 1.\n */\nexport const squarify = (\n  values: readonly number[],\n  rect: ShapeRect,\n): ShapeRect[] => {\n  const out: ShapeRect[] = values.map(() => ({\n    x: rect.x,\n    y: rect.y,\n    width: 0,\n    height: 0,\n  }));\n  const total = sum(values.map((v) => Math.max(0, v)));\n  if (total <= 0 || rect.width <= 0 || rect.height <= 0) return out;\n  const scale = (rect.width * rect.height) / total;\n  const areas = values.map((v) => Math.max(0, v) * scale);\n  let { x, y, width: w, height: h } = rect;\n\n  const worst = (s: number, min: number, max: number, side: number) => {\n    const s2 = s * s;\n    const side2 = side * side;\n    return Math.max((side2 * max) / s2, s2 / (side2 * min));\n  };\n  const place = (row: number[], s: number) => {\n    if (w >= h) {\n      const cw = h > 0 ? Math.min(w, s / h) : 0;\n      let yy = y;\n      for (const i of row) {\n        const hh = cw > 0 ? areas[i] / cw : 0;\n        out[i] = { x, y: yy, width: cw, height: hh };\n        yy += hh;\n      }\n      x += cw;\n      w = Math.max(0, w - cw);\n    } else {\n      const rh = w > 0 ? Math.min(h, s / w) : 0;\n      let xx = x;\n      for (const i of row) {\n        const ww = rh > 0 ? areas[i] / rh : 0;\n        out[i] = { x: xx, y, width: ww, height: rh };\n        xx += ww;\n      }\n      y += rh;\n      h = Math.max(0, h - rh);\n    }\n  };\n\n  let row: number[] = [];\n  let rowSum = 0;\n  let rowMin = Infinity;\n  let rowMax = 0;\n  areas.forEach((a, i) => {\n    if (a <= 0) return;\n    if (row.length) {\n      const side = Math.min(w, h);\n      const next = worst(\n        rowSum + a,\n        Math.min(rowMin, a),\n        Math.max(rowMax, a),\n        side,\n      );\n      if (next > worst(rowSum, rowMin, rowMax, side)) {\n        place(row, rowSum);\n        row = [];\n        rowSum = 0;\n        rowMin = Infinity;\n        rowMax = 0;\n      }\n    }\n    row.push(i);\n    rowSum += a;\n    rowMin = Math.min(rowMin, a);\n    rowMax = Math.max(rowMax, a);\n  });\n  if (row.length) place(row, rowSum);\n  return out;\n};\n\ninterface Built {\n  node: TreemapNode;\n  key: string;\n  path: string[];\n  top: number;\n  /** Index in the flattened leaves (leaves only) */\n  leaf: number;\n  target: number;\n  children: Built[];\n}\n\n/** Tree with the target values; hidden top-level nodes count 0 */\nconst build = (\n  o: TreemapChartOptions,\n  hidden: ReadonlySet<number>,\n): Built[] => {\n  let leafCount = 0;\n  const walk = (\n    nodes: readonly TreemapNode[],\n    parentKey: string,\n    parentPath: string[],\n    top: number,\n  ): Built[] => {\n    const keys = uniqueKeys(nodes.map((nd) => nd.name));\n    return nodes.map((node, j) => {\n      const t = parentPath.length ? top : j;\n      const key = `${parentKey}/${keys[j]}`;\n      const path = [...parentPath, node.name];\n      if (node.children?.length) {\n        const children = walk(node.children, key, path, t);\n        return {\n          node,\n          key,\n          path,\n          top: t,\n          leaf: -1,\n          target: sum(children.map((ch) => ch.target)),\n          children,\n        };\n      }\n      return {\n        node,\n        key,\n        path,\n        top: t,\n        leaf: leafCount++,\n        target: hidden.has(t) ? 0 : positive(node.value),\n        children: [],\n      };\n    });\n  };\n  return walk(o.data, \"\", [], 0);\n};\n\nexport const treemapValues = (\n  o: TreemapChartOptions,\n  hidden: ReadonlySet<number>,\n  out: Map<string, number>,\n) => {\n  const visit = (nodes: Built[]) =>\n    nodes.forEach((b) => {\n      if (b.children.length) visit(b.children);\n      else out.set(b.key, b.target);\n    });\n  visit(build(o, hidden));\n};\n\n/** Leaves in the flattened order (the hover / click `index`) */\nexport const treemapLeaves = (data: readonly TreemapNode[]) => {\n  const leaves: { node: TreemapNode; path: string[] }[] = [];\n  const visit = (nodes: readonly TreemapNode[], path: string[]) =>\n    nodes.forEach((node) => {\n      const p = [...path, node.name];\n      if (node.children?.length) visit(node.children, p);\n      else leaves.push({ node, path: p });\n    });\n  visit(data, []);\n  return leaves;\n};\n\nconst shrink = (r: ShapeRect, d: number): ShapeRect => ({\n  x: r.x + d,\n  y: r.y + d,\n  width: Math.max(0, r.width - 2 * d),\n  height: Math.max(0, r.height - 2 * d),\n});\n\nexport const layoutTreemap = (\n  o: TreemapChartOptions,\n  c: LayoutContext,\n): LayoutResult => {\n  const { theme, area, measure, hidden } = c;\n  const tree = build(o, hidden);\n  const rootTotal = sum(tree.map((b) => b.target));\n  // displayed (animated) values\n  const shown = new Map<Built, number>();\n  const measureShown = (b: Built): number => {\n    const v = b.children.length\n      ? sum(b.children.map(measureShown))\n      : Math.max(0, c.value(b.key, b.target));\n    shown.set(b, v);\n    return v;\n  };\n  const shownTotal = sum(tree.map(measureShown));\n  if (rootTotal <= 0 && shownTotal <= 1e-9) return emptyLayout(c);\n\n  const gap = Math.max(0, finite(o.gap, 2));\n  const headers = o.headers !== false;\n  const nameFont = font(theme, 12, 500);\n  const valueFont = font(theme, 11);\n  const headerFont = font(theme, 11, 600);\n  const nodes: ShapeNode[] = [];\n  const items: ShapeItem[] = [];\n  // dark themes: fills slightly toward the background so that labels read well\n  const dark = relativeLuminance(theme.background) < 0.2;\n\n  const level = (list: Built[], rect: ShapeRect, parentColor: Rgba | null) => {\n    const sorted = list\n      .filter((b) => (shown.get(b) ?? 0) > 1e-9)\n      .sort((a, b) => (shown.get(b) ?? 0) - (shown.get(a) ?? 0));\n    const rects = squarify(\n      sorted.map((b) => shown.get(b) ?? 0),\n      rect,\n    );\n    const step = Math.min(0.14, 0.5 / Math.max(1, sorted.length - 1));\n    sorted.forEach((b, j) => {\n      const cell = shrink(rects[j], gap / 2);\n      if (cell.width < 1 || cell.height < 1) return;\n      const color = parentColor\n        ? b.node.color\n          ? resolveWith(theme, b.node.color, parentColor)\n          : mix(parentColor, theme.background, j * step)\n        : c.color(b.node.color, b.top);\n      if (b.children.length) {\n        let content = cell;\n        if (headers && cell.height > HEADER + 14 && cell.width > 36) {\n          nodes.push({\n            kind: \"rect\",\n            x: cell.x,\n            y: cell.y,\n            width: cell.width,\n            height: cell.height,\n            radius: 4,\n            fill: toCss(color, 0.14),\n          });\n          const title = ellipsize(\n            b.node.name,\n            cell.width - 12,\n            headerFont,\n            measure,\n          );\n          if (title)\n            nodes.push({\n              kind: \"text\",\n              x: cell.x + 6,\n              y: cell.y + HEADER / 2 + 1,\n              text: title,\n              font: headerFont,\n              color: toCss(theme.text, 0.85),\n              align: \"left\",\n              baseline: \"middle\",\n            });\n          content = {\n            x: cell.x + 2,\n            y: cell.y + HEADER,\n            width: cell.width - 4,\n            height: cell.height - HEADER - 2,\n          };\n        }\n        level(b.children, content, color);\n        return;\n      }\n      const fill = readableFill(\n        dark ? mix(color, theme.background, 0.18) : color,\n      );\n      const css = toCss(fill);\n      nodes.push({\n        kind: \"rect\",\n        x: cell.x,\n        y: cell.y,\n        width: cell.width,\n        height: cell.height,\n        radius: Math.min(4, cell.width / 2, cell.height / 2),\n        fill: css,\n        hit: b.leaf,\n        brighten: true,\n      });\n      if (cell.width >= 36 && cell.height >= 22) {\n        const ink = textOn(fill);\n        const name = ellipsize(b.node.name, cell.width - 12, nameFont, measure);\n        if (name)\n          nodes.push({\n            kind: \"text\",\n            x: cell.x + 6,\n            y: cell.y + 6,\n            text: name,\n            font: nameFont,\n            color: ink,\n            align: \"left\",\n            baseline: \"top\",\n            hit: b.leaf,\n          });\n        const value = c.format(b.target);\n        if (\n          name &&\n          cell.height >= 38 &&\n          measure(value, valueFont) <= cell.width - 12\n        )\n          nodes.push({\n            kind: \"text\",\n            x: cell.x + 6,\n            y: cell.y + 22,\n            text: value,\n            font: valueFont,\n            color: ink,\n            align: \"left\",\n            baseline: \"top\",\n            hit: b.leaf,\n          });\n      }\n      if (b.target > 0) {\n        const percent = rootTotal > 0 ? b.target / rootTotal : 0;\n        items.push({\n          index: b.leaf,\n          name: b.node.name,\n          value: b.target,\n          percent,\n          share: c.percent(percent),\n          color: css,\n          path: b.path,\n          x: cell.x + cell.width / 2,\n          y: cell.y + cell.height / 2,\n          rows: [\n            { name: \"Value\", value: c.format(b.target) },\n            { name: \"Share\", value: c.percent(percent) },\n          ],\n        });\n      }\n    });\n  };\n  level(tree, area, null);\n  items.sort((a, b) => a.index - b.index);\n\n  const enter = clamp(c.enter, 0, 1);\n  return {\n    nodes,\n    items,\n    dim: 0.55,\n    empty: false,\n    ...(enter < 1\n      ? {\n          enter: {\n            alpha: enter,\n            scale: 0.94 + 0.06 * enter,\n            cx: area.x + area.width / 2,\n            cy: area.y + area.height / 2,\n          },\n        }\n      : {}),\n  };\n};\n"],"mappings":";;;;AAyBA,IAAMA,IAAS,IAMFC,KACX,GACA,MACgB;CAChB,IAAMC,IAAmBC,EAAO,WAAW;EACzC,GAAGC,EAAK;EACR,GAAGA,EAAK;EACR,OAAO;EACP,QAAQ;CACV,EAAE,GACIC,IAAQC,EAAIH,EAAO,KAAK,MAAM,KAAK,IAAI,GAAGI,CAAC,CAAC,CAAC;CACnD,IAAIF,KAAS,KAAKD,EAAK,SAAS,KAAKA,EAAK,UAAU,GAAG,OAAOF;CAC9D,IAAMM,IAASJ,EAAK,QAAQA,EAAK,SAAUC,GACrCI,IAAQN,EAAO,KAAK,MAAM,KAAK,IAAI,GAAGI,CAAC,IAAIC,CAAK,GAClD,EAAE,MAAG,MAAG,OAAOE,GAAG,QAAQC,MAAMP,GAE9BQ,KAAS,GAAW,GAAa,GAAa,MAAiB;EACnE,IAAMC,IAAKC,IAAIA,GACTC,IAAQC,IAAOA;EACrB,OAAO,KAAK,IAAKD,IAAQE,IAAOJ,GAAIA,KAAME,IAAQG,EAAI;CACxD,GACMC,KAAS,GAAe,MAAc;EAC1C,IAAIT,KAAKC,GAAG;GACV,IAAMS,IAAKT,IAAI,IAAI,KAAK,IAAID,GAAGI,IAAIH,CAAC,IAAI,GACpCU,IAAKC;GACT,KAAK,IAAMC,KAAKC,GAAK;IACnB,IAAMC,IAAKL,IAAK,IAAIX,EAAMc,KAAKH,IAAK;IAEpC,AADA,EAAIG,KAAK;KAAE;KAAG,GAAGF;KAAI,OAAOD;KAAI,QAAQK;IAAG,GAC3C,KAAMA;GACR;GAEA,AADA,KAAKL,GACL,IAAI,KAAK,IAAI,GAAGV,IAAIU,CAAE;EACxB,OAAO;GACL,IAAMM,IAAKhB,IAAI,IAAI,KAAK,IAAIC,GAAGG,IAAIJ,CAAC,IAAI,GACpCiB,IAAKC;GACT,KAAK,IAAML,KAAKC,GAAK;IACnB,IAAMK,IAAKH,IAAK,IAAIjB,EAAMc,KAAKG,IAAK;IAEpC,AADA,EAAIH,KAAK;KAAE,GAAGI;KAAI;KAAG,OAAOE;KAAI,QAAQH;IAAG,GAC3C,KAAMG;GACR;GAEA,AADA,KAAKH,GACL,IAAI,KAAK,IAAI,GAAGf,IAAIe,CAAE;EACxB;CACF,GAEIF,IAAgB,CAAC,GACjBM,IAAS,GACTC,IAAS,UACTC,IAAS;CAyBb,OAxBAvB,EAAM,SAAS,GAAG,MAAM;EACtB,IAAI,OAAK,IACT;OAAIe,EAAI,QAAQ;IACd,IAAMR,IAAO,KAAK,IAAIN,GAAGC,CAAC;IAO1B,AANaC,EACXkB,IAASG,GACT,KAAK,IAAIF,GAAQE,CAAC,GAClB,KAAK,IAAID,GAAQC,CAAC,GAClBjB,CAEE,IAAOJ,EAAMkB,GAAQC,GAAQC,GAAQhB,CAAI,MAC3CG,EAAMK,GAAKM,CAAM,GACjB,IAAM,CAAC,GACP,IAAS,GACT,IAAS,UACT,IAAS;GAEb;GAIA,AAHAN,EAAI,KAAKD,CAAC,GACV,KAAUU,GACV,IAAS,KAAK,IAAIF,GAAQE,CAAC,GAC3B,IAAS,KAAK,IAAID,GAAQC,CAAC;EAJ3B;CAKF,CAAC,GACGT,EAAI,UAAQL,EAAMK,GAAKM,CAAM,GAC1B5B;AACT,GAcMgC,KACJ,GACA,MACY;CACZ,IAAIC,IAAY,GACVC,KACJ,GACA,GACA,GACA,MACY;EACZ,IAAMC,IAAOC,EAAWC,EAAM,KAAK,MAAOC,EAAG,IAAI,CAAC;EAClD,OAAOD,EAAM,KAAK,GAAM,MAAM;GAC5B,IAAME,IAAIC,EAAW,SAASC,IAAMC,GAC9BC,IAAM,GAAGC,EAAU,GAAGT,EAAKO,MAC3BG,IAAO,CAAC,GAAGL,GAAYM,EAAK,IAAI;GACtC,IAAIA,EAAK,UAAU,QAAQ;IACzB,IAAMC,IAAWb,EAAKY,EAAK,UAAUH,GAAKE,GAAMN,CAAC;IACjD,OAAO;KACL;KACA;KACA;KACA,KAAKA;KACL,MAAM;KACN,QAAQnC,EAAI2C,EAAS,KAAK,MAAOC,EAAG,MAAM,CAAC;KAC3C;IACF;GACF;GACA,OAAO;IACL;IACA;IACA;IACA,KAAKT;IACL,MAAM;IACN,QAAQU,EAAO,IAAIV,CAAC,IAAI,IAAIW,EAASJ,EAAK,KAAK;IAC/C,UAAU,CAAC;GACb;EACF,CAAC;CACH;CACA,OAAOZ,EAAKiB,EAAE,MAAM,IAAI,CAAC,GAAG,CAAC;AAC/B,GAEaC,KACX,GACA,GACA,MACG;CACH,IAAMC,KAAS,MACbhB,EAAM,SAAS,MAAM;EACnB,AAAIiB,EAAE,SAAS,SAAQD,EAAMC,EAAE,QAAQ,IAClCtD,EAAI,IAAIsD,EAAE,KAAKA,EAAE,MAAM;CAC9B,CAAC;CACH,EAAMtB,EAAMmB,GAAGF,CAAM,CAAC;AACxB,GAeMM,KAAU,GAAc,OAA0B;CACtD,GAAGC,EAAE,IAAIC;CACT,GAAGD,EAAE,IAAIC;CACT,OAAO,KAAK,IAAI,GAAGD,EAAE,QAAQ,IAAIC,CAAC;CAClC,QAAQ,KAAK,IAAI,GAAGD,EAAE,SAAS,IAAIC,CAAC;AACtC,IAEaC,KACX,GACA,MACiB;CACjB,IAAM,EAAE,UAAO,SAAM,YAAS,cAAWC,GACnCC,IAAO5B,EAAMmB,GAAGF,CAAM,GACtBY,IAAYzD,EAAIwD,EAAK,KAAK,MAAMN,EAAE,MAAM,CAAC,GAEzCQ,oBAAQ,IAAI,IAAmB,GAC/BC,KAAgB,MAAqB;EACzC,IAAM1D,IAAIiD,EAAE,SAAS,SACjBlD,EAAIkD,EAAE,SAAS,IAAIS,CAAY,CAAC,IAChC,KAAK,IAAI,GAAGJ,EAAE,MAAML,EAAE,KAAKA,EAAE,MAAM,CAAC;EAExC,OADAQ,EAAM,IAAIR,GAAGjD,CAAC,GACPA;CACT,GACM2D,IAAa5D,EAAIwD,EAAK,IAAIG,CAAY,CAAC;CAC7C,IAAIF,KAAa,KAAKG,KAAc,MAAM,OAAOC,EAAYN,CAAC;CAE9D,IAAMO,IAAM,KAAK,IAAI,GAAGC,EAAOhB,EAAE,KAAK,CAAC,CAAC,GAClCiB,IAAUjB,EAAE,YAAY,IACxBkB,IAAWC,EAAKC,GAAO,IAAI,GAAG,GAC9BC,IAAYF,EAAKC,GAAO,EAAE,GAC1BE,IAAaH,EAAKC,GAAO,IAAI,GAAG,GAChClC,IAAqB,CAAC,GACtBqC,IAAqB,CAAC,GAEtBC,IAAOC,EAAkBL,EAAM,UAAU,IAAI,IAE7CM,KAAS,GAAe,GAAiB,MAA6B;EAC1E,IAAMC,IAASC,EACZ,QAAQ,OAAOjB,EAAM,IAAIR,CAAC,KAAK,KAAK,IAAI,CAAC,CACzC,MAAM,GAAG,OAAOQ,EAAM,IAAIR,CAAC,KAAK,MAAMQ,EAAM,IAAI/B,CAAC,KAAK,EAAE,GACrDiD,IAAQjF,EACZ+E,EAAO,KAAK,MAAMhB,EAAM,IAAIR,CAAC,KAAK,CAAC,GACnCpD,CACF,GACM+E,IAAO,KAAK,IAAI,KAAM,KAAM,KAAK,IAAI,GAAGH,EAAO,SAAS,CAAC,CAAC;EAChE,EAAO,SAAS,GAAG,MAAM;GACvB,IAAMI,IAAO3B,EAAOyB,EAAMtC,IAAIwB,IAAM,CAAC;GACrC,IAAIgB,EAAK,QAAQ,KAAKA,EAAK,SAAS,GAAG;GACvC,IAAMC,IAAQC,IACV9B,EAAE,KAAK,QACL+B,EAAYd,GAAOjB,EAAE,KAAK,OAAO8B,CAAW,IAC5CE,EAAIF,GAAab,EAAM,YAAY7B,IAAIuC,CAAI,IAC7CtB,EAAE,MAAML,EAAE,KAAK,OAAOA,EAAE,GAAG;GAC/B,IAAIA,EAAE,SAAS,QAAQ;IACrB,IAAIiC,IAAUL;IACd,IAAId,KAAWc,EAAK,SAAS,MAAeA,EAAK,QAAQ,IAAI;KAC3D,EAAM,KAAK;MACT,MAAM;MACN,GAAGA,EAAK;MACR,GAAGA,EAAK;MACR,OAAOA,EAAK;MACZ,QAAQA,EAAK;MACb,QAAQ;MACR,MAAMM,EAAML,GAAO,GAAI;KACzB,CAAC;KACD,IAAMM,IAAQC,EACZpC,EAAE,KAAK,MACP4B,EAAK,QAAQ,IACbT,GACAkB,CACF;KAYA,AAXIF,KACFpD,EAAM,KAAK;MACT,MAAM;MACN,GAAG6C,EAAK,IAAI;MACZ,GAAGA,EAAK,IAAIpF,IAAS,IAAI;MACzB,MAAM2F;MACN,MAAMhB;MACN,OAAOe,EAAMjB,EAAM,MAAM,GAAI;MAC7B,OAAO;MACP,UAAU;KACZ,CAAC,GACH,IAAU;MACR,GAAGW,EAAK,IAAI;MACZ,GAAGA,EAAK,IAAIpF;MACZ,OAAOoF,EAAK,QAAQ;MACpB,QAAQA,EAAK,SAASpF,IAAS;KACjC;IACF;IACA,EAAMwD,EAAE,UAAUiC,GAASJ,CAAK;IAChC;GACF;GACA,IAAMS,IAAOC,EACXlB,IAAOW,EAAIH,GAAOZ,EAAM,YAAY,GAAI,IAAIY,CAC9C,GACMW,IAAMN,EAAMI,CAAI;GAYtB,IAXAvD,EAAM,KAAK;IACT,MAAM;IACN,GAAG6C,EAAK;IACR,GAAGA,EAAK;IACR,OAAOA,EAAK;IACZ,QAAQA,EAAK;IACb,QAAQ,KAAK,IAAI,GAAGA,EAAK,QAAQ,GAAGA,EAAK,SAAS,CAAC;IACnD,MAAMY;IACN,KAAKxC,EAAE;IACP,UAAU;GACZ,CAAC,GACG4B,EAAK,SAAS,MAAMA,EAAK,UAAU,IAAI;IACzC,IAAMa,IAAMC,EAAOJ,CAAI,GACjBK,IAAOP,EAAUpC,EAAE,KAAK,MAAM4B,EAAK,QAAQ,IAAIb,GAAUsB,CAAO;IACtE,AAAIM,KACF5D,EAAM,KAAK;KACT,MAAM;KACN,GAAG6C,EAAK,IAAI;KACZ,GAAGA,EAAK,IAAI;KACZ,MAAMe;KACN,MAAM5B;KACN,OAAO0B;KACP,OAAO;KACP,UAAU;KACV,KAAKzC,EAAE;IACT,CAAC;IACH,IAAM4C,IAAQvC,EAAE,OAAOL,EAAE,MAAM;IAC/B,AACE2C,KACAf,EAAK,UAAU,MACfS,EAAQO,GAAO1B,CAAS,KAAKU,EAAK,QAAQ,MAE1C7C,EAAM,KAAK;KACT,MAAM;KACN,GAAG6C,EAAK,IAAI;KACZ,GAAGA,EAAK,IAAI;KACZ,MAAMgB;KACN,MAAM1B;KACN,OAAOuB;KACP,OAAO;KACP,UAAU;KACV,KAAKzC,EAAE;IACT,CAAC;GACL;GACA,IAAIA,EAAE,SAAS,GAAG;IAChB,IAAM6C,IAAUtC,IAAY,IAAIP,EAAE,SAASO,IAAY;IACvD,EAAM,KAAK;KACT,OAAOP,EAAE;KACT,MAAMA,EAAE,KAAK;KACb,OAAOA,EAAE;KACT;KACA,OAAOK,EAAE,QAAQwC,CAAO;KACxB,OAAOL;KACP,MAAMxC,EAAE;KACR,GAAG4B,EAAK,IAAIA,EAAK,QAAQ;KACzB,GAAGA,EAAK,IAAIA,EAAK,SAAS;KAC1B,MAAM,CACJ;MAAE,MAAM;MAAS,OAAOvB,EAAE,OAAOL,EAAE,MAAM;KAAE,GAC3C;MAAE,MAAM;MAAS,OAAOK,EAAE,QAAQwC,CAAO;KAAE,CAC7C;IACF,CAAC;GACH;EACF,CAAC;CACH;CAEA,AADAtB,EAAMjB,GAAMwC,GAAM,IAAI,GACtB1B,EAAM,MAAM,GAAG,MAAM3C,EAAE,QAAQuB,EAAE,KAAK;CAEtC,IAAM+C,IAAQC,EAAM3C,EAAE,OAAO,GAAG,CAAC;CACjC,OAAO;EACL;EACA;EACA,KAAK;EACL,OAAO;EACP,GAAI0C,IAAQ,IACR,EACE,OAAO;GACL,OAAOA;GACP,OAAO,MAAO,MAAOA;GACrB,IAAID,EAAK,IAAIA,EAAK,QAAQ;GAC1B,IAAIA,EAAK,IAAIA,EAAK,SAAS;EAC7B,EACF,IACA,CAAC;CACP;AACF"}
+{"version":3,"file":"treemap.js","names":["HEADER","squarify","out","values","rect","total","sum","v","scale","areas","w","h","worst","s2","s","side2","side","max","min","place","cw","yy","y","i","row","hh","rh","xx","x","ww","rowSum","rowMin","rowMax","a","build","leafCount","walk","keys","uniqueKeys","nodes","nd","t","parentPath","top","j","key","parentKey","path","node","children","ch","hidden","positive","o","treemapValues","visit","b","shrink","r","d","layoutTreemap","c","tree","rootTotal","shown","measureShown","shownTotal","emptyLayout","gap","finite","headers","nameFont","font","theme","valueFont","headerFont","items","dark","relativeLuminance","level","sorted","list","rects","step","cell","color","parentColor","resolveWith","mix","content","toCss","title","ellipsize","measure","fill","readableFill","css","ink","textOn","name","value","percent","area","enter","clamp"],"sources":["../../../../../charts/src/engine/shapes/treemap.ts"],"sourcesContent":["// Treemap layout: squarified rectangles, parent headers, a palette color per\n// top-level node and lighter shades for its children.\n\nimport { mix, toCss, type Rgba } from \"../color\";\nimport { font } from \"../overlay\";\nimport {\n  clamp,\n  ellipsize,\n  emptyLayout,\n  finite,\n  positive,\n  readableFill,\n  relativeLuminance,\n  resolveWith,\n  sum,\n  textOn,\n  uniqueKeys,\n  type LayoutContext,\n  type LayoutResult,\n  type ShapeItem,\n  type ShapeNode,\n  type ShapeRect,\n} from \"./scene\";\nimport type { TreemapChartOptions, TreemapNode } from \"./types\";\n\nconst HEADER = 20;\n\n/**\n * Squarified treemap (Bruls et al.): rectangles of areas proportional to\n * `values` (best sorted descending) filling `rect`, with aspect ratios close to 1.\n */\nexport const squarify = (\n  values: readonly number[],\n  rect: ShapeRect,\n): ShapeRect[] => {\n  const out: ShapeRect[] = values.map(() => ({\n    x: rect.x,\n    y: rect.y,\n    width: 0,\n    height: 0,\n  }));\n  const total = sum(values.map((v) => Math.max(0, v)));\n  if (total <= 0 || rect.width <= 0 || rect.height <= 0) return out;\n  const scale = (rect.width * rect.height) / total;\n  const areas = values.map((v) => Math.max(0, v) * scale);\n  let { x, y, width: w, height: h } = rect;\n\n  const worst = (s: number, min: number, max: number, side: number) => {\n    const s2 = s * s;\n    const side2 = side * side;\n    return Math.max((side2 * max) / s2, s2 / (side2 * min));\n  };\n  const place = (row: number[], s: number) => {\n    if (w >= h) {\n      const cw = h > 0 ? Math.min(w, s / h) : 0;\n      let yy = y;\n      for (const i of row) {\n        const hh = cw > 0 ? areas[i] / cw : 0;\n        out[i] = { x, y: yy, width: cw, height: hh };\n        yy += hh;\n      }\n      x += cw;\n      w = Math.max(0, w - cw);\n    } else {\n      const rh = w > 0 ? Math.min(h, s / w) : 0;\n      let xx = x;\n      for (const i of row) {\n        const ww = rh > 0 ? areas[i] / rh : 0;\n        out[i] = { x: xx, y, width: ww, height: rh };\n        xx += ww;\n      }\n      y += rh;\n      h = Math.max(0, h - rh);\n    }\n  };\n\n  let row: number[] = [];\n  let rowSum = 0;\n  let rowMin = Infinity;\n  let rowMax = 0;\n  areas.forEach((a, i) => {\n    if (a <= 0) return;\n    if (row.length) {\n      const side = Math.min(w, h);\n      const next = worst(\n        rowSum + a,\n        Math.min(rowMin, a),\n        Math.max(rowMax, a),\n        side,\n      );\n      if (next > worst(rowSum, rowMin, rowMax, side)) {\n        place(row, rowSum);\n        row = [];\n        rowSum = 0;\n        rowMin = Infinity;\n        rowMax = 0;\n      }\n    }\n    row.push(i);\n    rowSum += a;\n    rowMin = Math.min(rowMin, a);\n    rowMax = Math.max(rowMax, a);\n  });\n  if (row.length) place(row, rowSum);\n  return out;\n};\n\ninterface Built {\n  node: TreemapNode;\n  key: string;\n  path: string[];\n  top: number;\n  /** Index in the flattened leaves (leaves only) */\n  leaf: number;\n  target: number;\n  children: Built[];\n}\n\n/** Tree with the target values; hidden top-level nodes count 0 */\nconst build = (\n  o: TreemapChartOptions,\n  hidden: ReadonlySet<number>,\n): Built[] => {\n  let leafCount = 0;\n  const walk = (\n    nodes: readonly TreemapNode[],\n    parentKey: string,\n    parentPath: string[],\n    top: number,\n  ): Built[] => {\n    const keys = uniqueKeys(nodes.map((nd) => nd.name));\n    return nodes.map((node, j) => {\n      const t = parentPath.length ? top : j;\n      const key = `${parentKey}/${keys[j]}`;\n      const path = [...parentPath, node.name];\n      if (node.children?.length) {\n        const children = walk(node.children, key, path, t);\n        return {\n          node,\n          key,\n          path,\n          top: t,\n          leaf: -1,\n          target: sum(children.map((ch) => ch.target)),\n          children,\n        };\n      }\n      return {\n        node,\n        key,\n        path,\n        top: t,\n        leaf: leafCount++,\n        target: hidden.has(t) ? 0 : positive(node.value),\n        children: [],\n      };\n    });\n  };\n  return walk(o.data, \"\", [], 0);\n};\n\nexport const treemapValues = (\n  o: TreemapChartOptions,\n  hidden: ReadonlySet<number>,\n  out: Map<string, number>,\n) => {\n  const visit = (nodes: Built[]) =>\n    nodes.forEach((b) => {\n      if (b.children.length) visit(b.children);\n      else out.set(b.key, b.target);\n    });\n  visit(build(o, hidden));\n};\n\n/** Leaves in the flattened order (the hover / click `index`) */\nexport const treemapLeaves = (data: readonly TreemapNode[]) => {\n  const leaves: { node: TreemapNode; path: string[] }[] = [];\n  const visit = (nodes: readonly TreemapNode[], path: string[]) =>\n    nodes.forEach((node) => {\n      const p = [...path, node.name];\n      if (node.children?.length) visit(node.children, p);\n      else leaves.push({ node, path: p });\n    });\n  visit(data, []);\n  return leaves;\n};\n\nconst shrink = (r: ShapeRect, d: number): ShapeRect => ({\n  x: r.x + d,\n  y: r.y + d,\n  width: Math.max(0, r.width - 2 * d),\n  height: Math.max(0, r.height - 2 * d),\n});\n\nexport const layoutTreemap = (\n  o: TreemapChartOptions,\n  c: LayoutContext,\n): LayoutResult => {\n  const { theme, area, measure, hidden } = c;\n  const tree = build(o, hidden);\n  const rootTotal = sum(tree.map((b) => b.target));\n  // displayed (animated) values\n  const shown = new Map<Built, number>();\n  const measureShown = (b: Built): number => {\n    const v = b.children.length\n      ? sum(b.children.map(measureShown))\n      : Math.max(0, c.value(b.key, b.target));\n    shown.set(b, v);\n    return v;\n  };\n  const shownTotal = sum(tree.map(measureShown));\n  if (rootTotal <= 0 && shownTotal <= 1e-9) return emptyLayout(c);\n\n  const gap = Math.max(0, finite(o.gap, 2));\n  const headers = o.headers !== false;\n  const nameFont = font(theme, 12, 500);\n  const valueFont = font(theme, 11);\n  const headerFont = font(theme, 11, 600);\n  const nodes: ShapeNode[] = [];\n  const items: ShapeItem[] = [];\n  // dark themes: fills slightly toward the background so that labels read well\n  const dark = relativeLuminance(theme.background) < 0.2;\n\n  const level = (list: Built[], rect: ShapeRect, parentColor: Rgba | null) => {\n    const sorted = list\n      .filter((b) => (shown.get(b) ?? 0) > 1e-9)\n      .sort((a, b) => (shown.get(b) ?? 0) - (shown.get(a) ?? 0));\n    const rects = squarify(\n      sorted.map((b) => shown.get(b) ?? 0),\n      rect,\n    );\n    const step = Math.min(0.14, 0.5 / Math.max(1, sorted.length - 1));\n    sorted.forEach((b, j) => {\n      const cell = shrink(rects[j], gap / 2);\n      if (cell.width < 1 || cell.height < 1) return;\n      const color = parentColor\n        ? b.node.color\n          ? resolveWith(theme, b.node.color, parentColor)\n          : mix(parentColor, theme.background, j * step)\n        : c.color(b.node.color, b.top);\n      if (b.children.length) {\n        let content = cell;\n        if (headers && cell.height > HEADER + 14 && cell.width > 36) {\n          nodes.push({\n            kind: \"rect\",\n            x: cell.x,\n            y: cell.y,\n            width: cell.width,\n            height: cell.height,\n            radius: 4,\n            fill: toCss(color, 0.14),\n          });\n          const title = ellipsize(\n            b.node.name,\n            cell.width - 12,\n            headerFont,\n            measure,\n          );\n          if (title)\n            nodes.push({\n              kind: \"text\",\n              x: cell.x + 6,\n              y: cell.y + HEADER / 2 + 1,\n              text: title,\n              font: headerFont,\n              color: toCss(theme.text, 0.85),\n              align: \"left\",\n              baseline: \"middle\",\n            });\n          content = {\n            x: cell.x + 2,\n            y: cell.y + HEADER,\n            width: cell.width - 4,\n            height: cell.height - HEADER - 2,\n          };\n        }\n        level(b.children, content, color);\n        return;\n      }\n      const fill = readableFill(\n        dark ? mix(color, theme.background, 0.18) : color,\n      );\n      const css = toCss(fill);\n      nodes.push({\n        kind: \"rect\",\n        x: cell.x,\n        y: cell.y,\n        width: cell.width,\n        height: cell.height,\n        radius: Math.min(4, cell.width / 2, cell.height / 2),\n        fill: css,\n        hit: b.leaf,\n        brighten: true,\n      });\n      if (cell.width >= 36 && cell.height >= 22) {\n        const ink = textOn(fill);\n        const name = ellipsize(b.node.name, cell.width - 12, nameFont, measure);\n        if (name)\n          nodes.push({\n            kind: \"text\",\n            x: cell.x + 6,\n            y: cell.y + 6,\n            text: name,\n            font: nameFont,\n            color: ink,\n            align: \"left\",\n            baseline: \"top\",\n            hit: b.leaf,\n          });\n        const value = c.format(b.target);\n        if (\n          name &&\n          cell.height >= 38 &&\n          measure(value, valueFont) <= cell.width - 12\n        )\n          nodes.push({\n            kind: \"text\",\n            x: cell.x + 6,\n            y: cell.y + 22,\n            text: value,\n            font: valueFont,\n            color: ink,\n            align: \"left\",\n            baseline: \"top\",\n            hit: b.leaf,\n          });\n      }\n      if (b.target > 0) {\n        const percent = rootTotal > 0 ? b.target / rootTotal : 0;\n        items.push({\n          index: b.leaf,\n          name: b.node.name,\n          value: b.target,\n          percent,\n          share: c.percent(percent),\n          color: css,\n          path: b.path,\n          x: cell.x + cell.width / 2,\n          y: cell.y + cell.height / 2,\n          rows: [\n            { name: c.labels.value, value: c.format(b.target) },\n            { name: c.labels.share, value: c.percent(percent) },\n          ],\n        });\n      }\n    });\n  };\n  level(tree, area, null);\n  items.sort((a, b) => a.index - b.index);\n\n  const enter = clamp(c.enter, 0, 1);\n  return {\n    nodes,\n    items,\n    dim: 0.55,\n    empty: false,\n    ...(enter < 1\n      ? {\n          enter: {\n            alpha: enter,\n            scale: 0.94 + 0.06 * enter,\n            cx: area.x + area.width / 2,\n            cy: area.y + area.height / 2,\n          },\n        }\n      : {}),\n  };\n};\n"],"mappings":";;;;AAyBA,IAAMA,IAAS,IAMFC,KACX,GACA,MACgB;CAChB,IAAMC,IAAmBC,EAAO,WAAW;EACzC,GAAGC,EAAK;EACR,GAAGA,EAAK;EACR,OAAO;EACP,QAAQ;CACV,EAAE,GACIC,IAAQC,EAAIH,EAAO,KAAK,MAAM,KAAK,IAAI,GAAGI,CAAC,CAAC,CAAC;CACnD,IAAIF,KAAS,KAAKD,EAAK,SAAS,KAAKA,EAAK,UAAU,GAAG,OAAOF;CAC9D,IAAMM,IAASJ,EAAK,QAAQA,EAAK,SAAUC,GACrCI,IAAQN,EAAO,KAAK,MAAM,KAAK,IAAI,GAAGI,CAAC,IAAIC,CAAK,GAClD,EAAE,MAAG,MAAG,OAAOE,GAAG,QAAQC,MAAMP,GAE9BQ,KAAS,GAAW,GAAa,GAAa,MAAiB;EACnE,IAAMC,IAAKC,IAAIA,GACTC,IAAQC,IAAOA;EACrB,OAAO,KAAK,IAAKD,IAAQE,IAAOJ,GAAIA,KAAME,IAAQG,EAAI;CACxD,GACMC,KAAS,GAAe,MAAc;EAC1C,IAAIT,KAAKC,GAAG;GACV,IAAMS,IAAKT,IAAI,IAAI,KAAK,IAAID,GAAGI,IAAIH,CAAC,IAAI,GACpCU,IAAKC;GACT,KAAK,IAAMC,KAAKC,GAAK;IACnB,IAAMC,IAAKL,IAAK,IAAIX,EAAMc,KAAKH,IAAK;IAEpC,AADA,EAAIG,KAAK;KAAE;KAAG,GAAGF;KAAI,OAAOD;KAAI,QAAQK;IAAG,GAC3C,KAAMA;GACR;GAEA,AADA,KAAKL,GACL,IAAI,KAAK,IAAI,GAAGV,IAAIU,CAAE;EACxB,OAAO;GACL,IAAMM,IAAKhB,IAAI,IAAI,KAAK,IAAIC,GAAGG,IAAIJ,CAAC,IAAI,GACpCiB,IAAKC;GACT,KAAK,IAAML,KAAKC,GAAK;IACnB,IAAMK,IAAKH,IAAK,IAAIjB,EAAMc,KAAKG,IAAK;IAEpC,AADA,EAAIH,KAAK;KAAE,GAAGI;KAAI;KAAG,OAAOE;KAAI,QAAQH;IAAG,GAC3C,KAAMG;GACR;GAEA,AADA,KAAKH,GACL,IAAI,KAAK,IAAI,GAAGf,IAAIe,CAAE;EACxB;CACF,GAEIF,IAAgB,CAAC,GACjBM,IAAS,GACTC,IAAS,UACTC,IAAS;CAyBb,OAxBAvB,EAAM,SAAS,GAAG,MAAM;EACtB,IAAI,OAAK,IACT;OAAIe,EAAI,QAAQ;IACd,IAAMR,IAAO,KAAK,IAAIN,GAAGC,CAAC;IAO1B,AANaC,EACXkB,IAASG,GACT,KAAK,IAAIF,GAAQE,CAAC,GAClB,KAAK,IAAID,GAAQC,CAAC,GAClBjB,CAEE,IAAOJ,EAAMkB,GAAQC,GAAQC,GAAQhB,CAAI,MAC3CG,EAAMK,GAAKM,CAAM,GACjB,IAAM,CAAC,GACP,IAAS,GACT,IAAS,UACT,IAAS;GAEb;GAIA,AAHAN,EAAI,KAAKD,CAAC,GACV,KAAUU,GACV,IAAS,KAAK,IAAIF,GAAQE,CAAC,GAC3B,IAAS,KAAK,IAAID,GAAQC,CAAC;EAJ3B;CAKF,CAAC,GACGT,EAAI,UAAQL,EAAMK,GAAKM,CAAM,GAC1B5B;AACT,GAcMgC,KACJ,GACA,MACY;CACZ,IAAIC,IAAY,GACVC,KACJ,GACA,GACA,GACA,MACY;EACZ,IAAMC,IAAOC,EAAWC,EAAM,KAAK,MAAOC,EAAG,IAAI,CAAC;EAClD,OAAOD,EAAM,KAAK,GAAM,MAAM;GAC5B,IAAME,IAAIC,EAAW,SAASC,IAAMC,GAC9BC,IAAM,GAAGC,EAAU,GAAGT,EAAKO,MAC3BG,IAAO,CAAC,GAAGL,GAAYM,EAAK,IAAI;GACtC,IAAIA,EAAK,UAAU,QAAQ;IACzB,IAAMC,IAAWb,EAAKY,EAAK,UAAUH,GAAKE,GAAMN,CAAC;IACjD,OAAO;KACL;KACA;KACA;KACA,KAAKA;KACL,MAAM;KACN,QAAQnC,EAAI2C,EAAS,KAAK,MAAOC,EAAG,MAAM,CAAC;KAC3C;IACF;GACF;GACA,OAAO;IACL;IACA;IACA;IACA,KAAKT;IACL,MAAM;IACN,QAAQU,EAAO,IAAIV,CAAC,IAAI,IAAIW,EAASJ,EAAK,KAAK;IAC/C,UAAU,CAAC;GACb;EACF,CAAC;CACH;CACA,OAAOZ,EAAKiB,EAAE,MAAM,IAAI,CAAC,GAAG,CAAC;AAC/B,GAEaC,KACX,GACA,GACA,MACG;CACH,IAAMC,KAAS,MACbhB,EAAM,SAAS,MAAM;EACnB,AAAIiB,EAAE,SAAS,SAAQD,EAAMC,EAAE,QAAQ,IAClCtD,EAAI,IAAIsD,EAAE,KAAKA,EAAE,MAAM;CAC9B,CAAC;CACH,EAAMtB,EAAMmB,GAAGF,CAAM,CAAC;AACxB,GAeMM,KAAU,GAAc,OAA0B;CACtD,GAAGC,EAAE,IAAIC;CACT,GAAGD,EAAE,IAAIC;CACT,OAAO,KAAK,IAAI,GAAGD,EAAE,QAAQ,IAAIC,CAAC;CAClC,QAAQ,KAAK,IAAI,GAAGD,EAAE,SAAS,IAAIC,CAAC;AACtC,IAEaC,KACX,GACA,MACiB;CACjB,IAAM,EAAE,UAAO,SAAM,YAAS,cAAWC,GACnCC,IAAO5B,EAAMmB,GAAGF,CAAM,GACtBY,IAAYzD,EAAIwD,EAAK,KAAK,MAAMN,EAAE,MAAM,CAAC,GAEzCQ,oBAAQ,IAAI,IAAmB,GAC/BC,KAAgB,MAAqB;EACzC,IAAM1D,IAAIiD,EAAE,SAAS,SACjBlD,EAAIkD,EAAE,SAAS,IAAIS,CAAY,CAAC,IAChC,KAAK,IAAI,GAAGJ,EAAE,MAAML,EAAE,KAAKA,EAAE,MAAM,CAAC;EAExC,OADAQ,EAAM,IAAIR,GAAGjD,CAAC,GACPA;CACT,GACM2D,IAAa5D,EAAIwD,EAAK,IAAIG,CAAY,CAAC;CAC7C,IAAIF,KAAa,KAAKG,KAAc,MAAM,OAAOC,EAAYN,CAAC;CAE9D,IAAMO,IAAM,KAAK,IAAI,GAAGC,EAAOhB,EAAE,KAAK,CAAC,CAAC,GAClCiB,IAAUjB,EAAE,YAAY,IACxBkB,IAAWC,EAAKC,GAAO,IAAI,GAAG,GAC9BC,IAAYF,EAAKC,GAAO,EAAE,GAC1BE,IAAaH,EAAKC,GAAO,IAAI,GAAG,GAChClC,IAAqB,CAAC,GACtBqC,IAAqB,CAAC,GAEtBC,IAAOC,EAAkBL,EAAM,UAAU,IAAI,IAE7CM,KAAS,GAAe,GAAiB,MAA6B;EAC1E,IAAMC,IAASC,EACZ,QAAQ,OAAOjB,EAAM,IAAIR,CAAC,KAAK,KAAK,IAAI,CAAC,CACzC,MAAM,GAAG,OAAOQ,EAAM,IAAIR,CAAC,KAAK,MAAMQ,EAAM,IAAI/B,CAAC,KAAK,EAAE,GACrDiD,IAAQjF,EACZ+E,EAAO,KAAK,MAAMhB,EAAM,IAAIR,CAAC,KAAK,CAAC,GACnCpD,CACF,GACM+E,IAAO,KAAK,IAAI,KAAM,KAAM,KAAK,IAAI,GAAGH,EAAO,SAAS,CAAC,CAAC;EAChE,EAAO,SAAS,GAAG,MAAM;GACvB,IAAMI,IAAO3B,EAAOyB,EAAMtC,IAAIwB,IAAM,CAAC;GACrC,IAAIgB,EAAK,QAAQ,KAAKA,EAAK,SAAS,GAAG;GACvC,IAAMC,IAAQC,IACV9B,EAAE,KAAK,QACL+B,EAAYd,GAAOjB,EAAE,KAAK,OAAO8B,CAAW,IAC5CE,EAAIF,GAAab,EAAM,YAAY7B,IAAIuC,CAAI,IAC7CtB,EAAE,MAAML,EAAE,KAAK,OAAOA,EAAE,GAAG;GAC/B,IAAIA,EAAE,SAAS,QAAQ;IACrB,IAAIiC,IAAUL;IACd,IAAId,KAAWc,EAAK,SAAS,MAAeA,EAAK,QAAQ,IAAI;KAC3D,EAAM,KAAK;MACT,MAAM;MACN,GAAGA,EAAK;MACR,GAAGA,EAAK;MACR,OAAOA,EAAK;MACZ,QAAQA,EAAK;MACb,QAAQ;MACR,MAAMM,EAAML,GAAO,GAAI;KACzB,CAAC;KACD,IAAMM,IAAQC,EACZpC,EAAE,KAAK,MACP4B,EAAK,QAAQ,IACbT,GACAkB,CACF;KAYA,AAXIF,KACFpD,EAAM,KAAK;MACT,MAAM;MACN,GAAG6C,EAAK,IAAI;MACZ,GAAGA,EAAK,IAAIpF,IAAS,IAAI;MACzB,MAAM2F;MACN,MAAMhB;MACN,OAAOe,EAAMjB,EAAM,MAAM,GAAI;MAC7B,OAAO;MACP,UAAU;KACZ,CAAC,GACH,IAAU;MACR,GAAGW,EAAK,IAAI;MACZ,GAAGA,EAAK,IAAIpF;MACZ,OAAOoF,EAAK,QAAQ;MACpB,QAAQA,EAAK,SAASpF,IAAS;KACjC;IACF;IACA,EAAMwD,EAAE,UAAUiC,GAASJ,CAAK;IAChC;GACF;GACA,IAAMS,IAAOC,EACXlB,IAAOW,EAAIH,GAAOZ,EAAM,YAAY,GAAI,IAAIY,CAC9C,GACMW,IAAMN,EAAMI,CAAI;GAYtB,IAXAvD,EAAM,KAAK;IACT,MAAM;IACN,GAAG6C,EAAK;IACR,GAAGA,EAAK;IACR,OAAOA,EAAK;IACZ,QAAQA,EAAK;IACb,QAAQ,KAAK,IAAI,GAAGA,EAAK,QAAQ,GAAGA,EAAK,SAAS,CAAC;IACnD,MAAMY;IACN,KAAKxC,EAAE;IACP,UAAU;GACZ,CAAC,GACG4B,EAAK,SAAS,MAAMA,EAAK,UAAU,IAAI;IACzC,IAAMa,IAAMC,EAAOJ,CAAI,GACjBK,IAAOP,EAAUpC,EAAE,KAAK,MAAM4B,EAAK,QAAQ,IAAIb,GAAUsB,CAAO;IACtE,AAAIM,KACF5D,EAAM,KAAK;KACT,MAAM;KACN,GAAG6C,EAAK,IAAI;KACZ,GAAGA,EAAK,IAAI;KACZ,MAAMe;KACN,MAAM5B;KACN,OAAO0B;KACP,OAAO;KACP,UAAU;KACV,KAAKzC,EAAE;IACT,CAAC;IACH,IAAM4C,IAAQvC,EAAE,OAAOL,EAAE,MAAM;IAC/B,AACE2C,KACAf,EAAK,UAAU,MACfS,EAAQO,GAAO1B,CAAS,KAAKU,EAAK,QAAQ,MAE1C7C,EAAM,KAAK;KACT,MAAM;KACN,GAAG6C,EAAK,IAAI;KACZ,GAAGA,EAAK,IAAI;KACZ,MAAMgB;KACN,MAAM1B;KACN,OAAOuB;KACP,OAAO;KACP,UAAU;KACV,KAAKzC,EAAE;IACT,CAAC;GACL;GACA,IAAIA,EAAE,SAAS,GAAG;IAChB,IAAM6C,IAAUtC,IAAY,IAAIP,EAAE,SAASO,IAAY;IACvD,EAAM,KAAK;KACT,OAAOP,EAAE;KACT,MAAMA,EAAE,KAAK;KACb,OAAOA,EAAE;KACT;KACA,OAAOK,EAAE,QAAQwC,CAAO;KACxB,OAAOL;KACP,MAAMxC,EAAE;KACR,GAAG4B,EAAK,IAAIA,EAAK,QAAQ;KACzB,GAAGA,EAAK,IAAIA,EAAK,SAAS;KAC1B,MAAM,CACJ;MAAE,MAAMvB,EAAE,OAAO;MAAO,OAAOA,EAAE,OAAOL,EAAE,MAAM;KAAE,GAClD;MAAE,MAAMK,EAAE,OAAO;MAAO,OAAOA,EAAE,QAAQwC,CAAO;KAAE,CACpD;IACF,CAAC;GACH;EACF,CAAC;CACH;CAEA,AADAtB,EAAMjB,GAAMwC,GAAM,IAAI,GACtB1B,EAAM,MAAM,GAAG,MAAM3C,EAAE,QAAQuB,EAAE,KAAK;CAEtC,IAAM+C,IAAQC,EAAM3C,EAAE,OAAO,GAAG,CAAC;CACjC,OAAO;EACL;EACA;EACA,KAAK;EACL,OAAO;EACP,GAAI0C,IAAQ,IACR,EACE,OAAO;GACL,OAAOA;GACP,OAAO,MAAO,MAAOA;GACrB,IAAID,EAAK,IAAIA,EAAK,QAAQ;GAC1B,IAAIA,EAAK,IAAIA,EAAK,SAAS;EAC7B,EACF,IACA,CAAC;CACP;AACF"}