@dpuse/dpuse-tool-d3-visualiser 0.0.33 → 0.0.41

package/dist/treeDiagram-DemHfVnX.js

@@ -1,277 +0,0 @@
-import { t as e } from "./select-BIuoFcZG.js";
-import { t } from "./link-DKK0Q0lG.js";
-//#region node_modules/d3-hierarchy/src/hierarchy/count.js
-function n(e) {
-	var t = 0, n = e.children, r = n && n.length;
-	if (!r) t = 1;
-	else for (; --r >= 0;) t += n[r].value;
-	e.value = t;
-}
-function r() {
-	return this.eachAfter(n);
-}
-//#endregion
-//#region node_modules/d3-hierarchy/src/hierarchy/each.js
-function i(e, t) {
-	let n = -1;
-	for (let r of this) e.call(t, r, ++n, this);
-	return this;
-}
-//#endregion
-//#region node_modules/d3-hierarchy/src/hierarchy/eachBefore.js
-function a(e, t) {
-	for (var n = this, r = [n], i, a, o = -1; n = r.pop();) if (e.call(t, n, ++o, this), i = n.children) for (a = i.length - 1; a >= 0; --a) r.push(i[a]);
-	return this;
-}
-//#endregion
-//#region node_modules/d3-hierarchy/src/hierarchy/eachAfter.js
-function o(e, t) {
-	for (var n = this, r = [n], i = [], a, o, s, c = -1; n = r.pop();) if (i.push(n), a = n.children) for (o = 0, s = a.length; o < s; ++o) r.push(a[o]);
-	for (; n = i.pop();) e.call(t, n, ++c, this);
-	return this;
-}
-//#endregion
-//#region node_modules/d3-hierarchy/src/hierarchy/find.js
-function s(e, t) {
-	let n = -1;
-	for (let r of this) if (e.call(t, r, ++n, this)) return r;
-}
-//#endregion
-//#region node_modules/d3-hierarchy/src/hierarchy/sum.js
-function c(e) {
-	return this.eachAfter(function(t) {
-		for (var n = +e(t.data) || 0, r = t.children, i = r && r.length; --i >= 0;) n += r[i].value;
-		t.value = n;
-	});
-}
-//#endregion
-//#region node_modules/d3-hierarchy/src/hierarchy/sort.js
-function l(e) {
-	return this.eachBefore(function(t) {
-		t.children && t.children.sort(e);
-	});
-}
-//#endregion
-//#region node_modules/d3-hierarchy/src/hierarchy/path.js
-function u(e) {
-	for (var t = this, n = d(t, e), r = [t]; t !== n;) t = t.parent, r.push(t);
-	for (var i = r.length; e !== n;) r.splice(i, 0, e), e = e.parent;
-	return r;
-}
-function d(e, t) {
-	if (e === t) return e;
-	var n = e.ancestors(), r = t.ancestors(), i = null;
-	for (e = n.pop(), t = r.pop(); e === t;) i = e, e = n.pop(), t = r.pop();
-	return i;
-}
-//#endregion
-//#region node_modules/d3-hierarchy/src/hierarchy/ancestors.js
-function f() {
-	for (var e = this, t = [e]; e = e.parent;) t.push(e);
-	return t;
-}
-//#endregion
-//#region node_modules/d3-hierarchy/src/hierarchy/descendants.js
-function p() {
-	return Array.from(this);
-}
-//#endregion
-//#region node_modules/d3-hierarchy/src/hierarchy/leaves.js
-function m() {
-	var e = [];
-	return this.eachBefore(function(t) {
-		t.children || e.push(t);
-	}), e;
-}
-//#endregion
-//#region node_modules/d3-hierarchy/src/hierarchy/links.js
-function h() {
-	var e = this, t = [];
-	return e.each(function(n) {
-		n !== e && t.push({
-			source: n.parent,
-			target: n
-		});
-	}), t;
-}
-//#endregion
-//#region node_modules/d3-hierarchy/src/hierarchy/iterator.js
-function* g() {
-	var e = this, t, n = [e], r, i, a;
-	do
-		for (t = n.reverse(), n = []; e = t.pop();) if (yield e, r = e.children) for (i = 0, a = r.length; i < a; ++i) n.push(r[i]);
-	while (n.length);
-}
-//#endregion
-//#region node_modules/d3-hierarchy/src/hierarchy/index.js
-function _(e, t) {
-	e instanceof Map ? (e = [void 0, e], t === void 0 && (t = b)) : t === void 0 && (t = y);
-	for (var n = new C(e), r, i = [n], a, o, s, c; r = i.pop();) if ((o = t(r.data)) && (c = (o = Array.from(o)).length)) for (r.children = o, s = c - 1; s >= 0; --s) i.push(a = o[s] = new C(o[s])), a.parent = r, a.depth = r.depth + 1;
-	return n.eachBefore(S);
-}
-function v() {
-	return _(this).eachBefore(x);
-}
-function y(e) {
-	return e.children;
-}
-function b(e) {
-	return Array.isArray(e) ? e[1] : null;
-}
-function x(e) {
-	e.data.value !== void 0 && (e.value = e.data.value), e.data = e.data.data;
-}
-function S(e) {
-	var t = 0;
-	do
-		e.height = t;
-	while ((e = e.parent) && e.height < ++t);
-}
-function C(e) {
-	this.data = e, this.depth = this.height = 0, this.parent = null;
-}
-C.prototype = _.prototype = {
-	constructor: C,
-	count: r,
-	each: i,
-	eachAfter: o,
-	eachBefore: a,
-	find: s,
-	sum: c,
-	sort: l,
-	path: u,
-	ancestors: f,
-	descendants: p,
-	leaves: m,
-	links: h,
-	copy: v,
-	[Symbol.iterator]: g
-};
-//#endregion
-//#region node_modules/d3-hierarchy/src/tree.js
-function w(e, t) {
-	return e.parent === t.parent ? 1 : 2;
-}
-function T(e) {
-	var t = e.children;
-	return t ? t[0] : e.t;
-}
-function E(e) {
-	var t = e.children;
-	return t ? t[t.length - 1] : e.t;
-}
-function D(e, t, n) {
-	var r = n / (t.i - e.i);
-	t.c -= r, t.s += n, e.c += r, t.z += n, t.m += n;
-}
-function O(e) {
-	for (var t = 0, n = 0, r = e.children, i = r.length, a; --i >= 0;) a = r[i], a.z += t, a.m += t, t += a.s + (n += a.c);
-}
-function k(e, t, n) {
-	return e.a.parent === t.parent ? e.a : n;
-}
-function A(e, t) {
-	this._ = e, this.parent = null, this.children = null, this.A = null, this.a = this, this.z = 0, this.m = 0, this.c = 0, this.s = 0, this.t = null, this.i = t;
-}
-A.prototype = Object.create(C.prototype);
-function j(e) {
-	for (var t = new A(e, 0), n, r = [t], i, a, o, s; n = r.pop();) if (a = n._.children) for (n.children = Array(s = a.length), o = s - 1; o >= 0; --o) r.push(i = n.children[o] = new A(a[o], o)), i.parent = n;
-	return (t.parent = new A(null, 0)).children = [t], t;
-}
-function M() {
-	var e = w, t = 1, n = 1, r = null;
-	function i(i) {
-		var s = j(i);
-		if (s.eachAfter(a), s.parent.m = -s.z, s.eachBefore(o), r) i.eachBefore(c);
-		else {
-			var l = i, u = i, d = i;
-			i.eachBefore(function(e) {
-				e.x < l.x && (l = e), e.x > u.x && (u = e), e.depth > d.depth && (d = e);
-			});
-			var f = l === u ? 1 : e(l, u) / 2, p = f - l.x, m = t / (u.x + f + p), h = n / (d.depth || 1);
-			i.eachBefore(function(e) {
-				e.x = (e.x + p) * m, e.y = e.depth * h;
-			});
-		}
-		return i;
-	}
-	function a(t) {
-		var n = t.children, r = t.parent.children, i = t.i ? r[t.i - 1] : null;
-		if (n) {
-			O(t);
-			var a = (n[0].z + n[n.length - 1].z) / 2;
-			i ? (t.z = i.z + e(t._, i._), t.m = t.z - a) : t.z = a;
-		} else i && (t.z = i.z + e(t._, i._));
-		t.parent.A = s(t, i, t.parent.A || r[0]);
-	}
-	function o(e) {
-		e._.x = e.z + e.parent.m, e.m += e.parent.m;
-	}
-	function s(t, n, r) {
-		if (n) {
-			for (var i = t, a = t, o = n, s = i.parent.children[0], c = i.m, l = a.m, u = o.m, d = s.m, f; o = E(o), i = T(i), o && i;) s = T(s), a = E(a), a.a = t, f = o.z + u - i.z - c + e(o._, i._), f > 0 && (D(k(o, t, r), t, f), c += f, l += f), u += o.m, c += i.m, d += s.m, l += a.m;
-			o && !E(a) && (a.t = o, a.m += u - l), i && !T(s) && (s.t = i, s.m += c - d, r = t);
-		}
-		return r;
-	}
-	function c(e) {
-		e.x *= t, e.y = e.depth * n;
-	}
-	return i.separation = function(t) {
-		return arguments.length ? (e = t, i) : e;
-	}, i.size = function(e) {
-		return arguments.length ? (r = !1, t = +e[0], n = +e[1], i) : r ? null : [t, n];
-	}, i.nodeSize = function(e) {
-		return arguments.length ? (r = !0, t = +e[0], n = +e[1], i) : r ? [t, n] : null;
-	}, i;
-}
-//#endregion
-//#region src/treeDiagram.ts
-var N = 140, P = 40, F = 24, I = 50, L = 8, R = {
-	branch: {
-		fill: "#ffe6cc",
-		stroke: "#d79b00"
-	},
-	leaf: {
-		fill: "#dae8fc",
-		stroke: "#6c8ebf"
-	},
-	root: {
-		fill: "#d5e8d4",
-		stroke: "#82b366"
-	}
-};
-function z(n, r, i = {}) {
-	let a = i.nodeWidth ?? N, o = i.nodeHeight ?? P, s = i.siblingGap ?? F, c = i.levelGap ?? I, l = i.padding ?? L, u = i.nodeColors ?? R;
-	function d(e) {
-		return e.depth === 0 ? "root" : e.children ? "branch" : "leaf";
-	}
-	function f() {
-		e(r).selectAll("svg").remove();
-		let i = _(n, (e) => e.children), f = M().nodeSize([o + s, a + c]).separation(() => 1)(i);
-		f.eachAfter((e) => {
-			let [t] = e.children ?? [];
-			t && (e.x = t.x);
-		});
-		let p = f.descendants(), m = Math.min(...p.map((e) => e.y)) - a / 2, h = Math.max(...p.map((e) => e.y)) + a / 2, g = Math.min(...p.map((e) => e.x)) - o / 2, v = Math.max(...p.map((e) => e.x)) + o / 2, y = h - m + l * 2, b = v - g + l * 2, x = e(r).append("svg").attr("viewBox", `0 0 ${String(y)} ${String(b)}`).attr("width", y).attr("height", b), S = x.append("g").attr("transform", `translate(${String(l - m)}, ${String(l - g)})`), C = t().x((e) => e.y).y((e) => e.x);
-		S.append("g").attr("fill", "none").attr("stroke", "#999999").attr("stroke-width", 1.5).selectAll("path").data(f.links()).join("path").attr("d", C);
-		let w = S.append("g").selectAll("g").data(p).join("g").attr("transform", (e) => `translate(${String(e.y - a / 2)}, ${String(e.x - o / 2)})`);
-		w.append("rect").attr("width", a).attr("height", o).attr("rx", 6).attr("fill", (e) => u[d(e)].fill).attr("stroke", (e) => u[d(e)].stroke), w.append("text").attr("x", a / 2).attr("y", o / 2).attr("text-anchor", "middle").attr("dominant-baseline", "middle").attr("font-family", "Helvetica, Arial, sans-serif").attr("font-size", 12).attr("fill", "#000000").text((e) => e.data.label);
-		let T = x.node();
-		if (T == null) throw Error("Failed to create tree diagram SVG element.");
-		return T;
-	}
-	let p = f();
-	return {
-		resize: () => {
-			p = f();
-		},
-		get svg() {
-			return p;
-		}
-	};
-}
-//#endregion
-export { z as renderTreeDiagram };
-
-//# sourceMappingURL=treeDiagram-DemHfVnX.js.map

package/dist/treeDiagram-DemHfVnX.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"treeDiagram-DemHfVnX.js","names":["node_count","node_each","node_eachAfter","node_eachBefore","node_find","node_sum","node_sort","node_path","node_ancestors","node_descendants","node_leaves","node_links","node_iterator"],"sources":["../node_modules/d3-hierarchy/src/hierarchy/count.js","../node_modules/d3-hierarchy/src/hierarchy/each.js","../node_modules/d3-hierarchy/src/hierarchy/eachBefore.js","../node_modules/d3-hierarchy/src/hierarchy/eachAfter.js","../node_modules/d3-hierarchy/src/hierarchy/find.js","../node_modules/d3-hierarchy/src/hierarchy/sum.js","../node_modules/d3-hierarchy/src/hierarchy/sort.js","../node_modules/d3-hierarchy/src/hierarchy/path.js","../node_modules/d3-hierarchy/src/hierarchy/ancestors.js","../node_modules/d3-hierarchy/src/hierarchy/descendants.js","../node_modules/d3-hierarchy/src/hierarchy/leaves.js","../node_modules/d3-hierarchy/src/hierarchy/links.js","../node_modules/d3-hierarchy/src/hierarchy/iterator.js","../node_modules/d3-hierarchy/src/hierarchy/index.js","../node_modules/d3-hierarchy/src/tree.js","../src/treeDiagram.ts"],"sourcesContent":["function count(node) {\n  var sum = 0,\n      children = node.children,\n      i = children && children.length;\n  if (!i) sum = 1;\n  else while (--i >= 0) sum += children[i].value;\n  node.value = sum;\n}\n\nexport default function() {\n  return this.eachAfter(count);\n}\n","export default function(callback, that) {\n  let index = -1;\n  for (const node of this) {\n    callback.call(that, node, ++index, this);\n  }\n  return this;\n}\n","export default function(callback, that) {\n  var node = this, nodes = [node], children, i, index = -1;\n  while (node = nodes.pop()) {\n    callback.call(that, node, ++index, this);\n    if (children = node.children) {\n      for (i = children.length - 1; i >= 0; --i) {\n        nodes.push(children[i]);\n      }\n    }\n  }\n  return this;\n}\n","export default function(callback, that) {\n  var node = this, nodes = [node], next = [], children, i, n, index = -1;\n  while (node = nodes.pop()) {\n    next.push(node);\n    if (children = node.children) {\n      for (i = 0, n = children.length; i < n; ++i) {\n        nodes.push(children[i]);\n      }\n    }\n  }\n  while (node = next.pop()) {\n    callback.call(that, node, ++index, this);\n  }\n  return this;\n}\n","export default function(callback, that) {\n  let index = -1;\n  for (const node of this) {\n    if (callback.call(that, node, ++index, this)) {\n      return node;\n    }\n  }\n}\n","export default function(value) {\n  return this.eachAfter(function(node) {\n    var sum = +value(node.data) || 0,\n        children = node.children,\n        i = children && children.length;\n    while (--i >= 0) sum += children[i].value;\n    node.value = sum;\n  });\n}\n","export default function(compare) {\n  return this.eachBefore(function(node) {\n    if (node.children) {\n      node.children.sort(compare);\n    }\n  });\n}\n","export default function(end) {\n  var start = this,\n      ancestor = leastCommonAncestor(start, end),\n      nodes = [start];\n  while (start !== ancestor) {\n    start = start.parent;\n    nodes.push(start);\n  }\n  var k = nodes.length;\n  while (end !== ancestor) {\n    nodes.splice(k, 0, end);\n    end = end.parent;\n  }\n  return nodes;\n}\n\nfunction leastCommonAncestor(a, b) {\n  if (a === b) return a;\n  var aNodes = a.ancestors(),\n      bNodes = b.ancestors(),\n      c = null;\n  a = aNodes.pop();\n  b = bNodes.pop();\n  while (a === b) {\n    c = a;\n    a = aNodes.pop();\n    b = bNodes.pop();\n  }\n  return c;\n}\n","export default function() {\n  var node = this, nodes = [node];\n  while (node = node.parent) {\n    nodes.push(node);\n  }\n  return nodes;\n}\n","export default function() {\n  return Array.from(this);\n}\n","export default function() {\n  var leaves = [];\n  this.eachBefore(function(node) {\n    if (!node.children) {\n      leaves.push(node);\n    }\n  });\n  return leaves;\n}\n","export default function() {\n  var root = this, links = [];\n  root.each(function(node) {\n    if (node !== root) { // Don’t include the root’s parent, if any.\n      links.push({source: node.parent, target: node});\n    }\n  });\n  return links;\n}\n","export default function*() {\n  var node = this, current, next = [node], children, i, n;\n  do {\n    current = next.reverse(), next = [];\n    while (node = current.pop()) {\n      yield node;\n      if (children = node.children) {\n        for (i = 0, n = children.length; i < n; ++i) {\n          next.push(children[i]);\n        }\n      }\n    }\n  } while (next.length);\n}\n","import node_count from \"./count.js\";\nimport node_each from \"./each.js\";\nimport node_eachBefore from \"./eachBefore.js\";\nimport node_eachAfter from \"./eachAfter.js\";\nimport node_find from \"./find.js\";\nimport node_sum from \"./sum.js\";\nimport node_sort from \"./sort.js\";\nimport node_path from \"./path.js\";\nimport node_ancestors from \"./ancestors.js\";\nimport node_descendants from \"./descendants.js\";\nimport node_leaves from \"./leaves.js\";\nimport node_links from \"./links.js\";\nimport node_iterator from \"./iterator.js\";\n\nexport default function hierarchy(data, children) {\n  if (data instanceof Map) {\n    data = [undefined, data];\n    if (children === undefined) children = mapChildren;\n  } else if (children === undefined) {\n    children = objectChildren;\n  }\n\n  var root = new Node(data),\n      node,\n      nodes = [root],\n      child,\n      childs,\n      i,\n      n;\n\n  while (node = nodes.pop()) {\n    if ((childs = children(node.data)) && (n = (childs = Array.from(childs)).length)) {\n      node.children = childs;\n      for (i = n - 1; i >= 0; --i) {\n        nodes.push(child = childs[i] = new Node(childs[i]));\n        child.parent = node;\n        child.depth = node.depth + 1;\n      }\n    }\n  }\n\n  return root.eachBefore(computeHeight);\n}\n\nfunction node_copy() {\n  return hierarchy(this).eachBefore(copyData);\n}\n\nfunction objectChildren(d) {\n  return d.children;\n}\n\nfunction mapChildren(d) {\n  return Array.isArray(d) ? d[1] : null;\n}\n\nfunction copyData(node) {\n  if (node.data.value !== undefined) node.value = node.data.value;\n  node.data = node.data.data;\n}\n\nexport function computeHeight(node) {\n  var height = 0;\n  do node.height = height;\n  while ((node = node.parent) && (node.height < ++height));\n}\n\nexport function Node(data) {\n  this.data = data;\n  this.depth =\n  this.height = 0;\n  this.parent = null;\n}\n\nNode.prototype = hierarchy.prototype = {\n  constructor: Node,\n  count: node_count,\n  each: node_each,\n  eachAfter: node_eachAfter,\n  eachBefore: node_eachBefore,\n  find: node_find,\n  sum: node_sum,\n  sort: node_sort,\n  path: node_path,\n  ancestors: node_ancestors,\n  descendants: node_descendants,\n  leaves: node_leaves,\n  links: node_links,\n  copy: node_copy,\n  [Symbol.iterator]: node_iterator\n};\n","import {Node} from \"./hierarchy/index.js\";\n\nfunction defaultSeparation(a, b) {\n  return a.parent === b.parent ? 1 : 2;\n}\n\n// function radialSeparation(a, b) {\n//   return (a.parent === b.parent ? 1 : 2) / a.depth;\n// }\n\n// This function is used to traverse the left contour of a subtree (or\n// subforest). It returns the successor of v on this contour. This successor is\n// either given by the leftmost child of v or by the thread of v. The function\n// returns null if and only if v is on the highest level of its subtree.\nfunction nextLeft(v) {\n  var children = v.children;\n  return children ? children[0] : v.t;\n}\n\n// This function works analogously to nextLeft.\nfunction nextRight(v) {\n  var children = v.children;\n  return children ? children[children.length - 1] : v.t;\n}\n\n// Shifts the current subtree rooted at w+. This is done by increasing\n// prelim(w+) and mod(w+) by shift.\nfunction moveSubtree(wm, wp, shift) {\n  var change = shift / (wp.i - wm.i);\n  wp.c -= change;\n  wp.s += shift;\n  wm.c += change;\n  wp.z += shift;\n  wp.m += shift;\n}\n\n// All other shifts, applied to the smaller subtrees between w- and w+, are\n// performed by this function. To prepare the shifts, we have to adjust\n// change(w+), shift(w+), and change(w-).\nfunction executeShifts(v) {\n  var shift = 0,\n      change = 0,\n      children = v.children,\n      i = children.length,\n      w;\n  while (--i >= 0) {\n    w = children[i];\n    w.z += shift;\n    w.m += shift;\n    shift += w.s + (change += w.c);\n  }\n}\n\n// If vi-’s ancestor is a sibling of v, returns vi-’s ancestor. Otherwise,\n// returns the specified (default) ancestor.\nfunction nextAncestor(vim, v, ancestor) {\n  return vim.a.parent === v.parent ? vim.a : ancestor;\n}\n\nfunction TreeNode(node, i) {\n  this._ = node;\n  this.parent = null;\n  this.children = null;\n  this.A = null; // default ancestor\n  this.a = this; // ancestor\n  this.z = 0; // prelim\n  this.m = 0; // mod\n  this.c = 0; // change\n  this.s = 0; // shift\n  this.t = null; // thread\n  this.i = i; // number\n}\n\nTreeNode.prototype = Object.create(Node.prototype);\n\nfunction treeRoot(root) {\n  var tree = new TreeNode(root, 0),\n      node,\n      nodes = [tree],\n      child,\n      children,\n      i,\n      n;\n\n  while (node = nodes.pop()) {\n    if (children = node._.children) {\n      node.children = new Array(n = children.length);\n      for (i = n - 1; i >= 0; --i) {\n        nodes.push(child = node.children[i] = new TreeNode(children[i], i));\n        child.parent = node;\n      }\n    }\n  }\n\n  (tree.parent = new TreeNode(null, 0)).children = [tree];\n  return tree;\n}\n\n// Node-link tree diagram using the Reingold-Tilford \"tidy\" algorithm\nexport default function() {\n  var separation = defaultSeparation,\n      dx = 1,\n      dy = 1,\n      nodeSize = null;\n\n  function tree(root) {\n    var t = treeRoot(root);\n\n    // Compute the layout using Buchheim et al.’s algorithm.\n    t.eachAfter(firstWalk), t.parent.m = -t.z;\n    t.eachBefore(secondWalk);\n\n    // If a fixed node size is specified, scale x and y.\n    if (nodeSize) root.eachBefore(sizeNode);\n\n    // If a fixed tree size is specified, scale x and y based on the extent.\n    // Compute the left-most, right-most, and depth-most nodes for extents.\n    else {\n      var left = root,\n          right = root,\n          bottom = root;\n      root.eachBefore(function(node) {\n        if (node.x < left.x) left = node;\n        if (node.x > right.x) right = node;\n        if (node.depth > bottom.depth) bottom = node;\n      });\n      var s = left === right ? 1 : separation(left, right) / 2,\n          tx = s - left.x,\n          kx = dx / (right.x + s + tx),\n          ky = dy / (bottom.depth || 1);\n      root.eachBefore(function(node) {\n        node.x = (node.x + tx) * kx;\n        node.y = node.depth * ky;\n      });\n    }\n\n    return root;\n  }\n\n  // Computes a preliminary x-coordinate for v. Before that, FIRST WALK is\n  // applied recursively to the children of v, as well as the function\n  // APPORTION. After spacing out the children by calling EXECUTE SHIFTS, the\n  // node v is placed to the midpoint of its outermost children.\n  function firstWalk(v) {\n    var children = v.children,\n        siblings = v.parent.children,\n        w = v.i ? siblings[v.i - 1] : null;\n    if (children) {\n      executeShifts(v);\n      var midpoint = (children[0].z + children[children.length - 1].z) / 2;\n      if (w) {\n        v.z = w.z + separation(v._, w._);\n        v.m = v.z - midpoint;\n      } else {\n        v.z = midpoint;\n      }\n    } else if (w) {\n      v.z = w.z + separation(v._, w._);\n    }\n    v.parent.A = apportion(v, w, v.parent.A || siblings[0]);\n  }\n\n  // Computes all real x-coordinates by summing up the modifiers recursively.\n  function secondWalk(v) {\n    v._.x = v.z + v.parent.m;\n    v.m += v.parent.m;\n  }\n\n  // The core of the algorithm. Here, a new subtree is combined with the\n  // previous subtrees. Threads are used to traverse the inside and outside\n  // contours of the left and right subtree up to the highest common level. The\n  // vertices used for the traversals are vi+, vi-, vo-, and vo+, where the\n  // superscript o means outside and i means inside, the subscript - means left\n  // subtree and + means right subtree. For summing up the modifiers along the\n  // contour, we use respective variables si+, si-, so-, and so+. Whenever two\n  // nodes of the inside contours conflict, we compute the left one of the\n  // greatest uncommon ancestors using the function ANCESTOR and call MOVE\n  // SUBTREE to shift the subtree and prepare the shifts of smaller subtrees.\n  // Finally, we add a new thread (if necessary).\n  function apportion(v, w, ancestor) {\n    if (w) {\n      var vip = v,\n          vop = v,\n          vim = w,\n          vom = vip.parent.children[0],\n          sip = vip.m,\n          sop = vop.m,\n          sim = vim.m,\n          som = vom.m,\n          shift;\n      while (vim = nextRight(vim), vip = nextLeft(vip), vim && vip) {\n        vom = nextLeft(vom);\n        vop = nextRight(vop);\n        vop.a = v;\n        shift = vim.z + sim - vip.z - sip + separation(vim._, vip._);\n        if (shift > 0) {\n          moveSubtree(nextAncestor(vim, v, ancestor), v, shift);\n          sip += shift;\n          sop += shift;\n        }\n        sim += vim.m;\n        sip += vip.m;\n        som += vom.m;\n        sop += vop.m;\n      }\n      if (vim && !nextRight(vop)) {\n        vop.t = vim;\n        vop.m += sim - sop;\n      }\n      if (vip && !nextLeft(vom)) {\n        vom.t = vip;\n        vom.m += sip - som;\n        ancestor = v;\n      }\n    }\n    return ancestor;\n  }\n\n  function sizeNode(node) {\n    node.x *= dx;\n    node.y = node.depth * dy;\n  }\n\n  tree.separation = function(x) {\n    return arguments.length ? (separation = x, tree) : separation;\n  };\n\n  tree.size = function(x) {\n    return arguments.length ? (nodeSize = false, dx = +x[0], dy = +x[1], tree) : (nodeSize ? null : [dx, dy]);\n  };\n\n  tree.nodeSize = function(x) {\n    return arguments.length ? (nodeSize = true, dx = +x[0], dy = +x[1], tree) : (nodeSize ? [dx, dy] : null);\n  };\n\n  return tree;\n}\n","// ── External Dependencies & Registrations\nimport { linkHorizontal } from 'd3-shape';\nimport { select } from 'd3-selection';\nimport { hierarchy, type HierarchyPointLink, type HierarchyPointNode, tree } from 'd3-hierarchy';\n\n// ── Types ────────────────────────────────────────────────────────────────────────────────────────────────────────────\n\nexport type TreeDiagramNodeRoleId = 'branch' | 'leaf' | 'root';\n\nexport interface TreeDiagramNode {\n    children?: TreeDiagramNode[];\n    id: string;\n    label: string;\n}\n\nexport interface TreeDiagramOptions {\n    levelGap?: number;\n    nodeColors?: Record<TreeDiagramNodeRoleId, { fill: string; stroke: string }>;\n    nodeHeight?: number;\n    nodeWidth?: number;\n    padding?: number;\n    siblingGap?: number;\n}\n\nexport interface TreeDiagramHandle {\n    resize: () => void;\n    svg: SVGSVGElement;\n}\n\n// ── Constants ────────────────────────────────────────────────────────────────────────────────────────────────────────\n\nconst DEFAULT_NODE_WIDTH = 140;\nconst DEFAULT_NODE_HEIGHT = 40;\nconst DEFAULT_SIBLING_GAP = 24;\nconst DEFAULT_LEVEL_GAP = 50;\nconst DEFAULT_PADDING = 8;\nconst DEFAULT_NODE_COLORS: Record<TreeDiagramNodeRoleId, { fill: string; stroke: string }> = {\n    branch: { fill: '#ffe6cc', stroke: '#d79b00' },\n    leaf: { fill: '#dae8fc', stroke: '#6c8ebf' },\n    root: { fill: '#d5e8d4', stroke: '#82b366' }\n};\n\n// ── Actions ──────────────────────────────────────────────────────────────────────────────────────────────────────────\n\nexport function renderTreeDiagram(data: TreeDiagramNode, renderTo: HTMLElement, options: TreeDiagramOptions = {}): TreeDiagramHandle {\n    const nodeWidth = options.nodeWidth ?? DEFAULT_NODE_WIDTH;\n    const nodeHeight = options.nodeHeight ?? DEFAULT_NODE_HEIGHT;\n    const siblingGap = options.siblingGap ?? DEFAULT_SIBLING_GAP;\n    const levelGap = options.levelGap ?? DEFAULT_LEVEL_GAP;\n    const padding = options.padding ?? DEFAULT_PADDING;\n    const nodeColors = options.nodeColors ?? DEFAULT_NODE_COLORS;\n\n    function getNodeRole(node: HierarchyPointNode<TreeDiagramNode>): TreeDiagramNodeRoleId {\n        if (node.depth === 0) return 'root';\n        return node.children ? 'branch' : 'leaf';\n    }\n\n    function draw(): SVGSVGElement {\n        select(renderTo).selectAll('svg').remove();\n\n        const root = hierarchy(data, (node) => node.children);\n        const treeLayout = tree<TreeDiagramNode>()\n            .nodeSize([nodeHeight + siblingGap, nodeWidth + levelGap])\n            .separation(() => 1);\n        const treeRoot = treeLayout(root);\n\n        // Align each parent with its first child (instead of d3's default centering over all children) so the root sits at the top and the tree cascades downward.\n        treeRoot.eachAfter((node) => {\n            const [firstChild] = node.children ?? [];\n            if (!firstChild) return;\n            node.x = firstChild.x;\n        });\n\n        const treeNodes = treeRoot.descendants();\n\n        // Screen axes are swapped for a left-to-right tree: node.y (depth) drives horizontal position, node.x (sibling spread) drives vertical.\n        const minX = Math.min(...treeNodes.map((node) => node.y)) - nodeWidth / 2;\n        const maxX = Math.max(...treeNodes.map((node) => node.y)) + nodeWidth / 2;\n        const minY = Math.min(...treeNodes.map((node) => node.x)) - nodeHeight / 2;\n        const maxY = Math.max(...treeNodes.map((node) => node.x)) + nodeHeight / 2;\n\n        const viewBoxWidth = maxX - minX + padding * 2;\n        const viewBoxHeight = maxY - minY + padding * 2;\n\n        const svgSelection = select(renderTo)\n            .append('svg')\n            .attr('viewBox', `0 0 ${String(viewBoxWidth)} ${String(viewBoxHeight)}`)\n            .attr('width', viewBoxWidth)\n            .attr('height', viewBoxHeight);\n\n        const canvas = svgSelection.append('g').attr('transform', `translate(${String(padding - minX)}, ${String(padding - minY)})`);\n\n        const linkGenerator = linkHorizontal<HierarchyPointLink<TreeDiagramNode>, HierarchyPointNode<TreeDiagramNode>>()\n            .x((node) => node.y)\n            .y((node) => node.x);\n\n        canvas.append('g').attr('fill', 'none').attr('stroke', '#999999').attr('stroke-width', 1.5).selectAll('path').data(treeRoot.links()).join('path').attr('d', linkGenerator);\n\n        const nodeGroups = canvas\n            .append('g')\n            .selectAll('g')\n            .data(treeNodes)\n            .join('g')\n            .attr('transform', (node) => `translate(${String(node.y - nodeWidth / 2)}, ${String(node.x - nodeHeight / 2)})`);\n\n        nodeGroups\n            .append('rect')\n            .attr('width', nodeWidth)\n            .attr('height', nodeHeight)\n            .attr('rx', 6)\n            .attr('fill', (node) => nodeColors[getNodeRole(node)].fill)\n            .attr('stroke', (node) => nodeColors[getNodeRole(node)].stroke);\n\n        nodeGroups\n            .append('text')\n            .attr('x', nodeWidth / 2)\n            .attr('y', nodeHeight / 2)\n            .attr('text-anchor', 'middle')\n            .attr('dominant-baseline', 'middle')\n            .attr('font-family', 'Helvetica, Arial, sans-serif')\n            .attr('font-size', 12)\n            .attr('fill', '#000000')\n            .text((node) => node.data.label);\n\n        const svgNode = svgSelection.node();\n        if (svgNode == null) throw new Error('Failed to create tree diagram SVG element.');\n        return svgNode;\n    }\n\n    let svg = draw();\n\n    return {\n        resize: () => {\n            svg = draw();\n        },\n        get svg() {\n            return svg;\n        }\n    };\n}\n"],"x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"mappings":";;;AAAA,SAAS,EAAM,GAAM;CACnB,IAAI,IAAM,GACN,IAAW,EAAK,UAChB,IAAI,KAAY,EAAS;CAC7B,IAAI,CAAC,GAAG,IAAM;MACT,OAAO,EAAE,KAAK,IAAG,KAAO,EAAS,EAAE,CAAC;CACzC,EAAK,QAAQ;AACf;AAEA,SAAA,IAA0B;CACxB,OAAO,KAAK,UAAU,CAAK;AAC7B;;;ACXA,SAAA,EAAwB,GAAU,GAAM;CACtC,IAAI,IAAQ;CACZ,KAAK,IAAM,KAAQ,MACjB,EAAS,KAAK,GAAM,GAAM,EAAE,GAAO,IAAI;CAEzC,OAAO;AACT;;;ACNA,SAAA,EAAwB,GAAU,GAAM;CAEtC,KADA,IAAI,IAAO,MAAM,IAAQ,CAAC,CAAI,GAAG,GAAU,GAAG,IAAQ,IAC/C,IAAO,EAAM,IAAI,IAEtB,IADA,EAAS,KAAK,GAAM,GAAM,EAAE,GAAO,IAAI,GACnC,IAAW,EAAK,UAClB,KAAK,IAAI,EAAS,SAAS,GAAG,KAAK,GAAG,EAAE,GACtC,EAAM,KAAK,EAAS,EAAE;CAI5B,OAAO;AACT;;;ACXA,SAAA,EAAwB,GAAU,GAAM;CAEtC,KADA,IAAI,IAAO,MAAM,IAAQ,CAAC,CAAI,GAAG,IAAO,CAAC,GAAG,GAAU,GAAG,GAAG,IAAQ,IAC7D,IAAO,EAAM,IAAI,IAEtB,IADA,EAAK,KAAK,CAAI,GACV,IAAW,EAAK,UAClB,KAAK,IAAI,GAAG,IAAI,EAAS,QAAQ,IAAI,GAAG,EAAE,GACxC,EAAM,KAAK,EAAS,EAAE;CAI5B,OAAO,IAAO,EAAK,IAAI,IACrB,EAAS,KAAK,GAAM,GAAM,EAAE,GAAO,IAAI;CAEzC,OAAO;AACT;;;ACdA,SAAA,EAAwB,GAAU,GAAM;CACtC,IAAI,IAAQ;CACZ,KAAK,IAAM,KAAQ,MACjB,IAAI,EAAS,KAAK,GAAM,GAAM,EAAE,GAAO,IAAI,GACzC,OAAO;AAGb;;;ACPA,SAAA,EAAwB,GAAO;CAC7B,OAAO,KAAK,UAAU,SAAS,GAAM;EAInC,KAHA,IAAI,IAAM,CAAC,EAAM,EAAK,IAAI,KAAK,GAC3B,IAAW,EAAK,UAChB,IAAI,KAAY,EAAS,QACtB,EAAE,KAAK,IAAG,KAAO,EAAS,EAAE,CAAC;EACpC,EAAK,QAAQ;CACf,CAAC;AACH;;;ACRA,SAAA,EAAwB,GAAS;CAC/B,OAAO,KAAK,WAAW,SAAS,GAAM;EACpC,AAAI,EAAK,YACP,EAAK,SAAS,KAAK,CAAO;CAE9B,CAAC;AACH;;;ACNA,SAAA,EAAwB,GAAK;CAI3B,KAHA,IAAI,IAAQ,MACR,IAAW,EAAoB,GAAO,CAAG,GACzC,IAAQ,CAAC,CAAK,GACX,MAAU,IAEf,AADA,IAAQ,EAAM,QACd,EAAM,KAAK,CAAK;CAGlB,KADA,IAAI,IAAI,EAAM,QACP,MAAQ,IAEb,AADA,EAAM,OAAO,GAAG,GAAG,CAAG,GACtB,IAAM,EAAI;CAEZ,OAAO;AACT;AAEA,SAAS,EAAoB,GAAG,GAAG;CACjC,IAAI,MAAM,GAAG,OAAO;CACpB,IAAI,IAAS,EAAE,UAAU,GACrB,IAAS,EAAE,UAAU,GACrB,IAAI;CAGR,KAFA,IAAI,EAAO,IAAI,GACf,IAAI,EAAO,IAAI,GACR,MAAM,IAGX,AAFA,IAAI,GACJ,IAAI,EAAO,IAAI,GACf,IAAI,EAAO,IAAI;CAEjB,OAAO;AACT;;;AC7BA,SAAA,IAA0B;CAExB,KADA,IAAI,IAAO,MAAM,IAAQ,CAAC,CAAI,GACvB,IAAO,EAAK,SACjB,EAAM,KAAK,CAAI;CAEjB,OAAO;AACT;;;ACNA,SAAA,IAA0B;CACxB,OAAO,MAAM,KAAK,IAAI;AACxB;;;ACFA,SAAA,IAA0B;CACxB,IAAI,IAAS,CAAC;CAMd,OALA,KAAK,WAAW,SAAS,GAAM;EAC7B,AAAK,EAAK,YACR,EAAO,KAAK,CAAI;CAEpB,CAAC,GACM;AACT;;;ACRA,SAAA,IAA0B;CACxB,IAAI,IAAO,MAAM,IAAQ,CAAC;CAM1B,OALA,EAAK,KAAK,SAAS,GAAM;EACvB,AAAI,MAAS,KACX,EAAM,KAAK;GAAC,QAAQ,EAAK;GAAQ,QAAQ;EAAI,CAAC;CAElD,CAAC,GACM;AACT;;;ACRA,UAAA,IAA2B;CACzB,IAAI,IAAO,MAAM,GAAS,IAAO,CAAC,CAAI,GAAG,GAAU,GAAG;CACtD;EAEE,KADA,IAAU,EAAK,QAAQ,GAAG,IAAO,CAAC,GAC3B,IAAO,EAAQ,IAAI,IAExB,IADA,MAAM,GACF,IAAW,EAAK,UAClB,KAAK,IAAI,GAAG,IAAI,EAAS,QAAQ,IAAI,GAAG,EAAE,GACxC,EAAK,KAAK,EAAS,EAAE;QAIpB,EAAK;AAChB;;;ACCA,SAAwB,EAAU,GAAM,GAAU;CAChD,AAAI,aAAgB,OAClB,IAAO,CAAC,KAAA,GAAW,CAAI,GACnB,MAAa,KAAA,MAAW,IAAW,MAC9B,MAAa,KAAA,MACtB,IAAW;CAWb,KARA,IAAI,IAAO,IAAI,EAAK,CAAI,GACpB,GACA,IAAQ,CAAC,CAAI,GACb,GACA,GACA,GACA,GAEG,IAAO,EAAM,IAAI,IACtB,KAAK,IAAS,EAAS,EAAK,IAAI,OAAO,KAAK,IAAS,MAAM,KAAK,CAAM,EAAA,CAAG,SAEvE,KADA,EAAK,WAAW,GACX,IAAI,IAAI,GAAG,KAAK,GAAG,EAAE,GAGxB,AAFA,EAAM,KAAK,IAAQ,EAAO,KAAK,IAAI,EAAK,EAAO,EAAE,CAAC,GAClD,EAAM,SAAS,GACf,EAAM,QAAQ,EAAK,QAAQ;CAKjC,OAAO,EAAK,WAAW,CAAa;AACtC;AAEA,SAAS,IAAY;CACnB,OAAO,EAAU,IAAI,CAAC,CAAC,WAAW,CAAQ;AAC5C;AAEA,SAAS,EAAe,GAAG;CACzB,OAAO,EAAE;AACX;AAEA,SAAS,EAAY,GAAG;CACtB,OAAO,MAAM,QAAQ,CAAC,IAAI,EAAE,KAAK;AACnC;AAEA,SAAS,EAAS,GAAM;CAEtB,AADI,EAAK,KAAK,UAAU,KAAA,MAAW,EAAK,QAAQ,EAAK,KAAK,QAC1D,EAAK,OAAO,EAAK,KAAK;AACxB;AAEA,SAAgB,EAAc,GAAM;CAClC,IAAI,IAAS;CACb;EAAG,EAAK,SAAS;SACT,IAAO,EAAK,WAAY,EAAK,SAAS,EAAE;AAClD;AAEA,SAAgB,EAAK,GAAM;CAIzB,AAHA,KAAK,OAAO,GACZ,KAAK,QACL,KAAK,SAAS,GACd,KAAK,SAAS;AAChB;AAEA,EAAK,YAAY,EAAU,YAAY;CACrC,aAAa;CACb,OAAOA;CACP,MAAMC;CACN,WAAWC;CACX,YAAYC;CACZ,MAAMC;CACN,KAAKC;CACL,MAAMC;CACN,MAAMC;CACN,WAAWC;CACX,aAAaC;CACb,QAAQC;CACR,OAAOC;CACP,MAAM;EACL,OAAO,WAAWC;AACrB;;;ACxFA,SAAS,EAAkB,GAAG,GAAG;CAC/B,OAAO,EAAE,WAAW,EAAE,SAAS,IAAI;AACrC;AAUA,SAAS,EAAS,GAAG;CACnB,IAAI,IAAW,EAAE;CACjB,OAAO,IAAW,EAAS,KAAK,EAAE;AACpC;AAGA,SAAS,EAAU,GAAG;CACpB,IAAI,IAAW,EAAE;CACjB,OAAO,IAAW,EAAS,EAAS,SAAS,KAAK,EAAE;AACtD;AAIA,SAAS,EAAY,GAAI,GAAI,GAAO;CAClC,IAAI,IAAS,KAAS,EAAG,IAAI,EAAG;CAKhC,AAJA,EAAG,KAAK,GACR,EAAG,KAAK,GACR,EAAG,KAAK,GACR,EAAG,KAAK,GACR,EAAG,KAAK;AACV;AAKA,SAAS,EAAc,GAAG;CAMxB,KALA,IAAI,IAAQ,GACR,IAAS,GACT,IAAW,EAAE,UACb,IAAI,EAAS,QACb,GACG,EAAE,KAAK,IAIZ,AAHA,IAAI,EAAS,IACb,EAAE,KAAK,GACP,EAAE,KAAK,GACP,KAAS,EAAE,KAAK,KAAU,EAAE;AAEhC;AAIA,SAAS,EAAa,GAAK,GAAG,GAAU;CACtC,OAAO,EAAI,EAAE,WAAW,EAAE,SAAS,EAAI,IAAI;AAC7C;AAEA,SAAS,EAAS,GAAM,GAAG;CAWzB,AAVA,KAAK,IAAI,GACT,KAAK,SAAS,MACd,KAAK,WAAW,MAChB,KAAK,IAAI,MACT,KAAK,IAAI,MACT,KAAK,IAAI,GACT,KAAK,IAAI,GACT,KAAK,IAAI,GACT,KAAK,IAAI,GACT,KAAK,IAAI,MACT,KAAK,IAAI;AACX;AAEA,EAAS,YAAY,OAAO,OAAO,EAAK,SAAS;AAEjD,SAAS,EAAS,GAAM;CAStB,KARA,IAAI,IAAO,IAAI,EAAS,GAAM,CAAC,GAC3B,GACA,IAAQ,CAAC,CAAI,GACb,GACA,GACA,GACA,GAEG,IAAO,EAAM,IAAI,IACtB,IAAI,IAAW,EAAK,EAAE,UAEpB,KADA,EAAK,WAAe,MAAM,IAAI,EAAS,MAAM,GACxC,IAAI,IAAI,GAAG,KAAK,GAAG,EAAE,GAExB,AADA,EAAM,KAAK,IAAQ,EAAK,SAAS,KAAK,IAAI,EAAS,EAAS,IAAI,CAAC,CAAC,GAClE,EAAM,SAAS;CAMrB,OADA,CAAC,EAAK,SAAS,IAAI,EAAS,MAAM,CAAC,EAAA,CAAG,WAAW,CAAC,CAAI,GAC/C;AACT;AAGA,SAAA,IAA0B;CACxB,IAAI,IAAa,GACb,IAAK,GACL,IAAK,GACL,IAAW;CAEf,SAAS,EAAK,GAAM;EAClB,IAAI,IAAI,EAAS,CAAI;EAOrB,IAJA,EAAE,UAAU,CAAS,GAAG,EAAE,OAAO,IAAI,CAAC,EAAE,GACxC,EAAE,WAAW,CAAU,GAGnB,GAAU,EAAK,WAAW,CAAQ;OAIjC;GACH,IAAI,IAAO,GACP,IAAQ,GACR,IAAS;GACb,EAAK,WAAW,SAAS,GAAM;IAG7B,AAFI,EAAK,IAAI,EAAK,MAAG,IAAO,IACxB,EAAK,IAAI,EAAM,MAAG,IAAQ,IAC1B,EAAK,QAAQ,EAAO,UAAO,IAAS;GAC1C,CAAC;GACD,IAAI,IAAI,MAAS,IAAQ,IAAI,EAAW,GAAM,CAAK,IAAI,GACnD,IAAK,IAAI,EAAK,GACd,IAAK,KAAM,EAAM,IAAI,IAAI,IACzB,IAAK,KAAM,EAAO,SAAS;GAC/B,EAAK,WAAW,SAAS,GAAM;IAE7B,AADA,EAAK,KAAK,EAAK,IAAI,KAAM,GACzB,EAAK,IAAI,EAAK,QAAQ;GACxB,CAAC;EACH;EAEA,OAAO;CACT;CAMA,SAAS,EAAU,GAAG;EACpB,IAAI,IAAW,EAAE,UACb,IAAW,EAAE,OAAO,UACpB,IAAI,EAAE,IAAI,EAAS,EAAE,IAAI,KAAK;EAClC,IAAI,GAAU;GACZ,EAAc,CAAC;GACf,IAAI,KAAY,EAAS,EAAE,CAAC,IAAI,EAAS,EAAS,SAAS,EAAE,CAAC,KAAK;GACnE,AAAI,KACF,EAAE,IAAI,EAAE,IAAI,EAAW,EAAE,GAAG,EAAE,CAAC,GAC/B,EAAE,IAAI,EAAE,IAAI,KAEZ,EAAE,IAAI;EAEV,OAAO,AAAI,MACT,EAAE,IAAI,EAAE,IAAI,EAAW,EAAE,GAAG,EAAE,CAAC;EAEjC,EAAE,OAAO,IAAI,EAAU,GAAG,GAAG,EAAE,OAAO,KAAK,EAAS,EAAE;CACxD;CAGA,SAAS,EAAW,GAAG;EAErB,AADA,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,GACvB,EAAE,KAAK,EAAE,OAAO;CAClB;CAaA,SAAS,EAAU,GAAG,GAAG,GAAU;EACjC,IAAI,GAAG;GAUL,KATA,IAAI,IAAM,GACN,IAAM,GACN,IAAM,GACN,IAAM,EAAI,OAAO,SAAS,IAC1B,IAAM,EAAI,GACV,IAAM,EAAI,GACV,IAAM,EAAI,GACV,IAAM,EAAI,GACV,GACG,IAAM,EAAU,CAAG,GAAG,IAAM,EAAS,CAAG,GAAG,KAAO,IAavD,AAZA,IAAM,EAAS,CAAG,GAClB,IAAM,EAAU,CAAG,GACnB,EAAI,IAAI,GACR,IAAQ,EAAI,IAAI,IAAM,EAAI,IAAI,IAAM,EAAW,EAAI,GAAG,EAAI,CAAC,GACvD,IAAQ,MACV,EAAY,EAAa,GAAK,GAAG,CAAQ,GAAG,GAAG,CAAK,GACpD,KAAO,GACP,KAAO,IAET,KAAO,EAAI,GACX,KAAO,EAAI,GACX,KAAO,EAAI,GACX,KAAO,EAAI;GAMb,AAJI,KAAO,CAAC,EAAU,CAAG,MACvB,EAAI,IAAI,GACR,EAAI,KAAK,IAAM,IAEb,KAAO,CAAC,EAAS,CAAG,MACtB,EAAI,IAAI,GACR,EAAI,KAAK,IAAM,GACf,IAAW;EAEf;EACA,OAAO;CACT;CAEA,SAAS,EAAS,GAAM;EAEtB,AADA,EAAK,KAAK,GACV,EAAK,IAAI,EAAK,QAAQ;CACxB;CAcA,OAZA,EAAK,aAAa,SAAS,GAAG;EAC5B,OAAO,UAAU,UAAU,IAAa,GAAG,KAAQ;CACrD,GAEA,EAAK,OAAO,SAAS,GAAG;EACtB,OAAO,UAAU,UAAU,IAAW,IAAO,IAAK,CAAC,EAAE,IAAI,IAAK,CAAC,EAAE,IAAI,KAAS,IAAW,OAAO,CAAC,GAAI,CAAE;CACzG,GAEA,EAAK,WAAW,SAAS,GAAG;EAC1B,OAAO,UAAU,UAAU,IAAW,IAAM,IAAK,CAAC,EAAE,IAAI,IAAK,CAAC,EAAE,IAAI,KAAS,IAAW,CAAC,GAAI,CAAE,IAAI;CACrG,GAEO;AACT;;;AC7MA,IAAM,IAAqB,KACrB,IAAsB,IACtB,IAAsB,IACtB,IAAoB,IACpB,IAAkB,GAClB,IAAuF;CACzF,QAAQ;EAAE,MAAM;EAAW,QAAQ;CAAU;CAC7C,MAAM;EAAE,MAAM;EAAW,QAAQ;CAAU;CAC3C,MAAM;EAAE,MAAM;EAAW,QAAQ;CAAU;AAC/C;AAIA,SAAgB,EAAkB,GAAuB,GAAuB,IAA8B,CAAC,GAAsB;CACjI,IAAM,IAAY,EAAQ,aAAa,GACjC,IAAa,EAAQ,cAAc,GACnC,IAAa,EAAQ,cAAc,GACnC,IAAW,EAAQ,YAAY,GAC/B,IAAU,EAAQ,WAAW,GAC7B,IAAa,EAAQ,cAAc;CAEzC,SAAS,EAAY,GAAkE;EAEnF,OADI,EAAK,UAAU,IAAU,SACtB,EAAK,WAAW,WAAW;CACtC;CAEA,SAAS,IAAsB;EAC3B,EAAO,CAAQ,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC,OAAO;EAEzC,IAAM,IAAO,EAAU,IAAO,MAAS,EAAK,QAAQ,GAI9C,IAHa,EAAsB,CAAC,CACrC,SAAS,CAAC,IAAa,GAAY,IAAY,CAAQ,CAAC,CAAC,CACzD,iBAAiB,CACL,CAAA,CAAW,CAAI;EAGhC,EAAS,WAAW,MAAS;GACzB,IAAM,CAAC,KAAc,EAAK,YAAY,CAAC;GAClC,MACL,EAAK,IAAI,EAAW;EACxB,CAAC;EAED,IAAM,IAAY,EAAS,YAAY,GAGjC,IAAO,KAAK,IAAI,GAAG,EAAU,KAAK,MAAS,EAAK,CAAC,CAAC,IAAI,IAAY,GAClE,IAAO,KAAK,IAAI,GAAG,EAAU,KAAK,MAAS,EAAK,CAAC,CAAC,IAAI,IAAY,GAClE,IAAO,KAAK,IAAI,GAAG,EAAU,KAAK,MAAS,EAAK,CAAC,CAAC,IAAI,IAAa,GACnE,IAAO,KAAK,IAAI,GAAG,EAAU,KAAK,MAAS,EAAK,CAAC,CAAC,IAAI,IAAa,GAEnE,IAAe,IAAO,IAAO,IAAU,GACvC,IAAgB,IAAO,IAAO,IAAU,GAExC,IAAe,EAAO,CAAQ,CAAC,CAChC,OAAO,KAAK,CAAC,CACb,KAAK,WAAW,OAAO,OAAO,CAAY,EAAE,GAAG,OAAO,CAAa,GAAG,CAAC,CACvE,KAAK,SAAS,CAAY,CAAC,CAC3B,KAAK,UAAU,CAAa,GAE3B,IAAS,EAAa,OAAO,GAAG,CAAC,CAAC,KAAK,aAAa,aAAa,OAAO,IAAU,CAAI,EAAE,IAAI,OAAO,IAAU,CAAI,EAAE,EAAE,GAErH,IAAgB,EAAyF,CAAC,CAC3G,GAAG,MAAS,EAAK,CAAC,CAAC,CACnB,GAAG,MAAS,EAAK,CAAC;EAEvB,EAAO,OAAO,GAAG,CAAC,CAAC,KAAK,QAAQ,MAAM,CAAC,CAAC,KAAK,UAAU,SAAS,CAAC,CAAC,KAAK,gBAAgB,GAAG,CAAC,CAAC,UAAU,MAAM,CAAC,CAAC,KAAK,EAAS,MAAM,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,KAAK,KAAK,CAAa;EAEzK,IAAM,IAAa,EACd,OAAO,GAAG,CAAC,CACX,UAAU,GAAG,CAAC,CACd,KAAK,CAAS,CAAC,CACf,KAAK,GAAG,CAAC,CACT,KAAK,cAAc,MAAS,aAAa,OAAO,EAAK,IAAI,IAAY,CAAC,EAAE,IAAI,OAAO,EAAK,IAAI,IAAa,CAAC,EAAE,EAAE;EAUnH,AARA,EACK,OAAO,MAAM,CAAC,CACd,KAAK,SAAS,CAAS,CAAC,CACxB,KAAK,UAAU,CAAU,CAAC,CAC1B,KAAK,MAAM,CAAC,CAAC,CACb,KAAK,SAAS,MAAS,EAAW,EAAY,CAAI,EAAE,CAAC,IAAI,CAAC,CAC1D,KAAK,WAAW,MAAS,EAAW,EAAY,CAAI,EAAE,CAAC,MAAM,GAElE,EACK,OAAO,MAAM,CAAC,CACd,KAAK,KAAK,IAAY,CAAC,CAAC,CACxB,KAAK,KAAK,IAAa,CAAC,CAAC,CACzB,KAAK,eAAe,QAAQ,CAAC,CAC7B,KAAK,qBAAqB,QAAQ,CAAC,CACnC,KAAK,eAAe,8BAA8B,CAAC,CACnD,KAAK,aAAa,EAAE,CAAC,CACrB,KAAK,QAAQ,SAAS,CAAC,CACvB,MAAM,MAAS,EAAK,KAAK,KAAK;EAEnC,IAAM,IAAU,EAAa,KAAK;EAClC,IAAI,KAAW,MAAM,MAAU,MAAM,4CAA4C;EACjF,OAAO;CACX;CAEA,IAAI,IAAM,EAAK;CAEf,OAAO;EACH,cAAc;GACV,IAAM,EAAK;EACf;EACA,IAAI,MAAM;GACN,OAAO;EACX;CACJ;AACJ"}