@layers-app/editor 0.3.11 → 0.4.1

package/dist/layers.C7lIplJU.js

@@ -0,0 +1,247 @@
+import * as i from "lodash-es";
+var p = "\0", o = "\0", f = "
";
+class m {
+  constructor(e = {}) {
+    this._isDirected = i.has(e, "directed") ? e.directed : !0, this._isMultigraph = i.has(e, "multigraph") ? e.multigraph : !1, this._isCompound = i.has(e, "compound") ? e.compound : !1, this._label = void 0, this._defaultNodeLabelFn = i.constant(void 0), this._defaultEdgeLabelFn = i.constant(void 0), this._nodes = {}, this._isCompound && (this._parent = {}, this._children = {}, this._children[o] = {}), this._in = {}, this._preds = {}, this._out = {}, this._sucs = {}, this._edgeObjs = {}, this._edgeLabels = {};
+  }
+  /* === Graph functions ========= */
+  isDirected() {
+    return this._isDirected;
+  }
+  isMultigraph() {
+    return this._isMultigraph;
+  }
+  isCompound() {
+    return this._isCompound;
+  }
+  setGraph(e) {
+    return this._label = e, this;
+  }
+  graph() {
+    return this._label;
+  }
+  /* === Node functions ========== */
+  setDefaultNodeLabel(e) {
+    return i.isFunction(e) || (e = i.constant(e)), this._defaultNodeLabelFn = e, this;
+  }
+  nodeCount() {
+    return this._nodeCount;
+  }
+  nodes() {
+    return i.keys(this._nodes);
+  }
+  sources() {
+    var e = this;
+    return i.filter(this.nodes(), function(t) {
+      return i.isEmpty(e._in[t]);
+    });
+  }
+  sinks() {
+    var e = this;
+    return i.filter(this.nodes(), function(t) {
+      return i.isEmpty(e._out[t]);
+    });
+  }
+  setNodes(e, t) {
+    var s = arguments, r = this;
+    return i.each(e, function(n) {
+      s.length > 1 ? r.setNode(n, t) : r.setNode(n);
+    }), this;
+  }
+  setNode(e, t) {
+    return i.has(this._nodes, e) ? (arguments.length > 1 && (this._nodes[e] = t), this) : (this._nodes[e] = arguments.length > 1 ? t : this._defaultNodeLabelFn(e), this._isCompound && (this._parent[e] = o, this._children[e] = {}, this._children[o][e] = !0), this._in[e] = {}, this._preds[e] = {}, this._out[e] = {}, this._sucs[e] = {}, ++this._nodeCount, this);
+  }
+  node(e) {
+    return this._nodes[e];
+  }
+  hasNode(e) {
+    return i.has(this._nodes, e);
+  }
+  removeNode(e) {
+    var t = this;
+    if (i.has(this._nodes, e)) {
+      var s = function(r) {
+        t.removeEdge(t._edgeObjs[r]);
+      };
+      delete this._nodes[e], this._isCompound && (this._removeFromParentsChildList(e), delete this._parent[e], i.each(this.children(e), function(r) {
+        t.setParent(r);
+      }), delete this._children[e]), i.each(i.keys(this._in[e]), s), delete this._in[e], delete this._preds[e], i.each(i.keys(this._out[e]), s), delete this._out[e], delete this._sucs[e], --this._nodeCount;
+    }
+    return this;
+  }
+  setParent(e, t) {
+    if (!this._isCompound)
+      throw new Error("Cannot set parent in a non-compound graph");
+    if (i.isUndefined(t))
+      t = o;
+    else {
+      t += "";
+      for (var s = t; !i.isUndefined(s); s = this.parent(s))
+        if (s === e)
+          throw new Error("Setting " + t + " as parent of " + e + " would create a cycle");
+      this.setNode(t);
+    }
+    return this.setNode(e), this._removeFromParentsChildList(e), this._parent[e] = t, this._children[t][e] = !0, this;
+  }
+  _removeFromParentsChildList(e) {
+    delete this._children[this._parent[e]][e];
+  }
+  parent(e) {
+    if (this._isCompound) {
+      var t = this._parent[e];
+      if (t !== o)
+        return t;
+    }
+  }
+  children(e) {
+    if (i.isUndefined(e) && (e = o), this._isCompound) {
+      var t = this._children[e];
+      if (t)
+        return i.keys(t);
+    } else {
+      if (e === o)
+        return this.nodes();
+      if (this.hasNode(e))
+        return [];
+    }
+  }
+  predecessors(e) {
+    var t = this._preds[e];
+    if (t)
+      return i.keys(t);
+  }
+  successors(e) {
+    var t = this._sucs[e];
+    if (t)
+      return i.keys(t);
+  }
+  neighbors(e) {
+    var t = this.predecessors(e);
+    if (t)
+      return i.union(t, this.successors(e));
+  }
+  isLeaf(e) {
+    var t;
+    return this.isDirected() ? t = this.successors(e) : t = this.neighbors(e), t.length === 0;
+  }
+  filterNodes(e) {
+    var t = new this.constructor({
+      directed: this._isDirected,
+      multigraph: this._isMultigraph,
+      compound: this._isCompound
+    });
+    t.setGraph(this.graph());
+    var s = this;
+    i.each(this._nodes, function(h, d) {
+      e(d) && t.setNode(d, h);
+    }), i.each(this._edgeObjs, function(h) {
+      t.hasNode(h.v) && t.hasNode(h.w) && t.setEdge(h, s.edge(h));
+    });
+    var r = {};
+    function n(h) {
+      var d = s.parent(h);
+      return d === void 0 || t.hasNode(d) ? (r[h] = d, d) : d in r ? r[d] : n(d);
+    }
+    return this._isCompound && i.each(t.nodes(), function(h) {
+      t.setParent(h, n(h));
+    }), t;
+  }
+  /* === Edge functions ========== */
+  setDefaultEdgeLabel(e) {
+    return i.isFunction(e) || (e = i.constant(e)), this._defaultEdgeLabelFn = e, this;
+  }
+  edgeCount() {
+    return this._edgeCount;
+  }
+  edges() {
+    return i.values(this._edgeObjs);
+  }
+  setPath(e, t) {
+    var s = this, r = arguments;
+    return i.reduce(e, function(n, h) {
+      return r.length > 1 ? s.setEdge(n, h, t) : s.setEdge(n, h), h;
+    }), this;
+  }
+  /*
+   * setEdge(v, w, [value, [name]])
+   * setEdge({ v, w, [name] }, [value])
+   */
+  setEdge() {
+    var e, t, s, r, n = !1, h = arguments[0];
+    typeof h == "object" && h !== null && "v" in h ? (e = h.v, t = h.w, s = h.name, arguments.length === 2 && (r = arguments[1], n = !0)) : (e = h, t = arguments[1], s = arguments[3], arguments.length > 2 && (r = arguments[2], n = !0)), e = "" + e, t = "" + t, i.isUndefined(s) || (s = "" + s);
+    var d = _(this._isDirected, e, t, s);
+    if (i.has(this._edgeLabels, d))
+      return n && (this._edgeLabels[d] = r), this;
+    if (!i.isUndefined(s) && !this._isMultigraph)
+      throw new Error("Cannot set a named edge when isMultigraph = false");
+    this.setNode(e), this.setNode(t), this._edgeLabels[d] = n ? r : this._defaultEdgeLabelFn(e, t, s);
+    var a = b(this._isDirected, e, t, s);
+    return e = a.v, t = a.w, Object.freeze(a), this._edgeObjs[d] = a, c(this._preds[t], e), c(this._sucs[e], t), this._in[t][d] = a, this._out[e][d] = a, this._edgeCount++, this;
+  }
+  edge(e, t, s) {
+    var r = arguments.length === 1 ? l(this._isDirected, arguments[0]) : _(this._isDirected, e, t, s);
+    return this._edgeLabels[r];
+  }
+  hasEdge(e, t, s) {
+    var r = arguments.length === 1 ? l(this._isDirected, arguments[0]) : _(this._isDirected, e, t, s);
+    return i.has(this._edgeLabels, r);
+  }
+  removeEdge(e, t, s) {
+    var r = arguments.length === 1 ? l(this._isDirected, arguments[0]) : _(this._isDirected, e, t, s), n = this._edgeObjs[r];
+    return n && (e = n.v, t = n.w, delete this._edgeLabels[r], delete this._edgeObjs[r], g(this._preds[t], e), g(this._sucs[e], t), delete this._in[t][r], delete this._out[e][r], this._edgeCount--), this;
+  }
+  inEdges(e, t) {
+    var s = this._in[e];
+    if (s) {
+      var r = i.values(s);
+      return t ? i.filter(r, function(n) {
+        return n.v === t;
+      }) : r;
+    }
+  }
+  outEdges(e, t) {
+    var s = this._out[e];
+    if (s) {
+      var r = i.values(s);
+      return t ? i.filter(r, function(n) {
+        return n.w === t;
+      }) : r;
+    }
+  }
+  nodeEdges(e, t) {
+    var s = this.inEdges(e, t);
+    if (s)
+      return s.concat(this.outEdges(e, t));
+  }
+}
+m.prototype._nodeCount = 0;
+m.prototype._edgeCount = 0;
+function c(u, e) {
+  u[e] ? u[e]++ : u[e] = 1;
+}
+function g(u, e) {
+  --u[e] || delete u[e];
+}
+function _(u, e, t, s) {
+  var r = "" + e, n = "" + t;
+  if (!u && r > n) {
+    var h = r;
+    r = n, n = h;
+  }
+  return r + f + n + f + (i.isUndefined(s) ? p : s);
+}
+function b(u, e, t, s) {
+  var r = "" + e, n = "" + t;
+  if (!u && r > n) {
+    var h = r;
+    r = n, n = h;
+  }
+  var d = { v: r, w: n };
+  return s && (d.name = s), d;
+}
+function l(u, e) {
+  return _(u, e.v, e.w, e.name);
+}
+export {
+  m as G
+};

package/dist/layers.C7md-mpb.js

@@ -0,0 +1,373 @@
+import * as v from "lodash-es";
+import { l as M } from "./layers.D4fGb2cV.js";
+import { G as U } from "./layers.C7lIplJU.js";
+import { i as A, u as H, s as V, a as _, b as W, g as D, p as O, c as q, d as z, e as p, f as $, h as K, j as Q } from "./layers.UPBrkQqm.js";
+import { l as s, g as T, t as S, d as J } from "./layers.Dwrpihyi.js";
+import { c as Y } from "./layers.CHE9Vv0w.js";
+function m(e) {
+  var t = {
+    options: {
+      directed: e.isDirected(),
+      multigraph: e.isMultigraph(),
+      compound: e.isCompound()
+    },
+    nodes: Z(e),
+    edges: I(e)
+  };
+  return v.isUndefined(e.graph()) || (t.value = v.clone(e.graph())), t;
+}
+function Z(e) {
+  return v.map(e.nodes(), function(t) {
+    var n = e.node(t), r = e.parent(t), i = { v: t };
+    return v.isUndefined(n) || (i.value = n), v.isUndefined(r) || (i.parent = r), i;
+  });
+}
+function I(e) {
+  return v.map(e.edges(), function(t) {
+    var n = e.edge(t), r = { v: t.v, w: t.w };
+    return v.isUndefined(t.name) || (r.name = t.name), v.isUndefined(n) || (r.value = n), r;
+  });
+}
+let l = {}, g = {}, L = {};
+const tt = () => {
+  g = {}, L = {}, l = {};
+}, B = (e, t) => (s.trace("In isDescendant", t, " ", e, " = ", g[t].includes(e)), !!g[t].includes(e)), et = (e, t) => (s.info("Descendants of ", t, " is ", g[t]), s.info("Edge is ", e), e.v === t || e.w === t ? !1 : g[t] ? g[t].includes(e.v) || B(e.v, t) || B(e.w, t) || g[t].includes(e.w) : (s.debug("Tilt, ", t, ",not in descendants"), !1)), R = (e, t, n, r) => {
+  s.warn(
+    "Copying children of ",
+    e,
+    "root",
+    r,
+    "data",
+    t.node(e),
+    r
+  );
+  const i = t.children(e) || [];
+  e !== r && i.push(e), s.warn("Copying (nodes) clusterId", e, "nodes", i), i.forEach((a) => {
+    if (t.children(a).length > 0)
+      R(a, t, n, r);
+    else {
+      const d = t.node(a);
+      s.info("cp ", a, " to ", r, " with parent ", e), n.setNode(a, d), r !== t.parent(a) && (s.warn("Setting parent", a, t.parent(a)), n.setParent(a, t.parent(a))), e !== r && a !== e ? (s.debug("Setting parent", a, e), n.setParent(a, e)) : (s.info("In copy ", e, "root", r, "data", t.node(e), r), s.debug(
+        "Not Setting parent for node=",
+        a,
+        "cluster!==rootId",
+        e !== r,
+        "node!==clusterId",
+        a !== e
+      ));
+      const u = t.edges(a);
+      s.debug("Copying Edges", u), u.forEach((f) => {
+        s.info("Edge", f);
+        const h = t.edge(f.v, f.w, f.name);
+        s.info("Edge data", h, r);
+        try {
+          et(f, r) ? (s.info("Copying as ", f.v, f.w, h, f.name), n.setEdge(f.v, f.w, h, f.name), s.info("newGraph edges ", n.edges(), n.edge(n.edges()[0]))) : s.info(
+            "Skipping copy of edge ",
+            f.v,
+            "-->",
+            f.w,
+            " rootId: ",
+            r,
+            " clusterId:",
+            e
+          );
+        } catch (w) {
+          s.error(w);
+        }
+      });
+    }
+    s.debug("Removing node", a), t.removeNode(a);
+  });
+}, P = (e, t) => {
+  const n = t.children(e);
+  let r = [...n];
+  for (const i of n)
+    L[i] = e, r = [...r, ...P(i, t)];
+  return r;
+}, C = (e, t) => {
+  s.trace("Searching", e);
+  const n = t.children(e);
+  if (s.trace("Searching children of id ", e, n), n.length < 1)
+    return s.trace("This is a valid node", e), e;
+  for (const r of n) {
+    const i = C(r, t);
+    if (i)
+      return s.trace("Found replacement for", e, " => ", i), i;
+  }
+}, X = (e) => !l[e] || !l[e].externalConnections ? e : l[e] ? l[e].id : e, nt = (e, t) => {
+  if (!e || t > 10) {
+    s.debug("Opting out, no graph ");
+    return;
+  } else
+    s.debug("Opting in, graph ");
+  e.nodes().forEach(function(n) {
+    e.children(n).length > 0 && (s.warn(
+      "Cluster identified",
+      n,
+      " Replacement id in edges: ",
+      C(n, e)
+    ), g[n] = P(n, e), l[n] = { id: C(n, e), clusterData: e.node(n) });
+  }), e.nodes().forEach(function(n) {
+    const r = e.children(n), i = e.edges();
+    r.length > 0 ? (s.debug("Cluster identified", n, g), i.forEach((a) => {
+      if (a.v !== n && a.w !== n) {
+        const d = B(a.v, n), u = B(a.w, n);
+        d ^ u && (s.warn("Edge: ", a, " leaves cluster ", n), s.warn("Descendants of XXX ", n, ": ", g[n]), l[n].externalConnections = !0);
+      }
+    })) : s.debug("Not a cluster ", n, g);
+  });
+  for (let n of Object.keys(l)) {
+    const r = l[n].id, i = e.parent(r);
+    i !== n && l[i] && !l[i].externalConnections && (l[n].id = i);
+  }
+  e.edges().forEach(function(n) {
+    const r = e.edge(n);
+    s.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(n)), s.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(e.edge(n)));
+    let i = n.v, a = n.w;
+    if (s.warn(
+      "Fix XXX",
+      l,
+      "ids:",
+      n.v,
+      n.w,
+      "Translating: ",
+      l[n.v],
+      " --- ",
+      l[n.w]
+    ), l[n.v] && l[n.w] && l[n.v] === l[n.w]) {
+      s.warn("Fixing and trixing link to self - removing XXX", n.v, n.w, n.name), s.warn("Fixing and trixing - removing XXX", n.v, n.w, n.name), i = X(n.v), a = X(n.w), e.removeEdge(n.v, n.w, n.name);
+      const d = n.w + "---" + n.v;
+      e.setNode(d, {
+        domId: d,
+        id: d,
+        labelStyle: "",
+        labelText: r.label,
+        padding: 0,
+        shape: "labelRect",
+        style: ""
+      });
+      const u = structuredClone(r), f = structuredClone(r);
+      u.label = "", u.arrowTypeEnd = "none", f.label = "", u.fromCluster = n.v, f.toCluster = n.v, e.setEdge(i, d, u, n.name + "-cyclic-special"), e.setEdge(d, a, f, n.name + "-cyclic-special");
+    } else if (l[n.v] || l[n.w]) {
+      if (s.warn("Fixing and trixing - removing XXX", n.v, n.w, n.name), i = X(n.v), a = X(n.w), e.removeEdge(n.v, n.w, n.name), i !== n.v) {
+        const d = e.parent(i);
+        l[d].externalConnections = !0, r.fromCluster = n.v;
+      }
+      if (a !== n.w) {
+        const d = e.parent(a);
+        l[d].externalConnections = !0, r.toCluster = n.w;
+      }
+      s.warn("Fix Replacing with XXX", i, a, n.name), e.setEdge(i, a, r, n.name);
+    }
+  }), s.warn("Adjusted Graph", m(e)), k(e, 0), s.trace(l);
+}, k = (e, t) => {
+  if (s.warn("extractor - ", t, m(e), e.children("D")), t > 10) {
+    s.error("Bailing out");
+    return;
+  }
+  let n = e.nodes(), r = !1;
+  for (const i of n) {
+    const a = e.children(i);
+    r = r || a.length > 0;
+  }
+  if (!r) {
+    s.debug("Done, no node has children", e.nodes());
+    return;
+  }
+  s.debug("Nodes = ", n, t);
+  for (const i of n)
+    if (s.debug(
+      "Extracting node",
+      i,
+      l,
+      l[i] && !l[i].externalConnections,
+      !e.parent(i),
+      e.node(i),
+      e.children("D"),
+      " Depth ",
+      t
+    ), !l[i])
+      s.debug("Not a cluster", i, t);
+    else if (!l[i].externalConnections && // !graph.parent(node) &&
+    e.children(i) && e.children(i).length > 0) {
+      s.warn(
+        "Cluster without external connections, without a parent and with children",
+        i,
+        t
+      );
+      let d = e.graph().rankdir === "TB" ? "LR" : "TB";
+      l[i] && l[i].clusterData && l[i].clusterData.dir && (d = l[i].clusterData.dir, s.warn("Fixing dir", l[i].clusterData.dir, d));
+      const u = new U({
+        multigraph: !0,
+        compound: !0
+      }).setGraph({
+        rankdir: d,
+        // Todo: set proper spacing
+        nodesep: 50,
+        ranksep: 50,
+        marginx: 8,
+        marginy: 8
+      }).setDefaultEdgeLabel(function() {
+        return {};
+      });
+      s.warn("Old graph before copy", m(e)), R(i, e, u, i), e.setNode(i, {
+        clusterNode: !0,
+        id: i,
+        clusterData: l[i].clusterData,
+        labelText: l[i].labelText,
+        graph: u
+      }), s.warn("New graph after copy node: (", i, ")", m(u)), s.debug("Old graph after copy", m(e));
+    } else
+      s.warn(
+        "Cluster ** ",
+        i,
+        " **not meeting the criteria !externalConnections:",
+        !l[i].externalConnections,
+        " no parent: ",
+        !e.parent(i),
+        " children ",
+        e.children(i) && e.children(i).length > 0,
+        e.children("D"),
+        t
+      ), s.debug(l);
+  n = e.nodes(), s.warn("New list of nodes", n);
+  for (const i of n) {
+    const a = e.node(i);
+    s.warn(" Now next level", i, a), a.clusterNode && k(a.graph, t + 1);
+  }
+}, F = (e, t) => {
+  if (t.length === 0)
+    return [];
+  let n = Object.assign(t);
+  return t.forEach((r) => {
+    const i = e.children(r), a = F(e, i);
+    n = [...n, ...a];
+  }), n;
+}, it = (e) => F(e, e.children()), st = (e, t) => {
+  s.info("Creating subgraph rect for ", t.id, t);
+  const n = T(), r = e.insert("g").attr("class", "cluster" + (t.class ? " " + t.class : "")).attr("id", t.id), i = r.insert("rect", ":first-child"), a = S(n.flowchart.htmlLabels), d = r.insert("g").attr("class", "cluster-label"), u = t.labelType === "markdown" ? Y(d, t.labelText, { style: t.labelStyle, useHtmlLabels: a }) : d.node().appendChild($(t.labelText, t.labelStyle, void 0, !0));
+  let f = u.getBBox();
+  if (S(n.flowchart.htmlLabels)) {
+    const c = u.children[0], o = J(u);
+    f = c.getBoundingClientRect(), o.attr("width", f.width), o.attr("height", f.height);
+  }
+  const h = 0 * t.padding, w = h / 2, x = t.width <= f.width + h ? f.width + h : t.width;
+  t.width <= f.width + h ? t.diff = (f.width - t.width) / 2 - t.padding / 2 : t.diff = -t.padding / 2, s.trace("Data ", t, JSON.stringify(t)), i.attr("style", t.style).attr("rx", t.rx).attr("ry", t.ry).attr("x", t.x - x / 2).attr("y", t.y - t.height / 2 - w).attr("width", x).attr("height", t.height + h);
+  const { subGraphTitleTopMargin: E } = D(n);
+  a ? d.attr(
+    "transform",
+    // This puts the label on top of the box instead of inside it
+    `translate(${t.x - f.width / 2}, ${t.y - t.height / 2 + E})`
+  ) : d.attr(
+    "transform",
+    // This puts the label on top of the box instead of inside it
+    `translate(${t.x}, ${t.y - t.height / 2 + E})`
+  );
+  const y = i.node().getBBox();
+  return t.width = y.width, t.height = y.height, t.intersect = function(c) {
+    return p(t, c);
+  }, r;
+}, rt = (e, t) => {
+  const n = e.insert("g").attr("class", "note-cluster").attr("id", t.id), r = n.insert("rect", ":first-child"), i = 0 * t.padding, a = i / 2;
+  r.attr("rx", t.rx).attr("ry", t.ry).attr("x", t.x - t.width / 2 - a).attr("y", t.y - t.height / 2 - a).attr("width", t.width + i).attr("height", t.height + i).attr("fill", "none");
+  const d = r.node().getBBox();
+  return t.width = d.width, t.height = d.height, t.intersect = function(u) {
+    return p(t, u);
+  }, n;
+}, at = (e, t) => {
+  const n = T(), r = e.insert("g").attr("class", t.classes).attr("id", t.id), i = r.insert("rect", ":first-child"), a = r.insert("g").attr("class", "cluster-label"), d = r.append("rect"), u = a.node().appendChild($(t.labelText, t.labelStyle, void 0, !0));
+  let f = u.getBBox();
+  if (S(n.flowchart.htmlLabels)) {
+    const c = u.children[0], o = J(u);
+    f = c.getBoundingClientRect(), o.attr("width", f.width), o.attr("height", f.height);
+  }
+  f = u.getBBox();
+  const h = 0 * t.padding, w = h / 2, x = t.width <= f.width + t.padding ? f.width + t.padding : t.width;
+  t.width <= f.width + t.padding ? t.diff = (f.width + t.padding * 0 - t.width) / 2 : t.diff = -t.padding / 2, i.attr("class", "outer").attr("x", t.x - x / 2 - w).attr("y", t.y - t.height / 2 - w).attr("width", x + h).attr("height", t.height + h), d.attr("class", "inner").attr("x", t.x - x / 2 - w).attr("y", t.y - t.height / 2 - w + f.height - 1).attr("width", x + h).attr("height", t.height + h - f.height - 3);
+  const { subGraphTitleTopMargin: E } = D(n);
+  a.attr(
+    "transform",
+    `translate(${t.x - f.width / 2}, ${t.y - t.height / 2 - t.padding / 3 + (S(n.flowchart.htmlLabels) ? 5 : 3) + E})`
+  );
+  const y = i.node().getBBox();
+  return t.height = y.height, t.intersect = function(c) {
+    return p(t, c);
+  }, r;
+}, ct = (e, t) => {
+  const n = e.insert("g").attr("class", t.classes).attr("id", t.id), r = n.insert("rect", ":first-child"), i = 0 * t.padding, a = i / 2;
+  r.attr("class", "divider").attr("x", t.x - t.width / 2 - a).attr("y", t.y - t.height / 2).attr("width", t.width + i).attr("height", t.height + i);
+  const d = r.node().getBBox();
+  return t.width = d.width, t.height = d.height, t.diff = -t.padding / 2, t.intersect = function(u) {
+    return p(t, u);
+  }, n;
+}, ot = { rect: st, roundedWithTitle: at, noteGroup: rt, divider: ct };
+let G = {};
+const lt = (e, t) => {
+  s.trace("Inserting cluster");
+  const n = t.shape || "rect";
+  G[t.id] = ot[n](e, t);
+}, ft = () => {
+  G = {};
+}, j = async (e, t, n, r, i, a) => {
+  s.info("Graph in recursive render: XXX", m(t), i);
+  const d = t.graph().rankdir;
+  s.trace("Dir in recursive render - dir:", d);
+  const u = e.insert("g").attr("class", "root");
+  t.nodes() ? s.info("Recursive render XXX", t.nodes()) : s.info("No nodes found for", t), t.edges().length > 0 && s.trace("Recursive edges", t.edge(t.edges()[0]));
+  const f = u.insert("g").attr("class", "clusters"), h = u.insert("g").attr("class", "edgePaths"), w = u.insert("g").attr("class", "edgeLabels"), x = u.insert("g").attr("class", "nodes");
+  await Promise.all(
+    t.nodes().map(async function(c) {
+      const o = t.node(c);
+      if (i !== void 0) {
+        const b = JSON.parse(JSON.stringify(i.clusterData));
+        s.info("Setting data for cluster XXX (", c, ") ", b, i), t.setNode(i.id, b), t.parent(c) || (s.trace("Setting parent", c, i.id), t.setParent(c, i.id, b));
+      }
+      if (s.info("(Insert) Node XXX" + c + ": " + JSON.stringify(t.node(c))), o && o.clusterNode) {
+        s.info("Cluster identified", c, o.width, t.node(c));
+        const b = await j(
+          x,
+          o.graph,
+          n,
+          r,
+          t.node(c),
+          a
+        ), N = b.elem;
+        H(o, N), o.diff = b.diff || 0, s.info("Node bounds (abc123)", c, o, o.width, o.x, o.y), V(N, o), s.warn("Recursive render complete ", N, o);
+      } else
+        t.children(c).length > 0 ? (s.info("Cluster - the non recursive path XXX", c, o.id, o, t), s.info(C(o.id, t)), l[o.id] = { id: C(o.id, t), node: o }) : (s.info("Node - the non recursive path", c, o.id, o), await _(x, t.node(c), d));
+    })
+  ), t.edges().forEach(function(c) {
+    const o = t.edge(c.v, c.w, c.name);
+    s.info("Edge " + c.v + " -> " + c.w + ": " + JSON.stringify(c)), s.info("Edge " + c.v + " -> " + c.w + ": ", c, " ", JSON.stringify(t.edge(c))), s.info("Fix", l, "ids:", c.v, c.w, "Translating: ", l[c.v], l[c.w]), W(w, o);
+  }), t.edges().forEach(function(c) {
+    s.info("Edge " + c.v + " -> " + c.w + ": " + JSON.stringify(c));
+  }), s.info("#############################################"), s.info("###                Layout                 ###"), s.info("#############################################"), s.info(t), M(t), s.info("Graph after layout:", m(t));
+  let E = 0;
+  const { subGraphTitleTotalMargin: y } = D(a);
+  return it(t).forEach(function(c) {
+    const o = t.node(c);
+    s.info("Position " + c + ": " + JSON.stringify(t.node(c))), s.info(
+      "Position " + c + ": (" + o.x,
+      "," + o.y,
+      ") width: ",
+      o.width,
+      " height: ",
+      o.height
+    ), o && o.clusterNode ? (o.y += y, O(o)) : t.children(c).length > 0 ? (o.height += y, lt(f, o), l[o.id].node = o) : (o.y += y / 2, O(o));
+  }), t.edges().forEach(function(c) {
+    const o = t.edge(c);
+    s.info("Edge " + c.v + " -> " + c.w + ": " + JSON.stringify(o), o), o.points.forEach((N) => N.y += y / 2);
+    const b = q(h, c, o, l, n, t, r);
+    z(o, b);
+  }), t.nodes().forEach(function(c) {
+    const o = t.node(c);
+    s.info(c, o.type, o.diff), o.type === "group" && (E = o.diff);
+  }), { elem: u, diff: E };
+}, xt = async (e, t, n, r, i) => {
+  A(e, n, r, i), K(), Q(), ft(), tt(), s.warn("Graph at first:", JSON.stringify(m(t))), nt(t), s.warn("Graph after:", JSON.stringify(m(t)));
+  const a = T();
+  await j(e, t, r, i, void 0, a);
+};
+export {
+  xt as r
+};