@leanspec/ui-components 0.2.21 → 0.2.22

package/dist/{cytoscape.esm-CjI2IsL8.js → cytoscape.esm-Cvf3sx9F.js}

@@ -788,7 +788,7 @@ var _o = !0, Uc = console.warn != null, Kc = console.trace != null, Js = Number.
   var t = Object.keys(e);
   return function(a) {
     for (var n = {}, i = 0; i < t.length; i++) {
-      var s = t[i], o = a == null ? void 0 : a[s];
+      var s = t[i], o = a?.[s];
       n[s] = o === void 0 ? e[s] : o;
     }
     return n;
@@ -3017,11 +3017,6 @@ var sh = cr({
 [Sa, sd, od, ld, fd, dd, pd, Hd, Xt, Yt, Rs, th, gh, bh, kh, Bh, Ph, Ah].forEach(function(r) {
   be(Dv, r);
 });
-/*!
-Embeddable Minimum Strictly-Compliant Promises/A+ 1.1.1 Thenable
-Copyright (c) 2013-2014 Ralf S. Engelschall (http://engelschall.com)
-Licensed under The MIT License (http://opensource.org/licenses/MIT)
-*/
 var Bv = 0, Pv = 1, Av = 2, Nr = function(e) {
   if (!(this instanceof Nr)) return new Nr(e);
   this.id = "Thenable/1.0.7", this.state = Bv, this.fulfillValue = void 0, this.rejectReason = void 0, this.onFulfilled = [], this.onRejected = [], this.proxy = {
@@ -3460,7 +3455,7 @@ function Fh() {
   if (pu) return ki;
   pu = 1;
   function r(e, t) {
-    return e == null ? void 0 : e[t];
+    return e?.[t];
   }
   return ki = r, ki;
 }
@@ -5785,12 +5780,7 @@ var Kv = function(e) {
         if (a.isParent())
           return a.updateCompoundBounds(), n[e.autoName] || 0;
         var o = a.pstyle(e.name);
-        switch (o.strValue) {
-          case "label":
-            return a.recalculateRenderedStyle(), n.rstyle[e.labelName] || 0;
-          default:
-            return o.pfValue;
-        }
+        return o.strValue === "label" ? (a.recalculateRenderedStyle(), n.rstyle[e.labelName] || 0) : o.pfValue;
       } else
         return 1;
   }, ma["outer" + e.uppercaseName] = function() {
@@ -5890,13 +5880,6 @@ var Kg = qa, Xg = function(e, t) {
     return Yg(this, t.get);
   }, r;
 }, {}), np = be({}, Hg, Ug, Kg, ap);
-/*!
-Event object based on jQuery events, MIT license
-
-https://jquery.org/license/
-https://tldrlegal.com/license/mit-license
-https://github.com/jquery/jquery/blob/master/src/event.js
-*/
 var Xv = function(e, t) {
   this.recycle(e, t);
 };
@@ -7553,7 +7536,6 @@ var pp = {
     return e.remove();
   }
 };
-/*! Bezier curve function generator. Copyright Gaetan Renaudeau. MIT License: http://en.wikipedia.org/wiki/MIT_License */
 function yp(r, e, t, a) {
   var n = 4, i = 1e-3, s = 1e-7, o = 10, l = 11, u = 1 / (l - 1), v = typeof Float32Array < "u";
   if (arguments.length !== 4)
@@ -7627,7 +7609,6 @@ function yp(r, e, t, a) {
     return k;
   }, T;
 }
-/*! Runge-Kutta spring physics function generator. Adapted from Framer.js, copyright Koen Bok. MIT License: http://en.wikipedia.org/wiki/MIT_License */
 var mp = /* @__PURE__ */ (function() {
   function r(a) {
     return -a.tension * a.x - a.friction * a.v;
@@ -13113,33 +13094,23 @@ Ga.findEndpoints = function(r) {
 };
 Ga.getSourceEndpoint = function(r) {
   var e = r[0]._private.rscratch;
-  switch (this.recalculateRenderedStyle(r), e.edgeType) {
-    case "haystack":
-      return {
-        x: e.haystackPts[0],
-        y: e.haystackPts[1]
-      };
-    default:
-      return {
-        x: e.arrowStartX,
-        y: e.arrowStartY
-      };
-  }
+  return this.recalculateRenderedStyle(r), e.edgeType === "haystack" ? {
+    x: e.haystackPts[0],
+    y: e.haystackPts[1]
+  } : {
+    x: e.arrowStartX,
+    y: e.arrowStartY
+  };
 };
 Ga.getTargetEndpoint = function(r) {
   var e = r[0]._private.rscratch;
-  switch (this.recalculateRenderedStyle(r), e.edgeType) {
-    case "haystack":
-      return {
-        x: e.haystackPts[2],
-        y: e.haystackPts[3]
-      };
-    default:
-      return {
-        x: e.arrowEndX,
-        y: e.arrowEndY
-      };
-  }
+  return this.recalculateRenderedStyle(r), e.edgeType === "haystack" ? {
+    x: e.haystackPts[2],
+    y: e.haystackPts[3]
+  } : {
+    x: e.arrowEndX,
+    y: e.arrowEndY
+  };
 };
 var yo = {};
 function ry(r, e, t) {
@@ -14342,7 +14313,7 @@ ia.load = function() {
       };
       fe.emit(me("box")).stdFilter(Pe).select().emit(me("boxselect")), fe.nonempty() && r.redrawHint("eles", !0), r.redraw();
     }
-    if (_ != null && _.unactivate(), S.touches[2])
+    if (_?.unactivate(), S.touches[2])
       r.data.bgActivePosistion = void 0, r.redrawHint("select", !0);
     else if (!S.touches[1]) {
       if (!S.touches[0]) {
@@ -15846,7 +15817,6 @@ Lt.drawText = function(r, e, t) {
             case "double":
               r.lineWidth = T / 4, r.setLineDash([]);
               break;
-            case "solid":
             default:
               r.setLineDash([]);
               break;
@@ -18231,7 +18201,6 @@ function zf(r, e, t) {
       return Em(Ql(a()), t);
     case "base64":
       return Ql(a());
-    case "base64uri":
     default:
       return a();
   }

package/dist/dagre-6UL2VRFP-CKc2IEbO.js

@@ -0,0 +1,443 @@
+import { _ as w, aw as F, ax as Y, ay as _, az as H, l as i, f as V, aA as z, aB as U, an as $, as as q, ao as P, am as K, aC as Q, aD as W, aE as Z } from "./index-B5zgF_S5.js";
+import { i as b, G as B } from "./graph-Da1z0n_J.js";
+import { l as I } from "./layout-BoJlbrAK.js";
+import { c as L } from "./clone-Ctm6tjrV.js";
+import { m as A } from "./min-C8aXS73f.js";
+function h(e) {
+  var t = {
+    options: {
+      directed: e.isDirected(),
+      multigraph: e.isMultigraph(),
+      compound: e.isCompound()
+    },
+    nodes: ee(e),
+    edges: ne(e)
+  };
+  return b(e.graph()) || (t.value = L(e.graph())), t;
+}
+function ee(e) {
+  return A(e.nodes(), function(t) {
+    var n = e.node(t), a = e.parent(t), r = { v: t };
+    return b(n) || (r.value = n), b(a) || (r.parent = a), r;
+  });
+}
+function ne(e) {
+  return A(e.edges(), function(t) {
+    var n = e.edge(t), a = { v: t.v, w: t.w };
+    return b(t.name) || (a.name = t.name), b(n) || (a.value = n), a;
+  });
+}
+var d = /* @__PURE__ */ new Map(), y = /* @__PURE__ */ new Map(), J = /* @__PURE__ */ new Map(), te = /* @__PURE__ */ w(() => {
+  y.clear(), J.clear(), d.clear();
+}, "clear"), D = /* @__PURE__ */ w((e, t) => {
+  const n = y.get(t) || [];
+  return i.trace("In isDescendant", t, " ", e, " = ", n.includes(e)), n.includes(e);
+}, "isDescendant"), se = /* @__PURE__ */ w((e, t) => {
+  const n = y.get(t) || [];
+  return i.info("Descendants of ", t, " is ", n), i.info("Edge is ", e), e.v === t || e.w === t ? !1 : n ? n.includes(e.v) || D(e.v, t) || D(e.w, t) || n.includes(e.w) : (i.debug("Tilt, ", t, ",not in descendants"), !1);
+}, "edgeInCluster"), G = /* @__PURE__ */ w((e, t, n, a) => {
+  i.warn(
+    "Copying children of ",
+    e,
+    "root",
+    a,
+    "data",
+    t.node(e),
+    a
+  );
+  const r = t.children(e) || [];
+  e !== a && r.push(e), i.warn("Copying (nodes) clusterId", e, "nodes", r), r.forEach((o) => {
+    if (t.children(o).length > 0)
+      G(o, t, n, a);
+    else {
+      const l = t.node(o);
+      i.info("cp ", o, " to ", a, " with parent ", e), n.setNode(o, l), a !== t.parent(o) && (i.warn("Setting parent", o, t.parent(o)), n.setParent(o, t.parent(o))), e !== a && o !== e ? (i.debug("Setting parent", o, e), n.setParent(o, e)) : (i.info("In copy ", e, "root", a, "data", t.node(e), a), i.debug(
+        "Not Setting parent for node=",
+        o,
+        "cluster!==rootId",
+        e !== a,
+        "node!==clusterId",
+        o !== e
+      ));
+      const u = t.edges(o);
+      i.debug("Copying Edges", u), u.forEach((c) => {
+        i.info("Edge", c);
+        const m = t.edge(c.v, c.w, c.name);
+        i.info("Edge data", m, a);
+        try {
+          se(c, a) ? (i.info("Copying as ", c.v, c.w, m, c.name), n.setEdge(c.v, c.w, m, c.name), i.info("newGraph edges ", n.edges(), n.edge(n.edges()[0]))) : i.info(
+            "Skipping copy of edge ",
+            c.v,
+            "-->",
+            c.w,
+            " rootId: ",
+            a,
+            " clusterId:",
+            e
+          );
+        } catch (v) {
+          i.error(v);
+        }
+      });
+    }
+    i.debug("Removing node", o), t.removeNode(o);
+  });
+}, "copy"), R = /* @__PURE__ */ w((e, t) => {
+  const n = t.children(e);
+  let a = [...n];
+  for (const r of n)
+    J.set(r, e), a = [...a, ...R(r, t)];
+  return a;
+}, "extractDescendants"), ie = /* @__PURE__ */ w((e, t, n) => {
+  const a = e.edges().filter((c) => c.v === t || c.w === t), r = e.edges().filter((c) => c.v === n || c.w === n), o = a.map((c) => ({ v: c.v === t ? n : c.v, w: c.w === t ? t : c.w })), l = r.map((c) => ({ v: c.v, w: c.w }));
+  return o.filter((c) => l.some((m) => c.v === m.v && c.w === m.w));
+}, "findCommonEdges"), C = /* @__PURE__ */ w((e, t, n) => {
+  const a = t.children(e);
+  if (i.trace("Searching children of id ", e, a), a.length < 1)
+    return e;
+  let r;
+  for (const o of a) {
+    const l = C(o, t, n), u = ie(t, n, l);
+    if (l)
+      if (u.length > 0)
+        r = l;
+      else
+        return l;
+  }
+  return r;
+}, "findNonClusterChild"), k = /* @__PURE__ */ w((e) => !d.has(e) || !d.get(e).externalConnections ? e : d.has(e) ? d.get(e).id : e, "getAnchorId"), re = /* @__PURE__ */ w((e, t) => {
+  if (!e || t > 10) {
+    i.debug("Opting out, no graph ");
+    return;
+  } else
+    i.debug("Opting in, graph ");
+  e.nodes().forEach(function(n) {
+    e.children(n).length > 0 && (i.warn(
+      "Cluster identified",
+      n,
+      " Replacement id in edges: ",
+      C(n, e, n)
+    ), y.set(n, R(n, e)), d.set(n, { id: C(n, e, n), clusterData: e.node(n) }));
+  }), e.nodes().forEach(function(n) {
+    const a = e.children(n), r = e.edges();
+    a.length > 0 ? (i.debug("Cluster identified", n, y), r.forEach((o) => {
+      const l = D(o.v, n), u = D(o.w, n);
+      l ^ u && (i.warn("Edge: ", o, " leaves cluster ", n), i.warn("Descendants of XXX ", n, ": ", y.get(n)), d.get(n).externalConnections = !0);
+    })) : i.debug("Not a cluster ", n, y);
+  });
+  for (let n of d.keys()) {
+    const a = d.get(n).id, r = e.parent(a);
+    r !== n && d.has(r) && !d.get(r).externalConnections && (d.get(n).id = r);
+  }
+  e.edges().forEach(function(n) {
+    const a = e.edge(n);
+    i.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(n)), i.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(e.edge(n)));
+    let r = n.v, o = n.w;
+    if (i.warn(
+      "Fix XXX",
+      d,
+      "ids:",
+      n.v,
+      n.w,
+      "Translating: ",
+      d.get(n.v),
+      " --- ",
+      d.get(n.w)
+    ), d.get(n.v) || d.get(n.w)) {
+      if (i.warn("Fixing and trying - removing XXX", n.v, n.w, n.name), r = k(n.v), o = k(n.w), e.removeEdge(n.v, n.w, n.name), r !== n.v) {
+        const l = e.parent(r);
+        d.get(l).externalConnections = !0, a.fromCluster = n.v;
+      }
+      if (o !== n.w) {
+        const l = e.parent(o);
+        d.get(l).externalConnections = !0, a.toCluster = n.w;
+      }
+      i.warn("Fix Replacing with XXX", r, o, n.name), e.setEdge(r, o, a, n.name);
+    }
+  }), i.warn("Adjusted Graph", h(e)), T(e, 0), i.trace(d);
+}, "adjustClustersAndEdges"), T = /* @__PURE__ */ w((e, t) => {
+  if (i.warn("extractor - ", t, h(e), e.children("D")), t > 10) {
+    i.error("Bailing out");
+    return;
+  }
+  let n = e.nodes(), a = !1;
+  for (const r of n) {
+    const o = e.children(r);
+    a = a || o.length > 0;
+  }
+  if (!a) {
+    i.debug("Done, no node has children", e.nodes());
+    return;
+  }
+  i.debug("Nodes = ", n, t);
+  for (const r of n)
+    if (i.debug(
+      "Extracting node",
+      r,
+      d,
+      d.has(r) && !d.get(r).externalConnections,
+      !e.parent(r),
+      e.node(r),
+      e.children("D"),
+      " Depth ",
+      t
+    ), !d.has(r))
+      i.debug("Not a cluster", r, t);
+    else if (!d.get(r).externalConnections && e.children(r) && e.children(r).length > 0) {
+      i.warn(
+        "Cluster without external connections, without a parent and with children",
+        r,
+        t
+      );
+      let l = e.graph().rankdir === "TB" ? "LR" : "TB";
+      d.get(r)?.clusterData?.dir && (l = d.get(r).clusterData.dir, i.warn("Fixing dir", d.get(r).clusterData.dir, l));
+      const u = new B({
+        multigraph: !0,
+        compound: !0
+      }).setGraph({
+        rankdir: l,
+        nodesep: 50,
+        ranksep: 50,
+        marginx: 8,
+        marginy: 8
+      }).setDefaultEdgeLabel(function() {
+        return {};
+      });
+      i.warn("Old graph before copy", h(e)), G(r, e, u, r), e.setNode(r, {
+        clusterNode: !0,
+        id: r,
+        clusterData: d.get(r).clusterData,
+        label: d.get(r).label,
+        graph: u
+      }), i.warn("New graph after copy node: (", r, ")", h(u)), i.debug("Old graph after copy", h(e));
+    } else
+      i.warn(
+        "Cluster ** ",
+        r,
+        " **not meeting the criteria !externalConnections:",
+        !d.get(r).externalConnections,
+        " no parent: ",
+        !e.parent(r),
+        " children ",
+        e.children(r) && e.children(r).length > 0,
+        e.children("D"),
+        t
+      ), i.debug(d);
+  n = e.nodes(), i.warn("New list of nodes", n);
+  for (const r of n) {
+    const o = e.node(r);
+    i.warn(" Now next level", r, o), o?.clusterNode && T(o.graph, t + 1);
+  }
+}, "extractor"), M = /* @__PURE__ */ w((e, t) => {
+  if (t.length === 0)
+    return [];
+  let n = Object.assign([], t);
+  return t.forEach((a) => {
+    const r = e.children(a), o = M(e, r);
+    n = [...n, ...o];
+  }), n;
+}, "sorter"), oe = /* @__PURE__ */ w((e) => M(e, e.children()), "sortNodesByHierarchy"), j = /* @__PURE__ */ w(async (e, t, n, a, r, o) => {
+  i.warn("Graph in recursive render:XAX", h(t), r);
+  const l = t.graph().rankdir;
+  i.trace("Dir in recursive render - dir:", l);
+  const u = e.insert("g").attr("class", "root");
+  t.nodes() ? i.info("Recursive render XXX", t.nodes()) : i.info("No nodes found for", t), t.edges().length > 0 && i.info("Recursive edges", t.edge(t.edges()[0]));
+  const c = u.insert("g").attr("class", "clusters"), m = u.insert("g").attr("class", "edgePaths"), v = u.insert("g").attr("class", "edgeLabels"), X = u.insert("g").attr("class", "nodes");
+  await Promise.all(
+    t.nodes().map(async function(f) {
+      const s = t.node(f);
+      if (r !== void 0) {
+        const g = JSON.parse(JSON.stringify(r.clusterData));
+        i.trace(
+          `Setting data for parent cluster XXX
+ Node.id = `,
+          f,
+          `
+ data=`,
+          g.height,
+          `
+Parent cluster`,
+          r.height
+        ), t.setNode(r.id, g), t.parent(f) || (i.trace("Setting parent", f, r.id), t.setParent(f, r.id, g));
+      }
+      if (i.info("(Insert) Node XXX" + f + ": " + JSON.stringify(t.node(f))), s?.clusterNode) {
+        i.info("Cluster identified XBX", f, s.width, t.node(f));
+        const { ranksep: g, nodesep: p } = t.graph();
+        s.graph.setGraph({
+          ...s.graph.graph(),
+          ranksep: g + 25,
+          nodesep: p
+        });
+        const N = await j(
+          X,
+          s.graph,
+          n,
+          a,
+          t.node(f),
+          o
+        ), x = N.elem;
+        z(s, x), s.diff = N.diff || 0, i.info(
+          "New compound node after recursive render XAX",
+          f,
+          "width",
+          // node,
+          s.width,
+          "height",
+          s.height
+          // node.x,
+          // node.y
+        ), U(x, s);
+      } else
+        t.children(f).length > 0 ? (i.trace(
+          "Cluster - the non recursive path XBX",
+          f,
+          s.id,
+          s,
+          s.width,
+          "Graph:",
+          t
+        ), i.trace(C(s.id, t)), d.set(s.id, { id: C(s.id, t), node: s })) : (i.trace("Node - the non recursive path XAX", f, X, t.node(f), l), await $(X, t.node(f), { config: o, dir: l }));
+    })
+  ), await (/* @__PURE__ */ w(async () => {
+    const f = t.edges().map(async function(s) {
+      const g = t.edge(s.v, s.w, s.name);
+      i.info("Edge " + s.v + " -> " + s.w + ": " + JSON.stringify(s)), i.info("Edge " + s.v + " -> " + s.w + ": ", s, " ", JSON.stringify(t.edge(s))), i.info(
+        "Fix",
+        d,
+        "ids:",
+        s.v,
+        s.w,
+        "Translating: ",
+        d.get(s.v),
+        d.get(s.w)
+      ), await Z(v, g);
+    });
+    await Promise.all(f);
+  }, "processEdges"))(), i.info("Graph before layout:", JSON.stringify(h(t))), i.info("############################################# XXX"), i.info("###                Layout                 ### XXX"), i.info("############################################# XXX"), I(t), i.info("Graph after layout:", JSON.stringify(h(t)));
+  let O = 0, { subGraphTitleTotalMargin: S } = q(o);
+  return await Promise.all(
+    oe(t).map(async function(f) {
+      const s = t.node(f);
+      if (i.info(
+        "Position XBX => " + f + ": (" + s.x,
+        "," + s.y,
+        ") width: ",
+        s.width,
+        " height: ",
+        s.height
+      ), s?.clusterNode)
+        s.y += S, i.info(
+          "A tainted cluster node XBX1",
+          f,
+          s.id,
+          s.width,
+          s.height,
+          s.x,
+          s.y,
+          t.parent(f)
+        ), d.get(s.id).node = s, P(s);
+      else if (t.children(f).length > 0) {
+        i.info(
+          "A pure cluster node XBX1",
+          f,
+          s.id,
+          s.x,
+          s.y,
+          s.width,
+          s.height,
+          t.parent(f)
+        ), s.height += S, t.node(s.parentId);
+        const g = s?.padding / 2 || 0, p = s?.labelBBox?.height || 0, N = p - g || 0;
+        i.debug("OffsetY", N, "labelHeight", p, "halfPadding", g), await K(c, s), d.get(s.id).node = s;
+      } else {
+        const g = t.node(s.parentId);
+        s.y += S / 2, i.info(
+          "A regular node XBX1 - using the padding",
+          s.id,
+          "parent",
+          s.parentId,
+          s.width,
+          s.height,
+          s.x,
+          s.y,
+          "offsetY",
+          s.offsetY,
+          "parent",
+          g,
+          g?.offsetY,
+          s
+        ), P(s);
+      }
+    })
+  ), t.edges().forEach(function(f) {
+    const s = t.edge(f);
+    i.info("Edge " + f.v + " -> " + f.w + ": " + JSON.stringify(s), s), s.points.forEach((x) => x.y += S / 2);
+    const g = t.node(f.v);
+    var p = t.node(f.w);
+    const N = Q(m, s, d, n, g, p, a);
+    W(s, N);
+  }), t.nodes().forEach(function(f) {
+    const s = t.node(f);
+    i.info(f, s.type, s.diff), s.isGroup && (O = s.diff);
+  }), i.warn("Returning from recursive render XAX", u, O), { elem: u, diff: O };
+}, "recursiveRender"), ue = /* @__PURE__ */ w(async (e, t) => {
+  const n = new B({
+    multigraph: !0,
+    compound: !0
+  }).setGraph({
+    rankdir: e.direction,
+    nodesep: e.config?.nodeSpacing || e.config?.flowchart?.nodeSpacing || e.nodeSpacing,
+    ranksep: e.config?.rankSpacing || e.config?.flowchart?.rankSpacing || e.rankSpacing,
+    marginx: 8,
+    marginy: 8
+  }).setDefaultEdgeLabel(function() {
+    return {};
+  }), a = t.select("g");
+  F(a, e.markers, e.type, e.diagramId), Y(), _(), H(), te(), e.nodes.forEach((o) => {
+    n.setNode(o.id, { ...o }), o.parentId && n.setParent(o.id, o.parentId);
+  }), i.debug("Edges:", e.edges), e.edges.forEach((o) => {
+    if (o.start === o.end) {
+      const l = o.start, u = l + "---" + l + "---1", c = l + "---" + l + "---2", m = n.node(l);
+      n.setNode(u, {
+        domId: u,
+        id: u,
+        parentId: m.parentId,
+        labelStyle: "",
+        label: "",
+        padding: 0,
+        shape: "labelRect",
+        // shape: 'rect',
+        style: "",
+        width: 10,
+        height: 10
+      }), n.setParent(u, m.parentId), n.setNode(c, {
+        domId: c,
+        id: c,
+        parentId: m.parentId,
+        labelStyle: "",
+        padding: 0,
+        // shape: 'rect',
+        shape: "labelRect",
+        label: "",
+        style: "",
+        width: 10,
+        height: 10
+      }), n.setParent(c, m.parentId);
+      const v = structuredClone(o), X = structuredClone(o), E = structuredClone(o);
+      v.label = "", v.arrowTypeEnd = "none", v.id = l + "-cyclic-special-1", X.arrowTypeStart = "none", X.arrowTypeEnd = "none", X.id = l + "-cyclic-special-mid", E.label = "", m.isGroup && (v.fromCluster = l, E.toCluster = l), E.id = l + "-cyclic-special-2", E.arrowTypeStart = "none", n.setEdge(l, u, v, l + "-cyclic-special-0"), n.setEdge(u, c, X, l + "-cyclic-special-1"), n.setEdge(c, l, E, l + "-cyc<lic-special-2");
+    } else
+      n.setEdge(o.start, o.end, { ...o }, o.id);
+  }), i.warn("Graph at first:", JSON.stringify(h(n))), re(n), i.warn("Graph after XAX:", JSON.stringify(h(n)));
+  const r = V();
+  await j(
+    a,
+    n,
+    e.type,
+    e.diagramId,
+    void 0,
+    r
+  );
+}, "render");
+export {
+  ue as render
+};

package/dist/dagre-6UL2VRFP-sN44kpPp.cjs

@@ -0,0 +1,4 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index-KEDsBA0n.cjs"),X=require("./graph-AuIe-DO_.cjs"),G=require("./layout-9b_FTQ6g.cjs"),R=require("./clone-JAtNXNmq.cjs"),O=require("./min-Ddv5U3O-.cjs");function m(e){var o={options:{directed:e.isDirected(),multigraph:e.isMultigraph(),compound:e.isCompound()},nodes:M(e),edges:j(e)};return X.isUndefined(e.graph())||(o.value=R.clone(e.graph())),o}function M(e){return O.map(e.nodes(),function(o){var n=e.node(o),l=e.parent(o),r={v:o};return X.isUndefined(n)||(r.value=n),X.isUndefined(l)||(r.parent=l),r})}function j(e){return O.map(e.edges(),function(o){var n=e.edge(o),l={v:o.v,w:o.w};return X.isUndefined(o.name)||(l.name=o.name),X.isUndefined(n)||(l.value=n),l})}var a=new Map,y=new Map,P=new Map,q=t.__name(()=>{y.clear(),P.clear(),a.clear()},"clear"),_=t.__name((e,o)=>{const n=y.get(o)||[];return t.log.trace("In isDescendant",o," ",e," = ",n.includes(e)),n.includes(e)},"isDescendant"),F=t.__name((e,o)=>{const n=y.get(o)||[];return t.log.info("Descendants of ",o," is ",n),t.log.info("Edge is ",e),e.v===o||e.w===o?!1:n?n.includes(e.v)||_(e.v,o)||_(e.w,o)||n.includes(e.w):(t.log.debug("Tilt, ",o,",not in descendants"),!1)},"edgeInCluster"),k=t.__name((e,o,n,l)=>{t.log.warn("Copying children of ",e,"root",l,"data",o.node(e),l);const r=o.children(e)||[];e!==l&&r.push(e),t.log.warn("Copying (nodes) clusterId",e,"nodes",r),r.forEach(s=>{if(o.children(s).length>0)k(s,o,n,l);else{const d=o.node(s);t.log.info("cp ",s," to ",l," with parent ",e),n.setNode(s,d),l!==o.parent(s)&&(t.log.warn("Setting parent",s,o.parent(s)),n.setParent(s,o.parent(s))),e!==l&&s!==e?(t.log.debug("Setting parent",s,e),n.setParent(s,e)):(t.log.info("In copy ",e,"root",l,"data",o.node(e),l),t.log.debug("Not Setting parent for node=",s,"cluster!==rootId",e!==l,"node!==clusterId",s!==e));const g=o.edges(s);t.log.debug("Copying Edges",g),g.forEach(c=>{t.log.info("Edge",c);const w=o.edge(c.v,c.w,c.name);t.log.info("Edge data",w,l);try{F(c,l)?(t.log.info("Copying as ",c.v,c.w,w,c.name),n.setEdge(c.v,c.w,w,c.name),t.log.info("newGraph edges ",n.edges(),n.edge(n.edges()[0]))):t.log.info("Skipping copy of edge ",c.v,"-->",c.w," rootId: ",l," clusterId:",e)}catch(h){t.log.error(h)}})}t.log.debug("Removing node",s),o.removeNode(s)})},"copy"),B=t.__name((e,o)=>{const n=o.children(e);let l=[...n];for(const r of n)P.set(r,e),l=[...l,...B(r,o)];return l},"extractDescendants"),U=t.__name((e,o,n)=>{const l=e.edges().filter(c=>c.v===o||c.w===o),r=e.edges().filter(c=>c.v===n||c.w===n),s=l.map(c=>({v:c.v===o?n:c.v,w:c.w===o?o:c.w})),d=r.map(c=>({v:c.v,w:c.w}));return s.filter(c=>d.some(w=>c.v===w.v&&c.w===w.w))},"findCommonEdges"),b=t.__name((e,o,n)=>{const l=o.children(e);if(t.log.trace("Searching children of id ",e,l),l.length<1)return e;let r;for(const s of l){const d=b(s,o,n),g=U(o,n,d);if(d)if(g.length>0)r=d;else return d}return r},"findNonClusterChild"),D=t.__name(e=>!a.has(e)||!a.get(e).externalConnections?e:a.has(e)?a.get(e).id:e,"getAnchorId"),Y=t.__name((e,o)=>{if(!e||o>10){t.log.debug("Opting out, no graph ");return}else t.log.debug("Opting in, graph ");e.nodes().forEach(function(n){e.children(n).length>0&&(t.log.warn("Cluster identified",n," Replacement id in edges: ",b(n,e,n)),y.set(n,B(n,e)),a.set(n,{id:b(n,e,n),clusterData:e.node(n)}))}),e.nodes().forEach(function(n){const l=e.children(n),r=e.edges();l.length>0?(t.log.debug("Cluster identified",n,y),r.forEach(s=>{const d=_(s.v,n),g=_(s.w,n);d^g&&(t.log.warn("Edge: ",s," leaves cluster ",n),t.log.warn("Descendants of XXX ",n,": ",y.get(n)),a.get(n).externalConnections=!0)})):t.log.debug("Not a cluster ",n,y)});for(let n of a.keys()){const l=a.get(n).id,r=e.parent(l);r!==n&&a.has(r)&&!a.get(r).externalConnections&&(a.get(n).id=r)}e.edges().forEach(function(n){const l=e.edge(n);t.log.warn("Edge "+n.v+" -> "+n.w+": "+JSON.stringify(n)),t.log.warn("Edge "+n.v+" -> "+n.w+": "+JSON.stringify(e.edge(n)));let r=n.v,s=n.w;if(t.log.warn("Fix XXX",a,"ids:",n.v,n.w,"Translating: ",a.get(n.v)," --- ",a.get(n.w)),a.get(n.v)||a.get(n.w)){if(t.log.warn("Fixing and trying - removing XXX",n.v,n.w,n.name),r=D(n.v),s=D(n.w),e.removeEdge(n.v,n.w,n.name),r!==n.v){const d=e.parent(r);a.get(d).externalConnections=!0,l.fromCluster=n.v}if(s!==n.w){const d=e.parent(s);a.get(d).externalConnections=!0,l.toCluster=n.w}t.log.warn("Fix Replacing with XXX",r,s,n.name),e.setEdge(r,s,l,n.name)}}),t.log.warn("Adjusted Graph",m(e)),A(e,0),t.log.trace(a)},"adjustClustersAndEdges"),A=t.__name((e,o)=>{if(t.log.warn("extractor - ",o,m(e),e.children("D")),o>10){t.log.error("Bailing out");return}let n=e.nodes(),l=!1;for(const r of n){const s=e.children(r);l=l||s.length>0}if(!l){t.log.debug("Done, no node has children",e.nodes());return}t.log.debug("Nodes = ",n,o);for(const r of n)if(t.log.debug("Extracting node",r,a,a.has(r)&&!a.get(r).externalConnections,!e.parent(r),e.node(r),e.children("D")," Depth ",o),!a.has(r))t.log.debug("Not a cluster",r,o);else if(!a.get(r).externalConnections&&e.children(r)&&e.children(r).length>0){t.log.warn("Cluster without external connections, without a parent and with children",r,o);let d=e.graph().rankdir==="TB"?"LR":"TB";a.get(r)?.clusterData?.dir&&(d=a.get(r).clusterData.dir,t.log.warn("Fixing dir",a.get(r).clusterData.dir,d));const g=new X.Graph({multigraph:!0,compound:!0}).setGraph({rankdir:d,nodesep:50,ranksep:50,marginx:8,marginy:8}).setDefaultEdgeLabel(function(){return{}});t.log.warn("Old graph before copy",m(e)),k(r,e,g,r),e.setNode(r,{clusterNode:!0,id:r,clusterData:a.get(r).clusterData,label:a.get(r).label,graph:g}),t.log.warn("New graph after copy node: (",r,")",m(g)),t.log.debug("Old graph after copy",m(e))}else t.log.warn("Cluster ** ",r," **not meeting the criteria !externalConnections:",!a.get(r).externalConnections," no parent: ",!e.parent(r)," children ",e.children(r)&&e.children(r).length>0,e.children("D"),o),t.log.debug(a);n=e.nodes(),t.log.warn("New list of nodes",n);for(const r of n){const s=e.node(r);t.log.warn(" Now next level",r,s),s?.clusterNode&&A(s.graph,o+1)}},"extractor"),J=t.__name((e,o)=>{if(o.length===0)return[];let n=Object.assign([],o);return o.forEach(l=>{const r=e.children(l),s=J(e,r);n=[...n,...s]}),n},"sorter"),H=t.__name(e=>J(e,e.children()),"sortNodesByHierarchy"),T=t.__name(async(e,o,n,l,r,s)=>{t.log.warn("Graph in recursive render:XAX",m(o),r);const d=o.graph().rankdir;t.log.trace("Dir in recursive render - dir:",d);const g=e.insert("g").attr("class","root");o.nodes()?t.log.info("Recursive render XXX",o.nodes()):t.log.info("No nodes found for",o),o.edges().length>0&&t.log.info("Recursive edges",o.edge(o.edges()[0]));const c=g.insert("g").attr("class","clusters"),w=g.insert("g").attr("class","edgePaths"),h=g.insert("g").attr("class","edgeLabels"),v=g.insert("g").attr("class","nodes");await Promise.all(o.nodes().map(async function(f){const i=o.node(f);if(r!==void 0){const u=JSON.parse(JSON.stringify(r.clusterData));t.log.trace(`Setting data for parent cluster XXX
+ Node.id = `,f,`
+ data=`,u.height,`
+Parent cluster`,r.height),o.setNode(r.id,u),o.parent(f)||(t.log.trace("Setting parent",f,r.id),o.setParent(f,r.id,u))}if(t.log.info("(Insert) Node XXX"+f+": "+JSON.stringify(o.node(f))),i?.clusterNode){t.log.info("Cluster identified XBX",f,i.width,o.node(f));const{ranksep:u,nodesep:p}=o.graph();i.graph.setGraph({...i.graph.graph(),ranksep:u+25,nodesep:p});const N=await T(v,i.graph,n,l,o.node(f),s),S=N.elem;t.updateNodeBounds(i,S),i.diff=N.diff||0,t.log.info("New compound node after recursive render XAX",f,"width",i.width,"height",i.height),t.setNodeElem(S,i)}else o.children(f).length>0?(t.log.trace("Cluster - the non recursive path XBX",f,i.id,i,i.width,"Graph:",o),t.log.trace(b(i.id,o)),a.set(i.id,{id:b(i.id,o),node:i})):(t.log.trace("Node - the non recursive path XAX",f,v,o.node(f),d),await t.insertNode(v,o.node(f),{config:s,dir:d}))})),await t.__name(async()=>{const f=o.edges().map(async function(i){const u=o.edge(i.v,i.w,i.name);t.log.info("Edge "+i.v+" -> "+i.w+": "+JSON.stringify(i)),t.log.info("Edge "+i.v+" -> "+i.w+": ",i," ",JSON.stringify(o.edge(i))),t.log.info("Fix",a,"ids:",i.v,i.w,"Translating: ",a.get(i.v),a.get(i.w)),await t.insertEdgeLabel(h,u)});await Promise.all(f)},"processEdges")(),t.log.info("Graph before layout:",JSON.stringify(m(o))),t.log.info("############################################# XXX"),t.log.info("###                Layout                 ### XXX"),t.log.info("############################################# XXX"),G.layout(o),t.log.info("Graph after layout:",JSON.stringify(m(o)));let x=0,{subGraphTitleTotalMargin:C}=t.getSubGraphTitleMargins(s);return await Promise.all(H(o).map(async function(f){const i=o.node(f);if(t.log.info("Position XBX => "+f+": ("+i.x,","+i.y,") width: ",i.width," height: ",i.height),i?.clusterNode)i.y+=C,t.log.info("A tainted cluster node XBX1",f,i.id,i.width,i.height,i.x,i.y,o.parent(f)),a.get(i.id).node=i,t.positionNode(i);else if(o.children(f).length>0){t.log.info("A pure cluster node XBX1",f,i.id,i.x,i.y,i.width,i.height,o.parent(f)),i.height+=C,o.node(i.parentId);const u=i?.padding/2||0,p=i?.labelBBox?.height||0,N=p-u||0;t.log.debug("OffsetY",N,"labelHeight",p,"halfPadding",u),await t.insertCluster(c,i),a.get(i.id).node=i}else{const u=o.node(i.parentId);i.y+=C/2,t.log.info("A regular node XBX1 - using the padding",i.id,"parent",i.parentId,i.width,i.height,i.x,i.y,"offsetY",i.offsetY,"parent",u,u?.offsetY,i),t.positionNode(i)}})),o.edges().forEach(function(f){const i=o.edge(f);t.log.info("Edge "+f.v+" -> "+f.w+": "+JSON.stringify(i),i),i.points.forEach(S=>S.y+=C/2);const u=o.node(f.v);var p=o.node(f.w);const N=t.insertEdge(w,i,a,n,u,p,l);t.positionEdgeLabel(i,N)}),o.nodes().forEach(function(f){const i=o.node(f);t.log.info(f,i.type,i.diff),i.isGroup&&(x=i.diff)}),t.log.warn("Returning from recursive render XAX",g,x),{elem:g,diff:x}},"recursiveRender"),V=t.__name(async(e,o)=>{const n=new X.Graph({multigraph:!0,compound:!0}).setGraph({rankdir:e.direction,nodesep:e.config?.nodeSpacing||e.config?.flowchart?.nodeSpacing||e.nodeSpacing,ranksep:e.config?.rankSpacing||e.config?.flowchart?.rankSpacing||e.rankSpacing,marginx:8,marginy:8}).setDefaultEdgeLabel(function(){return{}}),l=o.select("g");t.markers_default(l,e.markers,e.type,e.diagramId),t.clear2(),t.clear$1(),t.clear$2(),q(),e.nodes.forEach(s=>{n.setNode(s.id,{...s}),s.parentId&&n.setParent(s.id,s.parentId)}),t.log.debug("Edges:",e.edges),e.edges.forEach(s=>{if(s.start===s.end){const d=s.start,g=d+"---"+d+"---1",c=d+"---"+d+"---2",w=n.node(d);n.setNode(g,{domId:g,id:g,parentId:w.parentId,labelStyle:"",label:"",padding:0,shape:"labelRect",style:"",width:10,height:10}),n.setParent(g,w.parentId),n.setNode(c,{domId:c,id:c,parentId:w.parentId,labelStyle:"",padding:0,shape:"labelRect",label:"",style:"",width:10,height:10}),n.setParent(c,w.parentId);const h=structuredClone(s),v=structuredClone(s),E=structuredClone(s);h.label="",h.arrowTypeEnd="none",h.id=d+"-cyclic-special-1",v.arrowTypeStart="none",v.arrowTypeEnd="none",v.id=d+"-cyclic-special-mid",E.label="",w.isGroup&&(h.fromCluster=d,E.toCluster=d),E.id=d+"-cyclic-special-2",E.arrowTypeStart="none",n.setEdge(d,g,h,d+"-cyclic-special-0"),n.setEdge(g,c,v,d+"-cyclic-special-1"),n.setEdge(c,d,E,d+"-cyc<lic-special-2")}else n.setEdge(s.start,s.end,{...s},s.id)}),t.log.warn("Graph at first:",JSON.stringify(m(n))),Y(n),t.log.warn("Graph after XAX:",JSON.stringify(m(n)));const r=t.getConfig2();await T(l,n,e.type,e.diagramId,void 0,r)},"render");exports.render=V;