@scalar/agent-chat 0.2.2 → 0.2.3

package/dist/node_modules/.pnpm/mermaid@11.12.1/node_modules/mermaid/dist/chunks/mermaid.core/cose-bilkent-S5V4N54A.js

@@ -1,231 +0,0 @@
-import { __name as l, log as y } from "./chunk-AGHRB4JF.js";
-import P from "../../../../../../cytoscape@3.33.1/node_modules/cytoscape/dist/cytoscape.esm.js";
-import q from "../../../../../../../../_virtual/cytoscape-cose-bilkent.js";
-import O from "../../../../../../d3-selection@3.0.0/node_modules/d3-selection/src/select.js";
-P.use(q);
-function D(t, o) {
-  t.forEach((e) => {
-    const n = {
-      id: e.id,
-      labelText: e.label,
-      height: e.height,
-      width: e.width,
-      padding: e.padding ?? 0
-    };
-    Object.keys(e).forEach((i) => {
-      ["id", "label", "height", "width", "padding", "x", "y"].includes(i) || (n[i] = e[i]);
-    }), o.add({
-      group: "nodes",
-      data: n,
-      position: {
-        x: e.x ?? 0,
-        y: e.y ?? 0
-      }
-    });
-  });
-}
-l(D, "addNodes");
-function I(t, o) {
-  t.forEach((e) => {
-    const n = {
-      id: e.id,
-      source: e.start,
-      target: e.end
-    };
-    Object.keys(e).forEach((i) => {
-      ["id", "start", "end"].includes(i) || (n[i] = e[i]);
-    }), o.add({
-      group: "edges",
-      data: n
-    });
-  });
-}
-l(I, "addEdges");
-function $(t) {
-  return new Promise((o) => {
-    const e = O("body").append("div").attr("id", "cy").attr("style", "display:none"), n = P({
-      container: document.getElementById("cy"),
-      // container to render in
-      style: [
-        {
-          selector: "edge",
-          style: {
-            "curve-style": "bezier"
-          }
-        }
-      ]
-    });
-    e.remove(), D(t.nodes, n), I(t.edges, n), n.nodes().forEach(function(a) {
-      a.layoutDimensions = () => {
-        const m = a.data();
-        return { w: m.width, h: m.height };
-      };
-    });
-    const i = {
-      name: "cose-bilkent",
-      // @ts-ignore Types for cose-bilkent are not correct?
-      quality: "proof",
-      styleEnabled: !1,
-      animate: !1
-    };
-    n.layout(i).run(), n.ready((a) => {
-      y.info("Cytoscape ready", a), o(n);
-    });
-  });
-}
-l($, "createCytoscapeInstance");
-function X(t) {
-  return t.nodes().map((o) => {
-    const e = o.data(), n = o.position(), i = {
-      id: e.id,
-      x: n.x,
-      y: n.y
-    };
-    return Object.keys(e).forEach((a) => {
-      a !== "id" && (i[a] = e[a]);
-    }), i;
-  });
-}
-l(X, "extractPositionedNodes");
-function Y(t) {
-  return t.edges().map((o) => {
-    const e = o.data(), n = o._private.rscratch, i = {
-      id: e.id,
-      source: e.source,
-      target: e.target,
-      startX: n.startX,
-      startY: n.startY,
-      midX: n.midX,
-      midY: n.midY,
-      endX: n.endX,
-      endY: n.endY
-    };
-    return Object.keys(e).forEach((a) => {
-      ["id", "source", "target"].includes(a) || (i[a] = e[a]);
-    }), i;
-  });
-}
-l(Y, "extractPositionedEdges");
-async function v(t, o) {
-  y.debug("Starting cose-bilkent layout algorithm");
-  try {
-    B(t);
-    const e = await $(t), n = X(e), i = Y(e);
-    return y.debug(`Layout completed: ${n.length} nodes, ${i.length} edges`), {
-      nodes: n,
-      edges: i
-    };
-  } catch (e) {
-    throw y.error("Error in cose-bilkent layout algorithm:", e), e;
-  }
-}
-l(v, "executeCoseBilkentLayout");
-function B(t) {
-  if (!t)
-    throw new Error("Layout data is required");
-  if (!t.config)
-    throw new Error("Configuration is required in layout data");
-  if (!t.rootNode)
-    throw new Error("Root node is required");
-  if (!t.nodes || !Array.isArray(t.nodes))
-    throw new Error("No nodes found in layout data");
-  if (!Array.isArray(t.edges))
-    throw new Error("Edges array is required in layout data");
-  return !0;
-}
-l(B, "validateLayoutData");
-var _ = /* @__PURE__ */ l(async (t, o, {
-  insertCluster: e,
-  insertEdge: n,
-  insertEdgeLabel: i,
-  insertMarkers: a,
-  insertNode: m,
-  log: c,
-  positionEdgeLabel: x
-}, { algorithm: j }) => {
-  const u = {}, p = {}, f = o.select("g");
-  a(f, t.markers, t.type, t.diagramId);
-  const C = f.insert("g").attr("class", "subgraphs"), E = f.insert("g").attr("class", "edgePaths"), A = f.insert("g").attr("class", "edgeLabels"), N = f.insert("g").attr("class", "nodes");
-  c.debug("Inserting nodes into DOM for dimension calculation"), await Promise.all(
-    t.nodes.map(async (s) => {
-      if (s.isGroup) {
-        const r = { ...s };
-        p[s.id] = r, u[s.id] = r, await e(C, s);
-      } else {
-        const r = { ...s };
-        u[s.id] = r;
-        const d = await m(N, s, {
-          config: t.config,
-          dir: t.direction || "TB"
-        }), g = d.node().getBBox();
-        r.width = g.width, r.height = g.height, r.domId = d, c.debug(`Node ${s.id} dimensions: ${g.width}x${g.height}`);
-      }
-    })
-  ), c.debug("Running cose-bilkent layout algorithm");
-  const k = {
-    ...t,
-    nodes: t.nodes.map((s) => {
-      const r = u[s.id];
-      return {
-        ...s,
-        width: r.width,
-        height: r.height
-      };
-    })
-  }, b = await v(k, t.config);
-  c.debug("Positioning nodes based on layout results"), b.nodes.forEach((s) => {
-    const r = u[s.id];
-    r?.domId && (r.domId.attr(
-      "transform",
-      `translate(${s.x}, ${s.y})`
-    ), r.x = s.x, r.y = s.y, c.debug(`Positioned node ${r.id} at center (${s.x}, ${s.y})`));
-  }), b.edges.forEach((s) => {
-    const r = t.edges.find((d) => d.id === s.id);
-    r && (r.points = [
-      { x: s.startX, y: s.startY },
-      { x: s.midX, y: s.midY },
-      { x: s.endX, y: s.endY }
-    ]);
-  }), c.debug("Inserting and positioning edges"), await Promise.all(
-    t.edges.map(async (s) => {
-      await i(A, s);
-      const r = u[s.start ?? ""], d = u[s.end ?? ""];
-      if (r && d) {
-        const g = b.edges.find((h) => h.id === s.id);
-        if (g) {
-          c.debug("APA01 positionedEdge", g);
-          const h = { ...s }, w = n(
-            E,
-            h,
-            p,
-            t.type,
-            r,
-            d,
-            t.diagramId
-          );
-          x(h, w);
-        } else {
-          const h = {
-            ...s,
-            points: [
-              { x: r.x || 0, y: r.y || 0 },
-              { x: d.x || 0, y: d.y || 0 }
-            ]
-          }, w = n(
-            E,
-            h,
-            p,
-            t.type,
-            r,
-            d,
-            t.diagramId
-          );
-          x(h, w);
-        }
-      }
-    })
-  ), c.debug("Cose-bilkent rendering completed");
-}, "render"), z = _;
-export {
-  z as render
-};

package/dist/node_modules/.pnpm/mermaid@11.12.1/node_modules/mermaid/dist/chunks/mermaid.core/dagre-6UL2VRFP.js

@@ -1,422 +0,0 @@
-import { markers_default as M, clear as F, insertEdge as Y, positionEdgeLabel as j, insertEdgeLabel as H } from "./chunk-QXUST7PY.js";
-import { clear2 as _, clear as $, updateNodeBounds as q, setNodeElem as z, insertNode as K, positionNode as O, insertCluster as Q } from "./chunk-JZLCHNYA.js";
-import { getSubGraphTitleMargins as U } from "./chunk-CVBHYZKI.js";
-import { getConfig2 as V } from "./chunk-ABZYJK2D.js";
-import { __name as w, log as i } from "./chunk-AGHRB4JF.js";
-import { layout as W } from "../../../../../../dagre-d3-es@7.0.13/node_modules/dagre-d3-es/src/dagre/layout.js";
-import { write as h } from "../../../../../../dagre-d3-es@7.0.13/node_modules/dagre-d3-es/src/graphlib/json.js";
-import { Graph as k } from "../../../../../../dagre-d3-es@7.0.13/node_modules/dagre-d3-es/src/graphlib/graph.js";
-var d = /* @__PURE__ */ new Map(), y = /* @__PURE__ */ new Map(), B = /* @__PURE__ */ new Map(), Z = /* @__PURE__ */ w(() => {
-  y.clear(), B.clear(), d.clear();
-}, "clear"), x = /* @__PURE__ */ w((e, t) => {
-  const n = y.get(t) || [];
-  return i.trace("In isDescendant", t, " ", e, " = ", n.includes(e)), n.includes(e);
-}, "isDescendant"), I = /* @__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) || x(e.v, t) || x(e.w, t) || n.includes(e.w) : (i.debug("Tilt, ", t, ",not in descendants"), !1);
-}, "edgeInCluster"), A = /* @__PURE__ */ w((e, t, n, c) => {
-  i.warn(
-    "Copying children of ",
-    e,
-    "root",
-    c,
-    "data",
-    t.node(e),
-    c
-  );
-  const r = t.children(e) || [];
-  e !== c && r.push(e), i.warn("Copying (nodes) clusterId", e, "nodes", r), r.forEach((o) => {
-    if (t.children(o).length > 0)
-      A(o, t, n, c);
-    else {
-      const l = t.node(o);
-      i.info("cp ", o, " to ", c, " with parent ", e), n.setNode(o, l), c !== t.parent(o) && (i.warn("Setting parent", o, t.parent(o)), n.setParent(o, t.parent(o))), e !== c && o !== e ? (i.debug("Setting parent", o, e), n.setParent(o, e)) : (i.info("In copy ", e, "root", c, "data", t.node(e), c), i.debug(
-        "Not Setting parent for node=",
-        o,
-        "cluster!==rootId",
-        e !== c,
-        "node!==clusterId",
-        o !== e
-      ));
-      const u = t.edges(o);
-      i.debug("Copying Edges", u), u.forEach((a) => {
-        i.info("Edge", a);
-        const m = t.edge(a.v, a.w, a.name);
-        i.info("Edge data", m, c);
-        try {
-          I(a, c) ? (i.info("Copying as ", a.v, a.w, m, a.name), n.setEdge(a.v, a.w, m, a.name), i.info("newGraph edges ", n.edges(), n.edge(n.edges()[0]))) : i.info(
-            "Skipping copy of edge ",
-            a.v,
-            "-->",
-            a.w,
-            " rootId: ",
-            c,
-            " clusterId:",
-            e
-          );
-        } catch (X) {
-          i.error(X);
-        }
-      });
-    }
-    i.debug("Removing node", o), t.removeNode(o);
-  });
-}, "copy"), J = /* @__PURE__ */ w((e, t) => {
-  const n = t.children(e);
-  let c = [...n];
-  for (const r of n)
-    B.set(r, e), c = [...c, ...J(r, t)];
-  return c;
-}, "extractDescendants"), L = /* @__PURE__ */ w((e, t, n) => {
-  const c = e.edges().filter((a) => a.v === t || a.w === t), r = e.edges().filter((a) => a.v === n || a.w === n), o = c.map((a) => ({ v: a.v === t ? n : a.v, w: a.w === t ? t : a.w })), l = r.map((a) => ({ v: a.v, w: a.w }));
-  return o.filter((a) => l.some((m) => a.v === m.v && a.w === m.w));
-}, "findCommonEdges"), p = /* @__PURE__ */ w((e, t, n) => {
-  const c = t.children(e);
-  if (i.trace("Searching children of id ", e, c), c.length < 1)
-    return e;
-  let r;
-  for (const o of c) {
-    const l = p(o, t, n), u = L(t, n, l);
-    if (l)
-      if (u.length > 0)
-        r = l;
-      else
-        return l;
-  }
-  return r;
-}, "findNonClusterChild"), P = /* @__PURE__ */ w((e) => !d.has(e) || !d.get(e).externalConnections ? e : d.has(e) ? d.get(e).id : e, "getAnchorId"), ee = /* @__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: ",
-      p(n, e, n)
-    ), y.set(n, J(n, e)), d.set(n, { id: p(n, e, n), clusterData: e.node(n) }));
-  }), e.nodes().forEach(function(n) {
-    const c = e.children(n), r = e.edges();
-    c.length > 0 ? (i.debug("Cluster identified", n, y), r.forEach((o) => {
-      const l = x(o.v, n), u = x(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 c = d.get(n).id, r = e.parent(c);
-    r !== n && d.has(r) && !d.get(r).externalConnections && (d.get(n).id = r);
-  }
-  e.edges().forEach(function(n) {
-    const c = 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 = P(n.v), o = P(n.w), e.removeEdge(n.v, n.w, n.name), r !== n.v) {
-        const l = e.parent(r);
-        d.get(l).externalConnections = !0, c.fromCluster = n.v;
-      }
-      if (o !== n.w) {
-        const l = e.parent(o);
-        d.get(l).externalConnections = !0, c.toCluster = n.w;
-      }
-      i.warn("Fix Replacing with XXX", r, o, n.name), e.setEdge(r, o, c, n.name);
-    }
-  }), i.warn("Adjusted Graph", h(e)), R(e, 0), i.trace(d);
-}, "adjustClustersAndEdges"), R = /* @__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(), c = !1;
-  for (const r of n) {
-    const o = e.children(r);
-    c = c || o.length > 0;
-  }
-  if (!c) {
-    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 k({
-        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)), A(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 && R(o.graph, t + 1);
-  }
-}, "extractor"), T = /* @__PURE__ */ w((e, t) => {
-  if (t.length === 0)
-    return [];
-  let n = Object.assign([], t);
-  return t.forEach((c) => {
-    const r = e.children(c), o = T(e, r);
-    n = [...n, ...o];
-  }), n;
-}, "sorter"), ne = /* @__PURE__ */ w((e) => T(e, e.children()), "sortNodesByHierarchy"), G = /* @__PURE__ */ w(async (e, t, n, c, 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 a = u.insert("g").attr("class", "clusters"), m = u.insert("g").attr("class", "edgePaths"), X = u.insert("g").attr("class", "edgeLabels"), v = 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: N } = t.graph();
-        s.graph.setGraph({
-          ...s.graph.graph(),
-          ranksep: g + 25,
-          nodesep: N
-        });
-        const b = await G(
-          v,
-          s.graph,
-          n,
-          c,
-          t.node(f),
-          o
-        ), S = b.elem;
-        q(s, S), s.diff = b.diff || 0, i.info(
-          "New compound node after recursive render XAX",
-          f,
-          "width",
-          // node,
-          s.width,
-          "height",
-          s.height
-          // node.x,
-          // node.y
-        ), z(S, 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(p(s.id, t)), d.set(s.id, { id: p(s.id, t), node: s })) : (i.trace("Node - the non recursive path XAX", f, v, t.node(f), l), await K(v, 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 H(X, 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"), W(t), i.info("Graph after layout:", JSON.stringify(h(t)));
-  let D = 0, { subGraphTitleTotalMargin: C } = U(o);
-  return await Promise.all(
-    ne(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 += C, 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, O(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 += C, t.node(s.parentId);
-        const g = s?.padding / 2 || 0, N = s?.labelBBox?.height || 0, b = N - g || 0;
-        i.debug("OffsetY", b, "labelHeight", N, "halfPadding", g), await Q(a, s), d.get(s.id).node = s;
-      } else {
-        const g = t.node(s.parentId);
-        s.y += C / 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
-        ), O(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((S) => S.y += C / 2);
-    const g = t.node(f.v);
-    var N = t.node(f.w);
-    const b = Y(m, s, d, n, g, N, c);
-    j(s, b);
-  }), t.nodes().forEach(function(f) {
-    const s = t.node(f);
-    i.info(f, s.type, s.diff), s.isGroup && (D = s.diff);
-  }), i.warn("Returning from recursive render XAX", u, D), { elem: u, diff: D };
-}, "recursiveRender"), le = /* @__PURE__ */ w(async (e, t) => {
-  const n = new k({
-    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 {};
-  }), c = t.select("g");
-  M(c, e.markers, e.type, e.diagramId), _(), F(), $(), Z(), 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", a = 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(a, {
-        domId: a,
-        id: a,
-        parentId: m.parentId,
-        labelStyle: "",
-        padding: 0,
-        // shape: 'rect',
-        shape: "labelRect",
-        label: "",
-        style: "",
-        width: 10,
-        height: 10
-      }), n.setParent(a, m.parentId);
-      const X = structuredClone(o), v = structuredClone(o), E = structuredClone(o);
-      X.label = "", X.arrowTypeEnd = "none", X.id = l + "-cyclic-special-1", v.arrowTypeStart = "none", v.arrowTypeEnd = "none", v.id = l + "-cyclic-special-mid", E.label = "", m.isGroup && (X.fromCluster = l, E.toCluster = l), E.id = l + "-cyclic-special-2", E.arrowTypeStart = "none", n.setEdge(l, u, X, l + "-cyclic-special-0"), n.setEdge(u, a, v, l + "-cyclic-special-1"), n.setEdge(a, 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))), ee(n), i.warn("Graph after XAX:", JSON.stringify(h(n)));
-  const r = V();
-  await G(
-    c,
-    n,
-    e.type,
-    e.diagramId,
-    void 0,
-    r
-  );
-}, "render");
-export {
-  le as render
-};