@dpuse/dpuse-tool-d3-visualiser 0.0.32 → 0.0.37

package/dist/treeDiagram-DsHUD8ou.js

@@ -0,0 +1,130 @@
+import { t as e } from "./select-BIuoFcZG.js";
+import { t } from "./link-D-9z7kEr.js";
+import { n, t as r } from "./hierarchy-CDFAetye.js";
+//#region node_modules/d3-hierarchy/src/tree.js
+function i(e, t) {
+	return e.parent === t.parent ? 1 : 2;
+}
+function a(e) {
+	var t = e.children;
+	return t ? t[0] : e.t;
+}
+function o(e) {
+	var t = e.children;
+	return t ? t[t.length - 1] : e.t;
+}
+function s(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 c(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 l(e, t, n) {
+	return e.a.parent === t.parent ? e.a : n;
+}
+function u(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;
+}
+u.prototype = Object.create(r.prototype);
+function d(e) {
+	for (var t = new u(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 u(a[o], o)), i.parent = n;
+	return (t.parent = new u(null, 0)).children = [t], t;
+}
+function f() {
+	var e = i, t = 1, n = 1, r = null;
+	function u(i) {
+		var a = d(i);
+		if (a.eachAfter(f), a.parent.m = -a.z, a.eachBefore(p), r) i.eachBefore(h);
+		else {
+			var o = i, s = i, c = i;
+			i.eachBefore(function(e) {
+				e.x < o.x && (o = e), e.x > s.x && (s = e), e.depth > c.depth && (c = e);
+			});
+			var l = o === s ? 1 : e(o, s) / 2, u = l - o.x, m = t / (s.x + l + u), g = n / (c.depth || 1);
+			i.eachBefore(function(e) {
+				e.x = (e.x + u) * m, e.y = e.depth * g;
+			});
+		}
+		return i;
+	}
+	function f(t) {
+		var n = t.children, r = t.parent.children, i = t.i ? r[t.i - 1] : null;
+		if (n) {
+			c(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 = m(t, i, t.parent.A || r[0]);
+	}
+	function p(e) {
+		e._.x = e.z + e.parent.m, e.m += e.parent.m;
+	}
+	function m(t, n, r) {
+		if (n) {
+			for (var i = t, c = t, u = n, d = i.parent.children[0], f = i.m, p = c.m, m = u.m, h = d.m, g; u = o(u), i = a(i), u && i;) d = a(d), c = o(c), c.a = t, g = u.z + m - i.z - f + e(u._, i._), g > 0 && (s(l(u, t, r), t, g), f += g, p += g), m += u.m, f += i.m, h += d.m, p += c.m;
+			u && !o(c) && (c.t = u, c.m += m - p), i && !a(d) && (d.t = i, d.m += f - h, r = t);
+		}
+		return r;
+	}
+	function h(e) {
+		e.x *= t, e.y = e.depth * n;
+	}
+	return u.separation = function(t) {
+		return arguments.length ? (e = t, u) : e;
+	}, u.size = function(e) {
+		return arguments.length ? (r = !1, t = +e[0], n = +e[1], u) : r ? null : [t, n];
+	}, u.nodeSize = function(e) {
+		return arguments.length ? (r = !0, t = +e[0], n = +e[1], u) : r ? [t, n] : null;
+	}, u;
+}
+//#endregion
+//#region src/treeDiagram.ts
+var p = 140, m = 40, h = 24, g = 50, _ = 8, v = {
+	branch: {
+		fill: "#ffe6cc",
+		stroke: "#d79b00"
+	},
+	leaf: {
+		fill: "#dae8fc",
+		stroke: "#6c8ebf"
+	},
+	root: {
+		fill: "#d5e8d4",
+		stroke: "#82b366"
+	}
+};
+function y(r, i, a = {}) {
+	let o = a.nodeWidth ?? p, s = a.nodeHeight ?? m, c = a.siblingGap ?? h, l = a.levelGap ?? g, u = a.padding ?? _, d = a.nodeColors ?? v;
+	function y(e) {
+		return e.depth === 0 ? "root" : e.children ? "branch" : "leaf";
+	}
+	function b() {
+		e(i).selectAll("svg").remove();
+		let a = n(r, (e) => e.children), p = f().nodeSize([s + c, o + l]).separation(() => 1)(a);
+		p.eachAfter((e) => {
+			let [t] = e.children ?? [];
+			t && (e.x = t.x);
+		});
+		let m = p.descendants(), h = Math.min(...m.map((e) => e.y)) - o / 2, g = Math.max(...m.map((e) => e.y)) + o / 2, _ = Math.min(...m.map((e) => e.x)) - s / 2, v = Math.max(...m.map((e) => e.x)) + s / 2, b = g - h + u * 2, x = v - _ + u * 2, S = e(i).append("svg").attr("viewBox", `0 0 ${String(b)} ${String(x)}`).attr("width", b).attr("height", x), C = S.append("g").attr("transform", `translate(${String(u - h)}, ${String(u - _)})`), w = t().x((e) => e.y).y((e) => e.x);
+		C.append("g").attr("fill", "none").attr("stroke", "#999999").attr("stroke-width", 1.5).selectAll("path").data(p.links()).join("path").attr("d", w);
+		let T = C.append("g").selectAll("g").data(m).join("g").attr("transform", (e) => `translate(${String(e.y - o / 2)}, ${String(e.x - s / 2)})`);
+		T.append("rect").attr("width", o).attr("height", s).attr("rx", 6).attr("fill", (e) => d[y(e)].fill).attr("stroke", (e) => d[y(e)].stroke), T.append("text").attr("x", o / 2).attr("y", s / 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 E = S.node();
+		if (E == null) throw Error("Failed to create tree diagram SVG element.");
+		return E;
+	}
+	let x = b();
+	return {
+		resize: () => {
+			x = b();
+		},
+		get svg() {
+			return x;
+		}
+	};
+}
+//#endregion
+export { y as renderTreeDiagram };
+
+//# sourceMappingURL=treeDiagram-DsHUD8ou.js.map

package/dist/treeDiagram-DsHUD8ou.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"treeDiagram-DsHUD8ou.js","names":[],"sources":["../node_modules/d3-hierarchy/src/tree.js","../src/treeDiagram.ts"],"sourcesContent":["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],"mappings":";;;;AAEA,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"}

package/dist/types/src/chordDiagram.d.ts

@@ -0,0 +1,25 @@
+import { ChordInputLink, ChordInputNode } from '@unovis/ts';
+import { ColorModeId } from './palette';
+export interface ChordDiagramNode extends ChordInputNode {
+    id: string;
+    label: string;
+}
+export interface ChordDiagramLink extends ChordInputLink {
+    source: string;
+    target: string;
+    value: number;
+}
+export interface ChordDiagramData {
+    links: ChordDiagramLink[];
+    nodes: ChordDiagramNode[];
+}
+export interface ChordDiagramOptions {
+    colorModeId?: ColorModeId;
+    nodeWidth?: number;
+    padAngle?: number;
+}
+export interface ChordDiagramRenderHandle {
+    resize: () => void;
+    svg: SVGSVGElement;
+}
+export declare function renderChordDiagram(data: ChordDiagramData, renderTo: HTMLElement, options?: ChordDiagramOptions): ChordDiagramRenderHandle;

package/dist/types/src/index.d.ts

@@ -2,11 +2,13 @@ import { Chart } from 'billboard.js';
 import { PresentationView } from '@dpuse/dpuse-shared/component/presentation';
 import { BarChartData } from './billboardJs';
 import { ObservablePlotChartTypeId } from './observablePlot';
+import { ChordDiagramData, ChordDiagramOptions } from './chordDiagram';
 import { ErdDiagramData, ErdDiagramOptions } from './erdDiagram';
 import { NetworkDiagramData, NetworkDiagramOptions } from './networkDiagram';
 import { SankeyDiagramData, SankeyDiagramOptions } from './sankeyDiagram';
 import { TreeDiagramNode, TreeDiagramOptions } from './treeDiagram';
 export type { BarChartData, BarChartSeries } from './billboardJs';
+export type { ChordDiagramData, ChordDiagramLink, ChordDiagramNode, ChordDiagramOptions } from './chordDiagram';
 export type { ErdDiagramData, ErdDiagramEdge, ErdDiagramNode, ErdDiagramNodeTypeId, ErdDiagramOptions } from './erdDiagram';
 export type { NetworkDiagramData, NetworkDiagramLink, NetworkDiagramNode, NetworkDiagramOptions } from './networkDiagram';
 export type { ObservablePlotChartTypeId } from './observablePlot';
@@ -31,6 +33,7 @@ export declare class D3Tool {
     renderObservablePlot(typeId: ObservablePlotChartTypeId, data: BarChartData, renderTo: HTMLElement, callback?: () => void): Promise<D3View>;
     renderD3BarChart(data: BarChartData, renderTo: HTMLElement, callback?: () => void): Promise<D3View>;
     renderTanStackCharts(data: BarChartData, renderTo: HTMLElement, callback?: () => void): Promise<D3TanStackChartsView>;
+    renderChordDiagram(data: ChordDiagramData, renderTo: HTMLElement, options?: ChordDiagramOptions, callback?: () => void): Promise<D3View>;
     renderErdDiagram(data: ErdDiagramData, renderTo: HTMLElement, options?: ErdDiagramOptions, callback?: () => void): Promise<D3View>;
     renderNetworkDiagram(data: NetworkDiagramData, renderTo: HTMLElement, options?: NetworkDiagramOptions, callback?: () => void): Promise<D3NetworkView>;
     renderSankeyDiagram(data: SankeyDiagramData, renderTo: HTMLElement, options?: SankeyDiagramOptions, callback?: () => void): Promise<D3View>;

package/package.json

@@ -1,8 +1,8 @@
 {
     "name": "@dpuse/dpuse-tool-d3-visualiser",
-    "version": "0.0.32",
+    "version": "0.0.37",
     "private": false,
-    "description": "A TypeScript wrapper for D3, Billboard.js, and Observable Plot that implements the Data Positioning chart-rendering interface, providing ERD (dagre), Sankey (d3-sankey), network (d3-force), tree (d3-hierarchy), and bar chart (billboard.js, Observable Plot) renderers.",
+    "description": "A TypeScript wrapper for D3, Billboard.js, Observable Plot, and Unovis that implements the Data Positioning chart-rendering interface, providing ERD (dagre), Sankey (d3-sankey), chord (Unovis), network (d3-force), tree (d3-hierarchy), and bar chart (billboard.js, Observable Plot) renderers.",
     "license": "MIT",
     "author": "Jonathan Terrell <terrell.jm@gmail.com>",
     "type": "module",
@@ -34,6 +34,7 @@
     "allowScripts": {
         "esbuild@0.28.1": true,
         "fsevents@2.3.3": true,
+        "maplibre-gl@2.4.0": true,
         "sharp@0.34.5": true,
         "unrs-resolver@1.12.2": true,
         "workerd@1.20260730.1": true
@@ -44,7 +45,7 @@
         "check": "node -e \"import('@dpuse/dpuse-development').then(m => m.checkConfigFiles())\" && node -e \"import('@dpuse/dpuse-development').then(m => m.checkDependencies())\"",
         "document": "npm run documentOpening && npm run documentUsage && npm run documentDependencies && npm run documentGovernance",
         "documentBundleSizes": "node -e \"import('@dpuse/dpuse-development').then(m => m.documentBundleSizes({ moduleLevel: true }))\"",
-        "documentDependencies": "node -e \"import('@dpuse/dpuse-development').then(m => m.documentDependencies('BSD-3-Clause;ISC;MIT;Unlicense'))\"",
+        "documentDependencies": "node -e \"import('@dpuse/dpuse-development').then(m => m.documentDependencies('0BSD;Apache-2.0;BSD-2-Clause;BSD-3-Clause;EPL-2.0;ISC;MIT;Unlicense'))\"",
         "documentGovernance": "node -e \"import('@dpuse/dpuse-development').then(m => m.documentGovernance())\"",
         "documentOpening": "node -e \"import('@dpuse/dpuse-development').then(m => m.documentOpening())\"",
         "documentUsage": "node -e \"import('@dpuse/dpuse-development').then(m => m.documentUsage())\"",
@@ -58,7 +59,8 @@
         "@dagrejs/dagre": "^3.1.0",
         "@dpuse/dpuse-shared": "^0.3.760",
         "@observablehq/plot": "^0.6.17",
-        "@tanstack/charts": "^0.6.4",
+        "@tanstack/charts": "^0.6.5",
+        "@unovis/ts": "^1.6.7",
         "billboard.js": "^4.0.3",
         "d3-axis": "^3.0.0",
         "d3-drag": "^3.0.0",