lowcoder-comps 0.0.14 → 0.0.16

package/17e7d0bf.js

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