lowcoder-comps 0.0.20 → 0.0.22

package/f5b4a4bc.js

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