@schmitech/chatbot-widget 0.6.3 → 0.7.0

package/dist/{layout-bsfAhWjc-fb3F3QBs.js → layout-C0kZPebx-CrIgKtBd.js}

@@ -1,7 +1,7 @@
-import { Q as b, A as k, _ as m, O as An } from "./graph-BpcfrHXY-Dllj_YdG.js";
-import { B as Vn, q as f, v as q, n as ln, a as j, $ as pn, G as Yn, Y as F, T as zn, Z as R, F as wn, j as mn, x as Q, I as Dn, M as Qn, b as Zn, c as Hn } from "./_baseUniq-BPMphbq5-xiRWQlDn.js";
-import { L as O, v as Jn, k as I, M as p, A as bn, x as Kn } from "./min-C2aDz5ZK-NndI1eE7.js";
-import { aD as yn, aE as L, aF as xn, aG as Xn, aH as Z, aI as Un, aJ as Wn, aK as kn, aL as En, aM as nr, aN as rr, aO as tr, aP as $, aQ as er, aR as On, aS as or, aT as ir } from "./index-DlxA4QQ9.js";
+import { Q as b, A as k, _ as m, O as qn } from "./graph-BmNkcFEM-CTJN7Ty_.js";
+import { B as Vn, q as f, v as Y, n as ln, a as j, $ as pn, G as An, Y as F, T as zn, Z as R, F as wn, j as mn, I as Dn, x as Q, M as Qn, b as Zn, c as Jn } from "./_baseUniq-BRKsqoH--HqBVqMpT.js";
+import { L as O, v as Hn, k as I, M as p, A as bn, x as Kn } from "./min-7Gb0pNxh-Cd_K7Lpk.js";
+import { aD as yn, aE as L, aF as xn, aG as Wn, aH as Z, aI as Un, aJ as Xn, aK as kn, aL as En, aM as nr, aN as rr, aO as C, aP as tr, aQ as On, aR as er, aS as or, aT as ir } from "./index-DU3Jqd59.js";
 typeof window < "u" && (window.global = window);
 var ar = /\s/;
 function ur(n) {
@@ -19,9 +19,9 @@ function gr(n) {
     return n;
   if (Q(n))
     return tn;
-  if ($(n)) {
+  if (C(n)) {
     var r = typeof n.valueOf == "function" ? n.valueOf() : n;
-    n = $(r) ? r + "" : r;
+    n = C(r) ? r + "" : r;
   }
   if (typeof n != "string")
     return n === 0 ? n : +n;
@@ -30,7 +30,7 @@ function gr(n) {
   return t || hr.test(n) ? vr(n.slice(2), t ? 2 : 8) : fr.test(n) ? tn : +n;
 }
 var en = 1 / 0, lr = 17976931348623157e292;
-function M(n) {
+function T(n) {
   if (!n)
     return n === 0 ? n : 0;
   if (n = gr(n), n === en || n === -en) {
@@ -40,15 +40,15 @@ function M(n) {
   return n === n ? n : 0;
 }
 function pr(n) {
-  var r = M(n), t = r % 1;
+  var r = T(n), t = r % 1;
   return r === r ? t ? r - t : r : 0;
 }
 function wr(n) {
-  return Un(Wn(n, void 0, O), n + "");
+  return Un(Xn(n, void 0, O), n + "");
 }
 var mr = 1, br = 4;
 function yr(n) {
-  return An(n, mr | br);
+  return qn(n, mr | br);
 }
 var Nn = Object.prototype, xr = Nn.hasOwnProperty, kr = yn(function(n, r) {
   n = Object(n);
@@ -56,11 +56,11 @@ var Nn = Object.prototype, xr = Nn.hasOwnProperty, kr = yn(function(n, r) {
   for (o && L(r[0], r[1], o) && (e = 1); ++t < e; )
     for (var a = r[t], i = xn(a), u = -1, d = i.length; ++u < d; ) {
       var c = i[u], s = n[c];
-      (s === void 0 || Xn(s, Nn[c]) && !xr.call(n, c)) && (n[c] = a[c]);
+      (s === void 0 || Wn(s, Nn[c]) && !xr.call(n, c)) && (n[c] = a[c]);
     }
   return n;
 });
-function C(n) {
+function $(n) {
   var r = n == null ? 0 : n.length;
   return r ? n[r - 1] : void 0;
 }
@@ -83,9 +83,9 @@ function Nr(n, r, t) {
   if (!e)
     return -1;
   var o = t == null ? 0 : pr(t);
-  return o < 0 && (o = Or(e + o, 0)), Hn(n, j(r), o);
+  return o < 0 && (o = Or(e + o, 0)), Jn(n, j(r), o);
 }
-var J = Er(Nr);
+var H = Er(Nr);
 function _r(n, r) {
   return n == null ? n : ir(n, wn(r), xn);
 }
@@ -96,11 +96,11 @@ function Pr(n, r) {
   return n > r;
 }
 var jr = Object.prototype, Rr = jr.hasOwnProperty;
-function Tr(n, r) {
+function Mr(n, r) {
   return n != null && Rr.call(n, r);
 }
 function _n(n, r) {
-  return n != null && zn(n, r, Tr);
+  return n != null && zn(n, r, Mr);
 }
 function G(n, r) {
   var t = {};
@@ -114,8 +114,8 @@ function y(n) {
 function K(n, r) {
   return n && n.length ? bn(n, j(r), Kn) : void 0;
 }
-function Mr(n, r, t, e) {
-  if (!$(n))
+function Tr(n, r, t, e) {
+  if (!C(n))
     return n;
   r = mn(r, n);
   for (var o = -1, a = r.length, i = a - 1, u = n; u != null && ++o < a; ) {
@@ -124,7 +124,7 @@ function Mr(n, r, t, e) {
       return n;
     if (o != i) {
       var s = u[d];
-      c = void 0, c === void 0 && (c = $(s) ? s : er(r[o + 1]) ? [] : {});
+      c = void 0, c === void 0 && (c = C(s) ? s : tr(r[o + 1]) ? [] : {});
     }
     On(u, d, c), u = u[d];
   }
@@ -133,17 +133,17 @@ function Mr(n, r, t, e) {
 function Lr(n, r, t) {
   for (var e = -1, o = r.length, a = {}; ++e < o; ) {
     var i = r[e], u = ln(n, i);
-    t(u, i) && Mr(a, mn(i, n), u);
+    t(u, i) && Tr(a, mn(i, n), u);
   }
   return a;
 }
-function $r(n, r) {
+function Cr(n, r) {
   var t = n.length;
   for (n.sort(r); t--; )
     n[t] = n[t].value;
   return n;
 }
-function Cr(n, r) {
+function $r(n, r) {
   if (n !== r) {
     var t = n !== void 0, e = n === null, o = n === n, a = Q(n), i = r !== void 0, u = r === null, d = r === r, c = Q(r);
     if (!u && !c && !a && n > r || a && i && d && !u && !c || e && i && d || !t && d || !o)
@@ -155,7 +155,7 @@ function Cr(n, r) {
 }
 function Sr(n, r, t) {
   for (var e = -1, o = n.criteria, a = r.criteria, i = o.length, u = t.length; ++e < i; ) {
-    var d = Cr(o[e], a[e]);
+    var d = $r(o[e], a[e]);
     if (d) {
       if (e >= u)
         return d;
@@ -166,20 +166,20 @@ function Sr(n, r, t) {
   return n.index - r.index;
 }
 function Fr(n, r, t) {
-  r.length ? r = q(r, function(a) {
+  r.length ? r = Y(r, function(a) {
     return kn(a) ? function(i) {
       return ln(i, a.length === 1 ? a[0] : a);
     } : a;
   }) : r = [En];
   var e = -1;
-  r = q(r, nr(j));
-  var o = Jn(n, function(a, i, u) {
-    var d = q(r, function(c) {
+  r = Y(r, nr(j));
+  var o = Hn(n, function(a, i, u) {
+    var d = Y(r, function(c) {
       return c(a);
     });
     return { criteria: d, index: ++e, value: a };
   });
-  return $r(o, function(a, i) {
+  return Cr(o, function(a, i) {
     return Sr(a, i, t);
   });
 }
@@ -190,26 +190,26 @@ function Gr(n, r) {
 }
 var S = wr(function(n, r) {
   return n == null ? {} : Gr(n, r);
-}), Br = Math.ceil, qr = Math.max;
-function Ar(n, r, t, e) {
-  for (var o = -1, a = qr(Br((r - n) / (t || 1)), 0), i = Array(a); a--; )
+}), Br = Math.ceil, Yr = Math.max;
+function qr(n, r, t, e) {
+  for (var o = -1, a = Yr(Br((r - n) / (t || 1)), 0), i = Array(a); a--; )
     i[++o] = n, n += t;
   return i;
 }
 function Vr(n) {
   return function(r, t, e) {
-    return e && typeof e != "number" && L(r, t, e) && (t = e = void 0), r = M(r), t === void 0 ? (t = r, r = 0) : t = M(t), e = e === void 0 ? r < t ? 1 : -1 : M(e), Ar(r, t, e);
+    return e && typeof e != "number" && L(r, t, e) && (t = e = void 0), r = T(r), t === void 0 ? (t = r, r = 0) : t = T(t), e = e === void 0 ? r < t ? 1 : -1 : T(e), qr(r, t, e);
   };
 }
-var E = Vr(), T = yn(function(n, r) {
+var E = Vr(), M = yn(function(n, r) {
   if (n == null)
     return [];
   var t = r.length;
   return t > 1 && L(n, r[0], r[1]) ? r = [] : t > 2 && L(r[0], r[1], r[2]) && (r = [r[0]]), Fr(n, Vn(r), []);
-}), Yr = 0;
-function X(n) {
-  var r = ++Yr;
-  return Yn(n) + r;
+}), Ar = 0;
+function W(n) {
+  var r = ++Ar;
+  return An(n) + r;
 }
 function zr(n, r, t) {
   for (var e = -1, o = n.length, a = r.length, i = {}; ++e < o; ) {
@@ -248,11 +248,11 @@ function Zr(n, r) {
   if (n !== "_next" && n !== "_prev")
     return r;
 }
-var Hr = tr(1);
-function Jr(n, r) {
+var Jr = er(1);
+function Hr(n, r) {
   if (n.nodeCount() <= 1)
     return [];
-  var t = Xr(n, r || Hr), e = Kr(t.graph, t.buckets, t.zeroIdx);
+  var t = Wr(n, r || Jr), e = Kr(t.graph, t.buckets, t.zeroIdx);
   return O(
     p(e, function(o) {
       return n.outEdges(o.v, o.w);
@@ -262,30 +262,30 @@ function Jr(n, r) {
 function Kr(n, r, t) {
   for (var e = [], o = r[r.length - 1], a = r[0], i; n.nodeCount(); ) {
     for (; i = a.dequeue(); )
-      A(n, r, t, i);
+      q(n, r, t, i);
     for (; i = o.dequeue(); )
-      A(n, r, t, i);
+      q(n, r, t, i);
     if (n.nodeCount()) {
       for (var u = r.length - 2; u > 0; --u)
         if (i = r[u].dequeue(), i) {
-          e = e.concat(A(n, r, t, i, !0));
+          e = e.concat(q(n, r, t, i, !0));
           break;
         }
     }
   }
   return e;
 }
-function A(n, r, t, e, o) {
+function q(n, r, t, e, o) {
   var a = o ? [] : void 0;
   return f(n.inEdges(e.v), function(i) {
     var u = n.edge(i), d = n.node(i.v);
-    o && a.push({ v: i.v, w: i.w }), d.out -= u, H(r, t, d);
+    o && a.push({ v: i.v, w: i.w }), d.out -= u, J(r, t, d);
   }), f(n.outEdges(e.v), function(i) {
     var u = n.edge(i), d = i.w, c = n.node(d);
-    c.in -= u, H(r, t, c);
+    c.in -= u, J(r, t, c);
   }), n.removeNode(e.v), a;
 }
-function Xr(n, r) {
+function Wr(n, r) {
   var t = new b(), e = 0, o = 0;
   f(n.nodes(), function(u) {
     t.setNode(u, { v: u, in: 0, out: 0 });
@@ -297,17 +297,17 @@ function Xr(n, r) {
     return new Qr();
   }), i = e + 1;
   return f(t.nodes(), function(u) {
-    H(a, i, t.node(u));
+    J(a, i, t.node(u));
   }), { graph: t, buckets: a, zeroIdx: i };
 }
-function H(n, r, t) {
+function J(n, r, t) {
   t.out ? t.in ? n[t.out - t.in + r].enqueue(t) : n[n.length - 1].enqueue(t) : n[0].enqueue(t);
 }
 function Ur(n) {
-  var r = n.graph().acyclicer === "greedy" ? Jr(n, t(n)) : Wr(n);
+  var r = n.graph().acyclicer === "greedy" ? Hr(n, t(n)) : Xr(n);
   f(r, function(e) {
     var o = n.edge(e);
-    n.removeEdge(e), o.forwardName = e.name, o.reversed = !0, n.setEdge(e.w, e.v, o, X("rev"));
+    n.removeEdge(e), o.forwardName = e.name, o.reversed = !0, n.setEdge(e.w, e.v, o, W("rev"));
   });
   function t(e) {
     return function(o) {
@@ -315,7 +315,7 @@ function Ur(n) {
     };
   }
 }
-function Wr(n) {
+function Xr(n) {
   var r = [], t = {}, e = {};
   function o(a) {
     Object.prototype.hasOwnProperty.call(e, a) || (e[a] = !0, t[a] = !0, f(n.outEdges(a), function(i) {
@@ -337,7 +337,7 @@ function nt(n) {
 function N(n, r, t, e) {
   var o;
   do
-    o = X(e);
+    o = W(e);
   while (n.hasNode(o));
   return t.dummy = r, n.setNode(o, t), o;
 }
@@ -477,13 +477,13 @@ function V(n) {
 }
 function ft(n) {
   f(n.nodes(), function(r) {
-    Y(n.node(r));
+    A(n.node(r));
   }), f(n.edges(), function(r) {
     var t = n.edge(r);
-    f(t.points, Y), Object.prototype.hasOwnProperty.call(t, "x") && Y(t);
+    f(t.points, A), Object.prototype.hasOwnProperty.call(t, "x") && A(t);
   });
 }
-function Y(n) {
+function A(n) {
   var r = n.x;
   n.x = n.y, n.y = r;
 }
@@ -563,40 +563,40 @@ function pt(n, r, t) {
     r.node(e).rank += t;
   });
 }
-function Tn(n, r, t) {
+function Mn(n, r, t) {
   kn(r) || (r = [r]);
   var e = (n.isDirected() ? n.successors : n.neighbors).bind(n), o = [], a = {};
   return f(r, function(i) {
     if (!n.hasNode(i))
       throw new Error("Graph does not have node: " + i);
-    Mn(n, i, t === "post", a, e, o);
+    Tn(n, i, t === "post", a, e, o);
   }), o;
 }
-function Mn(n, r, t, e, o, a) {
+function Tn(n, r, t, e, o, a) {
   Object.prototype.hasOwnProperty.call(e, r) || (e[r] = !0, t || a.push(r), f(o(r), function(i) {
-    Mn(n, i, t, e, o, a);
+    Tn(n, i, t, e, o, a);
   }), t && a.push(r));
 }
 function wt(n, r) {
-  return Tn(n, r, "post");
+  return Mn(n, r, "post");
 }
 function mt(n, r) {
-  return Tn(n, r, "pre");
+  return Mn(n, r, "pre");
 }
 x.initLowLimValues = nn;
-x.initCutValues = W;
+x.initCutValues = X;
 x.calcCutValue = Ln;
-x.leaveEdge = Cn;
+x.leaveEdge = $n;
 x.enterEdge = Sn;
 x.exchangeEdges = Fn;
 function x(n) {
   n = rt(n), U(n);
   var r = Rn(n);
-  nn(r), W(r, n);
-  for (var t, e; t = Cn(r); )
+  nn(r), X(r, n);
+  for (var t, e; t = $n(r); )
     e = Sn(r, n, t), Fn(r, n, t, e);
 }
-function W(n, r) {
+function X(n, r) {
   var t = wt(n, n.nodes());
   t = t.slice(0, t.length - 1), f(t, function(e) {
     bt(n, r, e);
@@ -620,16 +620,16 @@ function Ln(n, r, t) {
   }), u;
 }
 function nn(n, r) {
-  arguments.length < 2 && (r = n.nodes()[0]), $n(n, {}, 1, r);
+  arguments.length < 2 && (r = n.nodes()[0]), Cn(n, {}, 1, r);
 }
-function $n(n, r, t, e, o) {
+function Cn(n, r, t, e, o) {
   var a = t, i = n.node(e);
   return r[e] = !0, f(n.neighbors(e), function(u) {
-    Object.prototype.hasOwnProperty.call(r, u) || (t = $n(n, r, t, u, e));
+    Object.prototype.hasOwnProperty.call(r, u) || (t = Cn(n, r, t, u, e));
   }), i.low = a, i.lim = t++, o ? i.parent = o : delete i.parent, t;
 }
-function Cn(n) {
-  return J(n.edges(), function(r) {
+function $n(n) {
+  return H(n.edges(), function(r) {
     return n.edge(r).cutvalue < 0;
   });
 }
@@ -647,10 +647,10 @@ function Sn(n, r, t) {
 }
 function Fn(n, r, t, e) {
   var o = t.v, a = t.w;
-  n.removeEdge(o, a), n.setEdge(e.v, e.w, {}), nn(n), W(n, r), yt(n, r);
+  n.removeEdge(o, a), n.setEdge(e.v, e.w, {}), nn(n), X(n, r), yt(n, r);
 }
 function yt(n, r) {
-  var t = J(n.nodes(), function(o) {
+  var t = H(n.nodes(), function(o) {
     return !r.node(o).parent;
   }), e = mt(n, t);
   e = e.slice(1), f(e, function(o) {
@@ -758,7 +758,7 @@ function jt(n, r, t) {
   });
 }
 function Rt(n, r, t) {
-  var e = Tt(n), o = new b({ compound: !0 }).setGraph({ root: e }).setDefaultNodeLabel(function(a) {
+  var e = Mt(n), o = new b({ compound: !0 }).setGraph({ root: e }).setDefaultNodeLabel(function(a) {
     return n.node(a);
   });
   return f(n.nodes(), function(a) {
@@ -772,11 +772,11 @@ function Rt(n, r, t) {
     }));
   }), o;
 }
-function Tt(n) {
-  for (var r; n.hasNode(r = X("_root")); ) ;
+function Mt(n) {
+  for (var r; n.hasNode(r = W("_root")); ) ;
   return r;
 }
-function Mt(n, r) {
+function Tt(n, r) {
   for (var t = 0, e = 1; e < r.length; ++e)
     t += Lt(n, r[e - 1], r[e]);
   return t;
@@ -789,7 +789,7 @@ function Lt(n, r, t) {
     })
   ), o = O(
     p(r, function(c) {
-      return T(
+      return M(
         p(n.outEdges(c), function(s) {
           return { pos: e[s.w], weight: n.edge(s).weight };
         }),
@@ -813,7 +813,7 @@ function Lt(n, r, t) {
     })
   ), d;
 }
-function $t(n) {
+function Ct(n) {
   var r = {}, t = R(n.nodes(), function(u) {
     return !n.children(u).length;
   }), e = y(
@@ -830,12 +830,12 @@ function $t(n) {
       o[d.rank].push(u), f(n.successors(u), a);
     }
   }
-  var i = T(t, function(u) {
+  var i = M(t, function(u) {
     return n.node(u).rank;
   });
   return f(i, a), o;
 }
-function Ct(n, r) {
+function $t(n, r) {
   return p(r, function(t) {
     var e = n.inEdges(t);
     if (e.length) {
@@ -911,21 +911,21 @@ function Gt(n, r) {
 function Bt(n, r) {
   var t = ot(n, function(s) {
     return Object.prototype.hasOwnProperty.call(s, "barycenter");
-  }), e = t.lhs, o = T(t.rhs, function(s) {
+  }), e = t.lhs, o = M(t.rhs, function(s) {
     return -s.i;
   }), a = [], i = 0, u = 0, d = 0;
-  e.sort(qt(!!r)), d = hn(a, o, d), f(e, function(s) {
+  e.sort(Yt(!!r)), d = hn(a, o, d), f(e, function(s) {
     d += s.vs.length, a.push(s.vs), i += s.barycenter * s.weight, u += s.weight, d = hn(a, o, d);
   });
   var c = { vs: O(a) };
   return u && (c.barycenter = i / u, c.weight = u), c;
 }
 function hn(n, r, t) {
-  for (var e; r.length && (e = C(r)).i <= t; )
+  for (var e; r.length && (e = $(r)).i <= t; )
     r.pop(), n.push(e.vs), t++;
   return t;
 }
-function qt(n) {
+function Yt(n) {
   return function(r, t) {
     return r.barycenter < t.barycenter ? -1 : r.barycenter > t.barycenter ? 1 : n ? t.i - r.i : r.i - t.i;
   };
@@ -935,7 +935,7 @@ function Bn(n, r, t, e) {
   i && (o = R(o, function(l) {
     return l !== i && l !== u;
   }));
-  var c = Ct(n, o);
+  var c = $t(n, o);
   f(c, function(l) {
     if (n.children(l.v).length) {
       var w = Bn(n, l.v, t, e);
@@ -943,7 +943,7 @@ function Bn(n, r, t, e) {
     }
   });
   var s = St(c, t);
-  At(s, d);
+  qt(s, d);
   var h = Bt(s, e);
   if (i && (h.vs = O([i, h.vs, u]), n.predecessors(i).length)) {
     var v = n.node(n.predecessors(i)[0]), g = n.node(n.predecessors(u)[0]);
@@ -951,7 +951,7 @@ function Bn(n, r, t, e) {
   }
   return h;
 }
-function At(n, r) {
+function qt(n, r) {
   f(n, function(t) {
     t.vs = O(
       t.vs.map(function(e) {
@@ -963,12 +963,12 @@ function At(n, r) {
 function Vt(n, r) {
   m(n.barycenter) ? (n.barycenter = r.barycenter, n.weight = r.weight) : (n.barycenter = (n.barycenter * n.weight + r.barycenter * r.weight) / (n.weight + r.weight), n.weight += r.weight);
 }
-function Yt(n) {
-  var r = Pn(n), t = vn(n, E(1, r + 1), "inEdges"), e = vn(n, E(r - 1, -1, -1), "outEdges"), o = $t(n);
+function At(n) {
+  var r = Pn(n), t = vn(n, E(1, r + 1), "inEdges"), e = vn(n, E(r - 1, -1, -1), "outEdges"), o = Ct(n);
   gn(n, o);
   for (var a = Number.POSITIVE_INFINITY, i, u = 0, d = 0; d < 4; ++u, ++d) {
     zt(u % 2 ? t : e, u % 4 >= 2), o = B(n);
-    var c = Mt(n, o);
+    var c = Tt(n, o);
     c < a && (d = 0, i = yr(o), a = c);
   }
   gn(n, i);
@@ -1030,30 +1030,30 @@ function Zt(n) {
   }
   return f(n.children(), e), r;
 }
-function Ht(n, r) {
+function Jt(n, r) {
   var t = {};
   function e(o, a) {
-    var i = 0, u = 0, d = o.length, c = C(a);
+    var i = 0, u = 0, d = o.length, c = $(a);
     return f(a, function(s, h) {
       var v = Kt(n, s), g = v ? n.node(v).order : d;
       (v || s === c) && (f(a.slice(u, h + 1), function(l) {
         f(n.predecessors(l), function(w) {
           var _ = n.node(w), rn = _.order;
-          (rn < i || g < rn) && !(_.dummy && n.node(l).dummy) && qn(t, w, l);
+          (rn < i || g < rn) && !(_.dummy && n.node(l).dummy) && Yn(t, w, l);
         });
       }), u = h + 1, i = g);
     }), a;
   }
   return F(r, e), t;
 }
-function Jt(n, r) {
+function Ht(n, r) {
   var t = {};
   function e(a, i, u, d, c) {
     var s;
     f(E(i, u), function(h) {
       s = a[h], n.node(s).dummy && f(n.predecessors(s), function(v) {
         var g = n.node(v);
-        g.dummy && (g.order < d || g.order > c) && qn(t, v, s);
+        g.dummy && (g.order < d || g.order > c) && Yn(t, v, s);
       });
     });
   }
@@ -1071,11 +1071,11 @@ function Jt(n, r) {
 }
 function Kt(n, r) {
   if (n.node(r).dummy)
-    return J(n.predecessors(r), function(t) {
+    return H(n.predecessors(r), function(t) {
       return n.node(t).dummy;
     });
 }
-function qn(n, r, t) {
+function Yn(n, r, t) {
   if (r > t) {
     var e = r;
     r = t, t = e;
@@ -1094,7 +1094,7 @@ function qn(n, r, t) {
     writable: !0
   });
 }
-function Xt(n, r, t) {
+function Wt(n, r, t) {
   if (r > t) {
     var e = r;
     r = t, t = e;
@@ -1112,18 +1112,18 @@ function Ut(n, r, t, e) {
     f(u, function(c) {
       var s = e(c);
       if (s.length) {
-        s = T(s, function(w) {
+        s = M(s, function(w) {
           return i[w];
         });
         for (var h = (s.length - 1) / 2, v = Math.floor(h), g = Math.ceil(h); v <= g; ++v) {
           var l = s[v];
-          a[c] === c && d < i[l] && !Xt(t, c, l) && (a[l] = c, a[c] = o[c] = o[l], d = i[l]);
+          a[c] === c && d < i[l] && !Wt(t, c, l) && (a[l] = c, a[c] = o[c] = o[l], d = i[l]);
         }
       }
     });
   }), { root: o, align: a };
 }
-function Wt(n, r, t, e, o) {
+function Xt(n, r, t, e, o) {
   var a = {}, i = ne(n, r, t, o), u = o ? "borderLeft" : "borderRight";
   function d(h, v) {
     for (var g = i.nodes(), l = g.pop(), w = {}; l; )
@@ -1185,18 +1185,18 @@ function ee(n, r) {
   return G(n.ul, function(t, e) {
     if (r)
       return n[r.toLowerCase()][e];
-    var o = T(p(n, e));
+    var o = M(p(n, e));
     return (o[1] + o[2]) / 2;
   });
 }
 function oe(n) {
-  var r = B(n), t = Z(Ht(n, r), Jt(n, r)), e = {}, o;
+  var r = B(n), t = Z(Jt(n, r), Ht(n, r)), e = {}, o;
   f(["u", "d"], function(i) {
     o = i === "u" ? r : k(r).reverse(), f(["l", "r"], function(u) {
       u === "r" && (o = p(o, function(h) {
         return k(h).reverse();
       }));
-      var d = (i === "u" ? n.predecessors : n.successors).bind(n), c = Ut(n, o, t, d), s = Wt(n, o, c.root, c.align, u === "r");
+      var d = (i === "u" ? n.predecessors : n.successors).bind(n), c = Ut(n, o, t, d), s = Xt(n, o, c.root, c.align, u === "r");
       u === "r" && (s = G(s, function(h) {
         return -h;
       })), e[i + u] = s;
@@ -1258,7 +1258,7 @@ function Se(n, r) {
   });
 }
 function ce(n, r) {
-  r("    makeSpaceForEdgeLabels", () => ye(n)), r("    removeSelfEdges", () => je(n)), r("    acyclic", () => Ur(n)), r("    nestingGraph.run", () => Nt(n)), r("    rank", () => kt(In(n))), r("    injectEdgeLabelProxies", () => xe(n)), r("    removeEmptyRanks", () => et(n)), r("    nestingGraph.cleanup", () => Pt(n)), r("    normalizeRanks", () => tt(n)), r("    assignRankMinMax", () => ke(n)), r("    removeEdgeLabelProxies", () => Ee(n)), r("    normalize.run", () => st(n)), r("    parentDummyChains", () => Dt(n)), r("    addBorderSegments", () => at(n)), r("    order", () => Yt(n)), r("    insertSelfEdges", () => Re(n)), r("    adjustCoordinateSystem", () => ut(n)), r("    position", () => ue(n)), r("    positionSelfEdges", () => Te(n)), r("    removeBorderNodes", () => Pe(n)), r("    normalize.undo", () => vt(n)), r("    fixupEdgeLabelCoords", () => _e(n)), r("    undoCoordinateSystem", () => dt(n)), r("    translateGraph", () => Oe(n)), r("    assignNodeIntersects", () => Ne(n)), r("    reversePoints", () => Ie(n)), r("    acyclic.undo", () => nt(n));
+  r("    makeSpaceForEdgeLabels", () => ye(n)), r("    removeSelfEdges", () => je(n)), r("    acyclic", () => Ur(n)), r("    nestingGraph.run", () => Nt(n)), r("    rank", () => kt(In(n))), r("    injectEdgeLabelProxies", () => xe(n)), r("    removeEmptyRanks", () => et(n)), r("    nestingGraph.cleanup", () => Pt(n)), r("    normalizeRanks", () => tt(n)), r("    assignRankMinMax", () => ke(n)), r("    removeEdgeLabelProxies", () => Ee(n)), r("    normalize.run", () => st(n)), r("    parentDummyChains", () => Dt(n)), r("    addBorderSegments", () => at(n)), r("    order", () => At(n)), r("    insertSelfEdges", () => Re(n)), r("    adjustCoordinateSystem", () => ut(n)), r("    position", () => ue(n)), r("    positionSelfEdges", () => Me(n)), r("    removeBorderNodes", () => Pe(n)), r("    normalize.undo", () => vt(n)), r("    fixupEdgeLabelCoords", () => _e(n)), r("    undoCoordinateSystem", () => dt(n)), r("    translateGraph", () => Oe(n)), r("    assignNodeIntersects", () => Ne(n)), r("    reversePoints", () => Ie(n)), r("    acyclic.undo", () => nt(n));
 }
 function fe(n, r) {
   f(n.nodes(), function(t) {
@@ -1371,7 +1371,7 @@ function Ie(n) {
 function Pe(n) {
   f(n.nodes(), function(r) {
     if (n.children(r).length) {
-      var t = n.node(r), e = n.node(t.borderTop), o = n.node(t.borderBottom), a = n.node(C(t.borderLeft)), i = n.node(C(t.borderRight));
+      var t = n.node(r), e = n.node(t.borderTop), o = n.node(t.borderBottom), a = n.node($(t.borderLeft)), i = n.node($(t.borderRight));
       t.width = Math.abs(i.x - a.x), t.height = Math.abs(o.y - e.y), t.x = a.x + t.width / 2, t.y = e.y + t.height / 2;
     }
   }), f(n.nodes(), function(r) {
@@ -1410,7 +1410,7 @@ function Re(n) {
     });
   });
 }
-function Te(n) {
+function Me(n) {
   f(n.nodes(), function(r) {
     var t = n.node(r);
     if (t.dummy === "selfedge") {