@altimateai/ui-components 0.0.77-beta.3 → 0.0.77-beta.5

package/dist/kanban-definition-3W4ZIXB7.js

@@ -1,10 +1,10 @@
-import { a1 as c, ad as te, a7 as W, az as fe, b5 as ye, b6 as be, b7 as me, aO as Ee, au as Y, ac as G, ai as _e, aj as ke, aP as Se, aQ as le, aR as ce } from "./CoachForm.js";
+import { _ as c, l as te, d as W, G as fe, ae as ye, af as be, ag as me, V as _e, B as K, i as F, o as Ee, J as ke, W as Se, X as le, Y as ce } from "./CoachForm.js";
 import { g as Ne } from "./chunk-FMBD7UC4.js";
 var $ = function() {
-  var t = /* @__PURE__ */ c(function(E, s, n, a) {
-    for (n = n || {}, a = E.length; a--; n[E[a]] = s) ;
+  var t = /* @__PURE__ */ c(function(_, s, n, a) {
+    for (n = n || {}, a = _.length; a--; n[_[a]] = s) ;
     return n;
-  }, "o"), g = [1, 4], d = [1, 13], r = [1, 12], p = [1, 15], _ = [1, 16], f = [1, 20], h = [1, 19], L = [6, 7, 8], C = [1, 26], w = [1, 24], N = [1, 25], i = [6, 7, 11], j = [1, 31], x = [6, 7, 11, 24], P = [1, 6, 13, 16, 17, 20, 23], M = [1, 35], U = [1, 36], A = [1, 6, 7, 11, 13, 16, 17, 20, 23], H = [1, 38], V = {
+  }, "o"), g = [1, 4], d = [1, 13], r = [1, 12], p = [1, 15], E = [1, 16], f = [1, 20], h = [1, 19], L = [6, 7, 8], C = [1, 26], w = [1, 24], N = [1, 25], i = [6, 7, 11], M = [1, 31], x = [6, 7, 11, 24], P = [1, 6, 13, 16, 17, 20, 23], U = [1, 35], j = [1, 36], A = [1, 6, 7, 11, 13, 16, 17, 20, 23], H = [1, 38], V = {
     trace: /* @__PURE__ */ c(function() {
     }, "trace"),
     yy: {},
@@ -71,7 +71,7 @@ var $ = function() {
           break;
       }
     }, "anonymous"),
-    table: [{ 3: 1, 4: 2, 5: 3, 6: [1, 5], 8: g }, { 1: [3] }, { 1: [2, 1] }, { 4: 6, 6: [1, 7], 7: [1, 8], 8: g }, { 6: d, 7: [1, 10], 9: 9, 12: 11, 13: r, 14: 14, 16: p, 17: _, 18: 17, 19: 18, 20: f, 23: h }, t(L, [2, 3]), { 1: [2, 2] }, t(L, [2, 4]), t(L, [2, 5]), { 1: [2, 6], 6: d, 12: 21, 13: r, 14: 14, 16: p, 17: _, 18: 17, 19: 18, 20: f, 23: h }, { 6: d, 9: 22, 12: 11, 13: r, 14: 14, 16: p, 17: _, 18: 17, 19: 18, 20: f, 23: h }, { 6: C, 7: w, 10: 23, 11: N }, t(i, [2, 24], { 18: 17, 19: 18, 14: 27, 16: [1, 28], 17: [1, 29], 20: f, 23: h }), t(i, [2, 19]), t(i, [2, 21], { 15: 30, 24: j }), t(i, [2, 22]), t(i, [2, 23]), t(x, [2, 25]), t(x, [2, 26]), t(x, [2, 28], { 20: [1, 32] }), { 21: [1, 33] }, { 6: C, 7: w, 10: 34, 11: N }, { 1: [2, 7], 6: d, 12: 21, 13: r, 14: 14, 16: p, 17: _, 18: 17, 19: 18, 20: f, 23: h }, t(P, [2, 14], { 7: M, 11: U }), t(A, [2, 8]), t(A, [2, 9]), t(A, [2, 10]), t(i, [2, 16], { 15: 37, 24: j }), t(i, [2, 17]), t(i, [2, 18]), t(i, [2, 20], { 24: H }), t(x, [2, 31]), { 21: [1, 39] }, { 22: [1, 40] }, t(P, [2, 13], { 7: M, 11: U }), t(A, [2, 11]), t(A, [2, 12]), t(i, [2, 15], { 24: H }), t(x, [2, 30]), { 22: [1, 41] }, t(x, [2, 27]), t(x, [2, 29])],
+    table: [{ 3: 1, 4: 2, 5: 3, 6: [1, 5], 8: g }, { 1: [3] }, { 1: [2, 1] }, { 4: 6, 6: [1, 7], 7: [1, 8], 8: g }, { 6: d, 7: [1, 10], 9: 9, 12: 11, 13: r, 14: 14, 16: p, 17: E, 18: 17, 19: 18, 20: f, 23: h }, t(L, [2, 3]), { 1: [2, 2] }, t(L, [2, 4]), t(L, [2, 5]), { 1: [2, 6], 6: d, 12: 21, 13: r, 14: 14, 16: p, 17: E, 18: 17, 19: 18, 20: f, 23: h }, { 6: d, 9: 22, 12: 11, 13: r, 14: 14, 16: p, 17: E, 18: 17, 19: 18, 20: f, 23: h }, { 6: C, 7: w, 10: 23, 11: N }, t(i, [2, 24], { 18: 17, 19: 18, 14: 27, 16: [1, 28], 17: [1, 29], 20: f, 23: h }), t(i, [2, 19]), t(i, [2, 21], { 15: 30, 24: M }), t(i, [2, 22]), t(i, [2, 23]), t(x, [2, 25]), t(x, [2, 26]), t(x, [2, 28], { 20: [1, 32] }), { 21: [1, 33] }, { 6: C, 7: w, 10: 34, 11: N }, { 1: [2, 7], 6: d, 12: 21, 13: r, 14: 14, 16: p, 17: E, 18: 17, 19: 18, 20: f, 23: h }, t(P, [2, 14], { 7: U, 11: j }), t(A, [2, 8]), t(A, [2, 9]), t(A, [2, 10]), t(i, [2, 16], { 15: 37, 24: M }), t(i, [2, 17]), t(i, [2, 18]), t(i, [2, 20], { 24: H }), t(x, [2, 31]), { 21: [1, 39] }, { 22: [1, 40] }, t(P, [2, 13], { 7: U, 11: j }), t(A, [2, 11]), t(A, [2, 12]), t(i, [2, 15], { 24: H }), t(x, [2, 30]), { 22: [1, 41] }, t(x, [2, 27]), t(x, [2, 29])],
     defaultActions: { 2: [2, 1], 6: [2, 2] },
     parseError: /* @__PURE__ */ c(function(s, n) {
       if (n.recoverable)
@@ -86,8 +86,8 @@ var $ = function() {
       for (var J in this.yy)
         Object.prototype.hasOwnProperty.call(this.yy, J) && (T.yy[J] = this.yy[J]);
       b.setInput(s, T.yy), T.yy.lexer = b, T.yy.parser = this, typeof b.yylloc > "u" && (b.yylloc = {});
-      var Q = b.yylloc;
-      e.push(Q);
+      var q = b.yylloc;
+      e.push(q);
       var de = b.options && b.options.ranges;
       typeof T.yy.parseError == "function" ? this.parseError = T.yy.parseError : this.parseError = Object.getPrototypeOf(this).parseError;
       function pe(S) {
@@ -99,38 +99,38 @@ var $ = function() {
         return S = o.pop() || b.lex() || re, typeof S != "number" && (S instanceof Array && (o = S, S = o.pop()), S = n.symbols_[S] || S), S;
       }
       c(ae, "lex");
-      for (var k, R, v, q, F = {}, X, I, oe, K; ; ) {
+      for (var k, R, v, Q, G = {}, X, I, oe, Y; ; ) {
         if (R = a[a.length - 1], this.defaultActions[R] ? v = this.defaultActions[R] : ((k === null || typeof k > "u") && (k = ae()), v = B[R] && B[R][k]), typeof v > "u" || !v.length || !v[0]) {
           var Z = "";
-          K = [];
+          Y = [];
           for (X in B[R])
-            this.terminals_[X] && X > ue && K.push("'" + this.terminals_[X] + "'");
+            this.terminals_[X] && X > ue && Y.push("'" + this.terminals_[X] + "'");
           b.showPosition ? Z = "Parse error on line " + (z + 1) + `:
 ` + b.showPosition() + `
-Expecting ` + K.join(", ") + ", got '" + (this.terminals_[k] || k) + "'" : Z = "Parse error on line " + (z + 1) + ": Unexpected " + (k == re ? "end of input" : "'" + (this.terminals_[k] || k) + "'"), this.parseError(Z, {
+Expecting ` + Y.join(", ") + ", got '" + (this.terminals_[k] || k) + "'" : Z = "Parse error on line " + (z + 1) + ": Unexpected " + (k == re ? "end of input" : "'" + (this.terminals_[k] || k) + "'"), this.parseError(Z, {
             text: b.match,
             token: this.terminals_[k] || k,
             line: b.yylineno,
-            loc: Q,
-            expected: K
+            loc: q,
+            expected: Y
           });
         }
         if (v[0] instanceof Array && v.length > 1)
           throw new Error("Parse Error: multiple actions possible at state: " + R + ", token: " + k);
         switch (v[0]) {
           case 1:
-            a.push(k), u.push(b.yytext), e.push(b.yylloc), a.push(v[1]), k = null, ie = b.yyleng, l = b.yytext, z = b.yylineno, Q = b.yylloc;
+            a.push(k), u.push(b.yytext), e.push(b.yylloc), a.push(v[1]), k = null, ie = b.yyleng, l = b.yytext, z = b.yylineno, q = b.yylloc;
             break;
           case 2:
-            if (I = this.productions_[v[1]][1], F.$ = u[u.length - I], F._$ = {
+            if (I = this.productions_[v[1]][1], G.$ = u[u.length - I], G._$ = {
               first_line: e[e.length - (I || 1)].first_line,
               last_line: e[e.length - 1].last_line,
               first_column: e[e.length - (I || 1)].first_column,
               last_column: e[e.length - 1].last_column
-            }, de && (F._$.range = [
+            }, de && (G._$.range = [
               e[e.length - (I || 1)].range[0],
               e[e.length - 1].range[1]
-            ]), q = this.performAction.apply(F, [
+            ]), Q = this.performAction.apply(G, [
               l,
               ie,
               z,
@@ -138,9 +138,9 @@ Expecting ` + K.join(", ") + ", got '" + (this.terminals_[k] || k) + "'" : Z = "
               v[1],
               u,
               e
-            ].concat(ge)), typeof q < "u")
-              return q;
-            I && (a = a.slice(0, -1 * I * 2), u = u.slice(0, -1 * I), e = e.slice(0, -1 * I)), a.push(this.productions_[v[1]][0]), u.push(F.$), e.push(F._$), oe = B[a[a.length - 2]][a[a.length - 1]], a.push(oe);
+            ].concat(ge)), typeof Q < "u")
+              return Q;
+            I && (a = a.slice(0, -1 * I * 2), u = u.slice(0, -1 * I), e = e.slice(0, -1 * I)), a.push(this.productions_[v[1]][0]), u.push(G.$), e.push(G._$), oe = B[a[a.length - 2]][a[a.length - 1]], a.push(oe);
             break;
           case 3:
             return !0;
@@ -149,7 +149,7 @@ Expecting ` + K.join(", ") + ", got '" + (this.terminals_[k] || k) + "'" : Z = "
       return !0;
     }, "parse")
   }, m = /* @__PURE__ */ function() {
-    var E = {
+    var _ = {
       EOF: 1,
       parseError: /* @__PURE__ */ c(function(n, a) {
         if (this.yy.parser)
@@ -421,7 +421,7 @@ Expecting ` + K.join(", ") + ", got '" + (this.terminals_[k] || k) + "'" : Z = "
       rules: [/^(?:@\{)/i, /^(?:["])/i, /^(?:["])/i, /^(?:[^\"]+)/i, /^(?:[^}^"]+)/i, /^(?:\})/i, /^(?:\s*%%.*)/i, /^(?:kanban\b)/i, /^(?::::)/i, /^(?:.+)/i, /^(?:\n)/i, /^(?:::icon\()/i, /^(?:[\s]+[\n])/i, /^(?:[\n]+)/i, /^(?:[^\)]+)/i, /^(?:\))/i, /^(?:-\))/i, /^(?:\(-)/i, /^(?:\)\))/i, /^(?:\))/i, /^(?:\(\()/i, /^(?:\{\{)/i, /^(?:\()/i, /^(?:\[)/i, /^(?:[\s]+)/i, /^(?:[^\(\[\n\)\{\}@]+)/i, /^(?:$)/i, /^(?:["][`])/i, /^(?:[^`"]+)/i, /^(?:[`]["])/i, /^(?:["])/i, /^(?:[^"]+)/i, /^(?:["])/i, /^(?:[\)]\))/i, /^(?:[\)])/i, /^(?:[\]])/i, /^(?:\}\})/i, /^(?:\(-)/i, /^(?:-\))/i, /^(?:\(\()/i, /^(?:\()/i, /^(?:[^\)\]\(\}]+)/i, /^(?:.+(?!\(\())/i],
       conditions: { shapeDataEndBracket: { rules: [], inclusive: !1 }, shapeDataStr: { rules: [2, 3], inclusive: !1 }, shapeData: { rules: [1, 4, 5], inclusive: !1 }, CLASS: { rules: [9, 10], inclusive: !1 }, ICON: { rules: [14, 15], inclusive: !1 }, NSTR2: { rules: [28, 29], inclusive: !1 }, NSTR: { rules: [31, 32], inclusive: !1 }, NODE: { rules: [27, 30, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42], inclusive: !1 }, INITIAL: { rules: [0, 6, 7, 8, 11, 12, 13, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26], inclusive: !0 } }
     };
-    return E;
+    return _;
   }();
   V.lexer = m;
   function O() {
@@ -446,22 +446,22 @@ var xe = $, D = [], ne = [], ee = 0, se = {}, ve = /* @__PURE__ */ c(() => {
 }, "getSections"), Le = /* @__PURE__ */ c(function() {
   const t = [], g = [], d = he(), r = W();
   for (const p of d) {
-    const _ = {
+    const E = {
       id: p.id,
-      label: G(p.label ?? "", r),
+      label: F(p.label ?? "", r),
       isGroup: !0,
       ticket: p.ticket,
       shape: "kanbanSection",
       level: p.level,
       look: r.look
     };
-    g.push(_);
+    g.push(E);
     const f = D.filter((h) => h.parentId === p.id);
     for (const h of f) {
       const L = {
         id: h.id,
         parentId: p.id,
-        label: G(h.label ?? "", r),
+        label: F(h.label ?? "", r),
         isGroup: !1,
         ticket: h == null ? void 0 : h.ticket,
         priority: h == null ? void 0 : h.priority,
@@ -479,8 +479,8 @@ var xe = $, D = [], ne = [], ee = 0, se = {}, ve = /* @__PURE__ */ c(() => {
   return { nodes: g, edges: t, other: {}, config: W() };
 }, "getData"), Oe = /* @__PURE__ */ c((t, g, d, r, p) => {
   var C, w;
-  const _ = W();
-  let f = ((C = _.mindmap) == null ? void 0 : C.padding) ?? Y.mindmap.padding;
+  const E = W();
+  let f = ((C = E.mindmap) == null ? void 0 : C.padding) ?? K.mindmap.padding;
   switch (r) {
     case y.ROUNDED_RECT:
     case y.RECT:
@@ -488,10 +488,10 @@ var xe = $, D = [], ne = [], ee = 0, se = {}, ve = /* @__PURE__ */ c(() => {
       f *= 2;
   }
   const h = {
-    id: G(g, _) || "kbn" + ee++,
+    id: F(g, E) || "kbn" + ee++,
     level: t,
-    label: G(d, _),
-    width: ((w = _.mindmap) == null ? void 0 : w.maxNodeWidth) ?? Y.mindmap.maxNodeWidth,
+    label: F(d, E),
+    width: ((w = E.mindmap) == null ? void 0 : w.maxNodeWidth) ?? K.mindmap.maxNodeWidth,
     padding: f,
     isGroup: !1
   };
@@ -502,7 +502,7 @@ var xe = $, D = [], ne = [], ee = 0, se = {}, ve = /* @__PURE__ */ c(() => {
 ` : N = `{
 ` + p + `
 }`;
-    const i = _e(N, { schema: ke });
+    const i = Ee(N, { schema: ke });
     if (i.shape && (i.shape !== i.shape.toLowerCase() || i.shape.includes("_")))
       throw new Error(`No such shape: ${i.shape}. Shape names should be lowercase.`);
     i != null && i.shape && i.shape === "kanbanItem" && (h.shape = i == null ? void 0 : i.shape), i != null && i.label && (h.label = i == null ? void 0 : i.label), i != null && i.icon && (h.icon = i == null ? void 0 : i.icon.toString()), i != null && i.assigned && (h.assigned = i == null ? void 0 : i.assigned.toString()), i != null && i.ticket && (h.ticket = i == null ? void 0 : i.ticket.toString()), i != null && i.priority && (h.priority = i == null ? void 0 : i.priority);
@@ -541,7 +541,7 @@ var xe = $, D = [], ne = [], ee = 0, se = {}, ve = /* @__PURE__ */ c(() => {
   if (!t)
     return;
   const g = W(), d = D[D.length - 1];
-  t.icon && (d.icon = G(t.icon, g)), t.class && (d.cssClasses = G(t.class, g));
+  t.icon && (d.icon = F(t.icon, g)), t.class && (d.cssClasses = F(t.class, g));
 }, "decorateNode"), Ae = /* @__PURE__ */ c((t) => {
   switch (t) {
     case y.DEFAULT:
@@ -574,54 +574,54 @@ var xe = $, D = [], ne = [], ee = 0, se = {}, ve = /* @__PURE__ */ c(() => {
   getLogger: Te,
   getElementById: Re
 }, Ve = Pe, Be = /* @__PURE__ */ c(async (t, g, d, r) => {
-  var M, U, A, H, V;
+  var U, j, A, H, V;
   te.debug(`Rendering kanban diagram
 ` + t);
-  const _ = r.db.getData(), f = W();
+  const E = r.db.getData(), f = W();
   f.htmlLabels = !1;
   const h = fe(g), L = h.append("g");
   L.attr("class", "sections");
   const C = h.append("g");
   C.attr("class", "items");
-  const w = _.nodes.filter(
+  const w = E.nodes.filter(
     // TODO: TypeScript 5.5 will infer this predicate automatically
     (m) => m.isGroup
   );
   let N = 0;
-  const i = 10, j = [];
+  const i = 10, M = [];
   let x = 25;
   for (const m of w) {
-    const O = ((M = f == null ? void 0 : f.kanban) == null ? void 0 : M.sectionWidth) || 200;
+    const O = ((U = f == null ? void 0 : f.kanban) == null ? void 0 : U.sectionWidth) || 200;
     N = N + 1, m.x = O * N + (N - 1) * i / 2, m.width = O, m.y = 0, m.height = O * 3, m.rx = 5, m.ry = 5, m.cssClasses = m.cssClasses + " section-" + N;
-    const E = await ye(L, m);
-    x = Math.max(x, (U = E == null ? void 0 : E.labelBBox) == null ? void 0 : U.height), j.push(E);
+    const _ = await ye(L, m);
+    x = Math.max(x, (j = _ == null ? void 0 : _.labelBBox) == null ? void 0 : j.height), M.push(_);
   }
   let P = 0;
   for (const m of w) {
-    const O = j[P];
+    const O = M[P];
     P = P + 1;
-    const E = ((A = f == null ? void 0 : f.kanban) == null ? void 0 : A.sectionWidth) || 200, s = -E * 3 / 2 + x;
+    const _ = ((A = f == null ? void 0 : f.kanban) == null ? void 0 : A.sectionWidth) || 200, s = -_ * 3 / 2 + x;
     let n = s;
-    const a = _.nodes.filter((e) => e.parentId === m.id);
+    const a = E.nodes.filter((e) => e.parentId === m.id);
     for (const e of a) {
       if (e.isGroup)
         throw new Error("Groups within groups are not allowed in Kanban diagrams");
-      e.x = m.x, e.width = E - 1.5 * i;
+      e.x = m.x, e.width = _ - 1.5 * i;
       const l = (await be(C, e, { config: f })).node().getBBox();
       e.y = n + l.height / 2, await me(e), n = e.y + l.height / 2 + i / 2;
     }
     const o = O.cluster.select("rect"), u = Math.max(n - s + 3 * i, 50) + (x - 25);
     o.attr("height", u);
   }
-  Ee(
+  _e(
     void 0,
     h,
-    ((H = f.mindmap) == null ? void 0 : H.padding) ?? Y.kanban.padding,
-    ((V = f.mindmap) == null ? void 0 : V.useMaxWidth) ?? Y.kanban.useMaxWidth
+    ((H = f.mindmap) == null ? void 0 : H.padding) ?? K.kanban.padding,
+    ((V = f.mindmap) == null ? void 0 : V.useMaxWidth) ?? K.kanban.useMaxWidth
   );
-}, "draw"), Fe = {
+}, "draw"), Ge = {
   draw: Be
-}, Ge = /* @__PURE__ */ c((t) => {
+}, Fe = /* @__PURE__ */ c((t) => {
   let g = "";
   for (let r = 0; r < t.THEME_COLOR_LIMIT; r++)
     t["lineColor" + r] = t["lineColor" + r] || t["cScaleInv" + r], Se(t["lineColor" + r]) ? t["lineColor" + r] = le(t["lineColor" + r], 20) : t["lineColor" + r] = ce(t["lineColor" + r], 20);
@@ -677,11 +677,11 @@ var xe = $, D = [], ne = [], ee = 0, se = {}, ve = /* @__PURE__ */ c(() => {
     `;
   }
   return g;
-}, "genSections"), je = /* @__PURE__ */ c((t) => `
+}, "genSections"), Me = /* @__PURE__ */ c((t) => `
   .edge {
     stroke-width: 3;
   }
-  ${Ge(t)}
+  ${Fe(t)}
   .section-root rect, .section-root path, .section-root circle, .section-root polygon  {
     fill: ${t.git0};
   }
@@ -709,11 +709,11 @@ var xe = $, D = [], ne = [], ee = 0, se = {}, ve = /* @__PURE__ */ c(() => {
     text-align: center;
   }
     ${Ne()}
-`, "getStyles"), Me = je, We = {
+`, "getStyles"), Ue = Me, We = {
   db: Ve,
-  renderer: Fe,
+  renderer: Ge,
   parser: xe,
-  styles: Me
+  styles: Ue
 };
 export {
   We as diagram

package/dist/layout.js

@@ -1,15 +1,15 @@
 import { G as g } from "./graph.js";
 import { b as Te, p as ce, q as le, g as z, e as ee, l as j, o as Ie, s as Me, c as Se, u as Fe, d as f, i as m, f as _, v as x, r as M } from "./_baseUniq.js";
-import { f as O, b as he, a as je, c as Ve, d as Ae, t as V, m as w, e as P, h as ve, g as X, l as T, i as Be } from "./_basePickBy.js";
-import { bN as Ge, bO as Ye, bP as De, bD as qe, bQ as $e, bH as pe, bG as we, bR as We, bC as q, bq as ze, bJ as Xe, bs as Ue, bS as $ } from "./CoachForm.js";
+import { f as O, b as he, a as je, c as Ve, d as Be, t as V, m as w, e as P, h as ve, g as X, l as T, i as Ae } from "./_basePickBy.js";
+import { bS as Ge, bT as Ye, bU as De, bI as qe, bV as We, bM as pe, bL as we, bW as $e, bH as q, az as ze, bO as Xe, aB as Ue, bX as W } from "./CoachForm.js";
 function He(e) {
   return Ge(Ye(e, void 0, O), e + "");
 }
-var Je = 1, Qe = 4;
-function Ze(e) {
-  return Te(e, Je | Qe);
+var Je = 1, Ze = 4;
+function Ke(e) {
+  return Te(e, Je | Ze);
 }
-function Ke(e, n) {
+function Qe(e, n) {
   return e == null ? e : De(e, ce(n), qe);
 }
 function en(e, n) {
@@ -21,7 +21,7 @@ function nn(e, n) {
 function S(e, n) {
   var r = {};
   return n = z(n), le(e, function(t, a, i) {
-    $e(r, a, n(t, a, i));
+    We(r, a, n(t, a, i));
   }), r;
 }
 function y(e) {
@@ -65,7 +65,7 @@ function on(e, n, r) {
     } : i;
   }) : n = [pe];
   var t = -1;
-  n = j(n, We(z));
+  n = j(n, $e(z));
   var a = Ve(e, function(i, o, u) {
     var d = j(n, function(s) {
       return s(i);
@@ -77,7 +77,7 @@ function on(e, n, r) {
   });
 }
 function un(e, n) {
-  return Ae(e, n, function(r, t) {
+  return Be(e, n, function(r, t) {
     return Me(e, t);
   });
 }
@@ -155,27 +155,27 @@ function mn(e, n) {
 function gn(e, n, r) {
   for (var t = [], a = n[n.length - 1], i = n[0], o; e.nodeCount(); ) {
     for (; o = i.dequeue(); )
-      A(e, n, r, o);
+      B(e, n, r, o);
     for (; o = a.dequeue(); )
-      A(e, n, r, o);
+      B(e, n, r, o);
     if (e.nodeCount()) {
       for (var u = n.length - 2; u > 0; --u)
         if (o = n[u].dequeue(), o) {
-          t = t.concat(A(e, n, r, o, !0));
+          t = t.concat(B(e, n, r, o, !0));
           break;
         }
     }
   }
   return t;
 }
-function A(e, n, r, t, a) {
+function B(e, n, r, t, a) {
   var i = a ? [] : void 0;
   return f(e.inEdges(t.v), function(o) {
     var u = e.edge(o), d = e.node(o.v);
-    a && i.push({ v: o.v, w: o.w }), d.out -= u, W(n, r, d);
+    a && i.push({ v: o.v, w: o.w }), d.out -= u, $(n, r, d);
   }), f(e.outEdges(t.v), function(o) {
     var u = e.edge(o), d = o.w, s = e.node(d);
-    s.in -= u, W(n, r, s);
+    s.in -= u, $(n, r, s);
   }), e.removeNode(t.v), i;
 }
 function yn(e, n) {
@@ -190,10 +190,10 @@ function yn(e, n) {
     return new pn();
   }), o = t + 1;
   return f(r.nodes(), function(u) {
-    W(i, o, r.node(u));
+    $(i, o, r.node(u));
   }), { graph: r, buckets: i, zeroIdx: o };
 }
-function W(e, n, r) {
+function $(e, n, r) {
   r.out ? r.in ? e[r.out - r.in + n].enqueue(r) : e[e.length - 1].enqueue(r) : e[0].enqueue(r);
 }
 function kn(e) {
@@ -359,13 +359,13 @@ function ie(e) {
 }
 function In(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, "y") && B(r);
+    f(r.points, A), Object.prototype.hasOwnProperty.call(r, "y") && A(r);
   });
 }
-function B(e) {
+function A(e) {
   e.y = -e.y;
 }
 function Mn(e) {
@@ -433,7 +433,7 @@ function ye(e) {
   var n = new g({ directed: !1 }), r = e.nodes()[0], t = e.nodeCount();
   n.setNode(r, {});
   for (var a, i; Vn(n, e) < t; )
-    a = An(n, e), i = n.hasNode(a.v) ? C(e, a) : -C(e, a), Bn(n, e, i);
+    a = Bn(n, e), i = n.hasNode(a.v) ? C(e, a) : -C(e, a), An(n, e, i);
   return n;
 }
 function Vn(e, n) {
@@ -445,13 +445,13 @@ function Vn(e, n) {
   }
   return f(e.nodes(), r), e.nodeCount();
 }
-function An(e, n) {
+function Bn(e, n) {
   return U(n.edges(), function(r) {
     if (e.hasNode(r.v) !== e.hasNode(r.w))
       return C(n, r);
   });
 }
-function Bn(e, n, r) {
+function An(e, n, r) {
   f(e.nodes(), function(t) {
     n.node(t).rank += r;
   });
@@ -479,8 +479,8 @@ function Yn(e, n) {
 function Dn(e, n) {
   return ke(e, n, "pre");
 }
-k.initLowLimValues = Z;
-k.initCutValues = Q;
+k.initLowLimValues = K;
+k.initCutValues = Z;
 k.calcCutValue = Ee;
 k.leaveEdge = Le;
 k.enterEdge = Ne;
@@ -488,11 +488,11 @@ k.exchangeEdges = Pe;
 function k(e) {
   e = On(e), J(e);
   var n = ye(e);
-  Z(n), Q(n, e);
+  K(n), Z(n, e);
   for (var r, t; r = Le(n); )
     t = Ne(n, e, r), Pe(n, e, r, t);
 }
-function Q(e, n) {
+function Z(e, n) {
   var r = Yn(e, e.nodes());
   r = r.slice(0, r.length - 1), f(r, function(t) {
     qn(e, n, t);
@@ -508,14 +508,14 @@ function Ee(e, n, r) {
     var s = d.v === r, c = s ? d.w : d.v;
     if (c !== a) {
       var l = s === i, h = n.edge(d).weight;
-      if (u += l ? h : -h, Wn(e, r, c)) {
+      if (u += l ? h : -h, $n(e, r, c)) {
         var v = e.edge(r, c).cutvalue;
         u += l ? -v : v;
       }
     }
   }), u;
 }
-function Z(e, n) {
+function K(e, n) {
   arguments.length < 2 && (n = e.nodes()[0]), Oe(e, {}, 1, n);
 }
 function Oe(e, n, r, t, a) {
@@ -543,9 +543,9 @@ function Ne(e, n, r) {
 }
 function Pe(e, n, r, t) {
   var a = r.v, i = r.w;
-  e.removeEdge(a, i), e.setEdge(t.v, t.w, {}), Z(e), Q(e, n), $n(e, n);
+  e.removeEdge(a, i), e.setEdge(t.v, t.w, {}), K(e), Z(e, n), Wn(e, n);
 }
-function $n(e, n) {
+function Wn(e, n) {
   var r = X(e.nodes(), function(a) {
     return !n.node(a).parent;
   }), t = Dn(e, r);
@@ -554,7 +554,7 @@ function $n(e, n) {
     o || (o = n.edge(i, a), u = !0), n.node(a).rank = n.node(i).rank + (u ? o.minlen : -o.minlen);
   });
 }
-function Wn(e, n, r) {
+function $n(e, n, r) {
   return e.hasEdge(n, r);
 }
 function oe(e, n, r) {
@@ -587,7 +587,7 @@ function Hn(e) {
   e.graph().nestingRoot = n, f(e.edges(), function(o) {
     e.edge(o).minlen *= a;
   });
-  var i = Qn(e) + 1;
+  var i = Zn(e) + 1;
   f(e.children(), function(o) {
     Ce(e, n, a, i, t, r, o);
   }), e.graph().nodeRankFactor = a;
@@ -625,7 +625,7 @@ function Jn(e) {
     r(t, 1);
   }), n;
 }
-function Qn(e) {
+function Zn(e) {
   return M(
     e.edges(),
     function(n, r) {
@@ -634,14 +634,14 @@ function Qn(e) {
     0
   );
 }
-function Zn(e) {
+function Kn(e) {
   var n = e.graph();
   e.removeNode(n.nestingRoot), delete n.nestingRoot, f(e.edges(), function(r) {
     var t = e.edge(r);
     t.nestingEdge && e.removeEdge(r);
   });
 }
-function Kn(e, n, r) {
+function Qn(e, n, r) {
   var t = {}, a;
   f(r, function(i) {
     for (var o = e.parent(i), u, d; o; ) {
@@ -865,7 +865,7 @@ function hr(e) {
   for (var i = Number.POSITIVE_INFINITY, o, u = 0, d = 0; d < 4; ++u, ++d) {
     vr(u % 2 ? r : t, u % 4 >= 2), a = F(e);
     var s = rr(e, a);
-    s < i && (d = 0, o = Ze(a), i = s);
+    s < i && (d = 0, o = Ke(a), i = s);
   }
   fe(e, o);
 }
@@ -880,7 +880,7 @@ function vr(e, n) {
     var a = t.graph().root, i = _e(t, a, r, n);
     f(i.vs, function(o, u) {
       t.node(o).order = u;
-    }), Kn(t, r, i.vs);
+    }), Qn(t, r, i.vs);
   });
 }
 function fe(e, n) {
@@ -934,8 +934,8 @@ function mr(e, n) {
       var h = yr(e, c), v = h ? e.node(h).order : d;
       (h || c === s) && (f(i.slice(u, l + 1), function(p) {
         f(e.predecessors(p), function(b) {
-          var N = e.node(b), K = N.order;
-          (K < o || v < K) && !(N.dummy && e.node(p).dummy) && Re(r, b, p);
+          var N = e.node(b), Q = N.order;
+          (Q < o || v < Q) && !(N.dummy && e.node(p).dummy) && Re(r, b, p);
         });
       }), u = l + 1, o = v);
     }), i;
@@ -1046,7 +1046,7 @@ function Or(e, n, r, t) {
 function Lr(e, n) {
   return U(x(n), function(r) {
     var t = Number.NEGATIVE_INFINITY, a = Number.POSITIVE_INFINITY;
-    return Ke(r, function(i, o) {
+    return Qe(r, function(i, o) {
       var u = Rr(e, o) / 2;
       t = Math.max(i + u, t), a = Math.min(i - u, a);
     }), t - a;
@@ -1075,7 +1075,7 @@ function Pr(e, n) {
   });
 }
 function Cr(e) {
-  var n = F(e), r = $(mr(e, n), gr(e, n)), t = {}, a;
+  var n = F(e), r = W(mr(e, n), gr(e, n)), t = {}, a;
   f(["u", "d"], function(o) {
     a = o === "u" ? n : x(n).reverse(), f(["l", "r"], function(u) {
       u === "r" && (a = w(a, function(l) {
@@ -1143,7 +1143,7 @@ function ot(e, n) {
   });
 }
 function Mr(e, n) {
-  n("    makeSpaceForEdgeLabels", () => $r(e)), n("    removeSelfEdges", () => Kr(e)), n("    acyclic", () => kn(e)), n("    nestingGraph.run", () => Hn(e)), n("    rank", () => zn(be(e))), n("    injectEdgeLabelProxies", () => Wr(e)), n("    removeEmptyRanks", () => Nn(e)), n("    nestingGraph.cleanup", () => Zn(e)), n("    normalizeRanks", () => Ln(e)), n("    assignRankMinMax", () => zr(e)), n("    removeEdgeLabelProxies", () => Xr(e)), n("    normalize.run", () => Sn(e)), n("    parentDummyChains", () => pr(e)), n("    addBorderSegments", () => _n(e)), n("    order", () => hr(e)), n("    insertSelfEdges", () => et(e)), n("    adjustCoordinateSystem", () => Rn(e)), n("    position", () => Tr(e)), n("    positionSelfEdges", () => nt(e)), n("    removeBorderNodes", () => Zr(e)), n("    normalize.undo", () => jn(e)), n("    fixupEdgeLabelCoords", () => Jr(e)), n("    undoCoordinateSystem", () => Tn(e)), n("    translateGraph", () => Ur(e)), n("    assignNodeIntersects", () => Hr(e)), n("    reversePoints", () => Qr(e)), n("    acyclic.undo", () => En(e));
+  n("    makeSpaceForEdgeLabels", () => Wr(e)), n("    removeSelfEdges", () => Qr(e)), n("    acyclic", () => kn(e)), n("    nestingGraph.run", () => Hn(e)), n("    rank", () => zn(be(e))), n("    injectEdgeLabelProxies", () => $r(e)), n("    removeEmptyRanks", () => Nn(e)), n("    nestingGraph.cleanup", () => Kn(e)), n("    normalizeRanks", () => Ln(e)), n("    assignRankMinMax", () => zr(e)), n("    removeEdgeLabelProxies", () => Xr(e)), n("    normalize.run", () => Sn(e)), n("    parentDummyChains", () => pr(e)), n("    addBorderSegments", () => _n(e)), n("    order", () => hr(e)), n("    insertSelfEdges", () => et(e)), n("    adjustCoordinateSystem", () => Rn(e)), n("    position", () => Tr(e)), n("    positionSelfEdges", () => nt(e)), n("    removeBorderNodes", () => Kr(e)), n("    normalize.undo", () => jn(e)), n("    fixupEdgeLabelCoords", () => Jr(e)), n("    undoCoordinateSystem", () => Tn(e)), n("    translateGraph", () => Ur(e)), n("    assignNodeIntersects", () => Hr(e)), n("    reversePoints", () => Zr(e)), n("    acyclic.undo", () => En(e));
 }
 function Sr(e, n) {
   f(e.nodes(), function(r) {
@@ -1154,7 +1154,7 @@ function Sr(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 Fr = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], jr = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" }, Vr = ["acyclicer", "ranker", "rankdir", "align"], Ar = ["width", "height"], Br = { width: 0, height: 0 }, Gr = ["minlen", "weight", "width", "height", "labeloffset"], Yr = {
+var Fr = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], jr = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" }, Vr = ["acyclicer", "ranker", "rankdir", "align"], Br = ["width", "height"], Ar = { width: 0, height: 0 }, Gr = ["minlen", "weight", "width", "height", "labeloffset"], Yr = {
   minlen: 1,
   weight: 1,
   width: 0,
@@ -1165,26 +1165,26 @@ var Fr = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], jr = { ranksep
 function qr(e) {
   var n = new g({ multigraph: !0, compound: !0 }), r = D(e.graph());
   return n.setGraph(
-    $({}, jr, Y(r, Fr), I(r, Vr))
+    W({}, jr, Y(r, Fr), I(r, Vr))
   ), f(e.nodes(), function(t) {
     var a = D(e.node(t));
-    n.setNode(t, Be(Y(a, Ar), Br)), n.setParent(t, e.parent(t));
+    n.setNode(t, Ae(Y(a, Br), Ar)), n.setParent(t, e.parent(t));
   }), f(e.edges(), function(t) {
     var a = D(e.edge(t));
     n.setEdge(
       t,
-      $({}, Yr, Y(a, Gr), I(a, Dr))
+      W({}, Yr, Y(a, Gr), I(a, Dr))
     );
   }), n;
 }
-function $r(e) {
+function Wr(e) {
   var n = e.graph();
   n.ranksep /= 2, f(e.edges(), function(r) {
     var t = e.edge(r);
     t.minlen *= 2, t.labelpos.toLowerCase() !== "c" && (n.rankdir === "TB" || n.rankdir === "BT" ? t.width += t.labeloffset : t.height += t.labeloffset);
   });
 }
-function Wr(e) {
+function $r(e) {
   f(e.edges(), function(n) {
     var r = e.edge(n);
     if (r.width && r.height) {
@@ -1247,13 +1247,13 @@ function Jr(e) {
       }
   });
 }
-function Qr(e) {
+function Zr(e) {
   f(e.edges(), function(n) {
     var r = e.edge(n);
     r.reversed && r.points.reverse();
   });
 }
-function Zr(e) {
+function Kr(e) {
   f(e.nodes(), function(n) {
     if (e.children(n).length) {
       var r = e.node(n), t = e.node(r.borderTop), a = e.node(r.borderBottom), i = e.node(T(r.borderLeft)), o = e.node(T(r.borderRight));
@@ -1263,7 +1263,7 @@ function Zr(e) {
     e.node(n).dummy === "border" && e.removeNode(n);
   });
 }
-function Kr(e) {
+function Qr(e) {
   f(e.edges(), function(n) {
     if (n.v === n.w) {
       var r = e.node(n.v);