@marimo-team/islands 0.14.11-dev2 → 0.14.11-dev21

package/dist/{kanban-definition-NDS4AKOZ-3NJYjnpz.js → kanban-definition-ILFWEQ3N-nKJ02Ox0.js}

@@ -1,4 +1,5 @@
-import { _ as o, l as te, c as U, K as fe, $ as ye, a0 as be, a1 as me, T as _e, H as K, i as F, v as Ee, J as ke, V as Se, W as ce, X as le } from "./mermaid-DCIbF0Rd.js";
+import { g as fe } from "./chunk-E2GYISFI-BzFDmP6o.js";
+import { _ as o, l as te, c as U, K as ye, a0 as be, a1 as me, a2 as _e, V as Ee, H as K, i as F, v as ke, J as Se, W as Ne, X as ce, Y as le } from "./mermaid-CRRCnedu.js";
 var $ = function() {
   var e = /* @__PURE__ */ o(function(O, i, n, r) {
     for (n = n || {}, r = O.length; r--; n[O[r]] = i) ;
@@ -429,9 +430,9 @@ Expecting ` + X.join(", ") + ", got '" + (this.terminals_[k] || k) + "'" : Z = "
   return o(B, "Parser"), B.prototype = T, T.Parser = B, new B();
 }();
 $.parser = $;
-var Ne = $, v = [], ne = [], ee = 0, ie = {}, xe = /* @__PURE__ */ o(() => {
+var xe = $, v = [], ne = [], ee = 0, ie = {}, ve = /* @__PURE__ */ o(() => {
   v = [], ne = [], ee = 0, ie = {};
-}, "clear"), ve = /* @__PURE__ */ o((e) => {
+}, "clear"), De = /* @__PURE__ */ o((e) => {
   if (v.length === 0)
     return null;
   const u = v[0].level;
@@ -442,7 +443,7 @@ var Ne = $, v = [], ne = [], ee = 0, ie = {}, xe = /* @__PURE__ */ o(() => {
   return e === (p == null ? void 0 : p.level) ? null : p;
 }, "getSection"), he = /* @__PURE__ */ o(function() {
   return ne;
-}, "getSections"), De = /* @__PURE__ */ o(function() {
+}, "getSections"), Le = /* @__PURE__ */ o(function() {
   const e = [], u = [], p = he(), s = U();
   for (const d of p) {
     const E = {
@@ -476,7 +477,7 @@ var Ne = $, v = [], ne = [], ee = 0, ie = {}, xe = /* @__PURE__ */ o(() => {
     }
   }
   return { nodes: u, edges: e, other: {}, config: U() };
-}, "getData"), Le = /* @__PURE__ */ o((e, u, p, s, d) => {
+}, "getData"), Oe = /* @__PURE__ */ o((e, u, p, s, d) => {
   var _a, _b;
   const E = U();
   let b = ((_a = E.mindmap) == null ? void 0 : _a.padding) ?? K.mindmap.padding;
@@ -501,12 +502,12 @@ var Ne = $, v = [], ne = [], ee = 0, ie = {}, xe = /* @__PURE__ */ o(() => {
 ` : I = `{
 ` + d + `
 }`;
-    const g = Ee(I, { schema: ke });
+    const g = ke(I, { schema: Se });
     if (g.shape && (g.shape !== g.shape.toLowerCase() || g.shape.includes("_")))
       throw new Error(`No such shape: ${g.shape}. Shape names should be lowercase.`);
     (g == null ? void 0 : g.shape) && g.shape === "kanbanItem" && (l.shape = g == null ? void 0 : g.shape), (g == null ? void 0 : g.label) && (l.label = g == null ? void 0 : g.label), (g == null ? void 0 : g.icon) && (l.icon = g == null ? void 0 : g.icon.toString()), (g == null ? void 0 : g.assigned) && (l.assigned = g == null ? void 0 : g.assigned.toString()), (g == null ? void 0 : g.ticket) && (l.ticket = g == null ? void 0 : g.ticket.toString()), (g == null ? void 0 : g.priority) && (l.priority = g == null ? void 0 : g.priority);
   }
-  const D = ve(e);
+  const D = De(e);
   D ? l.parentId = D.id || "kbn" + ee++ : ne.push(l), v.push(l);
 }, "addNode"), f = {
   DEFAULT: 0,
@@ -517,7 +518,7 @@ var Ne = $, v = [], ne = [], ee = 0, ie = {}, xe = /* @__PURE__ */ o(() => {
   CLOUD: 4,
   BANG: 5,
   HEXAGON: 6
-}, Oe = /* @__PURE__ */ o((e, u) => {
+}, Ie = /* @__PURE__ */ o((e, u) => {
   switch (te.debug("In get type", e, u), e) {
     case "[":
       return f.RECT;
@@ -534,14 +535,14 @@ var Ne = $, v = [], ne = [], ee = 0, ie = {}, xe = /* @__PURE__ */ o(() => {
     default:
       return f.DEFAULT;
   }
-}, "getType"), Ie = /* @__PURE__ */ o((e, u) => {
+}, "getType"), Ce = /* @__PURE__ */ o((e, u) => {
   ie[e] = u;
-}, "setElementForId"), Ce = /* @__PURE__ */ o((e) => {
+}, "setElementForId"), we = /* @__PURE__ */ o((e) => {
   if (!e)
     return;
   const u = U(), p = v[v.length - 1];
   e.icon && (p.icon = F(e.icon, u)), e.class && (p.cssClasses = F(e.class, u));
-}, "decorateNode"), we = /* @__PURE__ */ o((e) => {
+}, "decorateNode"), Ae = /* @__PURE__ */ o((e) => {
   switch (e) {
     case f.DEFAULT:
       return "no-border";
@@ -561,25 +562,25 @@ var Ne = $, v = [], ne = [], ee = 0, ie = {}, xe = /* @__PURE__ */ o(() => {
     default:
       return "no-border";
   }
-}, "type2Str"), Ae = /* @__PURE__ */ o(() => te, "getLogger"), Te = /* @__PURE__ */ o((e) => ie[e], "getElementById"), Re = {
-  clear: xe,
-  addNode: Le,
+}, "type2Str"), Te = /* @__PURE__ */ o(() => te, "getLogger"), Re = /* @__PURE__ */ o((e) => ie[e], "getElementById"), Pe = {
+  clear: ve,
+  addNode: Oe,
   getSections: he,
-  getData: De,
+  getData: Le,
   nodeType: f,
-  getType: Oe,
-  setElementForId: Ie,
-  decorateNode: Ce,
-  type2Str: we,
-  getLogger: Ae,
-  getElementById: Te
-}, Pe = Re, Ve = /* @__PURE__ */ o(async (e, u, p, s) => {
+  getType: Ie,
+  setElementForId: Ce,
+  decorateNode: we,
+  type2Str: Ae,
+  getLogger: Te,
+  getElementById: Re
+}, Ve = Pe, Be = /* @__PURE__ */ o(async (e, u, p, s) => {
   var _a, _b, _c, _d, _e2;
   te.debug(`Rendering kanban diagram
 ` + e);
   const E = s.db.getData(), b = U();
   b.htmlLabels = false;
-  const l = fe(u), D = l.append("g");
+  const l = ye(u), D = l.append("g");
   D.attr("class", "sections");
   const I = l.append("g");
   I.attr("class", "items");
@@ -593,7 +594,7 @@ var Ne = $, v = [], ne = [], ee = 0, ie = {}, xe = /* @__PURE__ */ o(() => {
   for (const m of g) {
     const A = ((_a = b == null ? void 0 : b.kanban) == null ? void 0 : _a.sectionWidth) || 200;
     w = w + 1, m.x = A * w + (w - 1) * _ / 2, m.width = A, m.y = 0, m.height = A * 3, m.rx = 5, m.ry = 5, m.cssClasses = m.cssClasses + " section-" + w;
-    const L = await ye(D, m);
+    const L = await be(D, m);
     N = Math.max(N, (_b = L == null ? void 0 : L.labelBBox) == null ? void 0 : _b.height), G.push(L);
   }
   let V = 0;
@@ -607,24 +608,24 @@ var Ne = $, v = [], ne = [], ee = 0, ie = {}, xe = /* @__PURE__ */ o(() => {
       if (i.isGroup)
         throw new Error("Groups within groups are not allowed in Kanban diagrams");
       i.x = m.x, i.width = L - 1.5 * _;
-      const r = (await be(I, i, { config: b })).node().getBBox();
-      i.y = T + r.height / 2, await me(i), T = i.y + r.height / 2 + _ / 2;
+      const r = (await me(I, i, { config: b })).node().getBBox();
+      i.y = T + r.height / 2, await _e(i), T = i.y + r.height / 2 + _ / 2;
     }
     const B = A.cluster.select("rect"), O = Math.max(T - H + 3 * _, 50) + (N - 25);
     B.attr("height", O);
   }
-  _e(
+  Ee(
     void 0,
     l,
     ((_d = b.mindmap) == null ? void 0 : _d.padding) ?? K.kanban.padding,
     ((_e2 = b.mindmap) == null ? void 0 : _e2.useMaxWidth) ?? K.kanban.useMaxWidth
   );
-}, "draw"), Be = {
-  draw: Ve
-}, je = /* @__PURE__ */ o((e) => {
+}, "draw"), je = {
+  draw: Be
+}, Fe = /* @__PURE__ */ o((e) => {
   let u = "";
   for (let s = 0; s < e.THEME_COLOR_LIMIT; s++)
-    e["lineColor" + s] = e["lineColor" + s] || e["cScaleInv" + s], Se(e["lineColor" + s]) ? e["lineColor" + s] = ce(e["lineColor" + s], 20) : e["lineColor" + s] = le(e["lineColor" + s], 20);
+    e["lineColor" + s] = e["lineColor" + s] || e["cScaleInv" + s], Ne(e["lineColor" + s]) ? e["lineColor" + s] = ce(e["lineColor" + s], 20) : e["lineColor" + s] = le(e["lineColor" + s], 20);
   const p = /* @__PURE__ */ o((s, d) => e.darkMode ? le(s, d) : ce(s, d), "adjuster");
   for (let s = 0; s < e.THEME_COLOR_LIMIT; s++) {
     const d = "" + (17 - 3 * s);
@@ -677,11 +678,11 @@ var Ne = $, v = [], ne = [], ee = 0, ie = {}, xe = /* @__PURE__ */ o(() => {
     `;
   }
   return u;
-}, "genSections"), Fe = /* @__PURE__ */ o((e) => `
+}, "genSections"), Ge = /* @__PURE__ */ o((e) => `
   .edge {
     stroke-width: 3;
   }
-  ${je(e)}
+  ${Fe(e)}
   .section-root rect, .section-root path, .section-root circle, .section-root polygon  {
     fill: ${e.git0};
   }
@@ -708,12 +709,13 @@ var Ne = $, v = [], ne = [], ee = 0, ie = {}, xe = /* @__PURE__ */ o(() => {
     dominant-baseline: middle;
     text-align: center;
   }
-`, "getStyles"), Ge = Fe, Me = {
-  db: Pe,
-  renderer: Be,
-  parser: Ne,
-  styles: Ge
+    ${fe()}
+`, "getStyles"), He = Ge, We = {
+  db: Ve,
+  renderer: je,
+  parser: xe,
+  styles: He
 };
 export {
-  Me as diagram
+  We as diagram
 };

package/dist/{layout-qfivsCI_.js → layout-CbUwX9d6.js}

@@ -1,7 +1,7 @@
-import { G as g } from "./graph-Btsdly6D.js";
-import { b as Re, h as fe, j as ce, d as W, c as f, i as m, f as P, v as x, r as M } from "./_baseUniq-DXGCzwrs.js";
-import { b as le, a as Te, c as Ie, m as w, d as N, h as he, f as q, l as T, e as Me } from "./min-CQBZldos.js";
-import { aU as Se, av as je, aV as Fe, aD as ve, aC as K, az as F, aA as pe, aW as Ve, aX as Ae, x as Be, au as Q, y as Ge, aY as Ye, aZ as De, a_ as _, a$ as E, A as $e, b0 as I, b1 as D } from "./main-DLuap1gp.js";
+import { G as g } from "./graph-txVVq_De.js";
+import { b as Re, h as fe, j as ce, d as W, c as f, i as m, f as _, v as x, r as M } from "./_baseUniq-n5nuGCm-.js";
+import { b as le, a as Te, c as Ie, m as w, d as N, h as he, f as q, l as T, e as Me } from "./min-CYaGuxZ4.js";
+import { aU as Se, aw as je, aV as Fe, aE as ve, aD as K, aA as F, aB as pe, aW as Ve, aX as Be, y as Ae, av as Q, z as Ge, aY as Ye, aZ as De, a_ as C, a$ as E, B as $e, b0 as I, b1 as D } from "./main-D9-48wlP.js";
 var We = 1, qe = 4;
 function ze(e) {
   return Re(e, We | qe);
@@ -62,7 +62,7 @@ function Qe(e, n, r) {
     } : i;
   }) : n = [ve];
   var t = -1;
-  n = F(n, Ae(W));
+  n = F(n, Be(W));
   var a = Ie(e, function(i, o, u) {
     var d = F(n, function(s) {
       return s(i);
@@ -73,7 +73,7 @@ function Qe(e, n, r) {
     return Ke(i, o, r);
   });
 }
-var R = Be(function(e, n) {
+var R = Ae(function(e, n) {
   if (e == null)
     return [];
   var r = n.length;
@@ -125,7 +125,7 @@ function un(e, n) {
   if (e.nodeCount() <= 1)
     return [];
   var r = sn(e, n || on), t = dn(r.graph, r.buckets, r.zeroIdx);
-  return _(
+  return C(
     w(t, function(a) {
       return e.outEdges(a.v, a.w);
     })
@@ -338,24 +338,24 @@ function ae(e) {
 }
 function kn(e) {
   f(e.nodes(), function(n) {
-    A(e.node(n));
+    B(e.node(n));
   }), f(e.edges(), function(n) {
     var r = e.edge(n);
-    f(r.points, A), Object.prototype.hasOwnProperty.call(r, "y") && A(r);
+    f(r.points, B), Object.prototype.hasOwnProperty.call(r, "y") && B(r);
   });
 }
-function A(e) {
+function B(e) {
   e.y = -e.y;
 }
 function xn(e) {
   f(e.nodes(), function(n) {
-    B(e.node(n));
+    A(e.node(n));
   }), f(e.edges(), function(n) {
     var r = e.edge(n);
-    f(r.points, B), Object.prototype.hasOwnProperty.call(r, "x") && B(r);
+    f(r.points, A), Object.prototype.hasOwnProperty.call(r, "x") && A(r);
   });
 }
-function B(e) {
+function A(e) {
   var n = e.x;
   e.x = e.y, e.y = n;
 }
@@ -405,39 +405,39 @@ function U(e) {
   }
   f(e.sources(), r);
 }
-function C(e, n) {
+function P(e, n) {
   return e.node(n.w).rank - e.node(n.v).rank - e.edge(n).minlen;
 }
 function ge(e) {
   var n = new g({ directed: false }), r = e.nodes()[0], t = e.nodeCount();
   n.setNode(r, {});
   for (var a, i; Nn(n, e) < t; )
-    a = Cn(n, e), i = n.hasNode(a.v) ? C(e, a) : -C(e, a), Pn(n, e, i);
+    a = Pn(n, e), i = n.hasNode(a.v) ? P(e, a) : -P(e, a), _n(n, e, i);
   return n;
 }
 function Nn(e, n) {
   function r(t) {
     f(n.nodeEdges(t), function(a) {
       var i = a.v, o = t === i ? a.w : i;
-      !e.hasNode(o) && !C(n, a) && (e.setNode(o, {}), e.setEdge(t, o, {}), r(o));
+      !e.hasNode(o) && !P(n, a) && (e.setNode(o, {}), e.setEdge(t, o, {}), r(o));
     });
   }
   return f(e.nodes(), r), e.nodeCount();
 }
-function Cn(e, n) {
+function Pn(e, n) {
   return z(n.edges(), function(r) {
     if (e.hasNode(r.v) !== e.hasNode(r.w))
-      return C(n, r);
+      return P(n, r);
   });
 }
-function Pn(e, n, r) {
+function _n(e, n, r) {
   f(e.nodes(), function(t) {
     n.node(t).rank += r;
   });
 }
-function _n() {
+function Cn() {
 }
-_n.prototype = new Error();
+Cn.prototype = new Error();
 function ye(e, n, r) {
   pe(n) || (n = [n]);
   var t = (e.isDirected() ? e.successors : e.neighbors).bind(e), a = [], i = {};
@@ -513,11 +513,11 @@ function Le(e, n, r) {
   n.hasEdge(t, a) || (t = r.w, a = r.v);
   var i = e.node(t), o = e.node(a), u = i, d = false;
   i.lim > o.lim && (u = o, d = true);
-  var s = P(n.edges(), function(c) {
+  var s = _(n.edges(), function(c) {
     return d === ie(e, e.node(c.v), u) && d !== ie(e, e.node(c.w), u);
   });
   return z(s, function(c) {
-    return C(n, c);
+    return P(n, c);
   });
 }
 function Ne(e, n, r, t) {
@@ -561,17 +561,17 @@ function Vn(e) {
 function oe(e) {
   k(e);
 }
-function An(e) {
-  var n = O(e, "root", {}, "_root"), r = Bn(e), t = y(x(r)) - 1, a = 2 * t + 1;
+function Bn(e) {
+  var n = O(e, "root", {}, "_root"), r = An(e), t = y(x(r)) - 1, a = 2 * t + 1;
   e.graph().nestingRoot = n, f(e.edges(), function(o) {
     e.edge(o).minlen *= a;
   });
   var i = Gn(e) + 1;
   f(e.children(), function(o) {
-    Ce(e, n, a, i, t, r, o);
+    Pe(e, n, a, i, t, r, o);
   }), e.graph().nodeRankFactor = a;
 }
-function Ce(e, n, r, t, a, i, o) {
+function Pe(e, n, r, t, a, i, o) {
   var u = e.children(o);
   if (!u.length) {
     o !== n && e.setEdge(n, o, { weight: 0, minlen: r });
@@ -579,7 +579,7 @@ function Ce(e, n, r, t, a, i, o) {
   }
   var d = re(e, "_bt"), s = re(e, "_bb"), c = e.node(o);
   e.setParent(d, o), c.borderTop = d, e.setParent(s, o), c.borderBottom = s, f(u, function(l) {
-    Ce(e, n, r, t, a, i, l);
+    Pe(e, n, r, t, a, i, l);
     var h = e.node(l), v = h.borderTop ? h.borderTop : l, p = h.borderBottom ? h.borderBottom : l, b = h.borderTop ? t : 2 * t, L = v !== p ? 1 : a - i[o] + 1;
     e.setEdge(d, v, {
       weight: b,
@@ -592,7 +592,7 @@ function Ce(e, n, r, t, a, i, o) {
     });
   }), e.parent(o) || e.setEdge(n, d, { weight: 0, minlen: a + i[o] });
 }
-function Bn(e) {
+function An(e) {
   var n = {};
   function r(t, a) {
     var i = e.children(t);
@@ -662,7 +662,7 @@ function zn(e, n, r) {
     w(r, function(s, c) {
       return c;
     })
-  ), a = _(
+  ), a = C(
     w(n, function(s) {
       return R(
         w(e.outEdges(s), function(c) {
@@ -689,7 +689,7 @@ function zn(e, n, r) {
   ), d;
 }
 function Xn(e) {
-  var n = {}, r = P(e.nodes(), function(u) {
+  var n = {}, r = _(e.nodes(), function(u) {
     return !e.children(u).length;
   }), t = y(
     w(r, function(u) {
@@ -749,7 +749,7 @@ function Hn(e, n) {
     var i = r[a.v], o = r[a.w];
     !m(i) && !m(o) && (o.indegree++, i.out.push(r[a.w]));
   });
-  var t = P(r, function(a) {
+  var t = _(r, function(a) {
     return !a.indegree;
   });
   return Zn(t);
@@ -771,7 +771,7 @@ function Zn(e) {
     n.push(a), f(a.in.reverse(), r(a)), f(a.out, t(a));
   }
   return w(
-    P(n, function(i) {
+    _(n, function(i) {
       return !i.merged;
     }),
     function(i) {
@@ -792,7 +792,7 @@ function Kn(e, n) {
   t.sort(Qn(!!n)), d = ue(i, a, d), f(t, function(c) {
     d += c.vs.length, i.push(c.vs), o += c.barycenter * c.weight, u += c.weight, d = ue(i, a, d);
   });
-  var s = { vs: _(i) };
+  var s = { vs: C(i) };
   return u && (s.barycenter = o / u, s.weight = u), s;
 }
 function ue(e, n, r) {
@@ -805,22 +805,22 @@ function Qn(e) {
     return n.barycenter < r.barycenter ? -1 : n.barycenter > r.barycenter ? 1 : e ? r.i - n.i : n.i - r.i;
   };
 }
-function Pe(e, n, r, t) {
+function _e(e, n, r, t) {
   var a = e.children(n), i = e.node(n), o = i ? i.borderLeft : void 0, u = i ? i.borderRight : void 0, d = {};
-  o && (a = P(a, function(p) {
+  o && (a = _(a, function(p) {
     return p !== o && p !== u;
   }));
   var s = Un(e, a);
   f(s, function(p) {
     if (e.children(p.v).length) {
-      var b = Pe(e, p.v, r, t);
+      var b = _e(e, p.v, r, t);
       d[p.v] = b, Object.prototype.hasOwnProperty.call(b, "barycenter") && nr(p, b);
     }
   });
   var c = Hn(s, r);
   er(c, d);
   var l = Kn(c, t);
-  if (o && (l.vs = _([o, l.vs, u]), e.predecessors(o).length)) {
+  if (o && (l.vs = C([o, l.vs, u]), e.predecessors(o).length)) {
     var h = e.node(e.predecessors(o)[0]), v = e.node(e.predecessors(u)[0]);
     Object.prototype.hasOwnProperty.call(l, "barycenter") || (l.barycenter = 0, l.weight = 0), l.barycenter = (l.barycenter * l.weight + h.order + v.order) / (l.weight + 2), l.weight += 2;
   }
@@ -828,7 +828,7 @@ function Pe(e, n, r, t) {
 }
 function er(e, n) {
   f(e, function(r) {
-    r.vs = _(
+    r.vs = C(
       r.vs.map(function(t) {
         return n[t] ? n[t].vs : t;
       })
@@ -856,7 +856,7 @@ function de(e, n, r) {
 function tr(e, n) {
   var r = new g();
   f(e, function(t) {
-    var a = t.graph().root, i = Pe(t, a, r, n);
+    var a = t.graph().root, i = _e(t, a, r, n);
     f(i.vs, function(o, u) {
       t.node(o).order = u;
     }), Dn(t, r, i.vs);
@@ -914,7 +914,7 @@ function ur(e, n) {
       (h || c === s) && (f(i.slice(u, l + 1), function(p) {
         f(e.predecessors(p), function(b) {
           var L = e.node(b), J = L.order;
-          (J < o || v < J) && !(L.dummy && e.node(p).dummy) && _e(r, b, p);
+          (J < o || v < J) && !(L.dummy && e.node(p).dummy) && Ce(r, b, p);
         });
       }), u = l + 1, o = v);
     }), i;
@@ -928,7 +928,7 @@ function dr(e, n) {
     f(E(o, u), function(l) {
       c = i[l], e.node(c).dummy && f(e.predecessors(c), function(h) {
         var v = e.node(h);
-        v.dummy && (v.order < d || v.order > s) && _e(r, h, c);
+        v.dummy && (v.order < d || v.order > s) && Ce(r, h, c);
       });
     });
   }
@@ -950,7 +950,7 @@ function sr(e, n) {
       return e.node(r).dummy;
     });
 }
-function _e(e, n, r) {
+function Ce(e, n, r) {
   if (n > r) {
     var t = n;
     n = r, r = t;
@@ -1122,7 +1122,7 @@ function Hr(e, n) {
   });
 }
 function xr(e, n) {
-  n("    makeSpaceForEdgeLabels", () => Mr(e)), n("    removeSelfEdges", () => Dr(e)), n("    acyclic", () => fn(e)), n("    nestingGraph.run", () => An(e)), n("    rank", () => jn(we(e))), n("    injectEdgeLabelProxies", () => Sr(e)), n("    removeEmptyRanks", () => pn(e)), n("    nestingGraph.cleanup", () => Yn(e)), n("    normalizeRanks", () => vn(e)), n("    assignRankMinMax", () => jr(e)), n("    removeEdgeLabelProxies", () => Fr(e)), n("    normalize.run", () => En(e)), n("    parentDummyChains", () => ar(e)), n("    addBorderSegments", () => mn(e)), n("    order", () => rr(e)), n("    insertSelfEdges", () => $r(e)), n("    adjustCoordinateSystem", () => gn(e)), n("    position", () => yr(e)), n("    positionSelfEdges", () => Wr(e)), n("    removeBorderNodes", () => Yr(e)), n("    normalize.undo", () => Ln(e)), n("    fixupEdgeLabelCoords", () => Br(e)), n("    undoCoordinateSystem", () => yn(e)), n("    translateGraph", () => Vr(e)), n("    assignNodeIntersects", () => Ar(e)), n("    reversePoints", () => Gr(e)), n("    acyclic.undo", () => ln(e));
+  n("    makeSpaceForEdgeLabels", () => Mr(e)), n("    removeSelfEdges", () => Dr(e)), n("    acyclic", () => fn(e)), n("    nestingGraph.run", () => Bn(e)), n("    rank", () => jn(we(e))), n("    injectEdgeLabelProxies", () => Sr(e)), n("    removeEmptyRanks", () => pn(e)), n("    nestingGraph.cleanup", () => Yn(e)), n("    normalizeRanks", () => vn(e)), n("    assignRankMinMax", () => jr(e)), n("    removeEdgeLabelProxies", () => Fr(e)), n("    normalize.run", () => En(e)), n("    parentDummyChains", () => ar(e)), n("    addBorderSegments", () => mn(e)), n("    order", () => rr(e)), n("    insertSelfEdges", () => $r(e)), n("    adjustCoordinateSystem", () => gn(e)), n("    position", () => yr(e)), n("    positionSelfEdges", () => Wr(e)), n("    removeBorderNodes", () => Yr(e)), n("    normalize.undo", () => Ln(e)), n("    fixupEdgeLabelCoords", () => Ar(e)), n("    undoCoordinateSystem", () => yn(e)), n("    translateGraph", () => Vr(e)), n("    assignNodeIntersects", () => Br(e)), n("    reversePoints", () => Gr(e)), n("    acyclic.undo", () => ln(e));
 }
 function Er(e, n) {
   f(e.nodes(), function(r) {
@@ -1133,7 +1133,7 @@ function Er(e, n) {
     t.points = a.points, Object.prototype.hasOwnProperty.call(a, "x") && (t.x = a.x, t.y = a.y);
   }), e.graph().width = n.graph().width, e.graph().height = n.graph().height;
 }
-var Or = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], Lr = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" }, Nr = ["acyclicer", "ranker", "rankdir", "align"], Cr = ["width", "height"], Pr = { width: 0, height: 0 }, _r = ["minlen", "weight", "width", "height", "labeloffset"], Rr = {
+var Or = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], Lr = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" }, Nr = ["acyclicer", "ranker", "rankdir", "align"], Pr = ["width", "height"], _r = { width: 0, height: 0 }, Cr = ["minlen", "weight", "width", "height", "labeloffset"], Rr = {
   minlen: 1,
   weight: 1,
   width: 0,
@@ -1147,12 +1147,12 @@ function Ir(e) {
     D({}, Lr, G(r, Or), I(r, Nr))
   ), f(e.nodes(), function(t) {
     var a = Y(e.node(t));
-    n.setNode(t, Me(G(a, Cr), Pr)), n.setParent(t, e.parent(t));
+    n.setNode(t, Me(G(a, Pr), _r)), n.setParent(t, e.parent(t));
   }), f(e.edges(), function(t) {
     var a = Y(e.edge(t));
     n.setEdge(
       t,
-      D({}, Rr, G(a, _r), I(a, Tr))
+      D({}, Rr, G(a, Cr), I(a, Tr))
     );
   }), n;
 }
@@ -1206,13 +1206,13 @@ function Vr(e) {
     }), Object.prototype.hasOwnProperty.call(c, "x") && (c.x -= n), Object.prototype.hasOwnProperty.call(c, "y") && (c.y -= t);
   }), i.width = r - n + o, i.height = a - t + u;
 }
-function Ar(e) {
+function Br(e) {
   f(e.edges(), function(n) {
     var r = e.edge(n), t = e.node(n.v), a = e.node(n.w), i, o;
     r.points ? (i = r.points[0], o = r.points[r.points.length - 1]) : (r.points = [], i = a, o = t), r.points.unshift(ne(t, i)), r.points.push(ne(a, o));
   });
 }
-function Br(e) {
+function Ar(e) {
   f(e.edges(), function(n) {
     var r = e.edge(n);
     if (Object.prototype.hasOwnProperty.call(r, "x"))

package/dist/{linear-D_Kojy5s.js → linear-sn9_bxtB.js}

@@ -1,7 +1,7 @@
 import { x, y as h, z as v, A as S, B as d } from "./timer-BYwnU4DF.js";
-import { a6 as M, aK as B, af as D, aL as F, aM as P, aN as z, aO as I, aP as L, aQ as O, aR as V, aS as $ } from "./main-DLuap1gp.js";
+import { a7 as M, aL as B, ag as D, aM as F, aN as P, aO as z, aP as I, aQ as L, f as O, aR as V, aS as $ } from "./main-D9-48wlP.js";
 import { i as q } from "./init-DxzjmxYy.js";
-function K(n) {
+function Q(n) {
   return n === null ? NaN : +n;
 }
 function* an(n, r) {
@@ -14,8 +14,8 @@ function* an(n, r) {
       (t = r(t, ++e, n)) != null && (t = +t) >= t && (yield t);
   }
 }
-const k = M(B), Q = k.right, un = k.left;
-M(K).center;
+const k = M(B), T = k.right, un = k.left;
+M(Q).center;
 function w(n, r) {
   r || (r = []);
   var e = n ? Math.min(r.length, n.length) : 0, t = r.slice(), i;
@@ -39,13 +39,13 @@ function R(n, r) {
     return u;
   };
 }
-function T(n, r) {
+function C(n, r) {
   var e = /* @__PURE__ */ new Date();
   return n = +n, r = +r, function(t) {
     return e.setTime(n * (1 - t) + r * t), e;
   };
 }
-function C(n, r) {
+function E(n, r) {
   var e = {}, t = {}, i;
   (n === null || typeof n != "object") && (n = {}), (r === null || typeof r != "object") && (r = {});
   for (i in r)
@@ -57,19 +57,19 @@ function C(n, r) {
 }
 function y(n, r) {
   var e = typeof r, t;
-  return r == null || e === "boolean" ? x(r) : (e === "number" ? h : e === "string" ? (t = d(r)) ? (r = t, v) : S : r instanceof d ? v : r instanceof Date ? T : A(r) ? w : Array.isArray(r) ? R : typeof r.valueOf != "function" && typeof r.toString != "function" || isNaN(r) ? C : h)(n, r);
+  return r == null || e === "boolean" ? x(r) : (e === "number" ? h : e === "string" ? (t = d(r)) ? (r = t, v) : S : r instanceof d ? v : r instanceof Date ? C : A(r) ? w : Array.isArray(r) ? R : typeof r.valueOf != "function" && typeof r.toString != "function" || isNaN(r) ? E : h)(n, r);
 }
-function E(n, r) {
+function G(n, r) {
   return n = +n, r = +r, function(e) {
     return Math.round(n * (1 - e) + r * e);
   };
 }
-function G(n) {
+function H(n) {
   return function() {
     return n;
   };
 }
-function H(n) {
+function J(n) {
   return +n;
 }
 var N = [0, 1];
@@ -79,9 +79,9 @@ function p(n) {
 function g(n, r) {
   return (r -= n = +n) ? function(e) {
     return (e - n) / r;
-  } : G(isNaN(r) ? NaN : 0.5);
+  } : H(isNaN(r) ? NaN : 0.5);
 }
-function J(n, r) {
+function K(n, r) {
   var e;
   return n > r && (e = n, n = r, r = e), function(t) {
     return Math.max(n, Math.min(r, t));
@@ -98,7 +98,7 @@ function W(n, r, e) {
   for (n[t] < n[0] && (n = n.slice().reverse(), r = r.slice().reverse()); ++a < t; )
     i[a] = g(n[a], n[a + 1]), u[a] = e(r[a], r[a + 1]);
   return function(c) {
-    var s = Q(n, c, 1, t) - 1;
+    var s = T(n, c, 1, t) - 1;
     return u[s](i[s](c));
   };
 }
@@ -109,7 +109,7 @@ function Y() {
   var n = N, r = N, e = y, t, i, u, a = p, c, s, f;
   function m() {
     var o = Math.min(n.length, r.length);
-    return a !== p && (a = J(n[0], n[o - 1])), c = o > 2 ? W : U, s = f = null, l;
+    return a !== p && (a = K(n[0], n[o - 1])), c = o > 2 ? W : U, s = f = null, l;
   }
   function l(o) {
     return o == null || isNaN(o = +o) ? u : (s || (s = c(n.map(t), r, e)))(t(a(o)));
@@ -117,11 +117,11 @@ function Y() {
   return l.invert = function(o) {
     return a(i((f || (f = c(r, n.map(t), h)))(o)));
   }, l.domain = function(o) {
-    return arguments.length ? (n = Array.from(o, H), m()) : n.slice();
+    return arguments.length ? (n = Array.from(o, J), m()) : n.slice();
   }, l.range = function(o) {
     return arguments.length ? (r = Array.from(o), m()) : r.slice();
   }, l.rangeRound = function(o) {
-    return r = Array.from(o), e = E, m();
+    return r = Array.from(o), e = G, m();
   }, l.clamp = function(o) {
     return arguments.length ? (a = o ? true : p, m()) : a !== p;
   }, l.interpolate = function(o) {
@@ -191,20 +191,20 @@ function nn() {
 }
 export {
   X as a,
-  K as b,
+  Q as b,
   Z as c,
   on as d,
-  T as e,
+  C as e,
   w as f,
-  E as g,
-  H as h,
+  G as g,
+  J as h,
   y as i,
   b as j,
   p as k,
   nn as l,
-  Q as m,
+  T as m,
   an as n,
-  C as o,
+  E as o,
   _ as p,
   un as q,
   Y as t