@burdenoff/microfe-vibecontrols 2026.601.12 → 2026.601.13

package/dist/node_modules/dagre/lib/debug.js

@@ -0,0 +1,31 @@
+import { __commonJSMin as e } from "../../../_virtual/_rolldown/runtime.js";
+import { require_graphlib as t } from "./graphlib.js";
+import { require_lodash as n } from "./lodash.js";
+import { require_util as r } from "./util.js";
+//#region node_modules/dagre/lib/debug.js
+var i = /* @__PURE__ */ e(((e, i) => {
+	var a = n(), o = r(), s = t().Graph;
+	i.exports = { debugOrdering: c };
+	/* istanbul ignore next */
+	function c(e) {
+		var t = o.buildLayerMatrix(e), n = new s({
+			compound: !0,
+			multigraph: !0
+		}).setGraph({});
+		return a.forEach(e.nodes(), function(t) {
+			n.setNode(t, { label: t }), n.setParent(t, "layer" + e.node(t).rank);
+		}), a.forEach(e.edges(), function(e) {
+			n.setEdge(e.v, e.w, {}, e.name);
+		}), a.forEach(t, function(e, t) {
+			var r = "layer" + t;
+			n.setNode(r, { rank: "same" }), a.reduce(e, function(e, t) {
+				return n.setEdge(e, t, { style: "invis" }), t;
+			});
+		}), n;
+	}
+}));
+//#endregion
+export default i();
+export { i as require_debug };
+
+//# sourceMappingURL=debug.js.map

package/dist/node_modules/dagre/lib/debug.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"debug.js","names":[],"sources":["../../../../node_modules/dagre/lib/debug.js"],"sourcesContent":["var _ = require(\"./lodash\");\nvar util = require(\"./util\");\nvar Graph = require(\"./graphlib\").Graph;\n\nmodule.exports = {\n  debugOrdering: debugOrdering\n};\n\n/* istanbul ignore next */\nfunction debugOrdering(g) {\n  var layerMatrix = util.buildLayerMatrix(g);\n\n  var h = new Graph({ compound: true, multigraph: true }).setGraph({});\n\n  _.forEach(g.nodes(), function(v) {\n    h.setNode(v, { label: v });\n    h.setParent(v, \"layer\" + g.node(v).rank);\n  });\n\n  _.forEach(g.edges(), function(e) {\n    h.setEdge(e.v, e.w, {}, e.name);\n  });\n\n  _.forEach(layerMatrix, function(layer, i) {\n    var layerV = \"layer\" + i;\n    h.setNode(layerV, { rank: \"same\" });\n    _.reduce(layer, function(u, v) {\n      h.setEdge(u, v, { style: \"invis\" });\n      return v;\n    });\n  });\n\n  return h;\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;;CAAA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,CAA8B;AAElC,GAAO,UAAU,EACA,kBAChB;;CAGD,SAAS,EAAc,GAAG;EACxB,IAAI,IAAc,EAAK,iBAAiB,EAAE,EAEtC,IAAI,IAAI,EAAM;GAAE,UAAU;GAAM,YAAY;GAAM,CAAC,CAAC,SAAS,EAAE,CAAC;AAoBpE,SAlBA,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;AAE/B,GADA,EAAE,QAAQ,GAAG,EAAE,OAAO,GAAG,CAAC,EAC1B,EAAE,UAAU,GAAG,UAAU,EAAE,KAAK,EAAE,CAAC,KAAK;IACxC,EAEF,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;AAC/B,KAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,KAAK;IAC/B,EAEF,EAAE,QAAQ,GAAa,SAAS,GAAO,GAAG;GACxC,IAAI,IAAS,UAAU;AAEvB,GADA,EAAE,QAAQ,GAAQ,EAAE,MAAM,QAAQ,CAAC,EACnC,EAAE,OAAO,GAAO,SAAS,GAAG,GAAG;AAE7B,WADA,EAAE,QAAQ,GAAG,GAAG,EAAE,OAAO,SAAS,CAAC,EAC5B;KACP;IACF,EAEK"}

package/dist/node_modules/dagre/lib/graphlib.js

@@ -0,0 +1,15 @@
+import { __commonJSMin as e, __require as t } from "../../../_virtual/_rolldown/runtime.js";
+import { require_graphlib as n } from "../../graphlib/index.js";
+//#region node_modules/dagre/lib/graphlib.js
+var r = /* @__PURE__ */ e(((e, r) => {
+	var i;
+	if (typeof t == "function") try {
+		i = n();
+	} catch {}
+	i ||= window.graphlib, r.exports = i;
+}));
+//#endregion
+export default r();
+export { r as require_graphlib };
+
+//# sourceMappingURL=graphlib.js.map

package/dist/node_modules/dagre/lib/graphlib.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graphlib.js","names":[],"sources":["../../../../node_modules/dagre/lib/graphlib.js"],"sourcesContent":["/* global window */\n\nvar graphlib;\n\nif (typeof require === \"function\") {\n  try {\n    graphlib = require(\"graphlib\");\n  } catch (e) {\n    // continue regardless of error\n  }\n}\n\nif (!graphlib) {\n  graphlib = window.graphlib;\n}\n\nmodule.exports = graphlib;\n"],"x_google_ignoreList":[0],"mappings":";;;;CAEA,IAAI;AAEJ,KAAI,OAAA,KAAmB,WACrB,KAAI;AACF,MAAA,GAAA;SACU;AASd,CAJA,AACE,MAAW,OAAO,UAGpB,EAAO,UAAU"}

package/dist/node_modules/dagre/lib/greedy-fas.js

@@ -0,0 +1,74 @@
+import { __commonJSMin as e } from "../../../_virtual/_rolldown/runtime.js";
+import { require_graphlib as t } from "./graphlib.js";
+import { require_lodash as n } from "./lodash.js";
+import { require_list as r } from "./data/list.js";
+//#region node_modules/dagre/lib/greedy-fas.js
+var i = /* @__PURE__ */ e(((e, i) => {
+	var a = n(), o = t().Graph, s = r();
+	i.exports = l;
+	var c = a.constant(1);
+	function l(e, t) {
+		if (e.nodeCount() <= 1) return [];
+		var n = f(e, t || c), r = u(n.graph, n.buckets, n.zeroIdx);
+		return a.flatten(a.map(r, function(t) {
+			return e.outEdges(t.v, t.w);
+		}), !0);
+	}
+	function u(e, t, n) {
+		for (var r = [], i = t[t.length - 1], a = t[0], o; e.nodeCount();) {
+			for (; o = a.dequeue();) d(e, t, n, o);
+			for (; o = i.dequeue();) d(e, t, n, o);
+			if (e.nodeCount()) {
+				for (var s = t.length - 2; s > 0; --s) if (o = t[s].dequeue(), o) {
+					r = r.concat(d(e, t, n, o, !0));
+					break;
+				}
+			}
+		}
+		return r;
+	}
+	function d(e, t, n, r, i) {
+		var o = i ? [] : void 0;
+		return a.forEach(e.inEdges(r.v), function(r) {
+			var a = e.edge(r), s = e.node(r.v);
+			i && o.push({
+				v: r.v,
+				w: r.w
+			}), s.out -= a, p(t, n, s);
+		}), a.forEach(e.outEdges(r.v), function(r) {
+			var i = e.edge(r), a = r.w, o = e.node(a);
+			o.in -= i, p(t, n, o);
+		}), e.removeNode(r.v), o;
+	}
+	function f(e, t) {
+		var n = new o(), r = 0, i = 0;
+		a.forEach(e.nodes(), function(e) {
+			n.setNode(e, {
+				v: e,
+				in: 0,
+				out: 0
+			});
+		}), a.forEach(e.edges(), function(e) {
+			var a = n.edge(e.v, e.w) || 0, o = t(e), s = a + o;
+			n.setEdge(e.v, e.w, s), i = Math.max(i, n.node(e.v).out += o), r = Math.max(r, n.node(e.w).in += o);
+		});
+		var c = a.range(i + r + 3).map(function() {
+			return new s();
+		}), l = r + 1;
+		return a.forEach(n.nodes(), function(e) {
+			p(c, l, n.node(e));
+		}), {
+			graph: n,
+			buckets: c,
+			zeroIdx: l
+		};
+	}
+	function p(e, t, n) {
+		n.out ? n.in ? e[n.out - n.in + t].enqueue(n) : e[e.length - 1].enqueue(n) : e[0].enqueue(n);
+	}
+}));
+//#endregion
+export default i();
+export { i as require_greedy_fas };
+
+//# sourceMappingURL=greedy-fas.js.map

package/dist/node_modules/dagre/lib/greedy-fas.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"greedy-fas.js","names":[],"sources":["../../../../node_modules/dagre/lib/greedy-fas.js"],"sourcesContent":["var _ = require(\"./lodash\");\nvar Graph = require(\"./graphlib\").Graph;\nvar List = require(\"./data/list\");\n\n/*\n * A greedy heuristic for finding a feedback arc set for a graph. A feedback\n * arc set is a set of edges that can be removed to make a graph acyclic.\n * The algorithm comes from: P. Eades, X. Lin, and W. F. Smyth, \"A fast and\n * effective heuristic for the feedback arc set problem.\" This implementation\n * adjusts that from the paper to allow for weighted edges.\n */\nmodule.exports = greedyFAS;\n\nvar DEFAULT_WEIGHT_FN = _.constant(1);\n\nfunction greedyFAS(g, weightFn) {\n  if (g.nodeCount() <= 1) {\n    return [];\n  }\n  var state = buildState(g, weightFn || DEFAULT_WEIGHT_FN);\n  var results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);\n\n  // Expand multi-edges\n  return _.flatten(_.map(results, function(e) {\n    return g.outEdges(e.v, e.w);\n  }), true);\n}\n\nfunction doGreedyFAS(g, buckets, zeroIdx) {\n  var results = [];\n  var sources = buckets[buckets.length - 1];\n  var sinks = buckets[0];\n\n  var entry;\n  while (g.nodeCount()) {\n    while ((entry = sinks.dequeue()))   { removeNode(g, buckets, zeroIdx, entry); }\n    while ((entry = sources.dequeue())) { removeNode(g, buckets, zeroIdx, entry); }\n    if (g.nodeCount()) {\n      for (var i = buckets.length - 2; i > 0; --i) {\n        entry = buckets[i].dequeue();\n        if (entry) {\n          results = results.concat(removeNode(g, buckets, zeroIdx, entry, true));\n          break;\n        }\n      }\n    }\n  }\n\n  return results;\n}\n\nfunction removeNode(g, buckets, zeroIdx, entry, collectPredecessors) {\n  var results = collectPredecessors ? [] : undefined;\n\n  _.forEach(g.inEdges(entry.v), function(edge) {\n    var weight = g.edge(edge);\n    var uEntry = g.node(edge.v);\n\n    if (collectPredecessors) {\n      results.push({ v: edge.v, w: edge.w });\n    }\n\n    uEntry.out -= weight;\n    assignBucket(buckets, zeroIdx, uEntry);\n  });\n\n  _.forEach(g.outEdges(entry.v), function(edge) {\n    var weight = g.edge(edge);\n    var w = edge.w;\n    var wEntry = g.node(w);\n    wEntry[\"in\"] -= weight;\n    assignBucket(buckets, zeroIdx, wEntry);\n  });\n\n  g.removeNode(entry.v);\n\n  return results;\n}\n\nfunction buildState(g, weightFn) {\n  var fasGraph = new Graph();\n  var maxIn = 0;\n  var maxOut = 0;\n\n  _.forEach(g.nodes(), function(v) {\n    fasGraph.setNode(v, { v: v, \"in\": 0, out: 0 });\n  });\n\n  // Aggregate weights on nodes, but also sum the weights across multi-edges\n  // into a single edge for the fasGraph.\n  _.forEach(g.edges(), function(e) {\n    var prevWeight = fasGraph.edge(e.v, e.w) || 0;\n    var weight = weightFn(e);\n    var edgeWeight = prevWeight + weight;\n    fasGraph.setEdge(e.v, e.w, edgeWeight);\n    maxOut = Math.max(maxOut, fasGraph.node(e.v).out += weight);\n    maxIn  = Math.max(maxIn,  fasGraph.node(e.w)[\"in\"]  += weight);\n  });\n\n  var buckets = _.range(maxOut + maxIn + 3).map(function() { return new List(); });\n  var zeroIdx = maxIn + 1;\n\n  _.forEach(fasGraph.nodes(), function(v) {\n    assignBucket(buckets, zeroIdx, fasGraph.node(v));\n  });\n\n  return { graph: fasGraph, buckets: buckets, zeroIdx: zeroIdx };\n}\n\nfunction assignBucket(buckets, zeroIdx, entry) {\n  if (!entry.out) {\n    buckets[0].enqueue(entry);\n  } else if (!entry[\"in\"]) {\n    buckets[buckets.length - 1].enqueue(entry);\n  } else {\n    buckets[entry.out - entry[\"in\"] + zeroIdx].enqueue(entry);\n  }\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;;CAAA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA,CAA8B,OAC9B,IAAA,GAAA;AASJ,GAAO,UAAU;CAEjB,IAAI,IAAoB,EAAE,SAAS,EAAE;CAErC,SAAS,EAAU,GAAG,GAAU;AAC9B,MAAI,EAAE,WAAW,IAAI,EACnB,QAAO,EAAE;EAEX,IAAI,IAAQ,EAAW,GAAG,KAAY,EAAkB,EACpD,IAAU,EAAY,EAAM,OAAO,EAAM,SAAS,EAAM,QAAQ;AAGpE,SAAO,EAAE,QAAQ,EAAE,IAAI,GAAS,SAAS,GAAG;AAC1C,UAAO,EAAE,SAAS,EAAE,GAAG,EAAE,EAAE;IAC3B,EAAE,GAAK;;CAGX,SAAS,EAAY,GAAG,GAAS,GAAS;AAMxC,OALA,IAAI,IAAU,EAAE,EACZ,IAAU,EAAQ,EAAQ,SAAS,IACnC,IAAQ,EAAQ,IAEhB,GACG,EAAE,WAAW,GAAE;AACpB,UAAQ,IAAQ,EAAM,SAAS,EAAO,GAAW,GAAG,GAAS,GAAS,EAAM;AAC5E,UAAQ,IAAQ,EAAQ,SAAS,EAAK,GAAW,GAAG,GAAS,GAAS,EAAM;AAC5E,OAAI,EAAE,WAAW,EACf;SAAK,IAAI,IAAI,EAAQ,SAAS,GAAG,IAAI,GAAG,EAAE,EAExC,KADA,IAAQ,EAAQ,GAAG,SAAS,EACxB,GAAO;AACT,SAAU,EAAQ,OAAO,EAAW,GAAG,GAAS,GAAS,GAAO,GAAK,CAAC;AACtE;;;;AAMR,SAAO;;CAGT,SAAS,EAAW,GAAG,GAAS,GAAS,GAAO,GAAqB;EACnE,IAAI,IAAU,IAAsB,EAAE,GAAG,KAAA;AAwBzC,SAtBA,EAAE,QAAQ,EAAE,QAAQ,EAAM,EAAE,EAAE,SAAS,GAAM;GAC3C,IAAI,IAAS,EAAE,KAAK,EAAK,EACrB,IAAS,EAAE,KAAK,EAAK,EAAE;AAO3B,GALI,KACF,EAAQ,KAAK;IAAE,GAAG,EAAK;IAAG,GAAG,EAAK;IAAG,CAAC,EAGxC,EAAO,OAAO,GACd,EAAa,GAAS,GAAS,EAAO;IACtC,EAEF,EAAE,QAAQ,EAAE,SAAS,EAAM,EAAE,EAAE,SAAS,GAAM;GAC5C,IAAI,IAAS,EAAE,KAAK,EAAK,EACrB,IAAI,EAAK,GACT,IAAS,EAAE,KAAK,EAAE;AAEtB,GADA,EAAO,MAAS,GAChB,EAAa,GAAS,GAAS,EAAO;IACtC,EAEF,EAAE,WAAW,EAAM,EAAE,EAEd;;CAGT,SAAS,EAAW,GAAG,GAAU;EAC/B,IAAI,IAAW,IAAI,GAAO,EACtB,IAAQ,GACR,IAAS;AAQb,EANA,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;AAC/B,KAAS,QAAQ,GAAG;IAAK;IAAG,IAAM;IAAG,KAAK;IAAG,CAAC;IAC9C,EAIF,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAa,EAAS,KAAK,EAAE,GAAG,EAAE,EAAE,IAAI,GACxC,IAAS,EAAS,EAAE,EACpB,IAAa,IAAa;AAG9B,GAFA,EAAS,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAW,EACtC,IAAS,KAAK,IAAI,GAAQ,EAAS,KAAK,EAAE,EAAE,CAAC,OAAO,EAAO,EAC3D,IAAS,KAAK,IAAI,GAAQ,EAAS,KAAK,EAAE,EAAE,CAAC,MAAU,EAAO;IAC9D;EAEF,IAAI,IAAU,EAAE,MAAM,IAAS,IAAQ,EAAE,CAAC,IAAI,WAAW;AAAE,UAAO,IAAI,GAAM;IAAI,EAC5E,IAAU,IAAQ;AAMtB,SAJA,EAAE,QAAQ,EAAS,OAAO,EAAE,SAAS,GAAG;AACtC,KAAa,GAAS,GAAS,EAAS,KAAK,EAAE,CAAC;IAChD,EAEK;GAAE,OAAO;GAAmB;GAAkB;GAAS;;CAGhE,SAAS,EAAa,GAAS,GAAS,GAAO;AAC7C,EAAK,EAAM,MAEC,EAAM,KAGhB,EAAQ,EAAM,MAAM,EAAM,KAAQ,GAAS,QAAQ,EAAM,GAFzD,EAAQ,EAAQ,SAAS,GAAG,QAAQ,EAAM,GAF1C,EAAQ,GAAG,QAAQ,EAAM"}

package/dist/node_modules/dagre/lib/layout.js

@@ -0,0 +1,305 @@
+import { __commonJSMin as e } from "../../../_virtual/_rolldown/runtime.js";
+import { require_graphlib as t } from "./graphlib.js";
+import { require_lodash as n } from "./lodash.js";
+import { require_acyclic as r } from "./acyclic.js";
+import { require_util as i } from "./util.js";
+import { require_normalize as a } from "./normalize.js";
+import { require_rank as o } from "./rank/index.js";
+import { require_parent_dummy_chains as s } from "./parent-dummy-chains.js";
+import { require_nesting_graph as c } from "./nesting-graph.js";
+import { require_add_border_segments as l } from "./add-border-segments.js";
+import { require_coordinate_system as u } from "./coordinate-system.js";
+import { require_order as d } from "./order/index.js";
+import { require_position as f } from "./position/index.js";
+//#region node_modules/dagre/lib/layout.js
+var p = /* @__PURE__ */ e(((e, p) => {
+	var m = n(), h = r(), g = a(), _ = o(), v = i().normalizeRanks, y = s(), b = i().removeEmptyRanks, x = c(), S = l(), C = u(), w = d(), T = f(), E = i(), D = t().Graph;
+	p.exports = O;
+	function O(e, t) {
+		var n = t && t.debugTiming ? E.time : E.notime;
+		n("layout", function() {
+			var t = n("  buildLayoutGraph", function() {
+				return z(e);
+			});
+			n("  runLayout", function() {
+				k(t, n);
+			}), n("  updateInputGraph", function() {
+				A(e, t);
+			});
+		});
+	}
+	function k(e, t) {
+		t("    makeSpaceForEdgeLabels", function() {
+			B(e);
+		}), t("    removeSelfEdges", function() {
+			Y(e);
+		}), t("    acyclic", function() {
+			h.run(e);
+		}), t("    nestingGraph.run", function() {
+			x.run(e);
+		}), t("    rank", function() {
+			_(E.asNonCompoundGraph(e));
+		}), t("    injectEdgeLabelProxies", function() {
+			V(e);
+		}), t("    removeEmptyRanks", function() {
+			b(e);
+		}), t("    nestingGraph.cleanup", function() {
+			x.cleanup(e);
+		}), t("    normalizeRanks", function() {
+			v(e);
+		}), t("    assignRankMinMax", function() {
+			H(e);
+		}), t("    removeEdgeLabelProxies", function() {
+			U(e);
+		}), t("    normalize.run", function() {
+			g.run(e);
+		}), t("    parentDummyChains", function() {
+			y(e);
+		}), t("    addBorderSegments", function() {
+			S(e);
+		}), t("    order", function() {
+			w(e);
+		}), t("    insertSelfEdges", function() {
+			X(e);
+		}), t("    adjustCoordinateSystem", function() {
+			C.adjust(e);
+		}), t("    position", function() {
+			T(e);
+		}), t("    positionSelfEdges", function() {
+			Z(e);
+		}), t("    removeBorderNodes", function() {
+			J(e);
+		}), t("    normalize.undo", function() {
+			g.undo(e);
+		}), t("    fixupEdgeLabelCoords", function() {
+			K(e);
+		}), t("    undoCoordinateSystem", function() {
+			C.undo(e);
+		}), t("    translateGraph", function() {
+			W(e);
+		}), t("    assignNodeIntersects", function() {
+			G(e);
+		}), t("    reversePoints", function() {
+			q(e);
+		}), t("    acyclic.undo", function() {
+			h.undo(e);
+		});
+	}
+	function A(e, t) {
+		m.forEach(e.nodes(), function(n) {
+			var r = e.node(n), i = t.node(n);
+			r && (r.x = i.x, r.y = i.y, t.children(n).length && (r.width = i.width, r.height = i.height));
+		}), m.forEach(e.edges(), function(n) {
+			var r = e.edge(n), i = t.edge(n);
+			r.points = i.points, m.has(i, "x") && (r.x = i.x, r.y = i.y);
+		}), e.graph().width = t.graph().width, e.graph().height = t.graph().height;
+	}
+	var j = [
+		"nodesep",
+		"edgesep",
+		"ranksep",
+		"marginx",
+		"marginy"
+	], M = {
+		ranksep: 50,
+		edgesep: 20,
+		nodesep: 50,
+		rankdir: "tb"
+	}, N = [
+		"acyclicer",
+		"ranker",
+		"rankdir",
+		"align"
+	], P = ["width", "height"], F = {
+		width: 0,
+		height: 0
+	}, I = [
+		"minlen",
+		"weight",
+		"width",
+		"height",
+		"labeloffset"
+	], L = {
+		minlen: 1,
+		weight: 1,
+		width: 0,
+		height: 0,
+		labeloffset: 10,
+		labelpos: "r"
+	}, R = ["labelpos"];
+	function z(e) {
+		var t = new D({
+			multigraph: !0,
+			compound: !0
+		}), n = $(e.graph());
+		return t.setGraph(m.merge({}, M, Q(n, j), m.pick(n, N))), m.forEach(e.nodes(), function(n) {
+			var r = $(e.node(n));
+			t.setNode(n, m.defaults(Q(r, P), F)), t.setParent(n, e.parent(n));
+		}), m.forEach(e.edges(), function(n) {
+			var r = $(e.edge(n));
+			t.setEdge(n, m.merge({}, L, Q(r, I), m.pick(r, R)));
+		}), t;
+	}
+	function B(e) {
+		var t = e.graph();
+		t.ranksep /= 2, m.forEach(e.edges(), function(n) {
+			var r = e.edge(n);
+			r.minlen *= 2, r.labelpos.toLowerCase() !== "c" && (t.rankdir === "TB" || t.rankdir === "BT" ? r.width += r.labeloffset : r.height += r.labeloffset);
+		});
+	}
+	function V(e) {
+		m.forEach(e.edges(), function(t) {
+			var n = e.edge(t);
+			if (n.width && n.height) {
+				var r = e.node(t.v), i = {
+					rank: (e.node(t.w).rank - r.rank) / 2 + r.rank,
+					e: t
+				};
+				E.addDummyNode(e, "edge-proxy", i, "_ep");
+			}
+		});
+	}
+	function H(e) {
+		var t = 0;
+		m.forEach(e.nodes(), function(n) {
+			var r = e.node(n);
+			r.borderTop && (r.minRank = e.node(r.borderTop).rank, r.maxRank = e.node(r.borderBottom).rank, t = m.max(t, r.maxRank));
+		}), e.graph().maxRank = t;
+	}
+	function U(e) {
+		m.forEach(e.nodes(), function(t) {
+			var n = e.node(t);
+			n.dummy === "edge-proxy" && (e.edge(n.e).labelRank = n.rank, e.removeNode(t));
+		});
+	}
+	function W(e) {
+		var t = Infinity, n = 0, r = Infinity, i = 0, a = e.graph(), o = a.marginx || 0, s = a.marginy || 0;
+		function c(e) {
+			var a = e.x, o = e.y, s = e.width, c = e.height;
+			t = Math.min(t, a - s / 2), n = Math.max(n, a + s / 2), r = Math.min(r, o - c / 2), i = Math.max(i, o + c / 2);
+		}
+		m.forEach(e.nodes(), function(t) {
+			c(e.node(t));
+		}), m.forEach(e.edges(), function(t) {
+			var n = e.edge(t);
+			m.has(n, "x") && c(n);
+		}), t -= o, r -= s, m.forEach(e.nodes(), function(n) {
+			var i = e.node(n);
+			i.x -= t, i.y -= r;
+		}), m.forEach(e.edges(), function(n) {
+			var i = e.edge(n);
+			m.forEach(i.points, function(e) {
+				e.x -= t, e.y -= r;
+			}), m.has(i, "x") && (i.x -= t), m.has(i, "y") && (i.y -= r);
+		}), a.width = n - t + o, a.height = i - r + s;
+	}
+	function G(e) {
+		m.forEach(e.edges(), function(t) {
+			var n = e.edge(t), r = e.node(t.v), i = e.node(t.w), a, o;
+			n.points ? (a = n.points[0], o = n.points[n.points.length - 1]) : (n.points = [], a = i, o = r), n.points.unshift(E.intersectRect(r, a)), n.points.push(E.intersectRect(i, o));
+		});
+	}
+	function K(e) {
+		m.forEach(e.edges(), function(t) {
+			var n = e.edge(t);
+			if (m.has(n, "x")) switch ((n.labelpos === "l" || n.labelpos === "r") && (n.width -= n.labeloffset), n.labelpos) {
+				case "l":
+					n.x -= n.width / 2 + n.labeloffset;
+					break;
+				case "r":
+					n.x += n.width / 2 + n.labeloffset;
+					break;
+			}
+		});
+	}
+	function q(e) {
+		m.forEach(e.edges(), function(t) {
+			var n = e.edge(t);
+			n.reversed && n.points.reverse();
+		});
+	}
+	function J(e) {
+		m.forEach(e.nodes(), function(t) {
+			if (e.children(t).length) {
+				var n = e.node(t), r = e.node(n.borderTop), i = e.node(n.borderBottom), a = e.node(m.last(n.borderLeft)), o = e.node(m.last(n.borderRight));
+				n.width = Math.abs(o.x - a.x), n.height = Math.abs(i.y - r.y), n.x = a.x + n.width / 2, n.y = r.y + n.height / 2;
+			}
+		}), m.forEach(e.nodes(), function(t) {
+			e.node(t).dummy === "border" && e.removeNode(t);
+		});
+	}
+	function Y(e) {
+		m.forEach(e.edges(), function(t) {
+			if (t.v === t.w) {
+				var n = e.node(t.v);
+				n.selfEdges ||= [], n.selfEdges.push({
+					e: t,
+					label: e.edge(t)
+				}), e.removeEdge(t);
+			}
+		});
+	}
+	function X(e) {
+		var t = E.buildLayerMatrix(e);
+		m.forEach(t, function(t) {
+			var n = 0;
+			m.forEach(t, function(t, r) {
+				var i = e.node(t);
+				i.order = r + n, m.forEach(i.selfEdges, function(t) {
+					E.addDummyNode(e, "selfedge", {
+						width: t.label.width,
+						height: t.label.height,
+						rank: i.rank,
+						order: r + ++n,
+						e: t.e,
+						label: t.label
+					}, "_se");
+				}), delete i.selfEdges;
+			});
+		});
+	}
+	function Z(e) {
+		m.forEach(e.nodes(), function(t) {
+			var n = e.node(t);
+			if (n.dummy === "selfedge") {
+				var r = e.node(n.e.v), i = r.x + r.width / 2, a = r.y, o = n.x - i, s = r.height / 2;
+				e.setEdge(n.e, n.label), e.removeNode(t), n.label.points = [
+					{
+						x: i + 2 * o / 3,
+						y: a - s
+					},
+					{
+						x: i + 5 * o / 6,
+						y: a - s
+					},
+					{
+						x: i + o,
+						y: a
+					},
+					{
+						x: i + 5 * o / 6,
+						y: a + s
+					},
+					{
+						x: i + 2 * o / 3,
+						y: a + s
+					}
+				], n.label.x = n.x, n.label.y = n.y;
+			}
+		});
+	}
+	function Q(e, t) {
+		return m.mapValues(m.pick(e, t), Number);
+	}
+	function $(e) {
+		var t = {};
+		return m.forEach(e, function(e, n) {
+			t[n.toLowerCase()] = e;
+		}), t;
+	}
+}));
+//#endregion
+export default p();
+export { p as require_layout };
+
+//# sourceMappingURL=layout.js.map

package/dist/node_modules/dagre/lib/layout.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"layout.js","names":[],"sources":["../../../../node_modules/dagre/lib/layout.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar acyclic = require(\"./acyclic\");\nvar normalize = require(\"./normalize\");\nvar rank = require(\"./rank\");\nvar normalizeRanks = require(\"./util\").normalizeRanks;\nvar parentDummyChains = require(\"./parent-dummy-chains\");\nvar removeEmptyRanks = require(\"./util\").removeEmptyRanks;\nvar nestingGraph = require(\"./nesting-graph\");\nvar addBorderSegments = require(\"./add-border-segments\");\nvar coordinateSystem = require(\"./coordinate-system\");\nvar order = require(\"./order\");\nvar position = require(\"./position\");\nvar util = require(\"./util\");\nvar Graph = require(\"./graphlib\").Graph;\n\nmodule.exports = layout;\n\nfunction layout(g, opts) {\n  var time = opts && opts.debugTiming ? util.time : util.notime;\n  time(\"layout\", function() {\n    var layoutGraph = \n      time(\"  buildLayoutGraph\", function() { return buildLayoutGraph(g); });\n    time(\"  runLayout\",        function() { runLayout(layoutGraph, time); });\n    time(\"  updateInputGraph\", function() { updateInputGraph(g, layoutGraph); });\n  });\n}\n\nfunction runLayout(g, time) {\n  time(\"    makeSpaceForEdgeLabels\", function() { makeSpaceForEdgeLabels(g); });\n  time(\"    removeSelfEdges\",        function() { removeSelfEdges(g); });\n  time(\"    acyclic\",                function() { acyclic.run(g); });\n  time(\"    nestingGraph.run\",       function() { nestingGraph.run(g); });\n  time(\"    rank\",                   function() { rank(util.asNonCompoundGraph(g)); });\n  time(\"    injectEdgeLabelProxies\", function() { injectEdgeLabelProxies(g); });\n  time(\"    removeEmptyRanks\",       function() { removeEmptyRanks(g); });\n  time(\"    nestingGraph.cleanup\",   function() { nestingGraph.cleanup(g); });\n  time(\"    normalizeRanks\",         function() { normalizeRanks(g); });\n  time(\"    assignRankMinMax\",       function() { assignRankMinMax(g); });\n  time(\"    removeEdgeLabelProxies\", function() { removeEdgeLabelProxies(g); });\n  time(\"    normalize.run\",          function() { normalize.run(g); });\n  time(\"    parentDummyChains\",      function() { parentDummyChains(g); });\n  time(\"    addBorderSegments\",      function() { addBorderSegments(g); });\n  time(\"    order\",                  function() { order(g); });\n  time(\"    insertSelfEdges\",        function() { insertSelfEdges(g); });\n  time(\"    adjustCoordinateSystem\", function() { coordinateSystem.adjust(g); });\n  time(\"    position\",               function() { position(g); });\n  time(\"    positionSelfEdges\",      function() { positionSelfEdges(g); });\n  time(\"    removeBorderNodes\",      function() { removeBorderNodes(g); });\n  time(\"    normalize.undo\",         function() { normalize.undo(g); });\n  time(\"    fixupEdgeLabelCoords\",   function() { fixupEdgeLabelCoords(g); });\n  time(\"    undoCoordinateSystem\",   function() { coordinateSystem.undo(g); });\n  time(\"    translateGraph\",         function() { translateGraph(g); });\n  time(\"    assignNodeIntersects\",   function() { assignNodeIntersects(g); });\n  time(\"    reversePoints\",          function() { reversePointsForReversedEdges(g); });\n  time(\"    acyclic.undo\",           function() { acyclic.undo(g); });\n}\n\n/*\n * Copies final layout information from the layout graph back to the input\n * graph. This process only copies whitelisted attributes from the layout graph\n * to the input graph, so it serves as a good place to determine what\n * attributes can influence layout.\n */\nfunction updateInputGraph(inputGraph, layoutGraph) {\n  _.forEach(inputGraph.nodes(), function(v) {\n    var inputLabel = inputGraph.node(v);\n    var layoutLabel = layoutGraph.node(v);\n\n    if (inputLabel) {\n      inputLabel.x = layoutLabel.x;\n      inputLabel.y = layoutLabel.y;\n\n      if (layoutGraph.children(v).length) {\n        inputLabel.width = layoutLabel.width;\n        inputLabel.height = layoutLabel.height;\n      }\n    }\n  });\n\n  _.forEach(inputGraph.edges(), function(e) {\n    var inputLabel = inputGraph.edge(e);\n    var layoutLabel = layoutGraph.edge(e);\n\n    inputLabel.points = layoutLabel.points;\n    if (_.has(layoutLabel, \"x\")) {\n      inputLabel.x = layoutLabel.x;\n      inputLabel.y = layoutLabel.y;\n    }\n  });\n\n  inputGraph.graph().width = layoutGraph.graph().width;\n  inputGraph.graph().height = layoutGraph.graph().height;\n}\n\nvar graphNumAttrs = [\"nodesep\", \"edgesep\", \"ranksep\", \"marginx\", \"marginy\"];\nvar graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: \"tb\" };\nvar graphAttrs = [\"acyclicer\", \"ranker\", \"rankdir\", \"align\"];\nvar nodeNumAttrs = [\"width\", \"height\"];\nvar nodeDefaults = { width: 0, height: 0 };\nvar edgeNumAttrs = [\"minlen\", \"weight\", \"width\", \"height\", \"labeloffset\"];\nvar edgeDefaults = {\n  minlen: 1, weight: 1, width: 0, height: 0,\n  labeloffset: 10, labelpos: \"r\"\n};\nvar edgeAttrs = [\"labelpos\"];\n\n/*\n * Constructs a new graph from the input graph, which can be used for layout.\n * This process copies only whitelisted attributes from the input graph to the\n * layout graph. Thus this function serves as a good place to determine what\n * attributes can influence layout.\n */\nfunction buildLayoutGraph(inputGraph) {\n  var g = new Graph({ multigraph: true, compound: true });\n  var graph = canonicalize(inputGraph.graph());\n\n  g.setGraph(_.merge({},\n    graphDefaults,\n    selectNumberAttrs(graph, graphNumAttrs),\n    _.pick(graph, graphAttrs)));\n\n  _.forEach(inputGraph.nodes(), function(v) {\n    var node = canonicalize(inputGraph.node(v));\n    g.setNode(v, _.defaults(selectNumberAttrs(node, nodeNumAttrs), nodeDefaults));\n    g.setParent(v, inputGraph.parent(v));\n  });\n\n  _.forEach(inputGraph.edges(), function(e) {\n    var edge = canonicalize(inputGraph.edge(e));\n    g.setEdge(e, _.merge({},\n      edgeDefaults,\n      selectNumberAttrs(edge, edgeNumAttrs),\n      _.pick(edge, edgeAttrs)));\n  });\n\n  return g;\n}\n\n/*\n * This idea comes from the Gansner paper: to account for edge labels in our\n * layout we split each rank in half by doubling minlen and halving ranksep.\n * Then we can place labels at these mid-points between nodes.\n *\n * We also add some minimal padding to the width to push the label for the edge\n * away from the edge itself a bit.\n */\nfunction makeSpaceForEdgeLabels(g) {\n  var graph = g.graph();\n  graph.ranksep /= 2;\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    edge.minlen *= 2;\n    if (edge.labelpos.toLowerCase() !== \"c\") {\n      if (graph.rankdir === \"TB\" || graph.rankdir === \"BT\") {\n        edge.width += edge.labeloffset;\n      } else {\n        edge.height += edge.labeloffset;\n      }\n    }\n  });\n}\n\n/*\n * Creates temporary dummy nodes that capture the rank in which each edge's\n * label is going to, if it has one of non-zero width and height. We do this\n * so that we can safely remove empty ranks while preserving balance for the\n * label's position.\n */\nfunction injectEdgeLabelProxies(g) {\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (edge.width && edge.height) {\n      var v = g.node(e.v);\n      var w = g.node(e.w);\n      var label = { rank: (w.rank - v.rank) / 2 + v.rank, e: e };\n      util.addDummyNode(g, \"edge-proxy\", label, \"_ep\");\n    }\n  });\n}\n\nfunction assignRankMinMax(g) {\n  var maxRank = 0;\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    if (node.borderTop) {\n      node.minRank = g.node(node.borderTop).rank;\n      node.maxRank = g.node(node.borderBottom).rank;\n      maxRank = _.max(maxRank, node.maxRank);\n    }\n  });\n  g.graph().maxRank = maxRank;\n}\n\nfunction removeEdgeLabelProxies(g) {\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    if (node.dummy === \"edge-proxy\") {\n      g.edge(node.e).labelRank = node.rank;\n      g.removeNode(v);\n    }\n  });\n}\n\nfunction translateGraph(g) {\n  var minX = Number.POSITIVE_INFINITY;\n  var maxX = 0;\n  var minY = Number.POSITIVE_INFINITY;\n  var maxY = 0;\n  var graphLabel = g.graph();\n  var marginX = graphLabel.marginx || 0;\n  var marginY = graphLabel.marginy || 0;\n\n  function getExtremes(attrs) {\n    var x = attrs.x;\n    var y = attrs.y;\n    var w = attrs.width;\n    var h = attrs.height;\n    minX = Math.min(minX, x - w / 2);\n    maxX = Math.max(maxX, x + w / 2);\n    minY = Math.min(minY, y - h / 2);\n    maxY = Math.max(maxY, y + h / 2);\n  }\n\n  _.forEach(g.nodes(), function(v) { getExtremes(g.node(v)); });\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (_.has(edge, \"x\")) {\n      getExtremes(edge);\n    }\n  });\n\n  minX -= marginX;\n  minY -= marginY;\n\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    node.x -= minX;\n    node.y -= minY;\n  });\n\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    _.forEach(edge.points, function(p) {\n      p.x -= minX;\n      p.y -= minY;\n    });\n    if (_.has(edge, \"x\")) { edge.x -= minX; }\n    if (_.has(edge, \"y\")) { edge.y -= minY; }\n  });\n\n  graphLabel.width = maxX - minX + marginX;\n  graphLabel.height = maxY - minY + marginY;\n}\n\nfunction assignNodeIntersects(g) {\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    var nodeV = g.node(e.v);\n    var nodeW = g.node(e.w);\n    var p1, p2;\n    if (!edge.points) {\n      edge.points = [];\n      p1 = nodeW;\n      p2 = nodeV;\n    } else {\n      p1 = edge.points[0];\n      p2 = edge.points[edge.points.length - 1];\n    }\n    edge.points.unshift(util.intersectRect(nodeV, p1));\n    edge.points.push(util.intersectRect(nodeW, p2));\n  });\n}\n\nfunction fixupEdgeLabelCoords(g) {\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (_.has(edge, \"x\")) {\n      if (edge.labelpos === \"l\" || edge.labelpos === \"r\") {\n        edge.width -= edge.labeloffset;\n      }\n      switch (edge.labelpos) {\n      case \"l\": edge.x -= edge.width / 2 + edge.labeloffset; break;\n      case \"r\": edge.x += edge.width / 2 + edge.labeloffset; break;\n      }\n    }\n  });\n}\n\nfunction reversePointsForReversedEdges(g) {\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (edge.reversed) {\n      edge.points.reverse();\n    }\n  });\n}\n\nfunction removeBorderNodes(g) {\n  _.forEach(g.nodes(), function(v) {\n    if (g.children(v).length) {\n      var node = g.node(v);\n      var t = g.node(node.borderTop);\n      var b = g.node(node.borderBottom);\n      var l = g.node(_.last(node.borderLeft));\n      var r = g.node(_.last(node.borderRight));\n\n      node.width = Math.abs(r.x - l.x);\n      node.height = Math.abs(b.y - t.y);\n      node.x = l.x + node.width / 2;\n      node.y = t.y + node.height / 2;\n    }\n  });\n\n  _.forEach(g.nodes(), function(v) {\n    if (g.node(v).dummy === \"border\") {\n      g.removeNode(v);\n    }\n  });\n}\n\nfunction removeSelfEdges(g) {\n  _.forEach(g.edges(), function(e) {\n    if (e.v === e.w) {\n      var node = g.node(e.v);\n      if (!node.selfEdges) {\n        node.selfEdges = [];\n      }\n      node.selfEdges.push({ e: e, label: g.edge(e) });\n      g.removeEdge(e);\n    }\n  });\n}\n\nfunction insertSelfEdges(g) {\n  var layers = util.buildLayerMatrix(g);\n  _.forEach(layers, function(layer) {\n    var orderShift = 0;\n    _.forEach(layer, function(v, i) {\n      var node = g.node(v);\n      node.order = i + orderShift;\n      _.forEach(node.selfEdges, function(selfEdge) {\n        util.addDummyNode(g, \"selfedge\", {\n          width: selfEdge.label.width,\n          height: selfEdge.label.height,\n          rank: node.rank,\n          order: i + (++orderShift),\n          e: selfEdge.e,\n          label: selfEdge.label\n        }, \"_se\");\n      });\n      delete node.selfEdges;\n    });\n  });\n}\n\nfunction positionSelfEdges(g) {\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    if (node.dummy === \"selfedge\") {\n      var selfNode = g.node(node.e.v);\n      var x = selfNode.x + selfNode.width / 2;\n      var y = selfNode.y;\n      var dx = node.x - x;\n      var dy = selfNode.height / 2;\n      g.setEdge(node.e, node.label);\n      g.removeNode(v);\n      node.label.points = [\n        { x: x + 2 * dx / 3, y: y - dy },\n        { x: x + 5 * dx / 6, y: y - dy },\n        { x: x +     dx    , y: y },\n        { x: x + 5 * dx / 6, y: y + dy },\n        { x: x + 2 * dx / 3, y: y + dy }\n      ];\n      node.label.x = node.x;\n      node.label.y = node.y;\n    }\n  });\n}\n\nfunction selectNumberAttrs(obj, attrs) {\n  return _.mapValues(_.pick(obj, attrs), Number);\n}\n\nfunction canonicalize(attrs) {\n  var newAttrs = {};\n  _.forEach(attrs, function(v, k) {\n    newAttrs[k.toLowerCase()] = v;\n  });\n  return newAttrs;\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;;;;CAEA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,CAAmC,gBACnC,IAAA,GAAA,EACA,IAAA,GAAA,CAAqC,kBACrC,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,CAA8B;AAElC,GAAO,UAAU;CAEjB,SAAS,EAAO,GAAG,GAAM;EACvB,IAAI,IAAO,KAAQ,EAAK,cAAc,EAAK,OAAO,EAAK;AACvD,IAAK,UAAU,WAAW;GACxB,IAAI,IACF,EAAK,sBAAsB,WAAW;AAAE,WAAO,EAAiB,EAAE;KAAI;AAExE,GADA,EAAK,eAAsB,WAAW;AAAE,MAAU,GAAa,EAAK;KAAI,EACxE,EAAK,sBAAsB,WAAW;AAAE,MAAiB,GAAG,EAAY;KAAI;IAC5E;;CAGJ,SAAS,EAAU,GAAG,GAAM;AA2B1B,EA1BA,EAAK,8BAA8B,WAAW;AAAE,KAAuB,EAAE;IAAI,EAC7E,EAAK,uBAA8B,WAAW;AAAE,KAAgB,EAAE;IAAI,EACtE,EAAK,eAA8B,WAAW;AAAE,KAAQ,IAAI,EAAE;IAAI,EAClE,EAAK,wBAA8B,WAAW;AAAE,KAAa,IAAI,EAAE;IAAI,EACvE,EAAK,YAA8B,WAAW;AAAE,KAAK,EAAK,mBAAmB,EAAE,CAAC;IAAI,EACpF,EAAK,8BAA8B,WAAW;AAAE,KAAuB,EAAE;IAAI,EAC7E,EAAK,wBAA8B,WAAW;AAAE,KAAiB,EAAE;IAAI,EACvE,EAAK,4BAA8B,WAAW;AAAE,KAAa,QAAQ,EAAE;IAAI,EAC3E,EAAK,sBAA8B,WAAW;AAAE,KAAe,EAAE;IAAI,EACrE,EAAK,wBAA8B,WAAW;AAAE,KAAiB,EAAE;IAAI,EACvE,EAAK,8BAA8B,WAAW;AAAE,KAAuB,EAAE;IAAI,EAC7E,EAAK,qBAA8B,WAAW;AAAE,KAAU,IAAI,EAAE;IAAI,EACpE,EAAK,yBAA8B,WAAW;AAAE,KAAkB,EAAE;IAAI,EACxE,EAAK,yBAA8B,WAAW;AAAE,KAAkB,EAAE;IAAI,EACxE,EAAK,aAA8B,WAAW;AAAE,KAAM,EAAE;IAAI,EAC5D,EAAK,uBAA8B,WAAW;AAAE,KAAgB,EAAE;IAAI,EACtE,EAAK,8BAA8B,WAAW;AAAE,KAAiB,OAAO,EAAE;IAAI,EAC9E,EAAK,gBAA8B,WAAW;AAAE,KAAS,EAAE;IAAI,EAC/D,EAAK,yBAA8B,WAAW;AAAE,KAAkB,EAAE;IAAI,EACxE,EAAK,yBAA8B,WAAW;AAAE,KAAkB,EAAE;IAAI,EACxE,EAAK,sBAA8B,WAAW;AAAE,KAAU,KAAK,EAAE;IAAI,EACrE,EAAK,4BAA8B,WAAW;AAAE,KAAqB,EAAE;IAAI,EAC3E,EAAK,4BAA8B,WAAW;AAAE,KAAiB,KAAK,EAAE;IAAI,EAC5E,EAAK,sBAA8B,WAAW;AAAE,KAAe,EAAE;IAAI,EACrE,EAAK,4BAA8B,WAAW;AAAE,KAAqB,EAAE;IAAI,EAC3E,EAAK,qBAA8B,WAAW;AAAE,KAA8B,EAAE;IAAI,EACpF,EAAK,oBAA8B,WAAW;AAAE,KAAQ,KAAK,EAAE;IAAI;;CASrE,SAAS,EAAiB,GAAY,GAAa;AA4BjD,EA3BA,EAAE,QAAQ,EAAW,OAAO,EAAE,SAAS,GAAG;GACxC,IAAI,IAAa,EAAW,KAAK,EAAE,EAC/B,IAAc,EAAY,KAAK,EAAE;AAErC,GAAI,MACF,EAAW,IAAI,EAAY,GAC3B,EAAW,IAAI,EAAY,GAEvB,EAAY,SAAS,EAAE,CAAC,WAC1B,EAAW,QAAQ,EAAY,OAC/B,EAAW,SAAS,EAAY;IAGpC,EAEF,EAAE,QAAQ,EAAW,OAAO,EAAE,SAAS,GAAG;GACxC,IAAI,IAAa,EAAW,KAAK,EAAE,EAC/B,IAAc,EAAY,KAAK,EAAE;AAGrC,GADA,EAAW,SAAS,EAAY,QAC5B,EAAE,IAAI,GAAa,IAAI,KACzB,EAAW,IAAI,EAAY,GAC3B,EAAW,IAAI,EAAY;IAE7B,EAEF,EAAW,OAAO,CAAC,QAAQ,EAAY,OAAO,CAAC,OAC/C,EAAW,OAAO,CAAC,SAAS,EAAY,OAAO,CAAC;;CAGlD,IAAI,IAAgB;EAAC;EAAW;EAAW;EAAW;EAAW;EAAU,EACvE,IAAgB;EAAE,SAAS;EAAI,SAAS;EAAI,SAAS;EAAI,SAAS;EAAM,EACxE,IAAa;EAAC;EAAa;EAAU;EAAW;EAAQ,EACxD,IAAe,CAAC,SAAS,SAAS,EAClC,IAAe;EAAE,OAAO;EAAG,QAAQ;EAAG,EACtC,IAAe;EAAC;EAAU;EAAU;EAAS;EAAU;EAAc,EACrE,IAAe;EACjB,QAAQ;EAAG,QAAQ;EAAG,OAAO;EAAG,QAAQ;EACxC,aAAa;EAAI,UAAU;EAC5B,EACG,IAAY,CAAC,WAAW;CAQ5B,SAAS,EAAiB,GAAY;EACpC,IAAI,IAAI,IAAI,EAAM;GAAE,YAAY;GAAM,UAAU;GAAM,CAAC,EACnD,IAAQ,EAAa,EAAW,OAAO,CAAC;AAqB5C,SAnBA,EAAE,SAAS,EAAE,MAAM,EAAE,EACnB,GACA,EAAkB,GAAO,EAAc,EACvC,EAAE,KAAK,GAAO,EAAW,CAAC,CAAC,EAE7B,EAAE,QAAQ,EAAW,OAAO,EAAE,SAAS,GAAG;GACxC,IAAI,IAAO,EAAa,EAAW,KAAK,EAAE,CAAC;AAE3C,GADA,EAAE,QAAQ,GAAG,EAAE,SAAS,EAAkB,GAAM,EAAa,EAAE,EAAa,CAAC,EAC7E,EAAE,UAAU,GAAG,EAAW,OAAO,EAAE,CAAC;IACpC,EAEF,EAAE,QAAQ,EAAW,OAAO,EAAE,SAAS,GAAG;GACxC,IAAI,IAAO,EAAa,EAAW,KAAK,EAAE,CAAC;AAC3C,KAAE,QAAQ,GAAG,EAAE,MAAM,EAAE,EACrB,GACA,EAAkB,GAAM,EAAa,EACrC,EAAE,KAAK,GAAM,EAAU,CAAC,CAAC;IAC3B,EAEK;;CAWT,SAAS,EAAuB,GAAG;EACjC,IAAI,IAAQ,EAAE,OAAO;AAErB,EADA,EAAM,WAAW,GACjB,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAO,EAAE,KAAK,EAAE;AAEpB,GADA,EAAK,UAAU,GACX,EAAK,SAAS,aAAa,KAAK,QAC9B,EAAM,YAAY,QAAQ,EAAM,YAAY,OAC9C,EAAK,SAAS,EAAK,cAEnB,EAAK,UAAU,EAAK;IAGxB;;CASJ,SAAS,EAAuB,GAAG;AACjC,IAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAO,EAAE,KAAK,EAAE;AACpB,OAAI,EAAK,SAAS,EAAK,QAAQ;IAC7B,IAAI,IAAI,EAAE,KAAK,EAAE,EAAE,EAEf,IAAQ;KAAE,OADN,EAAE,KAAK,EAAE,EAAE,CACI,OAAO,EAAE,QAAQ,IAAI,EAAE;KAAS;KAAG;AAC1D,MAAK,aAAa,GAAG,cAAc,GAAO,MAAM;;IAElD;;CAGJ,SAAS,EAAiB,GAAG;EAC3B,IAAI,IAAU;AASd,EARA,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAO,EAAE,KAAK,EAAE;AACpB,GAAI,EAAK,cACP,EAAK,UAAU,EAAE,KAAK,EAAK,UAAU,CAAC,MACtC,EAAK,UAAU,EAAE,KAAK,EAAK,aAAa,CAAC,MACzC,IAAU,EAAE,IAAI,GAAS,EAAK,QAAQ;IAExC,EACF,EAAE,OAAO,CAAC,UAAU;;CAGtB,SAAS,EAAuB,GAAG;AACjC,IAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAO,EAAE,KAAK,EAAE;AACpB,GAAI,EAAK,UAAU,iBACjB,EAAE,KAAK,EAAK,EAAE,CAAC,YAAY,EAAK,MAChC,EAAE,WAAW,EAAE;IAEjB;;CAGJ,SAAS,EAAe,GAAG;EACzB,IAAI,IAAO,UACP,IAAO,GACP,IAAO,UACP,IAAO,GACP,IAAa,EAAE,OAAO,EACtB,IAAU,EAAW,WAAW,GAChC,IAAU,EAAW,WAAW;EAEpC,SAAS,EAAY,GAAO;GAC1B,IAAI,IAAI,EAAM,GACV,IAAI,EAAM,GACV,IAAI,EAAM,OACV,IAAI,EAAM;AAId,GAHA,IAAO,KAAK,IAAI,GAAM,IAAI,IAAI,EAAE,EAChC,IAAO,KAAK,IAAI,GAAM,IAAI,IAAI,EAAE,EAChC,IAAO,KAAK,IAAI,GAAM,IAAI,IAAI,EAAE,EAChC,IAAO,KAAK,IAAI,GAAM,IAAI,IAAI,EAAE;;AA+BlC,EA5BA,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;AAAE,KAAY,EAAE,KAAK,EAAE,CAAC;IAAI,EAC7D,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAO,EAAE,KAAK,EAAE;AACpB,GAAI,EAAE,IAAI,GAAM,IAAI,IAClB,EAAY,EAAK;IAEnB,EAEF,KAAQ,GACR,KAAQ,GAER,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAO,EAAE,KAAK,EAAE;AAEpB,GADA,EAAK,KAAK,GACV,EAAK,KAAK;IACV,EAEF,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAO,EAAE,KAAK,EAAE;AAMpB,GALA,EAAE,QAAQ,EAAK,QAAQ,SAAS,GAAG;AAEjC,IADA,EAAE,KAAK,GACP,EAAE,KAAK;KACP,EACE,EAAE,IAAI,GAAM,IAAI,KAAI,EAAK,KAAK,IAC9B,EAAE,IAAI,GAAM,IAAI,KAAI,EAAK,KAAK;IAClC,EAEF,EAAW,QAAQ,IAAO,IAAO,GACjC,EAAW,SAAS,IAAO,IAAO;;CAGpC,SAAS,EAAqB,GAAG;AAC/B,IAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAO,EAAE,KAAK,EAAE,EAChB,IAAQ,EAAE,KAAK,EAAE,EAAE,EACnB,IAAQ,EAAE,KAAK,EAAE,EAAE,EACnB,GAAI;AAUR,GATK,EAAK,UAKR,IAAK,EAAK,OAAO,IACjB,IAAK,EAAK,OAAO,EAAK,OAAO,SAAS,OALtC,EAAK,SAAS,EAAE,EAChB,IAAK,GACL,IAAK,IAKP,EAAK,OAAO,QAAQ,EAAK,cAAc,GAAO,EAAG,CAAC,EAClD,EAAK,OAAO,KAAK,EAAK,cAAc,GAAO,EAAG,CAAC;IAC/C;;CAGJ,SAAS,EAAqB,GAAG;AAC/B,IAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAO,EAAE,KAAK,EAAE;AACpB,OAAI,EAAE,IAAI,GAAM,IAAI,CAIlB,UAHI,EAAK,aAAa,OAAO,EAAK,aAAa,SAC7C,EAAK,SAAS,EAAK,cAEb,EAAK,UAAb;IACA,KAAK;AAAK,OAAK,KAAK,EAAK,QAAQ,IAAI,EAAK;AAAa;IACvD,KAAK;AAAK,OAAK,KAAK,EAAK,QAAQ,IAAI,EAAK;AAAa;;IAGzD;;CAGJ,SAAS,EAA8B,GAAG;AACxC,IAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAO,EAAE,KAAK,EAAE;AACpB,GAAI,EAAK,YACP,EAAK,OAAO,SAAS;IAEvB;;CAGJ,SAAS,EAAkB,GAAG;AAgB5B,EAfA,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;AAC/B,OAAI,EAAE,SAAS,EAAE,CAAC,QAAQ;IACxB,IAAI,IAAO,EAAE,KAAK,EAAE,EAChB,IAAI,EAAE,KAAK,EAAK,UAAU,EAC1B,IAAI,EAAE,KAAK,EAAK,aAAa,EAC7B,IAAI,EAAE,KAAK,EAAE,KAAK,EAAK,WAAW,CAAC,EACnC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAK,YAAY,CAAC;AAKxC,IAHA,EAAK,QAAQ,KAAK,IAAI,EAAE,IAAI,EAAE,EAAE,EAChC,EAAK,SAAS,KAAK,IAAI,EAAE,IAAI,EAAE,EAAE,EACjC,EAAK,IAAI,EAAE,IAAI,EAAK,QAAQ,GAC5B,EAAK,IAAI,EAAE,IAAI,EAAK,SAAS;;IAE/B,EAEF,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;AAC/B,GAAI,EAAE,KAAK,EAAE,CAAC,UAAU,YACtB,EAAE,WAAW,EAAE;IAEjB;;CAGJ,SAAS,EAAgB,GAAG;AAC1B,IAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;AAC/B,OAAI,EAAE,MAAM,EAAE,GAAG;IACf,IAAI,IAAO,EAAE,KAAK,EAAE,EAAE;AAKtB,IAJA,AACE,EAAK,cAAY,EAAE,EAErB,EAAK,UAAU,KAAK;KAAK;KAAG,OAAO,EAAE,KAAK,EAAE;KAAE,CAAC,EAC/C,EAAE,WAAW,EAAE;;IAEjB;;CAGJ,SAAS,EAAgB,GAAG;EAC1B,IAAI,IAAS,EAAK,iBAAiB,EAAE;AACrC,IAAE,QAAQ,GAAQ,SAAS,GAAO;GAChC,IAAI,IAAa;AACjB,KAAE,QAAQ,GAAO,SAAS,GAAG,GAAG;IAC9B,IAAI,IAAO,EAAE,KAAK,EAAE;AAYpB,IAXA,EAAK,QAAQ,IAAI,GACjB,EAAE,QAAQ,EAAK,WAAW,SAAS,GAAU;AAC3C,OAAK,aAAa,GAAG,YAAY;MAC/B,OAAO,EAAS,MAAM;MACtB,QAAQ,EAAS,MAAM;MACvB,MAAM,EAAK;MACX,OAAO,IAAK,EAAE;MACd,GAAG,EAAS;MACZ,OAAO,EAAS;MACjB,EAAE,MAAM;MACT,EACF,OAAO,EAAK;KACZ;IACF;;CAGJ,SAAS,EAAkB,GAAG;AAC5B,IAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAO,EAAE,KAAK,EAAE;AACpB,OAAI,EAAK,UAAU,YAAY;IAC7B,IAAI,IAAW,EAAE,KAAK,EAAK,EAAE,EAAE,EAC3B,IAAI,EAAS,IAAI,EAAS,QAAQ,GAClC,IAAI,EAAS,GACb,IAAK,EAAK,IAAI,GACd,IAAK,EAAS,SAAS;AAW3B,IAVA,EAAE,QAAQ,EAAK,GAAG,EAAK,MAAM,EAC7B,EAAE,WAAW,EAAE,EACf,EAAK,MAAM,SAAS;KAClB;MAAE,GAAG,IAAI,IAAI,IAAK;MAAG,GAAG,IAAI;MAAI;KAChC;MAAE,GAAG,IAAI,IAAI,IAAK;MAAG,GAAG,IAAI;MAAI;KAChC;MAAE,GAAG,IAAQ;MAAW;MAAG;KAC3B;MAAE,GAAG,IAAI,IAAI,IAAK;MAAG,GAAG,IAAI;MAAI;KAChC;MAAE,GAAG,IAAI,IAAI,IAAK;MAAG,GAAG,IAAI;MAAI;KACjC,EACD,EAAK,MAAM,IAAI,EAAK,GACpB,EAAK,MAAM,IAAI,EAAK;;IAEtB;;CAGJ,SAAS,EAAkB,GAAK,GAAO;AACrC,SAAO,EAAE,UAAU,EAAE,KAAK,GAAK,EAAM,EAAE,OAAO;;CAGhD,SAAS,EAAa,GAAO;EAC3B,IAAI,IAAW,EAAE;AAIjB,SAHA,EAAE,QAAQ,GAAO,SAAS,GAAG,GAAG;AAC9B,KAAS,EAAE,aAAa,IAAI;IAC5B,EACK"}

package/dist/node_modules/dagre/lib/lodash.js

@@ -0,0 +1,67 @@
+import { __commonJSMin as e, __require as t } from "../../../_virtual/_rolldown/runtime.js";
+import { require_constant as n } from "../../lodash/constant.js";
+import { require_sortBy as r } from "../../lodash/sortBy.js";
+import { require_now as i } from "../../lodash/now.js";
+import { require_max as a } from "../../lodash/max.js";
+import { require_min as o } from "../../lodash/min.js";
+import { require_map as s } from "../../lodash/map.js";
+import { require_last as c } from "../../lodash/last.js";
+import { require_minBy as l } from "../../lodash/minBy.js";
+import { require_range as u } from "../../lodash/range.js";
+import { require_mapValues as d } from "../../lodash/mapValues.js";
+import { require_find as f } from "../../lodash/find.js";
+import { require_flatten as p } from "../../lodash/flatten.js";
+import { require_forEach as m } from "../../lodash/forEach.js";
+import { require_each as h } from "../../lodash/each.js";
+import { require_filter as g } from "../../lodash/filter.js";
+import { require_has as _ } from "../../lodash/has.js";
+import { require_isUndefined as v } from "../../lodash/isUndefined.js";
+import { require_reduce as y } from "../../lodash/reduce.js";
+import { require_values as b } from "../../lodash/values.js";
+import { require_cloneDeep as x } from "../../lodash/cloneDeep.js";
+import { require_defaults as S } from "../../lodash/defaults.js";
+import { require_forIn as C } from "../../lodash/forIn.js";
+import { require_merge as w } from "../../lodash/merge.js";
+import { require_pick as T } from "../../lodash/pick.js";
+import { require_uniqueId as E } from "../../lodash/uniqueId.js";
+import { require_zipObject as D } from "../../lodash/zipObject.js";
+//#region node_modules/dagre/lib/lodash.js
+var O = /* @__PURE__ */ e(((e, O) => {
+	var k;
+	if (typeof t == "function") try {
+		k = {
+			cloneDeep: x(),
+			constant: n(),
+			defaults: S(),
+			each: h(),
+			filter: g(),
+			find: f(),
+			flatten: p(),
+			forEach: m(),
+			forIn: C(),
+			has: _(),
+			isUndefined: v(),
+			last: c(),
+			map: s(),
+			mapValues: d(),
+			max: a(),
+			merge: w(),
+			min: o(),
+			minBy: l(),
+			now: i(),
+			pick: T(),
+			range: u(),
+			reduce: y(),
+			sortBy: r(),
+			uniqueId: E(),
+			values: b(),
+			zipObject: D()
+		};
+	} catch {}
+	k ||= window._, O.exports = k;
+}));
+//#endregion
+export default O();
+export { O as require_lodash };
+
+//# sourceMappingURL=lodash.js.map

package/dist/node_modules/dagre/lib/lodash.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lodash.js","names":[],"sources":["../../../../node_modules/dagre/lib/lodash.js"],"sourcesContent":["/* global window */\n\nvar lodash;\n\nif (typeof require === \"function\") {\n  try {\n    lodash = {\n      cloneDeep: require(\"lodash/cloneDeep\"),\n      constant: require(\"lodash/constant\"),\n      defaults: require(\"lodash/defaults\"),\n      each: require(\"lodash/each\"),\n      filter: require(\"lodash/filter\"),\n      find: require(\"lodash/find\"),\n      flatten: require(\"lodash/flatten\"),\n      forEach: require(\"lodash/forEach\"),\n      forIn: require(\"lodash/forIn\"),\n      has:  require(\"lodash/has\"),\n      isUndefined: require(\"lodash/isUndefined\"),\n      last: require(\"lodash/last\"),\n      map: require(\"lodash/map\"),\n      mapValues: require(\"lodash/mapValues\"),\n      max: require(\"lodash/max\"),\n      merge: require(\"lodash/merge\"),\n      min: require(\"lodash/min\"),\n      minBy: require(\"lodash/minBy\"),\n      now: require(\"lodash/now\"),\n      pick: require(\"lodash/pick\"),\n      range: require(\"lodash/range\"),\n      reduce: require(\"lodash/reduce\"),\n      sortBy: require(\"lodash/sortBy\"),\n      uniqueId: require(\"lodash/uniqueId\"),\n      values: require(\"lodash/values\"),\n      zipObject: require(\"lodash/zipObject\"),\n    };\n  } catch (e) {\n    // continue regardless of error\n  }\n}\n\nif (!lodash) {\n  lodash = window._;\n}\n\nmodule.exports = lodash;\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAEA,IAAI;AAEJ,KAAI,OAAA,KAAmB,WACrB,KAAI;AACF,MAAS;GACP,WAAA,GAAA;GACA,UAAA,GAAA;GACA,UAAA,GAAA;GACA,MAAA,GAAA;GACA,QAAA,GAAA;GACA,MAAA,GAAA;GACA,SAAA,GAAA;GACA,SAAA,GAAA;GACA,OAAA,GAAA;GACA,KAAA,GAAA;GACA,aAAA,GAAA;GACA,MAAA,GAAA;GACA,KAAA,GAAA;GACA,WAAA,GAAA;GACA,KAAA,GAAA;GACA,OAAA,GAAA;GACA,KAAA,GAAA;GACA,OAAA,GAAA;GACA,KAAA,GAAA;GACA,MAAA,GAAA;GACA,OAAA,GAAA;GACA,QAAA,GAAA;GACA,QAAA,GAAA;GACA,UAAA,GAAA;GACA,QAAA,GAAA;GACA,WAAA,GAAA;GACD;SACS;AASd,CAJA,AACE,MAAS,OAAO,GAGlB,EAAO,UAAU"}

package/dist/node_modules/dagre/lib/nesting-graph.js

@@ -0,0 +1,76 @@
+import { __commonJSMin as e } from "../../../_virtual/_rolldown/runtime.js";
+import { require_lodash as t } from "./lodash.js";
+import { require_util as n } from "./util.js";
+//#region node_modules/dagre/lib/nesting-graph.js
+var r = /* @__PURE__ */ e(((e, r) => {
+	var i = t(), a = n();
+	r.exports = {
+		run: o,
+		cleanup: u
+	};
+	function o(e) {
+		var t = a.addDummyNode(e, "root", {}, "_root"), n = c(e), r = i.max(i.values(n)) - 1, o = 2 * r + 1;
+		e.graph().nestingRoot = t, i.forEach(e.edges(), function(t) {
+			e.edge(t).minlen *= o;
+		});
+		var u = l(e) + 1;
+		i.forEach(e.children(), function(i) {
+			s(e, t, o, u, r, n, i);
+		}), e.graph().nodeRankFactor = o;
+	}
+	function s(e, t, n, r, o, c, l) {
+		var u = e.children(l);
+		if (!u.length) {
+			l !== t && e.setEdge(t, l, {
+				weight: 0,
+				minlen: n
+			});
+			return;
+		}
+		var d = a.addBorderNode(e, "_bt"), f = a.addBorderNode(e, "_bb"), p = e.node(l);
+		e.setParent(d, l), p.borderTop = d, e.setParent(f, l), p.borderBottom = f, i.forEach(u, function(i) {
+			s(e, t, n, r, o, c, i);
+			var a = e.node(i), u = a.borderTop ? a.borderTop : i, p = a.borderBottom ? a.borderBottom : i, m = a.borderTop ? r : 2 * r, h = u === p ? o - c[l] + 1 : 1;
+			e.setEdge(d, u, {
+				weight: m,
+				minlen: h,
+				nestingEdge: !0
+			}), e.setEdge(p, f, {
+				weight: m,
+				minlen: h,
+				nestingEdge: !0
+			});
+		}), e.parent(l) || e.setEdge(t, d, {
+			weight: 0,
+			minlen: o + c[l]
+		});
+	}
+	function c(e) {
+		var t = {};
+		function n(r, a) {
+			var o = e.children(r);
+			o && o.length && i.forEach(o, function(e) {
+				n(e, a + 1);
+			}), t[r] = a;
+		}
+		return i.forEach(e.children(), function(e) {
+			n(e, 1);
+		}), t;
+	}
+	function l(e) {
+		return i.reduce(e.edges(), function(t, n) {
+			return t + e.edge(n).weight;
+		}, 0);
+	}
+	function u(e) {
+		var t = e.graph();
+		e.removeNode(t.nestingRoot), delete t.nestingRoot, i.forEach(e.edges(), function(t) {
+			e.edge(t).nestingEdge && e.removeEdge(t);
+		});
+	}
+}));
+//#endregion
+export default r();
+export { r as require_nesting_graph };
+
+//# sourceMappingURL=nesting-graph.js.map

package/dist/node_modules/dagre/lib/nesting-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nesting-graph.js","names":[],"sources":["../../../../node_modules/dagre/lib/nesting-graph.js"],"sourcesContent":["var _ = require(\"./lodash\");\nvar util = require(\"./util\");\n\nmodule.exports = {\n  run: run,\n  cleanup: cleanup\n};\n\n/*\n * A nesting graph creates dummy nodes for the tops and bottoms of subgraphs,\n * adds appropriate edges to ensure that all cluster nodes are placed between\n * these boundries, and ensures that the graph is connected.\n *\n * In addition we ensure, through the use of the minlen property, that nodes\n * and subgraph border nodes to not end up on the same rank.\n *\n * Preconditions:\n *\n *    1. Input graph is a DAG\n *    2. Nodes in the input graph has a minlen attribute\n *\n * Postconditions:\n *\n *    1. Input graph is connected.\n *    2. Dummy nodes are added for the tops and bottoms of subgraphs.\n *    3. The minlen attribute for nodes is adjusted to ensure nodes do not\n *       get placed on the same rank as subgraph border nodes.\n *\n * The nesting graph idea comes from Sander, \"Layout of Compound Directed\n * Graphs.\"\n */\nfunction run(g) {\n  var root = util.addDummyNode(g, \"root\", {}, \"_root\");\n  var depths = treeDepths(g);\n  var height = _.max(_.values(depths)) - 1; // Note: depths is an Object not an array\n  var nodeSep = 2 * height + 1;\n\n  g.graph().nestingRoot = root;\n\n  // Multiply minlen by nodeSep to align nodes on non-border ranks.\n  _.forEach(g.edges(), function(e) { g.edge(e).minlen *= nodeSep; });\n\n  // Calculate a weight that is sufficient to keep subgraphs vertically compact\n  var weight = sumWeights(g) + 1;\n\n  // Create border nodes and link them up\n  _.forEach(g.children(), function(child) {\n    dfs(g, root, nodeSep, weight, height, depths, child);\n  });\n\n  // Save the multiplier for node layers for later removal of empty border\n  // layers.\n  g.graph().nodeRankFactor = nodeSep;\n}\n\nfunction dfs(g, root, nodeSep, weight, height, depths, v) {\n  var children = g.children(v);\n  if (!children.length) {\n    if (v !== root) {\n      g.setEdge(root, v, { weight: 0, minlen: nodeSep });\n    }\n    return;\n  }\n\n  var top = util.addBorderNode(g, \"_bt\");\n  var bottom = util.addBorderNode(g, \"_bb\");\n  var label = g.node(v);\n\n  g.setParent(top, v);\n  label.borderTop = top;\n  g.setParent(bottom, v);\n  label.borderBottom = bottom;\n\n  _.forEach(children, function(child) {\n    dfs(g, root, nodeSep, weight, height, depths, child);\n\n    var childNode = g.node(child);\n    var childTop = childNode.borderTop ? childNode.borderTop : child;\n    var childBottom = childNode.borderBottom ? childNode.borderBottom : child;\n    var thisWeight = childNode.borderTop ? weight : 2 * weight;\n    var minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;\n\n    g.setEdge(top, childTop, {\n      weight: thisWeight,\n      minlen: minlen,\n      nestingEdge: true\n    });\n\n    g.setEdge(childBottom, bottom, {\n      weight: thisWeight,\n      minlen: minlen,\n      nestingEdge: true\n    });\n  });\n\n  if (!g.parent(v)) {\n    g.setEdge(root, top, { weight: 0, minlen: height + depths[v] });\n  }\n}\n\nfunction treeDepths(g) {\n  var depths = {};\n  function dfs(v, depth) {\n    var children = g.children(v);\n    if (children && children.length) {\n      _.forEach(children, function(child) {\n        dfs(child, depth + 1);\n      });\n    }\n    depths[v] = depth;\n  }\n  _.forEach(g.children(), function(v) { dfs(v, 1); });\n  return depths;\n}\n\nfunction sumWeights(g) {\n  return _.reduce(g.edges(), function(acc, e) {\n    return acc + g.edge(e).weight;\n  }, 0);\n}\n\nfunction cleanup(g) {\n  var graphLabel = g.graph();\n  g.removeNode(graphLabel.nestingRoot);\n  delete graphLabel.nestingRoot;\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (edge.nestingEdge) {\n      g.removeEdge(e);\n    }\n  });\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;CAAA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA;AAEJ,GAAO,UAAU;EACV;EACI;EACV;CAyBD,SAAS,EAAI,GAAG;EACd,IAAI,IAAO,EAAK,aAAa,GAAG,QAAQ,EAAE,EAAE,QAAQ,EAChD,IAAS,EAAW,EAAE,EACtB,IAAS,EAAE,IAAI,EAAE,OAAO,EAAO,CAAC,GAAG,GACnC,IAAU,IAAI,IAAS;AAK3B,EAHA,EAAE,OAAO,CAAC,cAAc,GAGxB,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;AAAE,KAAE,KAAK,EAAE,CAAC,UAAU;IAAW;EAGlE,IAAI,IAAS,EAAW,EAAE,GAAG;AAS7B,EANA,EAAE,QAAQ,EAAE,UAAU,EAAE,SAAS,GAAO;AACtC,KAAI,GAAG,GAAM,GAAS,GAAQ,GAAQ,GAAQ,EAAM;IACpD,EAIF,EAAE,OAAO,CAAC,iBAAiB;;CAG7B,SAAS,EAAI,GAAG,GAAM,GAAS,GAAQ,GAAQ,GAAQ,GAAG;EACxD,IAAI,IAAW,EAAE,SAAS,EAAE;AAC5B,MAAI,CAAC,EAAS,QAAQ;AACpB,GAAI,MAAM,KACR,EAAE,QAAQ,GAAM,GAAG;IAAE,QAAQ;IAAG,QAAQ;IAAS,CAAC;AAEpD;;EAGF,IAAI,IAAM,EAAK,cAAc,GAAG,MAAM,EAClC,IAAS,EAAK,cAAc,GAAG,MAAM,EACrC,IAAQ,EAAE,KAAK,EAAE;AA6BrB,EA3BA,EAAE,UAAU,GAAK,EAAE,EACnB,EAAM,YAAY,GAClB,EAAE,UAAU,GAAQ,EAAE,EACtB,EAAM,eAAe,GAErB,EAAE,QAAQ,GAAU,SAAS,GAAO;AAClC,KAAI,GAAG,GAAM,GAAS,GAAQ,GAAQ,GAAQ,EAAM;GAEpD,IAAI,IAAY,EAAE,KAAK,EAAM,EACzB,IAAW,EAAU,YAAY,EAAU,YAAY,GACvD,IAAc,EAAU,eAAe,EAAU,eAAe,GAChE,IAAa,EAAU,YAAY,IAAS,IAAI,GAChD,IAAS,MAAa,IAAkB,IAAS,EAAO,KAAK,IAAzB;AAQxC,GANA,EAAE,QAAQ,GAAK,GAAU;IACvB,QAAQ;IACA;IACR,aAAa;IACd,CAAC,EAEF,EAAE,QAAQ,GAAa,GAAQ;IAC7B,QAAQ;IACA;IACR,aAAa;IACd,CAAC;IACF,EAEG,EAAE,OAAO,EAAE,IACd,EAAE,QAAQ,GAAM,GAAK;GAAE,QAAQ;GAAG,QAAQ,IAAS,EAAO;GAAI,CAAC;;CAInE,SAAS,EAAW,GAAG;EACrB,IAAI,IAAS,EAAE;EACf,SAAS,EAAI,GAAG,GAAO;GACrB,IAAI,IAAW,EAAE,SAAS,EAAE;AAM5B,GALI,KAAY,EAAS,UACvB,EAAE,QAAQ,GAAU,SAAS,GAAO;AAClC,MAAI,GAAO,IAAQ,EAAE;KACrB,EAEJ,EAAO,KAAK;;AAGd,SADA,EAAE,QAAQ,EAAE,UAAU,EAAE,SAAS,GAAG;AAAE,KAAI,GAAG,EAAE;IAAI,EAC5C;;CAGT,SAAS,EAAW,GAAG;AACrB,SAAO,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,GAAK,GAAG;AAC1C,UAAO,IAAM,EAAE,KAAK,EAAE,CAAC;KACtB,EAAE;;CAGP,SAAS,EAAQ,GAAG;EAClB,IAAI,IAAa,EAAE,OAAO;AAG1B,EAFA,EAAE,WAAW,EAAW,YAAY,EACpC,OAAO,EAAW,aAClB,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;AAE/B,GADW,EAAE,KAAK,EAAE,CACX,eACP,EAAE,WAAW,EAAE;IAEjB"}