@omg-dev/app 0.5.0 → 0.6.1

package/dist-lib/dagre-VKFMJZFB-BhCjK7XQ.js

@@ -1,346 +0,0 @@
-import { c as O, w as M, a as J, f as P, b as N, s as A } from "./chunk-RYQCIY6F-fkeERzIG.js";
-import { _ as X, am as v, an as D, ao as H, ap as Y, l as d, c as _, aq as W, ar as $, ag as j, as as q, ah as R, af as F, at as z, au as K, av as G } from "./index-JkCQXUYs.js";
-import { G as Q } from "./graph-B68L3K2T.js";
-import { l as U } from "./layout-BGrtsiRL.js";
-var C = /* @__PURE__ */ X((o, s, l) => Math.max(s, Math.min(l, o)), "clamp"), B = /* @__PURE__ */ X((o = "TB") => {
-  switch (o) {
-    case "BT":
-      return "bottom";
-    case "LR":
-      return "right";
-    case "RL":
-      return "left";
-    case "TB":
-    default:
-      return "top";
-  }
-}, "getDefaultSelfLoopSide"), V = /* @__PURE__ */ X((o) => o === "flowchart" || o === "flowchart-v2" || o === "stateDiagram", "shouldMergeSelfLoopSegments"), Z = /* @__PURE__ */ X((o, s, l, y, a) => {
-  const f = [], p = /* @__PURE__ */ new Set();
-  if (l.forEach(({ start: r, end: t }) => {
-    r !== y && p.add(r), t !== y && p.add(t);
-  }), p.forEach((r) => {
-    const t = o.node(r);
-    typeof (t == null ? void 0 : t.x) == "number" && typeof (t == null ? void 0 : t.y) == "number" && f.push(t);
-  }), f.length === 0 && l.forEach(({ edge: r }) => {
-    (r.points ?? []).forEach((t) => {
-      typeof (t == null ? void 0 : t.x) == "number" && typeof (t == null ? void 0 : t.y) == "number" && f.push(t);
-    });
-  }), f.length === 0)
-    return B(a);
-  const c = f.reduce(
-    (r, t) => ({
-      x: r.x + t.x / f.length,
-      y: r.y + t.y / f.length
-    }),
-    { x: 0, y: 0 }
-  ), h = c.x - s.x, i = c.y - s.y;
-  return Math.abs(h) > Math.abs(i) ? h > 0 ? "right" : "left" : Math.abs(i) > 0 ? i > 0 ? "bottom" : "top" : B(a);
-}, "getSelfLoopSide"), ee = /* @__PURE__ */ X((o, s = "top", l = 0, y = 0) => {
-  const a = o.x, f = o.y - l, p = o.width / 2, c = o.height / 2, h = Math.max(36, Math.min(100, o.width * 0.8)), i = C(Math.max(y, o.width * 0.35), 36, h), r = C(Math.min(o.width, o.height) * 0.45, 24, 48);
-  switch (s) {
-    case "bottom": {
-      const t = f + c;
-      return [
-        { x: a - i / 2, y: t },
-        { x: a - i / 2, y: t + r },
-        { x: a + i / 2, y: t + r },
-        { x: a + i / 2, y: t }
-      ];
-    }
-    case "right": {
-      const t = a + p;
-      return [
-        { x: t, y: f - i / 2 },
-        { x: t + r, y: f - i / 2 },
-        { x: t + r, y: f + i / 2 },
-        { x: t, y: f + i / 2 }
-      ];
-    }
-    case "left": {
-      const t = a - p;
-      return [
-        { x: t, y: f - i / 2 },
-        { x: t - r, y: f - i / 2 },
-        { x: t - r, y: f + i / 2 },
-        { x: t, y: f + i / 2 }
-      ];
-    }
-    case "top":
-    default: {
-      const t = f - c;
-      return [
-        { x: a - i / 2, y: t },
-        { x: a - i / 2, y: t - r },
-        { x: a + i / 2, y: t - r },
-        { x: a + i / 2, y: t }
-      ];
-    }
-  }
-}, "getSelfLoopPoints"), te = /* @__PURE__ */ X((o, s, l = "top", y = 0, a = {}) => {
-  const p = o.x, c = o.y - y, h = a.width ?? 0, i = a.height ?? 0;
-  switch (l) {
-    case "bottom":
-      return { x: p, y: Math.max(...s.map((r) => r.y)) + i / 2 + 4 };
-    case "right":
-      return { x: Math.max(...s.map((r) => r.x)) + h / 2 + 4, y: c };
-    case "left":
-      return { x: Math.min(...s.map((r) => r.x)) - h / 2 - 4, y: c };
-    case "top":
-    default:
-      return { x: p, y: Math.min(...s.map((r) => r.y)) - i / 2 - 4 };
-  }
-}, "getSelfLoopLabelPosition"), se = /* @__PURE__ */ X((o, s = 0, { mergeSelfLoops: l = !0 } = {}) => {
-  var p;
-  const y = /* @__PURE__ */ new Map(), a = [], f = (p = o.graph()) == null ? void 0 : p.rankdir;
-  return o.edges().forEach((c) => {
-    const h = o.edge(c);
-    if (l && h.selfLoop) {
-      const i = h.selfLoop.id;
-      y.has(i) || y.set(i, []), y.get(i).push({ edge: h, start: c.v, end: c.w });
-    } else
-      a.push({ edge: h, start: c.v, end: c.w });
-  }), y.forEach((c) => {
-    if (c.length !== 3) {
-      c.forEach((n) => a.push(n));
-      return;
-    }
-    c.sort((n, e) => n.edge.selfLoop.order - e.edge.selfLoop.order);
-    const [h, i, r] = c, t = h.edge.originalEdge ?? i.edge.originalEdge ?? r.edge.originalEdge ?? i.edge, g = o.node(t.start);
-    if (!g) {
-      c.forEach((n) => a.push(n));
-      return;
-    }
-    const S = {
-      width: i.edge.width,
-      height: i.edge.height
-    }, w = Z(o, g, c, t.start, f), b = ee(g, w, s, S.width ?? 0), E = te(g, b, w, s, S), m = {
-      ...i.edge,
-      ...t,
-      id: t.id,
-      points: b,
-      start: t.start,
-      end: t.end,
-      x: E.x,
-      y: E.y,
-      width: S.width,
-      height: S.height,
-      labelStyle: i.edge.labelStyle,
-      fromCluster: h.edge.fromCluster ?? i.edge.fromCluster ?? r.edge.fromCluster,
-      toCluster: h.edge.toCluster ?? i.edge.toCluster ?? r.edge.toCluster
-    };
-    delete m.selfLoop, delete m.originalEdge, a.push({ edge: m, start: m.start, end: m.end });
-  }), a;
-}, "getEdgesToRender"), T = /* @__PURE__ */ X(async (o, s, l, y, a, f) => {
-  d.warn("Graph in recursive render:XAX", M(s), a);
-  const p = s.graph().rankdir;
-  d.trace("Dir in recursive render - dir:", p);
-  const c = o.insert("g").attr("class", "root");
-  s.nodes() ? d.info("Recursive render XXX", s.nodes()) : d.info("No nodes found for", s), s.edges().length > 0 && d.info("Recursive edges", s.edge(s.edges()[0]));
-  const h = c.insert("g").attr("class", "clusters"), i = c.insert("g").attr("class", "edgePaths"), r = c.insert("g").attr("class", "edgeLabels"), t = c.insert("g").attr("class", "nodes"), g = V(l);
-  await Promise.all(
-    s.nodes().map(async function(n) {
-      const e = s.node(n);
-      if (a !== void 0) {
-        const u = JSON.parse(JSON.stringify(a.clusterData));
-        d.trace(
-          `Setting data for parent cluster XXX
- Node.id = `,
-          n,
-          `
- data=`,
-          u.height,
-          `
-Parent cluster`,
-          a.height
-        ), s.setNode(a.id, u), s.parent(n) || (d.trace("Setting parent", n, a.id), s.setParent(n, a.id, u));
-      }
-      if (d.info("(Insert) Node XXX" + n + ": " + JSON.stringify(s.node(n))), e != null && e.clusterNode) {
-        d.info("Cluster identified XBX", n, e.width, s.node(n));
-        const { ranksep: u, nodesep: x } = s.graph();
-        e.graph.setGraph({
-          ...e.graph.graph(),
-          ranksep: u + 25,
-          nodesep: x
-        });
-        const L = await T(
-          t,
-          e.graph,
-          l,
-          y,
-          s.node(n),
-          f
-        ), I = L.elem;
-        W(e, I), e.diff = L.diff || 0, d.info(
-          "New compound node after recursive render XAX",
-          n,
-          "width",
-          // node,
-          e.width,
-          "height",
-          e.height
-          // node.x,
-          // node.y
-        ), $(I, e);
-      } else
-        s.children(n).length > 0 ? (d.trace(
-          "Cluster - the non recursive path XBX",
-          n,
-          e.id,
-          e,
-          e.width,
-          "Graph:",
-          s
-        ), d.trace(P(e.id, s)), N.set(e.id, { id: P(e.id, s), node: e })) : (d.trace("Node - the non recursive path XAX", n, t, s.node(n), p), await j(t, s.node(n), { config: f, dir: p }));
-    })
-  ), await (/* @__PURE__ */ X(async () => {
-    const n = s.edges().map(async function(e) {
-      const u = s.edge(e.v, e.w, e.name);
-      if (d.info("Edge " + e.v + " -> " + e.w + ": " + JSON.stringify(e)), d.info("Edge " + e.v + " -> " + e.w + ": ", e, " ", JSON.stringify(s.edge(e))), d.info(
-        "Fix",
-        N,
-        "ids:",
-        e.v,
-        e.w,
-        "Translating: ",
-        N.get(e.v),
-        N.get(e.w)
-      ), g && u.selfLoop) {
-        if (u.selfLoop.order !== 1)
-          return;
-        const x = u.id;
-        u.id = u.selfLoop.id, await G(r, u), u.id = x;
-        return;
-      }
-      await G(r, u);
-    });
-    await Promise.all(n);
-  }, "processEdges"))(), d.info("Graph before layout:", JSON.stringify(M(s))), d.info("############################################# XXX"), d.info("###                Layout                 ### XXX"), d.info("############################################# XXX"), U(s), d.info("Graph after layout:", JSON.stringify(M(s)));
-  let w = 0, { subGraphTitleTotalMargin: b } = q(f);
-  await Promise.all(
-    A(s).map(async function(n) {
-      var u;
-      const e = s.node(n);
-      if (d.info(
-        "Position XBX => " + n + ": (" + e.x,
-        "," + e.y,
-        ") width: ",
-        e.width,
-        " height: ",
-        e.height
-      ), e != null && e.clusterNode)
-        e.y += b, d.info(
-          "A tainted cluster node XBX1",
-          n,
-          e.id,
-          e.width,
-          e.height,
-          e.x,
-          e.y,
-          s.parent(n)
-        ), N.get(e.id).node = e, R(e);
-      else if (s.children(n).length > 0) {
-        d.info(
-          "A pure cluster node XBX1",
-          n,
-          e.id,
-          e.x,
-          e.y,
-          e.width,
-          e.height,
-          s.parent(n)
-        ), e.height += b, s.node(e.parentId);
-        const x = (e == null ? void 0 : e.padding) / 2 || 0, L = ((u = e == null ? void 0 : e.labelBBox) == null ? void 0 : u.height) || 0, I = L - x || 0;
-        d.debug("OffsetY", I, "labelHeight", L, "halfPadding", x), await F(h, e), N.get(e.id).node = e;
-      } else {
-        const x = s.node(e.parentId);
-        e.y += b / 2, d.info(
-          "A regular node XBX1 - using the padding",
-          e.id,
-          "parent",
-          e.parentId,
-          e.width,
-          e.height,
-          e.x,
-          e.y,
-          "offsetY",
-          e.offsetY,
-          "parent",
-          x,
-          x == null ? void 0 : x.offsetY,
-          e
-        ), R(e);
-      }
-    })
-  );
-  const E = b / 2;
-  return se(s, E, { mergeSelfLoops: g }).forEach(function({ edge: n, start: e, end: u }) {
-    d.info("Edge " + e + " -> " + u + ": " + JSON.stringify(n), n), n.points.forEach((k) => k.y += E);
-    const x = s.node(e), L = s.node(u), I = z(i, n, N, l, x, L, y);
-    K(n, I);
-  }), s.nodes().forEach(function(n) {
-    const e = s.node(n);
-    d.info(n, e.type, e.diff), e.isGroup && (w = e.diff);
-  }), d.warn("Returning from recursive render XAX", c, w), { elem: c, diff: w };
-}, "recursiveRender"), ae = /* @__PURE__ */ X(async (o, s) => {
-  var f, p, c, h, i, r;
-  const l = new Q({
-    multigraph: !0,
-    compound: !0
-  }).setGraph({
-    rankdir: o.direction,
-    nodesep: ((f = o.config) == null ? void 0 : f.nodeSpacing) || ((c = (p = o.config) == null ? void 0 : p.flowchart) == null ? void 0 : c.nodeSpacing) || o.nodeSpacing,
-    ranksep: ((h = o.config) == null ? void 0 : h.rankSpacing) || ((r = (i = o.config) == null ? void 0 : i.flowchart) == null ? void 0 : r.rankSpacing) || o.rankSpacing,
-    marginx: 8,
-    marginy: 8
-  }).setDefaultEdgeLabel(function() {
-    return {};
-  }), y = s.select("g");
-  v(y, o.markers, o.type, o.diagramId), D(), H(), Y(), O(), o.nodes.forEach((t) => {
-    l.setNode(t.id, { ...t }), t.parentId && l.setParent(t.id, t.parentId);
-  }), d.debug("Edges:", o.edges), o.edges.forEach((t) => {
-    if (t.start === t.end) {
-      const g = t.start, S = g + "---" + g + "---1", w = g + "---" + g + "---2", b = l.node(g);
-      l.setNode(S, {
-        domId: S,
-        id: S,
-        parentId: b.parentId,
-        labelStyle: "",
-        label: "",
-        padding: 0,
-        shape: "labelRect",
-        // shape: 'rect',
-        style: "",
-        width: 10,
-        height: 10
-      }), l.setParent(S, b.parentId), l.setNode(w, {
-        domId: w,
-        id: w,
-        parentId: b.parentId,
-        labelStyle: "",
-        padding: 0,
-        // shape: 'rect',
-        shape: "labelRect",
-        label: "",
-        style: "",
-        width: 10,
-        height: 10
-      }), l.setParent(w, b.parentId);
-      const E = structuredClone(t), m = structuredClone(t), n = structuredClone(t), e = structuredClone(t);
-      m.originalEdge = E, m.selfLoop = { id: E.id, order: 0 }, n.originalEdge = E, n.selfLoop = { id: E.id, order: 1 }, e.originalEdge = E, e.selfLoop = { id: E.id, order: 2 }, m.label = "", m.arrowTypeEnd = "none", m.endLabelLeft = "", m.endLabelRight = "", m.startLabelLeft = "", m.id = g + "-cyclic-special-1", n.startLabelRight = "", n.startLabelLeft = "", n.endLabelLeft = "", n.endLabelRight = "", n.arrowTypeStart = "none", n.arrowTypeEnd = "none", n.id = g + "-cyclic-special-mid", e.label = "", e.startLabelRight = "", e.startLabelLeft = "", e.arrowTypeStart = "none", b.isGroup && (m.fromCluster = g, e.toCluster = g), e.id = g + "-cyclic-special-2", e.arrowTypeStart = "none", l.setEdge(g, S, m, g + "-cyclic-special-0"), l.setEdge(S, w, n, g + "-cyclic-special-1"), l.setEdge(w, g, e, g + "-cyclic-special-2");
-    } else
-      l.setEdge(t.start, t.end, { ...t }, t.id);
-  }), d.warn("Graph at first:", JSON.stringify(M(l))), J(l), d.warn("Graph after XAX:", JSON.stringify(M(l)));
-  const a = _();
-  await T(
-    y,
-    l,
-    o.type,
-    o.diagramId,
-    void 0,
-    a
-  );
-}, "render");
-export {
-  se as getEdgesToRender,
-  ae as render
-};