@draftably/editor 0.0.0-stage → 0.1.0

package/dist/chunks/chunk-ZCHMQSOR-BALpdc3g.js

@@ -0,0 +1,451 @@
+import { _ as u, l as o, av as Z, am as I, aw as ee, ax as te, ay as ne, an as x, al as se, az as re, aA as D, aB as S, aC as k, c as ie, L as ae, aD as oe, aE as ce, aF as le, aG as ue, u as de } from "./mermaid.core-DXv6D2Sm.js";
+import { G as R } from "./graph-CKJmgLki.js";
+function T(e, { edgePathsClass: n = "edges edgePaths" } = {}) {
+  const t = e.insert("g").attr("class", "root"), r = t.insert("g").attr("class", "clusters"), s = t.insert("g").attr("class", n), i = t.insert("g").attr("class", "edgeLabels"), c = t.insert("g").attr("class", "nodes");
+  return { clusters: r, edgePaths: s, edgeLabels: i, nodes: c, rootGroups: t };
+}
+u(T, "createLayoutElementGroups");
+async function P(e, n, t) {
+  if (n.label) {
+    const { shapeSvg: r, bbox: s } = await ue(
+      e,
+      t === void 0 ? n : { ...n, width: t }
+    );
+    n.labelBBox = { width: s.width, height: s.height }, r.remove();
+  } else
+    n.labelBBox = { width: 0, height: 0 };
+}
+u(P, "measureGroupLabel");
+async function B(e, n, t) {
+  const r = await I(e, n, t), s = r.node()?.getBBox() ?? { width: 0, height: 0 };
+  return n.width = s.width, n.height = s.height, r;
+}
+u(B, "insertMeasuredNode");
+function M(e, n, t) {
+  let r = e;
+  const s = /* @__PURE__ */ new Set();
+  for (; r; ) {
+    if (r.dir)
+      return r.dir;
+    if (!r.parentId || s.has(r.parentId))
+      break;
+    s.add(r.parentId), r = n.get(r.parentId);
+  }
+  return t;
+}
+u(M, "resolveNodeDir");
+async function A(e, n, t = {}) {
+  const r = new R({
+    multigraph: !0,
+    compound: !0
+  }), s = [...n.edges], i = ie(), c = T(e), { edgeLabels: f, nodes: a } = c, g = /* @__PURE__ */ new Map(), h = new Map(n.nodes.map((d) => [d.id, d])), N = n.direction, w = e.node() != null;
+  await Promise.all(
+    n.nodes.map(async (d) => {
+      if (d.isGroup) {
+        if (w) {
+          const m = t.unwrapGroupLabels && d.labelType !== "markdown";
+          await P(a, d, m ? Number.POSITIVE_INFINITY : void 0);
+        }
+        r.setNode(d.id, { ...d });
+      } else {
+        if (w) {
+          const m = await B(a, d, {
+            config: i,
+            dir: M(d, h, N)
+          });
+          g.set(d.id, m);
+        }
+        r.setNode(d.id, { ...d });
+      }
+    })
+  );
+  for (const d of s)
+    w && D(d) && await k(f, d), r.setEdge(d.start, d.end, { ...d }, d.id), n.edges.some((E) => E.id === d.id) || n.edges.push(d);
+  if (globalThis.mermaidCaptureSizes) {
+    const { captureNodeSizes: d } = await import("./sizeCapture-INFHLROL-CToN3JSu.js");
+    d(e, n);
+  }
+  return {
+    graph: r,
+    groups: c,
+    nodeElements: g
+  };
+}
+u(A, "createGraphWithElements");
+var l = /* @__PURE__ */ new Map(), b = /* @__PURE__ */ new Map(), _ = /* @__PURE__ */ new Map(), fe = /* @__PURE__ */ u(() => {
+  b.clear(), _.clear(), l.clear();
+}, "clear"), v = /* @__PURE__ */ u((e, n) => {
+  const t = b.get(n) || [];
+  return o.trace("In isDescendant", n, " ", e, " = ", t.includes(e)), t.includes(e);
+}, "isDescendant"), ge = /* @__PURE__ */ u((e, n) => {
+  const t = b.get(n) || [];
+  return o.info("Descendants of ", n, " is ", t), o.info("Edge is ", e), e.v === n || e.w === n ? !1 : t ? t.includes(e.v) || v(e.v, n) || v(e.w, n) || t.includes(e.w) : (o.debug("Tilt, ", n, ",not in descendants"), !1);
+}, "edgeInCluster"), G = /* @__PURE__ */ u((e, n, t, r) => {
+  o.debug(
+    "Copying children of ",
+    e,
+    "root",
+    r,
+    "data",
+    n.node(e),
+    r
+  );
+  const s = n.children(e) || [];
+  e !== r && s.push(e), o.debug("Copying (nodes) clusterId", e, "nodes", s), s.forEach((i) => {
+    if (n.children(i).length > 0)
+      G(i, n, t, r);
+    else {
+      const c = n.node(i);
+      o.info("cp ", i, " to ", r, " with parent ", e), t.setNode(i, c), r !== n.parent(i) && (o.debug("Setting parent", i, n.parent(i)), t.setParent(i, n.parent(i))), e !== r && i !== e ? (o.debug("Setting parent", i, e), t.setParent(i, e)) : (o.info("In copy ", e, "root", r, "data", n.node(e), r), o.debug(
+        "Not Setting parent for node=",
+        i,
+        "cluster!==rootId",
+        e !== r,
+        "node!==clusterId",
+        i !== e
+      ));
+      const f = n.edges(i);
+      o.debug("Copying Edges", f), f.forEach((a) => {
+        o.info("Edge", a);
+        const g = n.edge(a.v, a.w, a.name);
+        o.info("Edge data", g, r);
+        try {
+          ge(a, r) ? (o.info("Copying as ", a.v, a.w, g, a.name), t.setEdge(a.v, a.w, g, a.name), o.info("newGraph edges ", t.edges(), t.edge(t.edges()[0]))) : o.info(
+            "Skipping copy of edge ",
+            a.v,
+            "-->",
+            a.w,
+            " rootId: ",
+            r,
+            " clusterId:",
+            e
+          );
+        } catch (h) {
+          o.error(h);
+        }
+      });
+    }
+    o.debug("Removing node", i), n.removeNode(i);
+  });
+}, "copy"), X = /* @__PURE__ */ u((e, n) => {
+  const t = n.children(e);
+  let r = [...t];
+  for (const s of t)
+    _.set(s, e), r = [...r, ...X(s, n)];
+  return r;
+}, "extractDescendants"), be = /* @__PURE__ */ u((e, n, t) => {
+  const r = e.edges().filter((a) => a.v === n || a.w === n), s = e.edges().filter((a) => a.v === t || a.w === t), i = r.map((a) => ({ v: a.v === n ? t : a.v, w: a.w === n ? n : a.w })), c = s.map((a) => ({ v: a.v, w: a.w }));
+  return i.filter((a) => c.some((g) => a.v === g.v && a.w === g.w));
+}, "findCommonEdges"), C = /* @__PURE__ */ u((e, n, t) => {
+  const r = n.children(e);
+  if (o.trace("Searching children of id ", e, r), r.length < 1)
+    return e;
+  let s;
+  for (const i of r) {
+    const c = C(i, n, t), f = be(n, t, c);
+    if (c)
+      if (f.length > 0)
+        s = c;
+      else
+        return c;
+  }
+  return s;
+}, "findNonClusterChild"), L = /* @__PURE__ */ u((e) => !l.has(e) || !l.get(e).externalConnections ? e : l.has(e) ? l.get(e).id : e, "getAnchorId"), Ce = /* @__PURE__ */ u((e, n) => {
+  if (!e || n > 10) {
+    o.debug("Opting out, no graph ");
+    return;
+  } else
+    o.debug("Opting in, graph ");
+  e.nodes().forEach(function(t) {
+    e.children(t).length > 0 && (o.debug(
+      "Cluster identified",
+      t,
+      " Replacement id in edges: ",
+      C(t, e, t)
+    ), b.set(t, X(t, e)), l.set(t, { id: C(t, e, t), clusterData: e.node(t) }));
+  }), e.nodes().forEach(function(t) {
+    const r = e.children(t), s = e.edges();
+    r.length > 0 ? (o.debug("Cluster identified", t, b), s.forEach((i) => {
+      const c = v(i.v, t), f = v(i.w, t);
+      c ^ f && (o.debug("Edge: ", i, " leaves cluster ", t), o.debug("Descendants of XXX ", t, ": ", b.get(t)), l.get(t).externalConnections = !0);
+    })) : o.debug("Not a cluster ", t, b);
+  });
+  for (let t of l.keys()) {
+    const r = l.get(t).id, s = e.parent(r);
+    s !== t && l.has(s) && !l.get(s).externalConnections && (l.get(t).id = s);
+    const i = e.edges().some((c) => c.v === t);
+    if (r && l.get(t)?.externalConnections && i && $(e, r, t)) {
+      const c = he(e, t, e.parent(r));
+      c && (l.get(t).id = c);
+    }
+  }
+  e.edges().forEach(function(t) {
+    const r = e.edge(t);
+    o.debug("Edge " + t.v + " -> " + t.w + ": " + JSON.stringify(t)), o.debug("Edge " + t.v + " -> " + t.w + ": " + JSON.stringify(e.edge(t)));
+    let s = t.v, i = t.w;
+    if (o.debug(
+      "Fix XXX",
+      l,
+      "ids:",
+      t.v,
+      t.w,
+      "Translating: ",
+      l.get(t.v),
+      " --- ",
+      l.get(t.w)
+    ), l.get(t.v) || l.get(t.w)) {
+      if (o.debug("Fixing and trying - removing XXX", t.v, t.w, t.name), s = L(t.v), i = L(t.w), e.removeEdge(t.v, t.w, t.name), s !== t.v) {
+        const c = e.parent(s);
+        l.get(c).externalConnections = !0, r.fromCluster = t.v;
+      }
+      if (i !== t.w) {
+        const c = e.parent(i);
+        l.get(c).externalConnections = !0, r.toCluster = t.w;
+      }
+      o.debug("Fix Replacing with XXX", s, i, t.name), e.setEdge(s, i, r, t.name);
+    }
+  }), O(e, 0), o.trace(l);
+}, "adjustClustersAndEdges"), O = /* @__PURE__ */ u((e, n) => {
+  if (n > 10) {
+    o.error("Bailing out");
+    return;
+  }
+  let t = e.nodes(), r = !1;
+  for (const s of t) {
+    const i = e.children(s);
+    r = r || i.length > 0;
+  }
+  if (!r) {
+    o.debug("Done, no node has children", e.nodes());
+    return;
+  }
+  o.debug("Nodes = ", t, n);
+  for (const s of t)
+    if (o.debug(
+      "Extracting node",
+      s,
+      l,
+      l.has(s) && !l.get(s).externalConnections,
+      !e.parent(s),
+      e.node(s),
+      e.children("D"),
+      " Depth ",
+      n
+    ), !l.has(s))
+      o.debug("Not a cluster", s, n);
+    else if (!l.get(s).externalConnections && e.children(s) && e.children(s).length > 0) {
+      o.debug(
+        "Cluster without external connections, without a parent and with children",
+        s,
+        n
+      );
+      let c = e.graph().rankdir === "TB" ? "LR" : "TB";
+      l.get(s)?.clusterData?.dir && (c = l.get(s).clusterData.dir, o.debug("Fixing dir", l.get(s).clusterData.dir, c));
+      const f = new R({
+        multigraph: !0,
+        compound: !0
+      }).setGraph({
+        rankdir: c,
+        nodesep: 50,
+        ranksep: 50,
+        marginx: 8,
+        marginy: 8
+      }).setDefaultEdgeLabel(function() {
+        return {};
+      });
+      G(s, e, f, s), e.setNode(s, {
+        clusterNode: !0,
+        id: s,
+        clusterData: l.get(s).clusterData,
+        label: l.get(s).label,
+        graph: f
+      });
+    } else
+      o.debug(
+        "Cluster ** ",
+        s,
+        " **not meeting the criteria !externalConnections:",
+        !l.get(s).externalConnections,
+        " no parent: ",
+        !e.parent(s),
+        " children ",
+        e.children(s) && e.children(s).length > 0,
+        e.children("D"),
+        n
+      ), o.debug(l);
+  t = e.nodes(), o.debug("New list of nodes", t);
+  for (const s of t) {
+    const i = e.node(s);
+    o.debug(" Now next level", s, i), i?.clusterNode && O(i.graph, n + 1);
+  }
+}, "extractor"), F = /* @__PURE__ */ u((e, n) => {
+  if (n.length === 0)
+    return [];
+  let t = Object.assign([], n);
+  return n.forEach((r) => {
+    const s = e.children(r), i = F(e, s);
+    t = [...t, ...i];
+  }), t;
+}, "sorter"), Ne = /* @__PURE__ */ u((e) => F(e, e.children()), "sortNodesByHierarchy"), $ = /* @__PURE__ */ u((e, n, t) => {
+  let r = e.parent(n);
+  for (; r && r !== t; ) {
+    const s = l.get(r);
+    if (s && !s.externalConnections)
+      return !0;
+    r = e.parent(r);
+  }
+  return !1;
+}, "isNodeInExtractableCluster"), he = /* @__PURE__ */ u((e, n, t) => {
+  const r = e.children(n) ?? [];
+  for (const s of r) {
+    if (s === t || v(s, t))
+      continue;
+    const i = C(s, e, n);
+    if (i && !$(e, i, n))
+      return i;
+  }
+  return null;
+}, "findSafeAnchorNode");
+function we({
+  prepareLayout: e,
+  measureLayout: n,
+  runLayoutCore: t,
+  paintLayout: r,
+  afterPaint: s,
+  paintOptions: i
+}) {
+  const c = n ?? z;
+  return /* @__PURE__ */ u(async function(a, g, h, N) {
+    const w = g.select("g");
+    (h?.insertMarkers ?? Z)(
+      w,
+      a.markers,
+      a.type,
+      a.diagramId
+    ), j();
+    const d = {
+      element: w,
+      // root SVG <g>
+      helpers: h,
+      // Mermaid helper functions
+      options: N
+      // { algorithm: "elk.layered" }
+    };
+    d.preparedLayout = await e?.(a, d);
+    const m = await c(a, d), E = await t(a, d), p = {
+      ...d,
+      measure: m
+    };
+    r ? await r(a, p, E) : await H(
+      a,
+      p,
+      i
+    ), await s?.(a, p, E);
+  }, "render");
+}
+u(we, "createCommonLayoutRenderer");
+function j() {
+  ee(), te(), ne(), fe();
+}
+u(j, "clearLayoutRenderState");
+async function z(e, { element: n }, t) {
+  return await A(n, e, t);
+}
+u(z, "defaultMeasureLayout");
+async function H(e, n, t = {}) {
+  const { measure: r } = n, { groups: s } = r;
+  for (const c of t.getNodes?.(e, n) ?? e.nodes)
+    t.skipNode?.(c, n) || await J(s, c, n, t);
+  const i = V(e.nodes);
+  for (const c of e.edges)
+    Y(c, t) || await q(s, c, i, e, t, n);
+}
+u(H, "paintLayoutData");
+async function J(e, n, t, r) {
+  n.clusterNode ? x(n) : W(n, t, r) ? await se(e.clusters, n) : x(n);
+}
+u(J, "paintLayoutNode");
+function W(e, n, t) {
+  return e.isGroup === !0 && (t.isCluster?.(e, n) ?? !0);
+}
+u(W, "shouldPaintAsCluster");
+function V(e) {
+  const n = /* @__PURE__ */ new Map();
+  for (const t of e)
+    t?.id && n.set(t.id, t);
+  return n;
+}
+u(V, "buildNodeLookup");
+function Y(e, n) {
+  return e.isLayoutOnly || !!n.skipEdge?.(e);
+}
+u(Y, "shouldSkipPaintEdge");
+async function q(e, n, t, r, s, i) {
+  const c = re(
+    e.edgePaths,
+    { ...n },
+    s.clusterDb ?? /* @__PURE__ */ new Map(),
+    r.type,
+    y(n.start, n, t, i, s),
+    y(n.end, n, t, i, s),
+    r.diagramId,
+    K(n, s),
+    r.layoutAlgorithm
+  );
+  D(n) && (S.has(n.id) || await k(e.edgeLabels, n), Q(n, c));
+}
+u(q, "paintLayoutEdge");
+function y(e, n, t, r, s) {
+  return s.getEdgeNode?.(e, n, r) ?? (e ? t.get(e) ?? {} : {});
+}
+u(y, "getRenderedNode");
+function K(e, n) {
+  return typeof n.skipIntersect == "function" ? n.skipIntersect(e) : n.skipIntersect ?? !1;
+}
+u(K, "shouldSkipIntersect");
+function Q(e, n) {
+  const t = n?.updatedPath ?? n?.originalPath, r = ae(), { subGraphTitleTotalMargin: s } = oe({
+    flowchart: r.flowchart ?? {}
+  });
+  if (e.label) {
+    const i = S.get(e.id), { x: c, y: f } = ce(e, n);
+    i.attr("transform", `translate(${c}, ${f + s / 2})`);
+  }
+  for (const [i, c] of [
+    ["startLeft", e.startLabelLeft],
+    ["startRight", e.startLabelRight],
+    ["endLeft", e.endLabelLeft],
+    ["endRight", e.endLabelRight]
+  ])
+    if (c) {
+      const { x: f, y: a } = U(e, i, t);
+      le.get(e.id)[i].attr("transform", `translate(${f}, ${a})`);
+    }
+}
+u(Q, "positionRenderedEdgeLabel");
+var me = {
+  startLeft: "start_left",
+  startRight: "start_right",
+  endLeft: "end_left",
+  endRight: "end_right"
+};
+function U(e, n, t) {
+  const r = e.terminalLabelCenters?.[n];
+  if (r)
+    return { ...r };
+  if (!t)
+    return { x: e.x, y: e.y };
+  const s = n.startsWith("start") ? e.arrowTypeStart : e.arrowTypeEnd;
+  return de.calcTerminalLabelPosition(s ? 10 : 0, me[n], t);
+}
+u(U, "terminalLabelTranslate");
+export {
+  Ce as a,
+  T as b,
+  we as c,
+  z as d,
+  l as e,
+  C as f,
+  B as i,
+  Ne as s
+};