@layers-app/editor 0.3.11 → 0.4.1-progress.1

package/dist/layers.D4fGb2cV.js

@@ -0,0 +1,1272 @@
+import * as t from "lodash-es";
+import { G as w } from "./layers.C7lIplJU.js";
+class ae {
+  constructor() {
+    var n = {};
+    n._next = n._prev = n, this._sentinel = n;
+  }
+  dequeue() {
+    var n = this._sentinel, r = n._prev;
+    if (r !== n)
+      return P(r), r;
+  }
+  enqueue(n) {
+    var r = this._sentinel;
+    n._prev && n._next && P(n), n._next = r._next, r._next._prev = n, r._next = n, n._prev = r;
+  }
+  toString() {
+    for (var n = [], r = this._sentinel, a = r._prev; a !== r; )
+      n.push(JSON.stringify(a, oe)), a = a._prev;
+    return "[" + n.join(", ") + "]";
+  }
+}
+function P(e) {
+  e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
+}
+function oe(e, n) {
+  if (e !== "_next" && e !== "_prev")
+    return n;
+}
+var te = t.constant(1);
+function ie(e, n) {
+  if (e.nodeCount() <= 1)
+    return [];
+  var r = ue(e, n || te), a = fe(r.graph, r.buckets, r.zeroIdx);
+  return t.flatten(
+    t.map(a, function(o) {
+      return e.outEdges(o.v, o.w);
+    })
+  );
+}
+function fe(e, n, r) {
+  for (var a = [], o = n[n.length - 1], f = n[0], i; e.nodeCount(); ) {
+    for (; i = f.dequeue(); )
+      y(e, n, r, i);
+    for (; i = o.dequeue(); )
+      y(e, n, r, i);
+    if (e.nodeCount()) {
+      for (var u = n.length - 2; u > 0; --u)
+        if (i = n[u].dequeue(), i) {
+          a = a.concat(y(e, n, r, i, !0));
+          break;
+        }
+    }
+  }
+  return a;
+}
+function y(e, n, r, a, o) {
+  var f = o ? [] : void 0;
+  return t.forEach(e.inEdges(a.v), function(i) {
+    var u = e.edge(i), d = e.node(i.v);
+    o && f.push({ v: i.v, w: i.w }), d.out -= u, R(n, r, d);
+  }), t.forEach(e.outEdges(a.v), function(i) {
+    var u = e.edge(i), d = i.w, s = e.node(d);
+    s.in -= u, R(n, r, s);
+  }), e.removeNode(a.v), f;
+}
+function ue(e, n) {
+  var r = new w(), a = 0, o = 0;
+  t.forEach(e.nodes(), function(u) {
+    r.setNode(u, { v: u, in: 0, out: 0 });
+  }), t.forEach(e.edges(), function(u) {
+    var d = r.edge(u.v, u.w) || 0, s = n(u), c = d + s;
+    r.setEdge(u.v, u.w, c), o = Math.max(o, r.node(u.v).out += s), a = Math.max(a, r.node(u.w).in += s);
+  });
+  var f = t.range(o + a + 3).map(function() {
+    return new ae();
+  }), i = a + 1;
+  return t.forEach(r.nodes(), function(u) {
+    R(f, i, r.node(u));
+  }), { graph: r, buckets: f, zeroIdx: i };
+}
+function R(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 de(e) {
+  var n = e.graph().acyclicer === "greedy" ? ie(e, r(e)) : se(e);
+  t.forEach(n, function(a) {
+    var o = e.edge(a);
+    e.removeEdge(a), o.forwardName = a.name, o.reversed = !0, e.setEdge(a.w, a.v, o, t.uniqueId("rev"));
+  });
+  function r(a) {
+    return function(o) {
+      return a.edge(o).weight;
+    };
+  }
+}
+function se(e) {
+  var n = [], r = {}, a = {};
+  function o(f) {
+    t.has(a, f) || (a[f] = !0, r[f] = !0, t.forEach(e.outEdges(f), function(i) {
+      t.has(r, i.w) ? n.push(i) : o(i.w);
+    }), delete r[f]);
+  }
+  return t.forEach(e.nodes(), o), n;
+}
+function ce(e) {
+  t.forEach(e.edges(), function(n) {
+    var r = e.edge(n);
+    if (r.reversed) {
+      e.removeEdge(n);
+      var a = r.forwardName;
+      delete r.reversed, delete r.forwardName, e.setEdge(n.w, n.v, r, a);
+    }
+  });
+}
+function b(e, n, r, a) {
+  var o;
+  do
+    o = t.uniqueId(a);
+  while (e.hasNode(o));
+  return r.dummy = n, e.setNode(o, r), o;
+}
+function he(e) {
+  var n = new w().setGraph(e.graph());
+  return t.forEach(e.nodes(), function(r) {
+    n.setNode(r, e.node(r));
+  }), t.forEach(e.edges(), function(r) {
+    var a = n.edge(r.v, r.w) || { weight: 0, minlen: 1 }, o = e.edge(r);
+    n.setEdge(r.v, r.w, {
+      weight: a.weight + o.weight,
+      minlen: Math.max(a.minlen, o.minlen)
+    });
+  }), n;
+}
+function j(e) {
+  var n = new w({ multigraph: e.isMultigraph() }).setGraph(e.graph());
+  return t.forEach(e.nodes(), function(r) {
+    e.children(r).length || n.setNode(r, e.node(r));
+  }), t.forEach(e.edges(), function(r) {
+    n.setEdge(r, e.edge(r));
+  }), n;
+}
+function V(e, n) {
+  var r = e.x, a = e.y, o = n.x - r, f = n.y - a, i = e.width / 2, u = e.height / 2;
+  if (!o && !f)
+    throw new Error("Not possible to find intersection inside of the rectangle");
+  var d, s;
+  return Math.abs(f) * i > Math.abs(o) * u ? (f < 0 && (u = -u), d = u * o / f, s = u) : (o < 0 && (i = -i), d = i, s = i * f / o), { x: r + d, y: a + s };
+}
+function x(e) {
+  var n = t.map(t.range(q(e) + 1), function() {
+    return [];
+  });
+  return t.forEach(e.nodes(), function(r) {
+    var a = e.node(r), o = a.rank;
+    t.isUndefined(o) || (n[o][a.order] = r);
+  }), n;
+}
+function le(e) {
+  var n = t.min(
+    t.map(e.nodes(), function(r) {
+      return e.node(r).rank;
+    })
+  );
+  t.forEach(e.nodes(), function(r) {
+    var a = e.node(r);
+    t.has(a, "rank") && (a.rank -= n);
+  });
+}
+function ve(e) {
+  var n = t.min(
+    t.map(e.nodes(), function(f) {
+      return e.node(f).rank;
+    })
+  ), r = [];
+  t.forEach(e.nodes(), function(f) {
+    var i = e.node(f).rank - n;
+    r[i] || (r[i] = []), r[i].push(f);
+  });
+  var a = 0, o = e.graph().nodeRankFactor;
+  t.forEach(r, function(f, i) {
+    t.isUndefined(f) && i % o !== 0 ? --a : a && t.forEach(f, function(u) {
+      e.node(u).rank += a;
+    });
+  });
+}
+function B(e, n, r, a) {
+  var o = {
+    width: 0,
+    height: 0
+  };
+  return arguments.length >= 4 && (o.rank = r, o.order = a), b(e, "border", o, n);
+}
+function q(e) {
+  return t.max(
+    t.map(e.nodes(), function(n) {
+      var r = e.node(n).rank;
+      if (!t.isUndefined(r))
+        return r;
+    })
+  );
+}
+function pe(e, n) {
+  var r = { lhs: [], rhs: [] };
+  return t.forEach(e, function(a) {
+    n(a) ? r.lhs.push(a) : r.rhs.push(a);
+  }), r;
+}
+function me(e, n) {
+  return n();
+}
+function we(e) {
+  function n(r) {
+    var a = e.children(r), o = e.node(r);
+    if (a.length && t.forEach(a, n), t.has(o, "minRank")) {
+      o.borderLeft = [], o.borderRight = [];
+      for (var f = o.minRank, i = o.maxRank + 1; f < i; ++f)
+        O(e, "borderLeft", "_bl", r, o, f), O(e, "borderRight", "_br", r, o, f);
+    }
+  }
+  t.forEach(e.children(), n);
+}
+function O(e, n, r, a, o, f) {
+  var i = { width: 0, height: 0, rank: f, borderType: n }, u = o[n][f - 1], d = b(e, "border", i, r);
+  o[n][f] = d, e.setParent(d, a), u && e.setEdge(u, d, { weight: 1 });
+}
+function Ee(e) {
+  var n = e.graph().rankdir.toLowerCase();
+  (n === "lr" || n === "rl") && W(e);
+}
+function be(e) {
+  var n = e.graph().rankdir.toLowerCase();
+  (n === "bt" || n === "rl") && ge(e), (n === "lr" || n === "rl") && (ke(e), W(e));
+}
+function W(e) {
+  t.forEach(e.nodes(), function(n) {
+    F(e.node(n));
+  }), t.forEach(e.edges(), function(n) {
+    F(e.edge(n));
+  });
+}
+function F(e) {
+  var n = e.width;
+  e.width = e.height, e.height = n;
+}
+function ge(e) {
+  t.forEach(e.nodes(), function(n) {
+    N(e.node(n));
+  }), t.forEach(e.edges(), function(n) {
+    var r = e.edge(n);
+    t.forEach(r.points, N), t.has(r, "y") && N(r);
+  });
+}
+function N(e) {
+  e.y = -e.y;
+}
+function ke(e) {
+  t.forEach(e.nodes(), function(n) {
+    L(e.node(n));
+  }), t.forEach(e.edges(), function(n) {
+    var r = e.edge(n);
+    t.forEach(r.points, L), t.has(r, "x") && L(r);
+  });
+}
+function L(e) {
+  var n = e.x;
+  e.x = e.y, e.y = n;
+}
+function xe(e) {
+  e.graph().dummyChains = [], t.forEach(e.edges(), function(n) {
+    ye(e, n);
+  });
+}
+function ye(e, n) {
+  var r = n.v, a = e.node(r).rank, o = n.w, f = e.node(o).rank, i = n.name, u = e.edge(n), d = u.labelRank;
+  if (f !== a + 1) {
+    e.removeEdge(n);
+    var s, c, h;
+    for (h = 0, ++a; a < f; ++h, ++a)
+      u.points = [], c = {
+        width: 0,
+        height: 0,
+        edgeLabel: u,
+        edgeObj: n,
+        rank: a
+      }, s = b(e, "edge", c, "_d"), a === d && (c.width = u.width, c.height = u.height, c.dummy = "edge-label", c.labelpos = u.labelpos), e.setEdge(r, s, { weight: u.weight }, i), h === 0 && e.graph().dummyChains.push(s), r = s;
+    e.setEdge(r, o, { weight: u.weight }, i);
+  }
+}
+function Ne(e) {
+  t.forEach(e.graph().dummyChains, function(n) {
+    var r = e.node(n), a = r.edgeLabel, o;
+    for (e.setEdge(r.edgeObj, a); r.dummy; )
+      o = e.successors(n)[0], e.removeNode(n), a.points.push({ x: r.x, y: r.y }), r.dummy === "edge-label" && (a.x = r.x, a.y = r.y, a.width = r.width, a.height = r.height), n = o, r = e.node(n);
+  });
+}
+function C(e) {
+  var n = {};
+  function r(a) {
+    var o = e.node(a);
+    if (t.has(n, a))
+      return o.rank;
+    n[a] = !0;
+    var f = t.min(
+      t.map(e.outEdges(a), function(i) {
+        return r(i.w) - e.edge(i).minlen;
+      })
+    );
+    return (f === Number.POSITIVE_INFINITY || // return value of _.map([]) for Lodash 3
+    f === void 0 || // return value of _.map([]) for Lodash 4
+    f === null) && (f = 0), o.rank = f;
+  }
+  t.forEach(e.sources(), r);
+}
+function k(e, n) {
+  return e.node(n.w).rank - e.node(n.v).rank - e.edge(n).minlen;
+}
+function $(e) {
+  var n = new w({ directed: !1 }), r = e.nodes()[0], a = e.nodeCount();
+  n.setNode(r, {});
+  for (var o, f; Le(n, e) < a; )
+    o = Ie(n, e), f = n.hasNode(o.v) ? k(e, o) : -k(e, o), _e(n, e, f);
+  return n;
+}
+function Le(e, n) {
+  function r(a) {
+    t.forEach(n.nodeEdges(a), function(o) {
+      var f = o.v, i = a === f ? o.w : f;
+      !e.hasNode(i) && !k(n, o) && (e.setNode(i, {}), e.setEdge(a, i, {}), r(i));
+    });
+  }
+  return t.forEach(e.nodes(), r), e.nodeCount();
+}
+function Ie(e, n) {
+  return t.minBy(n.edges(), function(r) {
+    if (e.hasNode(r.v) !== e.hasNode(r.w))
+      return k(n, r);
+  });
+}
+function _e(e, n, r) {
+  t.forEach(e.nodes(), function(a) {
+    n.node(a).rank += r;
+  });
+}
+t.constant(1);
+t.constant(1);
+function Re() {
+}
+Re.prototype = new Error();
+function z(e, n, r) {
+  t.isArray(n) || (n = [n]);
+  var a = (e.isDirected() ? e.successors : e.neighbors).bind(e), o = [], f = {};
+  return t.each(n, function(i) {
+    if (!e.hasNode(i))
+      throw new Error("Graph does not have node: " + i);
+    X(e, i, r === "post", f, a, o);
+  }), o;
+}
+function X(e, n, r, a, o, f) {
+  t.has(a, n) || (a[n] = !0, r || f.push(n), t.each(o(n), function(i) {
+    X(e, i, r, a, o, f);
+  }), r && f.push(n));
+}
+function Ce(e, n) {
+  return z(e, n, "post");
+}
+function Te(e, n) {
+  return z(e, n, "pre");
+}
+E.initLowLimValues = S;
+E.initCutValues = T;
+E.calcCutValue = H;
+E.leaveEdge = K;
+E.enterEdge = Q;
+E.exchangeEdges = Z;
+function E(e) {
+  e = he(e), C(e);
+  var n = $(e);
+  S(n), T(n, e);
+  for (var r, a; r = K(n); )
+    a = Q(n, e, r), Z(n, e, r, a);
+}
+function T(e, n) {
+  var r = Ce(e, e.nodes());
+  r = r.slice(0, r.length - 1), t.forEach(r, function(a) {
+    Se(e, n, a);
+  });
+}
+function Se(e, n, r) {
+  var a = e.node(r), o = a.parent;
+  e.edge(r, o).cutvalue = H(e, n, r);
+}
+function H(e, n, r) {
+  var a = e.node(r), o = a.parent, f = !0, i = n.edge(r, o), u = 0;
+  return i || (f = !1, i = n.edge(o, r)), u = i.weight, t.forEach(n.nodeEdges(r), function(d) {
+    var s = d.v === r, c = s ? d.w : d.v;
+    if (c !== o) {
+      var h = s === f, l = n.edge(d).weight;
+      if (u += h ? l : -l, Pe(e, r, c)) {
+        var v = e.edge(r, c).cutvalue;
+        u += h ? -v : v;
+      }
+    }
+  }), u;
+}
+function S(e, n) {
+  arguments.length < 2 && (n = e.nodes()[0]), J(e, {}, 1, n);
+}
+function J(e, n, r, a, o) {
+  var f = r, i = e.node(a);
+  return n[a] = !0, t.forEach(e.neighbors(a), function(u) {
+    t.has(n, u) || (r = J(e, n, r, u, a));
+  }), i.low = f, i.lim = r++, o ? i.parent = o : delete i.parent, r;
+}
+function K(e) {
+  return t.find(e.edges(), function(n) {
+    return e.edge(n).cutvalue < 0;
+  });
+}
+function Q(e, n, r) {
+  var a = r.v, o = r.w;
+  n.hasEdge(a, o) || (a = r.w, o = r.v);
+  var f = e.node(a), i = e.node(o), u = f, d = !1;
+  f.lim > i.lim && (u = i, d = !0);
+  var s = t.filter(n.edges(), function(c) {
+    return d === A(e, e.node(c.v), u) && d !== A(e, e.node(c.w), u);
+  });
+  return t.minBy(s, function(c) {
+    return k(n, c);
+  });
+}
+function Z(e, n, r, a) {
+  var o = r.v, f = r.w;
+  e.removeEdge(o, f), e.setEdge(a.v, a.w, {}), S(e), T(e, n), Me(e, n);
+}
+function Me(e, n) {
+  var r = t.find(e.nodes(), function(o) {
+    return !n.node(o).parent;
+  }), a = Te(e, r);
+  a = a.slice(1), t.forEach(a, function(o) {
+    var f = e.node(o).parent, i = n.edge(o, f), u = !1;
+    i || (i = n.edge(f, o), u = !0), n.node(o).rank = n.node(f).rank + (u ? i.minlen : -i.minlen);
+  });
+}
+function Pe(e, n, r) {
+  return e.hasEdge(n, r);
+}
+function A(e, n, r) {
+  return r.low <= n.lim && n.lim <= r.lim;
+}
+function Ve(e) {
+  switch (e.graph().ranker) {
+    case "network-simplex":
+      Y(e);
+      break;
+    case "tight-tree":
+      Oe(e);
+      break;
+    case "longest-path":
+      Be(e);
+      break;
+    default:
+      Y(e);
+  }
+}
+var Be = C;
+function Oe(e) {
+  C(e), $(e);
+}
+function Y(e) {
+  E(e);
+}
+function Fe(e) {
+  var n = b(e, "root", {}, "_root"), r = Ae(e), a = t.max(t.values(r)) - 1, o = 2 * a + 1;
+  e.graph().nestingRoot = n, t.forEach(e.edges(), function(i) {
+    e.edge(i).minlen *= o;
+  });
+  var f = Ye(e) + 1;
+  t.forEach(e.children(), function(i) {
+    ee(e, n, o, f, a, r, i);
+  }), e.graph().nodeRankFactor = o;
+}
+function ee(e, n, r, a, o, f, i) {
+  var u = e.children(i);
+  if (!u.length) {
+    i !== n && e.setEdge(n, i, { weight: 0, minlen: r });
+    return;
+  }
+  var d = B(e, "_bt"), s = B(e, "_bb"), c = e.node(i);
+  e.setParent(d, i), c.borderTop = d, e.setParent(s, i), c.borderBottom = s, t.forEach(u, function(h) {
+    ee(e, n, r, a, o, f, h);
+    var l = e.node(h), v = l.borderTop ? l.borderTop : h, p = l.borderBottom ? l.borderBottom : h, m = l.borderTop ? a : 2 * a, g = v !== p ? 1 : o - f[i] + 1;
+    e.setEdge(d, v, {
+      weight: m,
+      minlen: g,
+      nestingEdge: !0
+    }), e.setEdge(p, s, {
+      weight: m,
+      minlen: g,
+      nestingEdge: !0
+    });
+  }), e.parent(i) || e.setEdge(n, d, { weight: 0, minlen: o + f[i] });
+}
+function Ae(e) {
+  var n = {};
+  function r(a, o) {
+    var f = e.children(a);
+    f && f.length && t.forEach(f, function(i) {
+      r(i, o + 1);
+    }), n[a] = o;
+  }
+  return t.forEach(e.children(), function(a) {
+    r(a, 1);
+  }), n;
+}
+function Ye(e) {
+  return t.reduce(
+    e.edges(),
+    function(n, r) {
+      return n + e.edge(r).weight;
+    },
+    0
+  );
+}
+function De(e) {
+  var n = e.graph();
+  e.removeNode(n.nestingRoot), delete n.nestingRoot, t.forEach(e.edges(), function(r) {
+    var a = e.edge(r);
+    a.nestingEdge && e.removeEdge(r);
+  });
+}
+function Ge(e, n, r) {
+  var a = {}, o;
+  t.forEach(r, function(f) {
+    for (var i = e.parent(f), u, d; i; ) {
+      if (u = e.parent(i), u ? (d = a[u], a[u] = i) : (d = o, o = i), d && d !== i) {
+        n.setEdge(d, i);
+        return;
+      }
+      i = u;
+    }
+  });
+}
+function Ue(e, n, r) {
+  var a = je(e), o = new w({ compound: !0 }).setGraph({ root: a }).setDefaultNodeLabel(function(f) {
+    return e.node(f);
+  });
+  return t.forEach(e.nodes(), function(f) {
+    var i = e.node(f), u = e.parent(f);
+    (i.rank === n || i.minRank <= n && n <= i.maxRank) && (o.setNode(f), o.setParent(f, u || a), t.forEach(e[r](f), function(d) {
+      var s = d.v === f ? d.w : d.v, c = o.edge(s, f), h = t.isUndefined(c) ? 0 : c.weight;
+      o.setEdge(s, f, { weight: e.edge(d).weight + h });
+    }), t.has(i, "minRank") && o.setNode(f, {
+      borderLeft: i.borderLeft[n],
+      borderRight: i.borderRight[n]
+    }));
+  }), o;
+}
+function je(e) {
+  for (var n; e.hasNode(n = t.uniqueId("_root")); ) ;
+  return n;
+}
+function qe(e, n) {
+  for (var r = 0, a = 1; a < n.length; ++a)
+    r += We(e, n[a - 1], n[a]);
+  return r;
+}
+function We(e, n, r) {
+  for (var a = t.zipObject(
+    r,
+    t.map(r, function(s, c) {
+      return c;
+    })
+  ), o = t.flatten(
+    t.map(n, function(s) {
+      return t.sortBy(
+        t.map(e.outEdges(s), function(c) {
+          return { pos: a[c.w], weight: e.edge(c).weight };
+        }),
+        "pos"
+      );
+    })
+  ), f = 1; f < r.length; ) f <<= 1;
+  var i = 2 * f - 1;
+  f -= 1;
+  var u = t.map(new Array(i), function() {
+    return 0;
+  }), d = 0;
+  return t.forEach(
+    // @ts-expect-error
+    o.forEach(function(s) {
+      var c = s.pos + f;
+      u[c] += s.weight;
+      for (var h = 0; c > 0; )
+        c % 2 && (h += u[c + 1]), c = c - 1 >> 1, u[c] += s.weight;
+      d += s.weight * h;
+    })
+  ), d;
+}
+function $e(e) {
+  var n = {}, r = t.filter(e.nodes(), function(u) {
+    return !e.children(u).length;
+  }), a = t.max(
+    t.map(r, function(u) {
+      return e.node(u).rank;
+    })
+  ), o = t.map(t.range(a + 1), function() {
+    return [];
+  });
+  function f(u) {
+    if (!t.has(n, u)) {
+      n[u] = !0;
+      var d = e.node(u);
+      o[d.rank].push(u), t.forEach(e.successors(u), f);
+    }
+  }
+  var i = t.sortBy(r, function(u) {
+    return e.node(u).rank;
+  });
+  return t.forEach(i, f), o;
+}
+function ze(e, n) {
+  return t.map(n, function(r) {
+    var a = e.inEdges(r);
+    if (a.length) {
+      var o = t.reduce(
+        a,
+        function(f, i) {
+          var u = e.edge(i), d = e.node(i.v);
+          return {
+            sum: f.sum + u.weight * d.order,
+            weight: f.weight + u.weight
+          };
+        },
+        { sum: 0, weight: 0 }
+      );
+      return {
+        v: r,
+        barycenter: o.sum / o.weight,
+        weight: o.weight
+      };
+    } else
+      return { v: r };
+  });
+}
+function Xe(e, n) {
+  var r = {};
+  t.forEach(e, function(o, f) {
+    var i = r[o.v] = {
+      indegree: 0,
+      in: [],
+      out: [],
+      vs: [o.v],
+      i: f
+    };
+    t.isUndefined(o.barycenter) || (i.barycenter = o.barycenter, i.weight = o.weight);
+  }), t.forEach(n.edges(), function(o) {
+    var f = r[o.v], i = r[o.w];
+    !t.isUndefined(f) && !t.isUndefined(i) && (i.indegree++, f.out.push(r[o.w]));
+  });
+  var a = t.filter(r, function(o) {
+    return !o.indegree;
+  });
+  return He(a);
+}
+function He(e) {
+  var n = [];
+  function r(f) {
+    return function(i) {
+      i.merged || (t.isUndefined(i.barycenter) || t.isUndefined(f.barycenter) || i.barycenter >= f.barycenter) && Je(f, i);
+    };
+  }
+  function a(f) {
+    return function(i) {
+      i.in.push(f), --i.indegree === 0 && e.push(i);
+    };
+  }
+  for (; e.length; ) {
+    var o = e.pop();
+    n.push(o), t.forEach(o.in.reverse(), r(o)), t.forEach(o.out, a(o));
+  }
+  return t.map(
+    t.filter(n, function(f) {
+      return !f.merged;
+    }),
+    function(f) {
+      return t.pick(f, ["vs", "i", "barycenter", "weight"]);
+    }
+  );
+}
+function Je(e, n) {
+  var r = 0, a = 0;
+  e.weight && (r += e.barycenter * e.weight, a += e.weight), n.weight && (r += n.barycenter * n.weight, a += n.weight), e.vs = n.vs.concat(e.vs), e.barycenter = r / a, e.weight = a, e.i = Math.min(n.i, e.i), n.merged = !0;
+}
+function Ke(e, n) {
+  var r = pe(e, function(c) {
+    return t.has(c, "barycenter");
+  }), a = r.lhs, o = t.sortBy(r.rhs, function(c) {
+    return -c.i;
+  }), f = [], i = 0, u = 0, d = 0;
+  a.sort(Qe(!!n)), d = D(f, o, d), t.forEach(a, function(c) {
+    d += c.vs.length, f.push(c.vs), i += c.barycenter * c.weight, u += c.weight, d = D(f, o, d);
+  });
+  var s = { vs: t.flatten(f) };
+  return u && (s.barycenter = i / u, s.weight = u), s;
+}
+function D(e, n, r) {
+  for (var a; n.length && (a = t.last(n)).i <= r; )
+    n.pop(), e.push(a.vs), r++;
+  return r;
+}
+function Qe(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 ne(e, n, r, a) {
+  var o = e.children(n), f = e.node(n), i = f ? f.borderLeft : void 0, u = f ? f.borderRight : void 0, d = {};
+  i && (o = t.filter(o, function(p) {
+    return p !== i && p !== u;
+  }));
+  var s = ze(e, o);
+  t.forEach(s, function(p) {
+    if (e.children(p.v).length) {
+      var m = ne(e, p.v, r, a);
+      d[p.v] = m, t.has(m, "barycenter") && en(p, m);
+    }
+  });
+  var c = Xe(s, r);
+  Ze(c, d);
+  var h = Ke(c, a);
+  if (i && (h.vs = t.flatten([i, h.vs, u]), e.predecessors(i).length)) {
+    var l = e.node(e.predecessors(i)[0]), v = e.node(e.predecessors(u)[0]);
+    t.has(h, "barycenter") || (h.barycenter = 0, h.weight = 0), h.barycenter = (h.barycenter * h.weight + l.order + v.order) / (h.weight + 2), h.weight += 2;
+  }
+  return h;
+}
+function Ze(e, n) {
+  t.forEach(e, function(r) {
+    r.vs = t.flatten(
+      r.vs.map(function(a) {
+        return n[a] ? n[a].vs : a;
+      })
+    );
+  });
+}
+function en(e, n) {
+  t.isUndefined(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 nn(e) {
+  var n = q(e), r = G(e, t.range(1, n + 1), "inEdges"), a = G(e, t.range(n - 1, -1, -1), "outEdges"), o = $e(e);
+  U(e, o);
+  for (var f = Number.POSITIVE_INFINITY, i, u = 0, d = 0; d < 4; ++u, ++d) {
+    rn(u % 2 ? r : a, u % 4 >= 2), o = x(e);
+    var s = qe(e, o);
+    s < f && (d = 0, i = t.cloneDeep(o), f = s);
+  }
+  U(e, i);
+}
+function G(e, n, r) {
+  return t.map(n, function(a) {
+    return Ue(e, a, r);
+  });
+}
+function rn(e, n) {
+  var r = new w();
+  t.forEach(e, function(a) {
+    var o = a.graph().root, f = ne(a, o, r, n);
+    t.forEach(f.vs, function(i, u) {
+      a.node(i).order = u;
+    }), Ge(a, r, f.vs);
+  });
+}
+function U(e, n) {
+  t.forEach(n, function(r) {
+    t.forEach(r, function(a, o) {
+      e.node(a).order = o;
+    });
+  });
+}
+function an(e) {
+  var n = tn(e);
+  t.forEach(e.graph().dummyChains, function(r) {
+    for (var a = e.node(r), o = a.edgeObj, f = on(e, n, o.v, o.w), i = f.path, u = f.lca, d = 0, s = i[d], c = !0; r !== o.w; ) {
+      if (a = e.node(r), c) {
+        for (; (s = i[d]) !== u && e.node(s).maxRank < a.rank; )
+          d++;
+        s === u && (c = !1);
+      }
+      if (!c) {
+        for (; d < i.length - 1 && e.node(s = i[d + 1]).minRank <= a.rank; )
+          d++;
+        s = i[d];
+      }
+      e.setParent(r, s), r = e.successors(r)[0];
+    }
+  });
+}
+function on(e, n, r, a) {
+  var o = [], f = [], i = Math.min(n[r].low, n[a].low), u = Math.max(n[r].lim, n[a].lim), d, s;
+  d = r;
+  do
+    d = e.parent(d), o.push(d);
+  while (d && (n[d].low > i || u > n[d].lim));
+  for (s = d, d = a; (d = e.parent(d)) !== s; )
+    f.push(d);
+  return { path: o.concat(f.reverse()), lca: s };
+}
+function tn(e) {
+  var n = {}, r = 0;
+  function a(o) {
+    var f = r;
+    t.forEach(e.children(o), a), n[o] = { low: f, lim: r++ };
+  }
+  return t.forEach(e.children(), a), n;
+}
+function fn(e, n) {
+  var r = {};
+  function a(o, f) {
+    var i = 0, u = 0, d = o.length, s = t.last(f);
+    return t.forEach(f, function(c, h) {
+      var l = dn(e, c), v = l ? e.node(l).order : d;
+      (l || c === s) && (t.forEach(f.slice(u, h + 1), function(p) {
+        t.forEach(e.predecessors(p), function(m) {
+          var g = e.node(m), M = g.order;
+          (M < i || v < M) && !(g.dummy && e.node(p).dummy) && re(r, m, p);
+        });
+      }), u = h + 1, i = v);
+    }), f;
+  }
+  return t.reduce(n, a), r;
+}
+function un(e, n) {
+  var r = {};
+  function a(f, i, u, d, s) {
+    var c;
+    t.forEach(t.range(i, u), function(h) {
+      c = f[h], e.node(c).dummy && t.forEach(e.predecessors(c), function(l) {
+        var v = e.node(l);
+        v.dummy && (v.order < d || v.order > s) && re(r, l, c);
+      });
+    });
+  }
+  function o(f, i) {
+    var u = -1, d, s = 0;
+    return t.forEach(i, function(c, h) {
+      if (e.node(c).dummy === "border") {
+        var l = e.predecessors(c);
+        l.length && (d = e.node(l[0]).order, a(i, s, h, u, d), s = h, u = d);
+      }
+      a(i, s, i.length, d, f.length);
+    }), i;
+  }
+  return t.reduce(n, o), r;
+}
+function dn(e, n) {
+  if (e.node(n).dummy)
+    return t.find(e.predecessors(n), function(r) {
+      return e.node(r).dummy;
+    });
+}
+function re(e, n, r) {
+  if (n > r) {
+    var a = n;
+    n = r, r = a;
+  }
+  var o = e[n];
+  o || (e[n] = o = {}), o[r] = !0;
+}
+function sn(e, n, r) {
+  if (n > r) {
+    var a = n;
+    n = r, r = a;
+  }
+  return t.has(e[n], r);
+}
+function cn(e, n, r, a) {
+  var o = {}, f = {}, i = {};
+  return t.forEach(n, function(u) {
+    t.forEach(u, function(d, s) {
+      o[d] = d, f[d] = d, i[d] = s;
+    });
+  }), t.forEach(n, function(u) {
+    var d = -1;
+    t.forEach(u, function(s) {
+      var c = a(s);
+      if (c.length) {
+        c = t.sortBy(c, function(m) {
+          return i[m];
+        });
+        for (var h = (c.length - 1) / 2, l = Math.floor(h), v = Math.ceil(h); l <= v; ++l) {
+          var p = c[l];
+          f[s] === s && d < i[p] && !sn(r, s, p) && (f[p] = s, f[s] = o[s] = o[p], d = i[p]);
+        }
+      }
+    });
+  }), { root: o, align: f };
+}
+function hn(e, n, r, a, o) {
+  var f = {}, i = ln(e, n, r, o), u = o ? "borderLeft" : "borderRight";
+  function d(h, l) {
+    for (var v = i.nodes(), p = v.pop(), m = {}; p; )
+      m[p] ? h(p) : (m[p] = !0, v.push(p), v = v.concat(l(p))), p = v.pop();
+  }
+  function s(h) {
+    f[h] = i.inEdges(h).reduce(function(l, v) {
+      return Math.max(l, f[v.v] + i.edge(v));
+    }, 0);
+  }
+  function c(h) {
+    var l = i.outEdges(h).reduce(function(p, m) {
+      return Math.min(p, f[m.w] - i.edge(m));
+    }, Number.POSITIVE_INFINITY), v = e.node(h);
+    l !== Number.POSITIVE_INFINITY && v.borderType !== u && (f[h] = Math.max(f[h], l));
+  }
+  return d(s, i.predecessors.bind(i)), d(c, i.successors.bind(i)), t.forEach(a, function(h) {
+    f[h] = f[r[h]];
+  }), f;
+}
+function ln(e, n, r, a) {
+  var o = new w(), f = e.graph(), i = En(f.nodesep, f.edgesep, a);
+  return t.forEach(n, function(u) {
+    var d;
+    t.forEach(u, function(s) {
+      var c = r[s];
+      if (o.setNode(c), d) {
+        var h = r[d], l = o.edge(h, c);
+        o.setEdge(h, c, Math.max(i(e, s, d), l || 0));
+      }
+      d = s;
+    });
+  }), o;
+}
+function vn(e, n) {
+  return t.minBy(t.values(n), function(r) {
+    var a = Number.NEGATIVE_INFINITY, o = Number.POSITIVE_INFINITY;
+    return t.forIn(r, function(f, i) {
+      var u = bn(e, i) / 2;
+      a = Math.max(f + u, a), o = Math.min(f - u, o);
+    }), a - o;
+  });
+}
+function pn(e, n) {
+  var r = t.values(n), a = t.min(r), o = t.max(r);
+  t.forEach(["u", "d"], function(f) {
+    t.forEach(["l", "r"], function(i) {
+      var u = f + i, d = e[u], s;
+      if (d !== n) {
+        var c = t.values(d);
+        s = i === "l" ? a - t.min(c) : o - t.max(c), s && (e[u] = t.mapValues(d, function(h) {
+          return h + s;
+        }));
+      }
+    });
+  });
+}
+function mn(e, n) {
+  return t.mapValues(e.ul, function(r, a) {
+    if (n)
+      return e[n.toLowerCase()][a];
+    var o = t.sortBy(t.map(e, a));
+    return (o[1] + o[2]) / 2;
+  });
+}
+function wn(e) {
+  var n = x(e), r = t.merge(fn(e, n), un(e, n)), a = {}, o;
+  t.forEach(["u", "d"], function(i) {
+    o = i === "u" ? n : t.values(n).reverse(), t.forEach(["l", "r"], function(u) {
+      u === "r" && (o = t.map(o, function(h) {
+        return t.values(h).reverse();
+      }));
+      var d = (i === "u" ? e.predecessors : e.successors).bind(e), s = cn(e, o, r, d), c = hn(e, o, s.root, s.align, u === "r");
+      u === "r" && (c = t.mapValues(c, function(h) {
+        return -h;
+      })), a[i + u] = c;
+    });
+  });
+  var f = vn(e, a);
+  return pn(a, f), mn(a, e.graph().align);
+}
+function En(e, n, r) {
+  return function(a, o, f) {
+    var i = a.node(o), u = a.node(f), d = 0, s;
+    if (d += i.width / 2, t.has(i, "labelpos"))
+      switch (i.labelpos.toLowerCase()) {
+        case "l":
+          s = -i.width / 2;
+          break;
+        case "r":
+          s = i.width / 2;
+          break;
+      }
+    if (s && (d += r ? s : -s), s = 0, d += (i.dummy ? n : e) / 2, d += (u.dummy ? n : e) / 2, d += u.width / 2, t.has(u, "labelpos"))
+      switch (u.labelpos.toLowerCase()) {
+        case "l":
+          s = u.width / 2;
+          break;
+        case "r":
+          s = -u.width / 2;
+          break;
+      }
+    return s && (d += r ? s : -s), s = 0, d;
+  };
+}
+function bn(e, n) {
+  return e.node(n).width;
+}
+function gn(e) {
+  e = j(e), kn(e), t.forOwn(wn(e), function(n, r) {
+    e.node(r).x = n;
+  });
+}
+function kn(e) {
+  var n = x(e), r = e.graph().ranksep, a = 0;
+  t.forEach(n, function(o) {
+    var f = t.max(
+      t.map(o, function(i) {
+        return e.node(i).height;
+      })
+    );
+    t.forEach(o, function(i) {
+      e.node(i).y = a + f / 2;
+    }), a += f + r;
+  });
+}
+function $n(e, n) {
+  var r = me;
+  r("layout", function() {
+    var a = r("  buildLayoutGraph", function() {
+      return Mn(e);
+    });
+    r("  runLayout", function() {
+      xn(a, r);
+    }), r("  updateInputGraph", function() {
+      yn(e, a);
+    });
+  });
+}
+function xn(e, n) {
+  n("    makeSpaceForEdgeLabels", function() {
+    Pn(e);
+  }), n("    removeSelfEdges", function() {
+    Un(e);
+  }), n("    acyclic", function() {
+    de(e);
+  }), n("    nestingGraph.run", function() {
+    Fe(e);
+  }), n("    rank", function() {
+    Ve(j(e));
+  }), n("    injectEdgeLabelProxies", function() {
+    Vn(e);
+  }), n("    removeEmptyRanks", function() {
+    ve(e);
+  }), n("    nestingGraph.cleanup", function() {
+    De(e);
+  }), n("    normalizeRanks", function() {
+    le(e);
+  }), n("    assignRankMinMax", function() {
+    Bn(e);
+  }), n("    removeEdgeLabelProxies", function() {
+    On(e);
+  }), n("    normalize.run", function() {
+    xe(e);
+  }), n("    parentDummyChains", function() {
+    an(e);
+  }), n("    addBorderSegments", function() {
+    we(e);
+  }), n("    order", function() {
+    nn(e);
+  }), n("    insertSelfEdges", function() {
+    jn(e);
+  }), n("    adjustCoordinateSystem", function() {
+    Ee(e);
+  }), n("    position", function() {
+    gn(e);
+  }), n("    positionSelfEdges", function() {
+    qn(e);
+  }), n("    removeBorderNodes", function() {
+    Gn(e);
+  }), n("    normalize.undo", function() {
+    Ne(e);
+  }), n("    fixupEdgeLabelCoords", function() {
+    Yn(e);
+  }), n("    undoCoordinateSystem", function() {
+    be(e);
+  }), n("    translateGraph", function() {
+    Fn(e);
+  }), n("    assignNodeIntersects", function() {
+    An(e);
+  }), n("    reversePoints", function() {
+    Dn(e);
+  }), n("    acyclic.undo", function() {
+    ce(e);
+  });
+}
+function yn(e, n) {
+  t.forEach(e.nodes(), function(r) {
+    var a = e.node(r), o = n.node(r);
+    a && (a.x = o.x, a.y = o.y, n.children(r).length && (a.width = o.width, a.height = o.height));
+  }), t.forEach(e.edges(), function(r) {
+    var a = e.edge(r), o = n.edge(r);
+    a.points = o.points, t.has(o, "x") && (a.x = o.x, a.y = o.y);
+  }), e.graph().width = n.graph().width, e.graph().height = n.graph().height;
+}
+var Nn = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], Ln = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" }, In = ["acyclicer", "ranker", "rankdir", "align"], _n = ["width", "height"], Rn = { width: 0, height: 0 }, Cn = ["minlen", "weight", "width", "height", "labeloffset"], Tn = {
+  minlen: 1,
+  weight: 1,
+  width: 0,
+  height: 0,
+  labeloffset: 10,
+  labelpos: "r"
+}, Sn = ["labelpos"];
+function Mn(e) {
+  var n = new w({ multigraph: !0, compound: !0 }), r = _(e.graph());
+  return n.setGraph(
+    t.merge({}, Ln, I(r, Nn), t.pick(r, In))
+  ), t.forEach(e.nodes(), function(a) {
+    var o = _(e.node(a));
+    n.setNode(a, t.defaults(I(o, _n), Rn)), n.setParent(a, e.parent(a));
+  }), t.forEach(e.edges(), function(a) {
+    var o = _(e.edge(a));
+    n.setEdge(
+      a,
+      t.merge({}, Tn, I(o, Cn), t.pick(o, Sn))
+    );
+  }), n;
+}
+function Pn(e) {
+  var n = e.graph();
+  n.ranksep /= 2, t.forEach(e.edges(), function(r) {
+    var a = e.edge(r);
+    a.minlen *= 2, a.labelpos.toLowerCase() !== "c" && (n.rankdir === "TB" || n.rankdir === "BT" ? a.width += a.labeloffset : a.height += a.labeloffset);
+  });
+}
+function Vn(e) {
+  t.forEach(e.edges(), function(n) {
+    var r = e.edge(n);
+    if (r.width && r.height) {
+      var a = e.node(n.v), o = e.node(n.w), f = { rank: (o.rank - a.rank) / 2 + a.rank, e: n };
+      b(e, "edge-proxy", f, "_ep");
+    }
+  });
+}
+function Bn(e) {
+  var n = 0;
+  t.forEach(e.nodes(), function(r) {
+    var a = e.node(r);
+    a.borderTop && (a.minRank = e.node(a.borderTop).rank, a.maxRank = e.node(a.borderBottom).rank, n = t.max(n, a.maxRank));
+  }), e.graph().maxRank = n;
+}
+function On(e) {
+  t.forEach(e.nodes(), function(n) {
+    var r = e.node(n);
+    r.dummy === "edge-proxy" && (e.edge(r.e).labelRank = r.rank, e.removeNode(n));
+  });
+}
+function Fn(e) {
+  var n = Number.POSITIVE_INFINITY, r = 0, a = Number.POSITIVE_INFINITY, o = 0, f = e.graph(), i = f.marginx || 0, u = f.marginy || 0;
+  function d(s) {
+    var c = s.x, h = s.y, l = s.width, v = s.height;
+    n = Math.min(n, c - l / 2), r = Math.max(r, c + l / 2), a = Math.min(a, h - v / 2), o = Math.max(o, h + v / 2);
+  }
+  t.forEach(e.nodes(), function(s) {
+    d(e.node(s));
+  }), t.forEach(e.edges(), function(s) {
+    var c = e.edge(s);
+    t.has(c, "x") && d(c);
+  }), n -= i, a -= u, t.forEach(e.nodes(), function(s) {
+    var c = e.node(s);
+    c.x -= n, c.y -= a;
+  }), t.forEach(e.edges(), function(s) {
+    var c = e.edge(s);
+    t.forEach(c.points, function(h) {
+      h.x -= n, h.y -= a;
+    }), t.has(c, "x") && (c.x -= n), t.has(c, "y") && (c.y -= a);
+  }), f.width = r - n + i, f.height = o - a + u;
+}
+function An(e) {
+  t.forEach(e.edges(), function(n) {
+    var r = e.edge(n), a = e.node(n.v), o = e.node(n.w), f, i;
+    r.points ? (f = r.points[0], i = r.points[r.points.length - 1]) : (r.points = [], f = o, i = a), r.points.unshift(V(a, f)), r.points.push(V(o, i));
+  });
+}
+function Yn(e) {
+  t.forEach(e.edges(), function(n) {
+    var r = e.edge(n);
+    if (t.has(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 Dn(e) {
+  t.forEach(e.edges(), function(n) {
+    var r = e.edge(n);
+    r.reversed && r.points.reverse();
+  });
+}
+function Gn(e) {
+  t.forEach(e.nodes(), function(n) {
+    if (e.children(n).length) {
+      var r = e.node(n), a = e.node(r.borderTop), o = e.node(r.borderBottom), f = e.node(t.last(r.borderLeft)), i = e.node(t.last(r.borderRight));
+      r.width = Math.abs(i.x - f.x), r.height = Math.abs(o.y - a.y), r.x = f.x + r.width / 2, r.y = a.y + r.height / 2;
+    }
+  }), t.forEach(e.nodes(), function(n) {
+    e.node(n).dummy === "border" && e.removeNode(n);
+  });
+}
+function Un(e) {
+  t.forEach(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 jn(e) {
+  var n = x(e);
+  t.forEach(n, function(r) {
+    var a = 0;
+    t.forEach(r, function(o, f) {
+      var i = e.node(o);
+      i.order = f + a, t.forEach(i.selfEdges, function(u) {
+        b(
+          e,
+          "selfedge",
+          {
+            width: u.label.width,
+            height: u.label.height,
+            rank: i.rank,
+            order: f + ++a,
+            e: u.e,
+            label: u.label
+          },
+          "_se"
+        );
+      }), delete i.selfEdges;
+    });
+  });
+}
+function qn(e) {
+  t.forEach(e.nodes(), function(n) {
+    var r = e.node(n);
+    if (r.dummy === "selfedge") {
+      var a = e.node(r.e.v), o = a.x + a.width / 2, f = a.y, i = r.x - o, u = a.height / 2;
+      e.setEdge(r.e, r.label), e.removeNode(n), r.label.points = [
+        { x: o + 2 * i / 3, y: f - u },
+        { x: o + 5 * i / 6, y: f - u },
+        { x: o + i, y: f },
+        { x: o + 5 * i / 6, y: f + u },
+        { x: o + 2 * i / 3, y: f + u }
+      ], r.label.x = r.x, r.label.y = r.y;
+    }
+  });
+}
+function I(e, n) {
+  return t.mapValues(t.pick(e, n), Number);
+}
+function _(e) {
+  var n = {};
+  return t.forEach(e, function(r, a) {
+    n[a.toLowerCase()] = r;
+  }), n;
+}
+export {
+  $n as l
+};