@orangelogic/design-system 2.162.0 → 2.164.0

package/library/chunks/layout.DZcMFKol.js

@@ -0,0 +1,1446 @@
+import { c as Ee, G as g, f as c, i as b, a as C, v as E, r as V } from "./graph.XHMI5hta.js";
+import { i as U } from "./isSymbol.L0C2ND_U.js";
+import { b as R, d as We, i as K, a as Xe } from "./_baseIteratee.sC2wLi2m.js";
+import { b as Ue, m as w } from "./map.DJnohTgl.js";
+import { u as Q, p as F, c as He } from "./cloneDeep.B-5z5SI3.js";
+import { i as Oe, l as ze, v as ee, d as Je, e as Ze, a as S, f as se, q as Ke, r as Qe, k as en, b as nn } from "./watch.DJF5K-8U.js";
+import { a as ne } from "./isObjectLike.z36Fu426.js";
+import { t as rn } from "./toNumber.MuDz8DgU.js";
+import { i as tn, a as I, l as A } from "./_flatRest.D3ZVApI5.js";
+import { a as re, i as an, b as on, c as un } from "./isArrayLikeObject.D7afXo-f.js";
+import { c as dn } from "./_baseUniq.lwMgmtt2.js";
+import { k as j, c as ke, d as fn, e as sn, f as cn, h as ln, i as hn, a as vn } from "./_baseClone.BHNjfIdS.js";
+import { a as Y } from "./toString.B1zKIiZc.js";
+import { a as Ne, c as Le } from "./_baseEach.DQk0As2f.js";
+var ce = 1 / 0, pn = 17976931348623157e292;
+function T(e) {
+  if (!e)
+    return e === 0 ? e : 0;
+  if (e = rn(e), e === ce || e === -ce) {
+    var n = e < 0 ? -1 : 1;
+    return n * pn;
+  }
+  return e === e ? e : 0;
+}
+function wn(e) {
+  var n = T(e), r = n % 1;
+  return n === n ? r ? n - r : n : 0;
+}
+function L(e, n, r) {
+  if (!ne(r))
+    return !1;
+  var t = typeof n;
+  return (t == "number" ? Oe(r) && ze(n, r.length) : t == "string" && n in r) ? ee(r[n], e) : !1;
+}
+function mn(e) {
+  return re(function(n, r) {
+    var t = -1, i = r.length, o = i > 1 ? r[i - 1] : void 0, a = i > 2 ? r[2] : void 0;
+    for (o = e.length > 3 && typeof o == "function" ? (i--, o) : void 0, a && L(r[0], r[1], a) && (o = i < 3 ? void 0 : o, i = 1), n = Object(n); ++t < i; ) {
+      var u = r[t];
+      u && e(n, u, t, o);
+    }
+    return n;
+  });
+}
+var Pe = Object.prototype, bn = Pe.hasOwnProperty, gn = re(function(e, n) {
+  e = Object(e);
+  var r = -1, t = n.length, i = t > 2 ? n[2] : void 0;
+  for (i && L(n[0], n[1], i) && (t = 1); ++r < t; )
+    for (var o = n[r], a = j(o), u = -1, d = a.length; ++u < d; ) {
+      var f = a[u], s = e[f];
+      (s === void 0 || ee(s, Pe[f]) && !bn.call(e, f)) && (e[f] = o[f]);
+    }
+  return e;
+});
+function H(e, n, r) {
+  (r !== void 0 && !ee(e[n], r) || r === void 0 && !(n in e)) && ke(e, n, r);
+}
+function z(e, n) {
+  if (!(n === "constructor" && typeof e[n] == "function") && n != "__proto__")
+    return e[n];
+}
+function yn(e) {
+  return fn(e, j(e));
+}
+function xn(e, n, r, t, i, o, a) {
+  var u = z(e, r), d = z(n, r), f = a.get(d);
+  if (f) {
+    H(e, r, f);
+    return;
+  }
+  var s = o ? o(u, d, r + "", e, n, a) : void 0, l = s === void 0;
+  if (l) {
+    var h = S(d), v = !h && Je(d), p = !h && !v && Ze(d);
+    s = d, h || v || p ? S(u) ? s = u : an(u) ? s = sn(u) : v ? (l = !1, s = cn(d, !0)) : p ? (l = !1, s = ln(d, !0)) : s = [] : tn(d) || se(d) ? (s = u, se(u) ? s = yn(u) : (!ne(u) || Ke(u)) && (s = hn(d))) : l = !1;
+  }
+  l && (a.set(d, s), i(s, d, t, o, a), a.delete(d)), H(e, r, s);
+}
+function _e(e, n, r, t, i) {
+  e !== n && Ne(n, function(o, a) {
+    if (i || (i = new Qe()), ne(o))
+      xn(e, n, a, r, _e, t, i);
+    else {
+      var u = t ? t(z(e, a), o, a + "", e, n, i) : void 0;
+      u === void 0 && (u = o), H(e, a, u);
+    }
+  }, j);
+}
+function En(e) {
+  return function(n, r, t) {
+    var i = Object(n);
+    if (!Oe(n)) {
+      var o = R(r);
+      n = en(n), r = function(u) {
+        return o(i[u], u, i);
+      };
+    }
+    var a = e(n, r, t);
+    return a > -1 ? i[o ? n[a] : a] : void 0;
+  };
+}
+var On = Math.max;
+function kn(e, n, r) {
+  var t = e == null ? 0 : e.length;
+  if (!t)
+    return -1;
+  var i = r == null ? 0 : wn(r);
+  return i < 0 && (i = On(t + i, 0)), dn(e, R(n), i);
+}
+var te = En(kn);
+function Nn(e, n) {
+  return e == null ? e : Ne(e, Ee(n), j);
+}
+function Ln(e, n) {
+  return e && Le(e, Ee(n));
+}
+function Pn(e, n) {
+  return e > n;
+}
+var _n = Object.prototype, Cn = _n.hasOwnProperty;
+function Rn(e, n) {
+  return e != null && Cn.call(e, n);
+}
+function Ce(e, n) {
+  return e != null && We(e, n, Rn);
+}
+function Re(e, n) {
+  return e < n;
+}
+function B(e, n) {
+  var r = {};
+  return n = R(n), Le(e, function(t, i, o) {
+    ke(r, i, n(t, i, o));
+  }), r;
+}
+function ie(e, n, r) {
+  for (var t = -1, i = e.length; ++t < i; ) {
+    var o = e[t], a = n(o);
+    if (a != null && (u === void 0 ? a === a && !U(a) : r(a, u)))
+      var u = a, d = o;
+  }
+  return d;
+}
+function y(e) {
+  return e && e.length ? ie(e, K, Pn) : void 0;
+}
+var J = mn(function(e, n, r) {
+  _e(e, n, r);
+});
+function P(e) {
+  return e && e.length ? ie(e, K, Re) : void 0;
+}
+function ae(e, n) {
+  return e && e.length ? ie(e, R(n), Re) : void 0;
+}
+function In(e, n) {
+  var r = e.length;
+  for (e.sort(n); r--; )
+    e[r] = e[r].value;
+  return e;
+}
+function Mn(e, n) {
+  if (e !== n) {
+    var r = e !== void 0, t = e === null, i = e === e, o = U(e), a = n !== void 0, u = n === null, d = n === n, f = U(n);
+    if (!u && !f && !o && e > n || o && a && d && !u && !f || t && a && d || !r && d || !i)
+      return 1;
+    if (!t && !o && !f && e < n || f && r && i && !t && !o || u && r && i || !a && i || !d)
+      return -1;
+  }
+  return 0;
+}
+function Tn(e, n, r) {
+  for (var t = -1, i = e.criteria, o = n.criteria, a = i.length, u = r.length; ++t < a; ) {
+    var d = Mn(i[t], o[t]);
+    if (d) {
+      if (t >= u)
+        return d;
+      var f = r[t];
+      return d * (f == "desc" ? -1 : 1);
+    }
+  }
+  return e.index - n.index;
+}
+function Fn(e, n, r) {
+  n.length ? n = Y(n, function(o) {
+    return S(o) ? function(a) {
+      return Xe(a, o.length === 1 ? o[0] : o);
+    } : o;
+  }) : n = [K];
+  var t = -1;
+  n = Y(n, nn(R));
+  var i = Ue(e, function(o, a, u) {
+    var d = Y(n, function(f) {
+      return f(o);
+    });
+    return { criteria: d, index: ++t, value: o };
+  });
+  return In(i, function(o, a) {
+    return Tn(o, a, r);
+  });
+}
+var Sn = Math.ceil, An = Math.max;
+function Vn(e, n, r, t) {
+  for (var i = -1, o = An(Sn((n - e) / (r || 1)), 0), a = Array(o); o--; )
+    a[++i] = e, e += r;
+  return a;
+}
+function jn(e) {
+  return function(n, r, t) {
+    return t && typeof t != "number" && L(n, r, t) && (r = t = void 0), n = T(n), r === void 0 ? (r = n, n = 0) : r = T(r), t = t === void 0 ? n < r ? 1 : -1 : T(t), Vn(n, r, t);
+  };
+}
+var O = jn(), M = re(function(e, n) {
+  if (e == null)
+    return [];
+  var r = n.length;
+  return r > 1 && L(e, n[0], n[1]) ? n = [] : r > 2 && L(n[0], n[1], n[2]) && (n = [n[0]]), Fn(e, on(n), []);
+});
+function Bn(e, n, r) {
+  for (var t = -1, i = e.length, o = n.length, a = {}; ++t < i; ) {
+    var u = t < o ? n[t] : void 0;
+    r(a, e[t], u);
+  }
+  return a;
+}
+function Gn(e, n) {
+  return Bn(e || [], n || [], vn);
+}
+class Yn {
+  constructor() {
+    var n = {};
+    n._next = n._prev = n, this._sentinel = n;
+  }
+  dequeue() {
+    var n = this._sentinel, r = n._prev;
+    if (r !== n)
+      return le(r), r;
+  }
+  enqueue(n) {
+    var r = this._sentinel;
+    n._prev && n._next && le(n), n._next = r._next, r._next._prev = n, r._next = n, n._prev = r;
+  }
+  toString() {
+    for (var n = [], r = this._sentinel, t = r._prev; t !== r; )
+      n.push(JSON.stringify(t, Dn)), t = t._prev;
+    return "[" + n.join(", ") + "]";
+  }
+}
+function le(e) {
+  e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
+}
+function Dn(e, n) {
+  if (e !== "_next" && e !== "_prev")
+    return n;
+}
+var $n = un(1);
+function qn(e, n) {
+  if (e.nodeCount() <= 1)
+    return [];
+  var r = Xn(e, n || $n), t = Wn(r.graph, r.buckets, r.zeroIdx);
+  return I(
+    w(t, function(i) {
+      return e.outEdges(i.v, i.w);
+    })
+  );
+}
+function Wn(e, n, r) {
+  for (var t = [], i = n[n.length - 1], o = n[0], a; e.nodeCount(); ) {
+    for (; a = o.dequeue(); )
+      D(e, n, r, a);
+    for (; a = i.dequeue(); )
+      D(e, n, r, a);
+    if (e.nodeCount()) {
+      for (var u = n.length - 2; u > 0; --u)
+        if (a = n[u].dequeue(), a) {
+          t = t.concat(D(e, n, r, a, !0));
+          break;
+        }
+    }
+  }
+  return t;
+}
+function D(e, n, r, t, i) {
+  var o = i ? [] : void 0;
+  return c(e.inEdges(t.v), function(a) {
+    var u = e.edge(a), d = e.node(a.v);
+    i && o.push({ v: a.v, w: a.w }), d.out -= u, Z(n, r, d);
+  }), c(e.outEdges(t.v), function(a) {
+    var u = e.edge(a), d = a.w, f = e.node(d);
+    f.in -= u, Z(n, r, f);
+  }), e.removeNode(t.v), o;
+}
+function Xn(e, n) {
+  var r = new g(), t = 0, i = 0;
+  c(e.nodes(), function(u) {
+    r.setNode(u, { v: u, in: 0, out: 0 });
+  }), c(e.edges(), function(u) {
+    var d = r.edge(u.v, u.w) || 0, f = n(u), s = d + f;
+    r.setEdge(u.v, u.w, s), i = Math.max(i, r.node(u.v).out += f), t = Math.max(t, r.node(u.w).in += f);
+  });
+  var o = O(i + t + 3).map(function() {
+    return new Yn();
+  }), a = t + 1;
+  return c(r.nodes(), function(u) {
+    Z(o, a, r.node(u));
+  }), { graph: r, buckets: o, zeroIdx: a };
+}
+function Z(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 Un(e) {
+  var n = e.graph().acyclicer === "greedy" ? qn(e, r(e)) : Hn(e);
+  c(n, function(t) {
+    var i = e.edge(t);
+    e.removeEdge(t), i.forwardName = t.name, i.reversed = !0, e.setEdge(t.w, t.v, i, Q("rev"));
+  });
+  function r(t) {
+    return function(i) {
+      return t.edge(i).weight;
+    };
+  }
+}
+function Hn(e) {
+  var n = [], r = {}, t = {};
+  function i(o) {
+    Object.prototype.hasOwnProperty.call(t, o) || (t[o] = !0, r[o] = !0, c(e.outEdges(o), function(a) {
+      Object.prototype.hasOwnProperty.call(r, a.w) ? n.push(a) : i(a.w);
+    }), delete r[o]);
+  }
+  return c(e.nodes(), i), n;
+}
+function zn(e) {
+  c(e.edges(), function(n) {
+    var r = e.edge(n);
+    if (r.reversed) {
+      e.removeEdge(n);
+      var t = r.forwardName;
+      delete r.reversed, delete r.forwardName, e.setEdge(n.w, n.v, r, t);
+    }
+  });
+}
+function k(e, n, r, t) {
+  var i;
+  do
+    i = Q(t);
+  while (e.hasNode(i));
+  return r.dummy = n, e.setNode(i, r), i;
+}
+function Jn(e) {
+  var n = new g().setGraph(e.graph());
+  return c(e.nodes(), function(r) {
+    n.setNode(r, e.node(r));
+  }), c(e.edges(), function(r) {
+    var t = n.edge(r.v, r.w) || { weight: 0, minlen: 1 }, i = e.edge(r);
+    n.setEdge(r.v, r.w, {
+      weight: t.weight + i.weight,
+      minlen: Math.max(t.minlen, i.minlen)
+    });
+  }), n;
+}
+function Ie(e) {
+  var n = new g({ multigraph: e.isMultigraph() }).setGraph(e.graph());
+  return c(e.nodes(), function(r) {
+    e.children(r).length || n.setNode(r, e.node(r));
+  }), c(e.edges(), function(r) {
+    n.setEdge(r, e.edge(r));
+  }), n;
+}
+function he(e, n) {
+  var r = e.x, t = e.y, i = n.x - r, o = n.y - t, a = e.width / 2, u = e.height / 2;
+  if (!i && !o)
+    throw new Error("Not possible to find intersection inside of the rectangle");
+  var d, f;
+  return Math.abs(o) * a > Math.abs(i) * u ? (o < 0 && (u = -u), d = u * i / o, f = u) : (i < 0 && (a = -a), d = a, f = a * o / i), { x: r + d, y: t + f };
+}
+function G(e) {
+  var n = w(O(Me(e) + 1), function() {
+    return [];
+  });
+  return c(e.nodes(), function(r) {
+    var t = e.node(r), i = t.rank;
+    b(i) || (n[i][t.order] = r);
+  }), n;
+}
+function Zn(e) {
+  var n = P(
+    w(e.nodes(), function(r) {
+      return e.node(r).rank;
+    })
+  );
+  c(e.nodes(), function(r) {
+    var t = e.node(r);
+    Ce(t, "rank") && (t.rank -= n);
+  });
+}
+function Kn(e) {
+  var n = P(
+    w(e.nodes(), function(o) {
+      return e.node(o).rank;
+    })
+  ), r = [];
+  c(e.nodes(), function(o) {
+    var a = e.node(o).rank - n;
+    r[a] || (r[a] = []), r[a].push(o);
+  });
+  var t = 0, i = e.graph().nodeRankFactor;
+  c(r, function(o, a) {
+    b(o) && a % i !== 0 ? --t : t && c(o, function(u) {
+      e.node(u).rank += t;
+    });
+  });
+}
+function ve(e, n, r, t) {
+  var i = {
+    width: 0,
+    height: 0
+  };
+  return arguments.length >= 4 && (i.rank = r, i.order = t), k(e, "border", i, n);
+}
+function Me(e) {
+  return y(
+    w(e.nodes(), function(n) {
+      var r = e.node(n).rank;
+      if (!b(r))
+        return r;
+    })
+  );
+}
+function Qn(e, n) {
+  var r = { lhs: [], rhs: [] };
+  return c(e, function(t) {
+    n(t) ? r.lhs.push(t) : r.rhs.push(t);
+  }), r;
+}
+function er(e, n) {
+  return n();
+}
+function nr(e) {
+  function n(r) {
+    var t = e.children(r), i = e.node(r);
+    if (t.length && c(t, n), Object.prototype.hasOwnProperty.call(i, "minRank")) {
+      i.borderLeft = [], i.borderRight = [];
+      for (var o = i.minRank, a = i.maxRank + 1; o < a; ++o)
+        pe(e, "borderLeft", "_bl", r, i, o), pe(e, "borderRight", "_br", r, i, o);
+    }
+  }
+  c(e.children(), n);
+}
+function pe(e, n, r, t, i, o) {
+  var a = { width: 0, height: 0, rank: o, borderType: n }, u = i[n][o - 1], d = k(e, "border", a, r);
+  i[n][o] = d, e.setParent(d, t), u && e.setEdge(u, d, { weight: 1 });
+}
+function rr(e) {
+  var n = e.graph().rankdir.toLowerCase();
+  (n === "lr" || n === "rl") && Te(e);
+}
+function tr(e) {
+  var n = e.graph().rankdir.toLowerCase();
+  (n === "bt" || n === "rl") && ir(e), (n === "lr" || n === "rl") && (ar(e), Te(e));
+}
+function Te(e) {
+  c(e.nodes(), function(n) {
+    we(e.node(n));
+  }), c(e.edges(), function(n) {
+    we(e.edge(n));
+  });
+}
+function we(e) {
+  var n = e.width;
+  e.width = e.height, e.height = n;
+}
+function ir(e) {
+  c(e.nodes(), function(n) {
+    $(e.node(n));
+  }), c(e.edges(), function(n) {
+    var r = e.edge(n);
+    c(r.points, $), Object.prototype.hasOwnProperty.call(r, "y") && $(r);
+  });
+}
+function $(e) {
+  e.y = -e.y;
+}
+function ar(e) {
+  c(e.nodes(), function(n) {
+    q(e.node(n));
+  }), c(e.edges(), function(n) {
+    var r = e.edge(n);
+    c(r.points, q), Object.prototype.hasOwnProperty.call(r, "x") && q(r);
+  });
+}
+function q(e) {
+  var n = e.x;
+  e.x = e.y, e.y = n;
+}
+function or(e) {
+  e.graph().dummyChains = [], c(e.edges(), function(n) {
+    ur(e, n);
+  });
+}
+function ur(e, n) {
+  var r = n.v, t = e.node(r).rank, i = n.w, o = e.node(i).rank, a = n.name, u = e.edge(n), d = u.labelRank;
+  if (o !== t + 1) {
+    e.removeEdge(n);
+    var f = void 0, s, l;
+    for (l = 0, ++t; t < o; ++l, ++t)
+      u.points = [], f = {
+        width: 0,
+        height: 0,
+        edgeLabel: u,
+        edgeObj: n,
+        rank: t
+      }, s = k(e, "edge", f, "_d"), t === d && (f.width = u.width, f.height = u.height, f.dummy = "edge-label", f.labelpos = u.labelpos), e.setEdge(r, s, { weight: u.weight }, a), l === 0 && e.graph().dummyChains.push(s), r = s;
+    e.setEdge(r, i, { weight: u.weight }, a);
+  }
+}
+function dr(e) {
+  c(e.graph().dummyChains, function(n) {
+    var r = e.node(n), t = r.edgeLabel, i;
+    for (e.setEdge(r.edgeObj, t); r.dummy; )
+      i = e.successors(n)[0], e.removeNode(n), t.points.push({ x: r.x, y: r.y }), r.dummy === "edge-label" && (t.x = r.x, t.y = r.y, t.width = r.width, t.height = r.height), n = i, r = e.node(n);
+  });
+}
+function oe(e) {
+  var n = {};
+  function r(t) {
+    var i = e.node(t);
+    if (Object.prototype.hasOwnProperty.call(n, t))
+      return i.rank;
+    n[t] = !0;
+    var o = P(
+      w(e.outEdges(t), function(a) {
+        return r(a.w) - e.edge(a).minlen;
+      })
+    );
+    return (o === Number.POSITIVE_INFINITY || // return value of _.map([]) for Lodash 3
+    o === void 0 || // return value of _.map([]) for Lodash 4
+    o === null) && (o = 0), i.rank = o;
+  }
+  c(e.sources(), r);
+}
+function _(e, n) {
+  return e.node(n.w).rank - e.node(n.v).rank - e.edge(n).minlen;
+}
+function Fe(e) {
+  var n = new g({ directed: !1 }), r = e.nodes()[0], t = e.nodeCount();
+  n.setNode(r, {});
+  for (var i, o; fr(n, e) < t; )
+    i = sr(n, e), o = n.hasNode(i.v) ? _(e, i) : -_(e, i), cr(n, e, o);
+  return n;
+}
+function fr(e, n) {
+  function r(t) {
+    c(n.nodeEdges(t), function(i) {
+      var o = i.v, a = t === o ? i.w : o;
+      !e.hasNode(a) && !_(n, i) && (e.setNode(a, {}), e.setEdge(t, a, {}), r(a));
+    });
+  }
+  return c(e.nodes(), r), e.nodeCount();
+}
+function sr(e, n) {
+  return ae(n.edges(), function(r) {
+    if (e.hasNode(r.v) !== e.hasNode(r.w))
+      return _(n, r);
+  });
+}
+function cr(e, n, r) {
+  c(e.nodes(), function(t) {
+    n.node(t).rank += r;
+  });
+}
+function lr() {
+}
+lr.prototype = new Error();
+function Se(e, n, r) {
+  S(n) || (n = [n]);
+  var t = (e.isDirected() ? e.successors : e.neighbors).bind(e), i = [], o = {};
+  return c(n, function(a) {
+    if (!e.hasNode(a))
+      throw new Error("Graph does not have node: " + a);
+    Ae(e, a, r === "post", o, t, i);
+  }), i;
+}
+function Ae(e, n, r, t, i, o) {
+  Object.prototype.hasOwnProperty.call(t, n) || (t[n] = !0, r || o.push(n), c(i(n), function(a) {
+    Ae(e, a, r, t, i, o);
+  }), r && o.push(n));
+}
+function hr(e, n) {
+  return Se(e, n, "post");
+}
+function vr(e, n) {
+  return Se(e, n, "pre");
+}
+x.initLowLimValues = de;
+x.initCutValues = ue;
+x.calcCutValue = Ve;
+x.leaveEdge = Be;
+x.enterEdge = Ge;
+x.exchangeEdges = Ye;
+function x(e) {
+  e = Jn(e), oe(e);
+  var n = Fe(e);
+  de(n), ue(n, e);
+  for (var r, t; r = Be(n); )
+    t = Ge(n, e, r), Ye(n, e, r, t);
+}
+function ue(e, n) {
+  var r = hr(e, e.nodes());
+  r = r.slice(0, r.length - 1), c(r, function(t) {
+    pr(e, n, t);
+  });
+}
+function pr(e, n, r) {
+  var t = e.node(r), i = t.parent;
+  e.edge(r, i).cutvalue = Ve(e, n, r);
+}
+function Ve(e, n, r) {
+  var t = e.node(r), i = t.parent, o = !0, a = n.edge(r, i), u = 0;
+  return a || (o = !1, a = n.edge(i, r)), u = a.weight, c(n.nodeEdges(r), function(d) {
+    var f = d.v === r, s = f ? d.w : d.v;
+    if (s !== i) {
+      var l = f === o, h = n.edge(d).weight;
+      if (u += l ? h : -h, mr(e, r, s)) {
+        var v = e.edge(r, s).cutvalue;
+        u += l ? -v : v;
+      }
+    }
+  }), u;
+}
+function de(e, n) {
+  arguments.length < 2 && (n = e.nodes()[0]), je(e, {}, 1, n);
+}
+function je(e, n, r, t, i) {
+  var o = r, a = e.node(t);
+  return n[t] = !0, c(e.neighbors(t), function(u) {
+    Object.prototype.hasOwnProperty.call(n, u) || (r = je(e, n, r, u, t));
+  }), a.low = o, a.lim = r++, i ? a.parent = i : delete a.parent, r;
+}
+function Be(e) {
+  return te(e.edges(), function(n) {
+    return e.edge(n).cutvalue < 0;
+  });
+}
+function Ge(e, n, r) {
+  var t = r.v, i = r.w;
+  n.hasEdge(t, i) || (t = r.w, i = r.v);
+  var o = e.node(t), a = e.node(i), u = o, d = !1;
+  o.lim > a.lim && (u = a, d = !0);
+  var f = C(n.edges(), function(s) {
+    return d === me(e, e.node(s.v), u) && d !== me(e, e.node(s.w), u);
+  });
+  return ae(f, function(s) {
+    return _(n, s);
+  });
+}
+function Ye(e, n, r, t) {
+  var i = r.v, o = r.w;
+  e.removeEdge(i, o), e.setEdge(t.v, t.w, {}), de(e), ue(e, n), wr(e, n);
+}
+function wr(e, n) {
+  var r = te(e.nodes(), function(i) {
+    return !n.node(i).parent;
+  }), t = vr(e, r);
+  t = t.slice(1), c(t, function(i) {
+    var o = e.node(i).parent, a = n.edge(i, o), u = !1;
+    a || (a = n.edge(o, i), u = !0), n.node(i).rank = n.node(o).rank + (u ? a.minlen : -a.minlen);
+  });
+}
+function mr(e, n, r) {
+  return e.hasEdge(n, r);
+}
+function me(e, n, r) {
+  return r.low <= n.lim && n.lim <= r.lim;
+}
+function br(e) {
+  switch (e.graph().ranker) {
+    case "network-simplex":
+      be(e);
+      break;
+    case "tight-tree":
+      yr(e);
+      break;
+    case "longest-path":
+      gr(e);
+      break;
+    default:
+      be(e);
+  }
+}
+var gr = oe;
+function yr(e) {
+  oe(e), Fe(e);
+}
+function be(e) {
+  x(e);
+}
+function xr(e) {
+  var n = k(e, "root", {}, "_root"), r = Er(e), t = y(E(r)) - 1, i = 2 * t + 1;
+  e.graph().nestingRoot = n, c(e.edges(), function(a) {
+    e.edge(a).minlen *= i;
+  });
+  var o = Or(e) + 1;
+  c(e.children(), function(a) {
+    De(e, n, i, o, t, r, a);
+  }), e.graph().nodeRankFactor = i;
+}
+function De(e, n, r, t, i, o, a) {
+  var u = e.children(a);
+  if (!u.length) {
+    a !== n && e.setEdge(n, a, { weight: 0, minlen: r });
+    return;
+  }
+  var d = ve(e, "_bt"), f = ve(e, "_bb"), s = e.node(a);
+  e.setParent(d, a), s.borderTop = d, e.setParent(f, a), s.borderBottom = f, c(u, function(l) {
+    De(e, n, r, t, i, o, l);
+    var h = e.node(l), v = h.borderTop ? h.borderTop : l, p = h.borderBottom ? h.borderBottom : l, m = h.borderTop ? t : 2 * t, N = v !== p ? 1 : i - o[a] + 1;
+    e.setEdge(d, v, {
+      weight: m,
+      minlen: N,
+      nestingEdge: !0
+    }), e.setEdge(p, f, {
+      weight: m,
+      minlen: N,
+      nestingEdge: !0
+    });
+  }), e.parent(a) || e.setEdge(n, d, { weight: 0, minlen: i + o[a] });
+}
+function Er(e) {
+  var n = {};
+  function r(t, i) {
+    var o = e.children(t);
+    o && o.length && c(o, function(a) {
+      r(a, i + 1);
+    }), n[t] = i;
+  }
+  return c(e.children(), function(t) {
+    r(t, 1);
+  }), n;
+}
+function Or(e) {
+  return V(
+    e.edges(),
+    function(n, r) {
+      return n + e.edge(r).weight;
+    },
+    0
+  );
+}
+function kr(e) {
+  var n = e.graph();
+  e.removeNode(n.nestingRoot), delete n.nestingRoot, c(e.edges(), function(r) {
+    var t = e.edge(r);
+    t.nestingEdge && e.removeEdge(r);
+  });
+}
+function Nr(e, n, r) {
+  var t = {}, i;
+  c(r, function(o) {
+    for (var a = e.parent(o), u, d; a; ) {
+      if (u = e.parent(a), u ? (d = t[u], t[u] = a) : (d = i, i = a), d && d !== a) {
+        n.setEdge(d, a);
+        return;
+      }
+      a = u;
+    }
+  });
+}
+function Lr(e, n, r) {
+  var t = Pr(e), i = new g({ compound: !0 }).setGraph({ root: t }).setDefaultNodeLabel(function(o) {
+    return e.node(o);
+  });
+  return c(e.nodes(), function(o) {
+    var a = e.node(o), u = e.parent(o);
+    (a.rank === n || a.minRank <= n && n <= a.maxRank) && (i.setNode(o), i.setParent(o, u || t), c(e[r](o), function(d) {
+      var f = d.v === o ? d.w : d.v, s = i.edge(f, o), l = b(s) ? 0 : s.weight;
+      i.setEdge(f, o, { weight: e.edge(d).weight + l });
+    }), Object.prototype.hasOwnProperty.call(a, "minRank") && i.setNode(o, {
+      borderLeft: a.borderLeft[n],
+      borderRight: a.borderRight[n]
+    }));
+  }), i;
+}
+function Pr(e) {
+  for (var n; e.hasNode(n = Q("_root")); ) ;
+  return n;
+}
+function _r(e, n) {
+  for (var r = 0, t = 1; t < n.length; ++t)
+    r += Cr(e, n[t - 1], n[t]);
+  return r;
+}
+function Cr(e, n, r) {
+  for (var t = Gn(
+    r,
+    w(r, function(f, s) {
+      return s;
+    })
+  ), i = I(
+    w(n, function(f) {
+      return M(
+        w(e.outEdges(f), function(s) {
+          return { pos: t[s.w], weight: e.edge(s).weight };
+        }),
+        "pos"
+      );
+    })
+  ), o = 1; o < r.length; ) o <<= 1;
+  var a = 2 * o - 1;
+  o -= 1;
+  var u = w(new Array(a), function() {
+    return 0;
+  }), d = 0;
+  return c(
+    // @ts-expect-error
+    i.forEach(function(f) {
+      var s = f.pos + o;
+      u[s] += f.weight;
+      for (var l = 0; s > 0; )
+        s % 2 && (l += u[s + 1]), s = s - 1 >> 1, u[s] += f.weight;
+      d += f.weight * l;
+    })
+  ), d;
+}
+function Rr(e) {
+  var n = {}, r = C(e.nodes(), function(u) {
+    return !e.children(u).length;
+  }), t = y(
+    w(r, function(u) {
+      return e.node(u).rank;
+    })
+  ), i = w(O(t + 1), function() {
+    return [];
+  });
+  function o(u) {
+    if (!Ce(n, u)) {
+      n[u] = !0;
+      var d = e.node(u);
+      i[d.rank].push(u), c(e.successors(u), o);
+    }
+  }
+  var a = M(r, function(u) {
+    return e.node(u).rank;
+  });
+  return c(a, o), i;
+}
+function Ir(e, n) {
+  return w(n, function(r) {
+    var t = e.inEdges(r);
+    if (t.length) {
+      var i = V(
+        t,
+        function(o, a) {
+          var u = e.edge(a), d = e.node(a.v);
+          return {
+            sum: o.sum + u.weight * d.order,
+            weight: o.weight + u.weight
+          };
+        },
+        { sum: 0, weight: 0 }
+      );
+      return {
+        v: r,
+        barycenter: i.sum / i.weight,
+        weight: i.weight
+      };
+    } else
+      return { v: r };
+  });
+}
+function Mr(e, n) {
+  var r = {};
+  c(e, function(i, o) {
+    var a = r[i.v] = {
+      indegree: 0,
+      in: [],
+      out: [],
+      vs: [i.v],
+      i: o
+    };
+    b(i.barycenter) || (a.barycenter = i.barycenter, a.weight = i.weight);
+  }), c(n.edges(), function(i) {
+    var o = r[i.v], a = r[i.w];
+    !b(o) && !b(a) && (a.indegree++, o.out.push(r[i.w]));
+  });
+  var t = C(r, function(i) {
+    return !i.indegree;
+  });
+  return Tr(t);
+}
+function Tr(e) {
+  var n = [];
+  function r(o) {
+    return function(a) {
+      a.merged || (b(a.barycenter) || b(o.barycenter) || a.barycenter >= o.barycenter) && Fr(o, a);
+    };
+  }
+  function t(o) {
+    return function(a) {
+      a.in.push(o), --a.indegree === 0 && e.push(a);
+    };
+  }
+  for (; e.length; ) {
+    var i = e.pop();
+    n.push(i), c(i.in.reverse(), r(i)), c(i.out, t(i));
+  }
+  return w(
+    C(n, function(o) {
+      return !o.merged;
+    }),
+    function(o) {
+      return F(o, ["vs", "i", "barycenter", "weight"]);
+    }
+  );
+}
+function Fr(e, n) {
+  var r = 0, t = 0;
+  e.weight && (r += e.barycenter * e.weight, t += e.weight), n.weight && (r += n.barycenter * n.weight, t += n.weight), e.vs = n.vs.concat(e.vs), e.barycenter = r / t, e.weight = t, e.i = Math.min(n.i, e.i), n.merged = !0;
+}
+function Sr(e, n) {
+  var r = Qn(e, function(s) {
+    return Object.prototype.hasOwnProperty.call(s, "barycenter");
+  }), t = r.lhs, i = M(r.rhs, function(s) {
+    return -s.i;
+  }), o = [], a = 0, u = 0, d = 0;
+  t.sort(Ar(!!n)), d = ge(o, i, d), c(t, function(s) {
+    d += s.vs.length, o.push(s.vs), a += s.barycenter * s.weight, u += s.weight, d = ge(o, i, d);
+  });
+  var f = { vs: I(o) };
+  return u && (f.barycenter = a / u, f.weight = u), f;
+}
+function ge(e, n, r) {
+  for (var t; n.length && (t = A(n)).i <= r; )
+    n.pop(), e.push(t.vs), r++;
+  return r;
+}
+function Ar(e) {
+  return function(n, r) {
+    return n.barycenter < r.barycenter ? -1 : n.barycenter > r.barycenter ? 1 : e ? r.i - n.i : n.i - r.i;
+  };
+}
+function $e(e, n, r, t) {
+  var i = e.children(n), o = e.node(n), a = o ? o.borderLeft : void 0, u = o ? o.borderRight : void 0, d = {};
+  a && (i = C(i, function(p) {
+    return p !== a && p !== u;
+  }));
+  var f = Ir(e, i);
+  c(f, function(p) {
+    if (e.children(p.v).length) {
+      var m = $e(e, p.v, r, t);
+      d[p.v] = m, Object.prototype.hasOwnProperty.call(m, "barycenter") && jr(p, m);
+    }
+  });
+  var s = Mr(f, r);
+  Vr(s, d);
+  var l = Sr(s, t);
+  if (a && (l.vs = I([a, l.vs, u]), e.predecessors(a).length)) {
+    var h = e.node(e.predecessors(a)[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;
+  }
+  return l;
+}
+function Vr(e, n) {
+  c(e, function(r) {
+    r.vs = I(
+      r.vs.map(function(t) {
+        return n[t] ? n[t].vs : t;
+      })
+    );
+  });
+}
+function jr(e, n) {
+  b(e.barycenter) ? (e.barycenter = n.barycenter, e.weight = n.weight) : (e.barycenter = (e.barycenter * e.weight + n.barycenter * n.weight) / (e.weight + n.weight), e.weight += n.weight);
+}
+function Br(e) {
+  var n = Me(e), r = ye(e, O(1, n + 1), "inEdges"), t = ye(e, O(n - 1, -1, -1), "outEdges"), i = Rr(e);
+  xe(e, i);
+  for (var o = Number.POSITIVE_INFINITY, a, u = 0, d = 0; d < 4; ++u, ++d) {
+    Gr(u % 2 ? r : t, u % 4 >= 2), i = G(e);
+    var f = _r(e, i);
+    f < o && (d = 0, a = He(i), o = f);
+  }
+  xe(e, a);
+}
+function ye(e, n, r) {
+  return w(n, function(t) {
+    return Lr(e, t, r);
+  });
+}
+function Gr(e, n) {
+  var r = new g();
+  c(e, function(t) {
+    var i = t.graph().root, o = $e(t, i, r, n);
+    c(o.vs, function(a, u) {
+      t.node(a).order = u;
+    }), Nr(t, r, o.vs);
+  });
+}
+function xe(e, n) {
+  c(n, function(r) {
+    c(r, function(t, i) {
+      e.node(t).order = i;
+    });
+  });
+}
+function Yr(e) {
+  var n = $r(e);
+  c(e.graph().dummyChains, function(r) {
+    for (var t = e.node(r), i = t.edgeObj, o = Dr(e, n, i.v, i.w), a = o.path, u = o.lca, d = 0, f = a[d], s = !0; r !== i.w; ) {
+      if (t = e.node(r), s) {
+        for (; (f = a[d]) !== u && e.node(f).maxRank < t.rank; )
+          d++;
+        f === u && (s = !1);
+      }
+      if (!s) {
+        for (; d < a.length - 1 && e.node(f = a[d + 1]).minRank <= t.rank; )
+          d++;
+        f = a[d];
+      }
+      e.setParent(r, f), r = e.successors(r)[0];
+    }
+  });
+}
+function Dr(e, n, r, t) {
+  var i = [], o = [], a = Math.min(n[r].low, n[t].low), u = Math.max(n[r].lim, n[t].lim), d, f;
+  d = r;
+  do
+    d = e.parent(d), i.push(d);
+  while (d && (n[d].low > a || u > n[d].lim));
+  for (f = d, d = t; (d = e.parent(d)) !== f; )
+    o.push(d);
+  return { path: i.concat(o.reverse()), lca: f };
+}
+function $r(e) {
+  var n = {}, r = 0;
+  function t(i) {
+    var o = r;
+    c(e.children(i), t), n[i] = { low: o, lim: r++ };
+  }
+  return c(e.children(), t), n;
+}
+function qr(e, n) {
+  var r = {};
+  function t(i, o) {
+    var a = 0, u = 0, d = i.length, f = A(o);
+    return c(o, function(s, l) {
+      var h = Xr(e, s), v = h ? e.node(h).order : d;
+      (h || s === f) && (c(o.slice(u, l + 1), function(p) {
+        c(e.predecessors(p), function(m) {
+          var N = e.node(m), fe = N.order;
+          (fe < a || v < fe) && !(N.dummy && e.node(p).dummy) && qe(r, m, p);
+        });
+      }), u = l + 1, a = v);
+    }), o;
+  }
+  return V(n, t), r;
+}
+function Wr(e, n) {
+  var r = {};
+  function t(o, a, u, d, f) {
+    var s;
+    c(O(a, u), function(l) {
+      s = o[l], e.node(s).dummy && c(e.predecessors(s), function(h) {
+        var v = e.node(h);
+        v.dummy && (v.order < d || v.order > f) && qe(r, h, s);
+      });
+    });
+  }
+  function i(o, a) {
+    var u = -1, d, f = 0;
+    return c(a, function(s, l) {
+      if (e.node(s).dummy === "border") {
+        var h = e.predecessors(s);
+        h.length && (d = e.node(h[0]).order, t(a, f, l, u, d), f = l, u = d);
+      }
+      t(a, f, a.length, d, o.length);
+    }), a;
+  }
+  return V(n, i), r;
+}
+function Xr(e, n) {
+  if (e.node(n).dummy)
+    return te(e.predecessors(n), function(r) {
+      return e.node(r).dummy;
+    });
+}
+function qe(e, n, r) {
+  if (n > r) {
+    var t = n;
+    n = r, r = t;
+  }
+  Object.prototype.hasOwnProperty.call(e, n) || Object.defineProperty(e, n, {
+    enumerable: !0,
+    configurable: !0,
+    value: {},
+    writable: !0
+  });
+  var i = e[n];
+  Object.defineProperty(i, r, {
+    enumerable: !0,
+    configurable: !0,
+    value: !0,
+    writable: !0
+  });
+}
+function Ur(e, n, r) {
+  if (n > r) {
+    var t = n;
+    n = r, r = t;
+  }
+  return !!e[n] && Object.prototype.hasOwnProperty.call(e[n], r);
+}
+function Hr(e, n, r, t) {
+  var i = {}, o = {}, a = {};
+  return c(n, function(u) {
+    c(u, function(d, f) {
+      i[d] = d, o[d] = d, a[d] = f;
+    });
+  }), c(n, function(u) {
+    var d = -1;
+    c(u, function(f) {
+      var s = t(f);
+      if (s.length) {
+        s = M(s, function(m) {
+          return a[m];
+        });
+        for (var l = (s.length - 1) / 2, h = Math.floor(l), v = Math.ceil(l); h <= v; ++h) {
+          var p = s[h];
+          o[f] === f && d < a[p] && !Ur(r, f, p) && (o[p] = f, o[f] = i[f] = i[p], d = a[p]);
+        }
+      }
+    });
+  }), { root: i, align: o };
+}
+function zr(e, n, r, t, i) {
+  var o = {}, a = Jr(e, n, r, i), u = i ? "borderLeft" : "borderRight";
+  function d(l, h) {
+    for (var v = a.nodes(), p = v.pop(), m = {}; p; )
+      m[p] ? l(p) : (m[p] = !0, v.push(p), v = v.concat(h(p))), p = v.pop();
+  }
+  function f(l) {
+    o[l] = a.inEdges(l).reduce(function(h, v) {
+      return Math.max(h, o[v.v] + a.edge(v));
+    }, 0);
+  }
+  function s(l) {
+    var h = a.outEdges(l).reduce(function(p, m) {
+      return Math.min(p, o[m.w] - a.edge(m));
+    }, Number.POSITIVE_INFINITY), v = e.node(l);
+    h !== Number.POSITIVE_INFINITY && v.borderType !== u && (o[l] = Math.max(o[l], h));
+  }
+  return d(f, a.predecessors.bind(a)), d(s, a.successors.bind(a)), c(t, function(l) {
+    o[l] = o[r[l]];
+  }), o;
+}
+function Jr(e, n, r, t) {
+  var i = new g(), o = e.graph(), a = nt(o.nodesep, o.edgesep, t);
+  return c(n, function(u) {
+    var d;
+    c(u, function(f) {
+      var s = r[f];
+      if (i.setNode(s), d) {
+        var l = r[d], h = i.edge(l, s);
+        i.setEdge(l, s, Math.max(a(e, f, d), h || 0));
+      }
+      d = f;
+    });
+  }), i;
+}
+function Zr(e, n) {
+  return ae(E(n), function(r) {
+    var t = Number.NEGATIVE_INFINITY, i = Number.POSITIVE_INFINITY;
+    return Nn(r, function(o, a) {
+      var u = rt(e, a) / 2;
+      t = Math.max(o + u, t), i = Math.min(o - u, i);
+    }), t - i;
+  });
+}
+function Kr(e, n) {
+  var r = E(n), t = P(r), i = y(r);
+  c(["u", "d"], function(o) {
+    c(["l", "r"], function(a) {
+      var u = o + a, d = e[u], f;
+      if (d !== n) {
+        var s = E(d);
+        f = a === "l" ? t - P(s) : i - y(s), f && (e[u] = B(d, function(l) {
+          return l + f;
+        }));
+      }
+    });
+  });
+}
+function Qr(e, n) {
+  return B(e.ul, function(r, t) {
+    if (n)
+      return e[n.toLowerCase()][t];
+    var i = M(w(e, t));
+    return (i[1] + i[2]) / 2;
+  });
+}
+function et(e) {
+  var n = G(e), r = J(qr(e, n), Wr(e, n)), t = {}, i;
+  c(["u", "d"], function(a) {
+    i = a === "u" ? n : E(n).reverse(), c(["l", "r"], function(u) {
+      u === "r" && (i = w(i, function(l) {
+        return E(l).reverse();
+      }));
+      var d = (a === "u" ? e.predecessors : e.successors).bind(e), f = Hr(e, i, r, d), s = zr(e, i, f.root, f.align, u === "r");
+      u === "r" && (s = B(s, function(l) {
+        return -l;
+      })), t[a + u] = s;
+    });
+  });
+  var o = Zr(e, t);
+  return Kr(t, o), Qr(t, e.graph().align);
+}
+function nt(e, n, r) {
+  return function(t, i, o) {
+    var a = t.node(i), u = t.node(o), d = 0, f;
+    if (d += a.width / 2, Object.prototype.hasOwnProperty.call(a, "labelpos"))
+      switch (a.labelpos.toLowerCase()) {
+        case "l":
+          f = -a.width / 2;
+          break;
+        case "r":
+          f = a.width / 2;
+          break;
+      }
+    if (f && (d += r ? f : -f), f = 0, d += (a.dummy ? n : e) / 2, d += (u.dummy ? n : e) / 2, d += u.width / 2, Object.prototype.hasOwnProperty.call(u, "labelpos"))
+      switch (u.labelpos.toLowerCase()) {
+        case "l":
+          f = u.width / 2;
+          break;
+        case "r":
+          f = -u.width / 2;
+          break;
+      }
+    return f && (d += r ? f : -f), f = 0, d;
+  };
+}
+function rt(e, n) {
+  return e.node(n).width;
+}
+function tt(e) {
+  e = Ie(e), it(e), Ln(et(e), function(n, r) {
+    e.node(r).x = n;
+  });
+}
+function it(e) {
+  var n = G(e), r = e.graph().ranksep, t = 0;
+  c(n, function(i) {
+    var o = y(
+      w(i, function(a) {
+        return e.node(a).height;
+      })
+    );
+    c(i, function(a) {
+      e.node(a).y = t + o / 2;
+    }), t += o + r;
+  });
+}
+function Dt(e, n) {
+  var r = er;
+  r("layout", () => {
+    var t = r("  buildLayoutGraph", () => pt(e));
+    r("  runLayout", () => at(t, r)), r("  updateInputGraph", () => ot(e, t));
+  });
+}
+function at(e, n) {
+  n("    makeSpaceForEdgeLabels", () => wt(e)), n("    removeSelfEdges", () => Nt(e)), n("    acyclic", () => Un(e)), n("    nestingGraph.run", () => xr(e)), n("    rank", () => br(Ie(e))), n("    injectEdgeLabelProxies", () => mt(e)), n("    removeEmptyRanks", () => Kn(e)), n("    nestingGraph.cleanup", () => kr(e)), n("    normalizeRanks", () => Zn(e)), n("    assignRankMinMax", () => bt(e)), n("    removeEdgeLabelProxies", () => gt(e)), n("    normalize.run", () => or(e)), n("    parentDummyChains", () => Yr(e)), n("    addBorderSegments", () => nr(e)), n("    order", () => Br(e)), n("    insertSelfEdges", () => Lt(e)), n("    adjustCoordinateSystem", () => rr(e)), n("    position", () => tt(e)), n("    positionSelfEdges", () => Pt(e)), n("    removeBorderNodes", () => kt(e)), n("    normalize.undo", () => dr(e)), n("    fixupEdgeLabelCoords", () => Et(e)), n("    undoCoordinateSystem", () => tr(e)), n("    translateGraph", () => yt(e)), n("    assignNodeIntersects", () => xt(e)), n("    reversePoints", () => Ot(e)), n("    acyclic.undo", () => zn(e));
+}
+function ot(e, n) {
+  c(e.nodes(), function(r) {
+    var t = e.node(r), i = n.node(r);
+    t && (t.x = i.x, t.y = i.y, n.children(r).length && (t.width = i.width, t.height = i.height));
+  }), c(e.edges(), function(r) {
+    var t = e.edge(r), i = n.edge(r);
+    t.points = i.points, Object.prototype.hasOwnProperty.call(i, "x") && (t.x = i.x, t.y = i.y);
+  }), e.graph().width = n.graph().width, e.graph().height = n.graph().height;
+}
+var ut = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], dt = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" }, ft = ["acyclicer", "ranker", "rankdir", "align"], st = ["width", "height"], ct = { width: 0, height: 0 }, lt = ["minlen", "weight", "width", "height", "labeloffset"], ht = {
+  minlen: 1,
+  weight: 1,
+  width: 0,
+  height: 0,
+  labeloffset: 10,
+  labelpos: "r"
+}, vt = ["labelpos"];
+function pt(e) {
+  var n = new g({ multigraph: !0, compound: !0 }), r = X(e.graph());
+  return n.setGraph(
+    J({}, dt, W(r, ut), F(r, ft))
+  ), c(e.nodes(), function(t) {
+    var i = X(e.node(t));
+    n.setNode(t, gn(W(i, st), ct)), n.setParent(t, e.parent(t));
+  }), c(e.edges(), function(t) {
+    var i = X(e.edge(t));
+    n.setEdge(
+      t,
+      J({}, ht, W(i, lt), F(i, vt))
+    );
+  }), n;
+}
+function wt(e) {
+  var n = e.graph();
+  n.ranksep /= 2, c(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 mt(e) {
+  c(e.edges(), function(n) {
+    var r = e.edge(n);
+    if (r.width && r.height) {
+      var t = e.node(n.v), i = e.node(n.w), o = { rank: (i.rank - t.rank) / 2 + t.rank, e: n };
+      k(e, "edge-proxy", o, "_ep");
+    }
+  });
+}
+function bt(e) {
+  var n = 0;
+  c(e.nodes(), function(r) {
+    var t = e.node(r);
+    t.borderTop && (t.minRank = e.node(t.borderTop).rank, t.maxRank = e.node(t.borderBottom).rank, n = y(n, t.maxRank));
+  }), e.graph().maxRank = n;
+}
+function gt(e) {
+  c(e.nodes(), function(n) {
+    var r = e.node(n);
+    r.dummy === "edge-proxy" && (e.edge(r.e).labelRank = r.rank, e.removeNode(n));
+  });
+}
+function yt(e) {
+  var n = Number.POSITIVE_INFINITY, r = 0, t = Number.POSITIVE_INFINITY, i = 0, o = e.graph(), a = o.marginx || 0, u = o.marginy || 0;
+  function d(f) {
+    var s = f.x, l = f.y, h = f.width, v = f.height;
+    n = Math.min(n, s - h / 2), r = Math.max(r, s + h / 2), t = Math.min(t, l - v / 2), i = Math.max(i, l + v / 2);
+  }
+  c(e.nodes(), function(f) {
+    d(e.node(f));
+  }), c(e.edges(), function(f) {
+    var s = e.edge(f);
+    Object.prototype.hasOwnProperty.call(s, "x") && d(s);
+  }), n -= a, t -= u, c(e.nodes(), function(f) {
+    var s = e.node(f);
+    s.x -= n, s.y -= t;
+  }), c(e.edges(), function(f) {
+    var s = e.edge(f);
+    c(s.points, function(l) {
+      l.x -= n, l.y -= t;
+    }), Object.prototype.hasOwnProperty.call(s, "x") && (s.x -= n), Object.prototype.hasOwnProperty.call(s, "y") && (s.y -= t);
+  }), o.width = r - n + a, o.height = i - t + u;
+}
+function xt(e) {
+  c(e.edges(), function(n) {
+    var r = e.edge(n), t = e.node(n.v), i = e.node(n.w), o, a;
+    r.points ? (o = r.points[0], a = r.points[r.points.length - 1]) : (r.points = [], o = i, a = t), r.points.unshift(he(t, o)), r.points.push(he(i, a));
+  });
+}
+function Et(e) {
+  c(e.edges(), function(n) {
+    var r = e.edge(n);
+    if (Object.prototype.hasOwnProperty.call(r, "x"))
+      switch ((r.labelpos === "l" || r.labelpos === "r") && (r.width -= r.labeloffset), r.labelpos) {
+        case "l":
+          r.x -= r.width / 2 + r.labeloffset;
+          break;
+        case "r":
+          r.x += r.width / 2 + r.labeloffset;
+          break;
+      }
+  });
+}
+function Ot(e) {
+  c(e.edges(), function(n) {
+    var r = e.edge(n);
+    r.reversed && r.points.reverse();
+  });
+}
+function kt(e) {
+  c(e.nodes(), function(n) {
+    if (e.children(n).length) {
+      var r = e.node(n), t = e.node(r.borderTop), i = e.node(r.borderBottom), o = e.node(A(r.borderLeft)), a = e.node(A(r.borderRight));
+      r.width = Math.abs(a.x - o.x), r.height = Math.abs(i.y - t.y), r.x = o.x + r.width / 2, r.y = t.y + r.height / 2;
+    }
+  }), c(e.nodes(), function(n) {
+    e.node(n).dummy === "border" && e.removeNode(n);
+  });
+}
+function Nt(e) {
+  c(e.edges(), function(n) {
+    if (n.v === n.w) {
+      var r = e.node(n.v);
+      r.selfEdges || (r.selfEdges = []), r.selfEdges.push({ e: n, label: e.edge(n) }), e.removeEdge(n);
+    }
+  });
+}
+function Lt(e) {
+  var n = G(e);
+  c(n, function(r) {
+    var t = 0;
+    c(r, function(i, o) {
+      var a = e.node(i);
+      a.order = o + t, c(a.selfEdges, function(u) {
+        k(
+          e,
+          "selfedge",
+          {
+            width: u.label.width,
+            height: u.label.height,
+            rank: a.rank,
+            order: o + ++t,
+            e: u.e,
+            label: u.label
+          },
+          "_se"
+        );
+      }), delete a.selfEdges;
+    });
+  });
+}
+function Pt(e) {
+  c(e.nodes(), function(n) {
+    var r = e.node(n);
+    if (r.dummy === "selfedge") {
+      var t = e.node(r.e.v), i = t.x + t.width / 2, o = t.y, a = r.x - i, u = t.height / 2;
+      e.setEdge(r.e, r.label), e.removeNode(n), r.label.points = [
+        { x: i + 2 * a / 3, y: o - u },
+        { x: i + 5 * a / 6, y: o - u },
+        { x: i + a, y: o },
+        { x: i + 5 * a / 6, y: o + u },
+        { x: i + 2 * a / 3, y: o + u }
+      ], r.label.x = r.x, r.label.y = r.y;
+    }
+  });
+}
+function W(e, n) {
+  return B(F(e, n), Number);
+}
+function X(e) {
+  var n = {};
+  return c(e, function(r, t) {
+    n[t.toLowerCase()] = r;
+  }), n;
+}
+export {
+  Dt as l
+};