lowcoder-comps 0.0.26 → 0.0.28

package/596b7f71.js

@@ -1,365 +0,0 @@
-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 "./3f82489c.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 "./b053e17f.js";
-import { l as s, p as S, c as X, h as J } from "./3f63d12d.js";
-import { a as Q } from "./3220cb2e.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
-};

package/637a168a.js

@@ -1,235 +0,0 @@
-var F = Object.defineProperty;
-var A = Object.getOwnPropertySymbols;
-var H = Object.prototype.hasOwnProperty, V = Object.prototype.propertyIsEnumerable;
-var I = (l, t, n) => t in l ? F(l, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : l[t] = n, k = (l, t) => {
-  for (var n in t || (t = {}))
-    H.call(t, n) && I(l, n, t[n]);
-  if (A)
-    for (var n of A(t))
-      V.call(t, n) && I(l, n, t[n]);
-  return l;
-};
-var M = (l, t, n) => new Promise((i, e) => {
-  var c = (o) => {
-    try {
-      r(n.next(o));
-    } catch (a) {
-      e(a);
-    }
-  }, s = (o) => {
-    try {
-      r(n.throw(o));
-    } catch (a) {
-      e(a);
-    }
-  }, r = (o) => o.done ? i(o.value) : Promise.resolve(o.value).then(c, s);
-  r((n = n.apply(l, t)).next());
-});
-import { p as W, d as $, s as J } from "./765a2a38.js";
-import { l as p, c as d, h as S, z as K, r as Q, q as B, n as G, o as U, j as z } from "./3f63d12d.js";
-import { G as X } from "./3f82489c.js";
-import { r as Y } from "./596b7f71.js";
-import "./b053e17f.js";
-import "./3220cb2e.js";
-import "./b70abaaf.js";
-import "./2ff2c7a6.js";
-import "./256b619e.js";
-const L = (l) => z.sanitizeText(l, d());
-let T = {
-  dividerMargin: 10,
-  padding: 5,
-  textHeight: 10,
-  curve: void 0
-};
-const Z = function(l, t, n, i) {
-  const e = Object.keys(l);
-  p.info("keys:", e), p.info(l), e.forEach(function(c) {
-    var y;
-    var s, r;
-    const o = l[c], f = {
-      shape: "rect",
-      id: o.id,
-      domId: o.domId,
-      labelText: L(o.id),
-      labelStyle: "",
-      style: "fill: none; stroke: black",
-      // TODO V10: Flowchart ? Keeping flowchart for backwards compatibility. Remove in next major release
-      padding: (y = (s = d().flowchart) == null ? void 0 : s.padding) != null ? y : (r = d().class) == null ? void 0 : r.padding
-    };
-    t.setNode(o.id, f), q(o.classes, t, n, i, o.id), p.info("setNode", f);
-  });
-}, q = function(l, t, n, i, e) {
-  const c = Object.keys(l);
-  p.info("keys:", c), p.info(l), c.filter((s) => l[s].parent == e).forEach(function(s) {
-    var g, h;
-    var r, o;
-    const a = l[s], f = a.cssClasses.join(" "), y = { labelStyle: "", style: "" }, v = (g = a.label) != null ? g : a.id, b = 0, m = "class_box", u = {
-      labelStyle: y.labelStyle,
-      shape: m,
-      labelText: L(v),
-      classData: a,
-      rx: b,
-      ry: b,
-      class: f,
-      style: y.style,
-      id: a.id,
-      domId: a.domId,
-      tooltip: i.db.getTooltip(a.id, e) || "",
-      haveCallback: a.haveCallback,
-      link: a.link,
-      width: a.type === "group" ? 500 : void 0,
-      type: a.type,
-      // TODO V10: Flowchart ? Keeping flowchart for backwards compatibility. Remove in next major release
-      padding: (h = (r = d().flowchart) == null ? void 0 : r.padding) != null ? h : (o = d().class) == null ? void 0 : o.padding
-    };
-    t.setNode(a.id, u), e && t.setParent(a.id, e), p.info("setNode", u);
-  });
-}, j = function(l, t, n, i) {
-  p.info(l), l.forEach(function(e, c) {
-    var h;
-    var s, r;
-    const o = e, a = "", f = { labelStyle: "", style: "" }, y = o.text, v = 0, b = "note", m = {
-      labelStyle: f.labelStyle,
-      shape: b,
-      labelText: L(y),
-      noteData: o,
-      rx: v,
-      ry: v,
-      class: a,
-      style: f.style,
-      id: o.id,
-      domId: o.id,
-      tooltip: "",
-      type: "note",
-      // TODO V10: Flowchart ? Keeping flowchart for backwards compatibility. Remove in next major release
-      padding: (h = (s = d().flowchart) == null ? void 0 : s.padding) != null ? h : (r = d().class) == null ? void 0 : r.padding
-    };
-    if (t.setNode(o.id, m), p.info("setNode", m), !o.class || !(o.class in i))
-      return;
-    const u = n + c, g = {
-      id: `edgeNote${u}`,
-      //Set relationship style and line type
-      classes: "relation",
-      pattern: "dotted",
-      // Set link type for rendering
-      arrowhead: "none",
-      //Set edge extra labels
-      startLabelRight: "",
-      endLabelLeft: "",
-      //Set relation arrow types
-      arrowTypeStart: "none",
-      arrowTypeEnd: "none",
-      style: "fill:none",
-      labelStyle: "",
-      curve: B(T.curve, G)
-    };
-    t.setEdge(o.id, o.class, g, u);
-  });
-}, O = function(l, t) {
-  const n = d().flowchart;
-  let i = 0;
-  l.forEach(function(e) {
-    var r;
-    var c;
-    i++;
-    const s = {
-      //Set relationship style and line type
-      classes: "relation",
-      pattern: e.relation.lineType == 1 ? "dashed" : "solid",
-      id: "id" + i,
-      // Set link type for rendering
-      arrowhead: e.type === "arrow_open" ? "none" : "normal",
-      //Set edge extra labels
-      startLabelRight: e.relationTitle1 === "none" ? "" : e.relationTitle1,
-      endLabelLeft: e.relationTitle2 === "none" ? "" : e.relationTitle2,
-      //Set relation arrow types
-      arrowTypeStart: R(e.relation.type1),
-      arrowTypeEnd: R(e.relation.type2),
-      style: "fill:none",
-      labelStyle: "",
-      curve: B(n == null ? void 0 : n.curve, G)
-    };
-    if (p.info(s, e), e.style !== void 0) {
-      const o = U(e.style);
-      s.style = o.style, s.labelStyle = o.labelStyle;
-    }
-    e.text = e.title, e.text === void 0 ? e.style !== void 0 && (s.arrowheadStyle = "fill: #333") : (s.arrowheadStyle = "fill: #333", s.labelpos = "c", ((r = (c = d().flowchart) == null ? void 0 : c.htmlLabels) != null ? r : d().htmlLabels) ? (s.labelType = "html", s.label = '<span class="edgeLabel">' + e.text + "</span>") : (s.labelType = "text", s.label = e.text.replace(z.lineBreakRegex, `
-`), e.style === void 0 && (s.style = s.style || "stroke: #333; stroke-width: 1.5px;fill:none"), s.labelStyle = s.labelStyle.replace("color:", "fill:"))), t.setEdge(e.id1, e.id2, s, i);
-  });
-}, ee = function(l) {
-  T = k(k({}, T), l);
-}, te = function(l, t, n, i) {
-  return M(this, null, function* () {
-    var h, N, D, E;
-    p.info("Drawing class - ", t);
-    const e = (h = d().flowchart) != null ? h : d().class, c = d().securityLevel;
-    p.info("config:", e);
-    const s = (N = e == null ? void 0 : e.nodeSpacing) != null ? N : 50, r = (D = e == null ? void 0 : e.rankSpacing) != null ? D : 50, o = new X({
-      multigraph: !0,
-      compound: !0
-    }).setGraph({
-      rankdir: i.db.getDirection(),
-      nodesep: s,
-      ranksep: r,
-      marginx: 8,
-      marginy: 8
-    }).setDefaultEdgeLabel(function() {
-      return {};
-    }), a = i.db.getNamespaces(), f = i.db.getClasses(), y = i.db.getRelations(), v = i.db.getNotes();
-    p.info(y), Z(a, o, t, i), q(f, o, t, i), O(y, o), j(v, o, y.length + 1, f);
-    let b;
-    c === "sandbox" && (b = S("#i" + t));
-    const m = c === "sandbox" ? S(b.nodes()[0].contentDocument.body) : S("body"), u = m.select(`[id="${t}"]`), g = m.select("#" + t + " g");
-    if (yield Y(
-      g,
-      o,
-      ["aggregation", "extension", "composition", "dependency", "lollipop"],
-      "classDiagram",
-      t
-    ), K.insertTitle(u, "classTitleText", (E = e == null ? void 0 : e.titleTopMargin) != null ? E : 5, i.db.getDiagramTitle()), Q(o, u, e == null ? void 0 : e.diagramPadding, e == null ? void 0 : e.useMaxWidth), !(e != null && e.htmlLabels)) {
-      const _ = c === "sandbox" ? b.nodes()[0].contentDocument : document, P = _.querySelectorAll('[id="' + t + '"] .edgeLabel .label');
-      for (const w of P) {
-        const C = w.getBBox(), x = _.createElementNS("http://www.w3.org/2000/svg", "rect");
-        x.setAttribute("rx", 0), x.setAttribute("ry", 0), x.setAttribute("width", C.width), x.setAttribute("height", C.height), w.insertBefore(x, w.firstChild);
-      }
-    }
-  });
-};
-function R(l) {
-  let t;
-  switch (l) {
-    case 0:
-      t = "aggregation";
-      break;
-    case 1:
-      t = "extension";
-      break;
-    case 2:
-      t = "composition";
-      break;
-    case 3:
-      t = "dependency";
-      break;
-    case 4:
-      t = "lollipop";
-      break;
-    default:
-      t = "none";
-  }
-  return t;
-}
-const oe = {
-  setConf: ee,
-  draw: te
-}, fe = {
-  parser: W,
-  db: $,
-  renderer: oe,
-  styles: J,
-  init: (l) => {
-    l.class || (l.class = {}), l.class.arrowMarkerAbsolute = l.arrowMarkerAbsolute, $.clear();
-  }
-};
-export {
-  fe as diagram
-};