@altimateai/ui-components 0.0.79 → 0.0.80

package/dist/dagre-6UL2VRFP.js

@@ -1,447 +0,0 @@
-import { a1 as b, bh as F, bi as Y, bj as H, bk as _, ad as i, a7 as V, bl as U, bm as $, b6 as q, bb as z, b7 as P, b5 as K, bn as Q, bo as W, bp as Z } from "./CoachForm.js";
-import { G as B } from "./graph.js";
-import { l as I } from "./layout.js";
-import { i as x } from "./_baseUniq.js";
-import { c as L } from "./clone.js";
-import { m as A } from "./_basePickBy.js";
-function p(e) {
-  var t = {
-    options: {
-      directed: e.isDirected(),
-      multigraph: e.isMultigraph(),
-      compound: e.isCompound()
-    },
-    nodes: ee(e),
-    edges: ne(e)
-  };
-  return x(e.graph()) || (t.value = L(e.graph())), t;
-}
-function ee(e) {
-  return A(e.nodes(), function(t) {
-    var n = e.node(t), o = e.parent(t), c = { v: t };
-    return x(n) || (c.value = n), x(o) || (c.parent = o), c;
-  });
-}
-function ne(e) {
-  return A(e.edges(), function(t) {
-    var n = e.edge(t), o = { v: t.v, w: t.w };
-    return x(t.name) || (o.name = t.name), x(n) || (o.value = n), o;
-  });
-}
-var f = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), J = /* @__PURE__ */ new Map(), te = /* @__PURE__ */ b(() => {
-  N.clear(), J.clear(), f.clear();
-}, "clear"), O = /* @__PURE__ */ b((e, t) => {
-  const n = N.get(t) || [];
-  return i.trace("In isDescendant", t, " ", e, " = ", n.includes(e)), n.includes(e);
-}, "isDescendant"), se = /* @__PURE__ */ b((e, t) => {
-  const n = N.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) || O(e.v, t) || O(e.w, t) || n.includes(e.w) : (i.debug("Tilt, ", t, ",not in descendants"), !1);
-}, "edgeInCluster"), G = /* @__PURE__ */ b((e, t, n, o) => {
-  i.warn(
-    "Copying children of ",
-    e,
-    "root",
-    o,
-    "data",
-    t.node(e),
-    o
-  );
-  const c = t.children(e) || [];
-  e !== o && c.push(e), i.warn("Copying (nodes) clusterId", e, "nodes", c), c.forEach((a) => {
-    if (t.children(a).length > 0)
-      G(a, t, n, o);
-    else {
-      const r = t.node(a);
-      i.info("cp ", a, " to ", o, " with parent ", e), n.setNode(a, r), o !== t.parent(a) && (i.warn("Setting parent", a, t.parent(a)), n.setParent(a, t.parent(a))), e !== o && a !== e ? (i.debug("Setting parent", a, e), n.setParent(a, e)) : (i.info("In copy ", e, "root", o, "data", t.node(e), o), i.debug(
-        "Not Setting parent for node=",
-        a,
-        "cluster!==rootId",
-        e !== o,
-        "node!==clusterId",
-        a !== e
-      ));
-      const u = t.edges(a);
-      i.debug("Copying Edges", u), u.forEach((l) => {
-        i.info("Edge", l);
-        const v = t.edge(l.v, l.w, l.name);
-        i.info("Edge data", v, o);
-        try {
-          se(l, o) ? (i.info("Copying as ", l.v, l.w, v, l.name), n.setEdge(l.v, l.w, v, l.name), i.info("newGraph edges ", n.edges(), n.edge(n.edges()[0]))) : i.info(
-            "Skipping copy of edge ",
-            l.v,
-            "-->",
-            l.w,
-            " rootId: ",
-            o,
-            " clusterId:",
-            e
-          );
-        } catch (C) {
-          i.error(C);
-        }
-      });
-    }
-    i.debug("Removing node", a), t.removeNode(a);
-  });
-}, "copy"), R = /* @__PURE__ */ b((e, t) => {
-  const n = t.children(e);
-  let o = [...n];
-  for (const c of n)
-    J.set(c, e), o = [...o, ...R(c, t)];
-  return o;
-}, "extractDescendants"), ie = /* @__PURE__ */ b((e, t, n) => {
-  const o = e.edges().filter((l) => l.v === t || l.w === t), c = e.edges().filter((l) => l.v === n || l.w === n), a = o.map((l) => ({ v: l.v === t ? n : l.v, w: l.w === t ? t : l.w })), r = c.map((l) => ({ v: l.v, w: l.w }));
-  return a.filter((l) => r.some((v) => l.v === v.v && l.w === v.w));
-}, "findCommonEdges"), D = /* @__PURE__ */ b((e, t, n) => {
-  const o = t.children(e);
-  if (i.trace("Searching children of id ", e, o), o.length < 1)
-    return e;
-  let c;
-  for (const a of o) {
-    const r = D(a, t, n), u = ie(t, n, r);
-    if (r)
-      if (u.length > 0)
-        c = r;
-      else
-        return r;
-  }
-  return c;
-}, "findNonClusterChild"), k = /* @__PURE__ */ b((e) => !f.has(e) || !f.get(e).externalConnections ? e : f.has(e) ? f.get(e).id : e, "getAnchorId"), re = /* @__PURE__ */ b((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: ",
-      D(n, e, n)
-    ), N.set(n, R(n, e)), f.set(n, { id: D(n, e, n), clusterData: e.node(n) }));
-  }), e.nodes().forEach(function(n) {
-    const o = e.children(n), c = e.edges();
-    o.length > 0 ? (i.debug("Cluster identified", n, N), c.forEach((a) => {
-      const r = O(a.v, n), u = O(a.w, n);
-      r ^ u && (i.warn("Edge: ", a, " leaves cluster ", n), i.warn("Descendants of XXX ", n, ": ", N.get(n)), f.get(n).externalConnections = !0);
-    })) : i.debug("Not a cluster ", n, N);
-  });
-  for (let n of f.keys()) {
-    const o = f.get(n).id, c = e.parent(o);
-    c !== n && f.has(c) && !f.get(c).externalConnections && (f.get(n).id = c);
-  }
-  e.edges().forEach(function(n) {
-    const o = 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 c = n.v, a = n.w;
-    if (i.warn(
-      "Fix XXX",
-      f,
-      "ids:",
-      n.v,
-      n.w,
-      "Translating: ",
-      f.get(n.v),
-      " --- ",
-      f.get(n.w)
-    ), f.get(n.v) || f.get(n.w)) {
-      if (i.warn("Fixing and trying - removing XXX", n.v, n.w, n.name), c = k(n.v), a = k(n.w), e.removeEdge(n.v, n.w, n.name), c !== n.v) {
-        const r = e.parent(c);
-        f.get(r).externalConnections = !0, o.fromCluster = n.v;
-      }
-      if (a !== n.w) {
-        const r = e.parent(a);
-        f.get(r).externalConnections = !0, o.toCluster = n.w;
-      }
-      i.warn("Fix Replacing with XXX", c, a, n.name), e.setEdge(c, a, o, n.name);
-    }
-  }), i.warn("Adjusted Graph", p(e)), T(e, 0), i.trace(f);
-}, "adjustClustersAndEdges"), T = /* @__PURE__ */ b((e, t) => {
-  var c, a;
-  if (i.warn("extractor - ", t, p(e), e.children("D")), t > 10) {
-    i.error("Bailing out");
-    return;
-  }
-  let n = e.nodes(), o = !1;
-  for (const r of n) {
-    const u = e.children(r);
-    o = o || u.length > 0;
-  }
-  if (!o) {
-    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,
-      f,
-      f.has(r) && !f.get(r).externalConnections,
-      !e.parent(r),
-      e.node(r),
-      e.children("D"),
-      " Depth ",
-      t
-    ), !f.has(r))
-      i.debug("Not a cluster", r, t);
-    else if (!f.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";
-      (a = (c = f.get(r)) == null ? void 0 : c.clusterData) != null && a.dir && (l = f.get(r).clusterData.dir, i.warn("Fixing dir", f.get(r).clusterData.dir, l));
-      const v = new B({
-        multigraph: !0,
-        compound: !0
-      }).setGraph({
-        rankdir: l,
-        nodesep: 50,
-        ranksep: 50,
-        marginx: 8,
-        marginy: 8
-      }).setDefaultEdgeLabel(function() {
-        return {};
-      });
-      i.warn("Old graph before copy", p(e)), G(r, e, v, r), e.setNode(r, {
-        clusterNode: !0,
-        id: r,
-        clusterData: f.get(r).clusterData,
-        label: f.get(r).label,
-        graph: v
-      }), i.warn("New graph after copy node: (", r, ")", p(v)), i.debug("Old graph after copy", p(e));
-    } else
-      i.warn(
-        "Cluster ** ",
-        r,
-        " **not meeting the criteria !externalConnections:",
-        !f.get(r).externalConnections,
-        " no parent: ",
-        !e.parent(r),
-        " children ",
-        e.children(r) && e.children(r).length > 0,
-        e.children("D"),
-        t
-      ), i.debug(f);
-  n = e.nodes(), i.warn("New list of nodes", n);
-  for (const r of n) {
-    const u = e.node(r);
-    i.warn(" Now next level", r, u), u != null && u.clusterNode && T(u.graph, t + 1);
-  }
-}, "extractor"), M = /* @__PURE__ */ b((e, t) => {
-  if (t.length === 0)
-    return [];
-  let n = Object.assign([], t);
-  return t.forEach((o) => {
-    const c = e.children(o), a = M(e, c);
-    n = [...n, ...a];
-  }), n;
-}, "sorter"), oe = /* @__PURE__ */ b((e) => M(e, e.children()), "sortNodesByHierarchy"), j = /* @__PURE__ */ b(async (e, t, n, o, c, a) => {
-  i.warn("Graph in recursive render:XAX", p(t), c);
-  const r = t.graph().rankdir;
-  i.trace("Dir in recursive render - dir:", r);
-  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 l = u.insert("g").attr("class", "clusters"), v = u.insert("g").attr("class", "edgePaths"), C = u.insert("g").attr("class", "edgeLabels"), g = u.insert("g").attr("class", "nodes");
-  await Promise.all(
-    t.nodes().map(async function(d) {
-      const s = t.node(d);
-      if (c !== void 0) {
-        const w = JSON.parse(JSON.stringify(c.clusterData));
-        i.trace(
-          `Setting data for parent cluster XXX
- Node.id = `,
-          d,
-          `
- data=`,
-          w.height,
-          `
-Parent cluster`,
-          c.height
-        ), t.setNode(c.id, w), t.parent(d) || (i.trace("Setting parent", d, c.id), t.setParent(d, c.id, w));
-      }
-      if (i.info("(Insert) Node XXX" + d + ": " + JSON.stringify(t.node(d))), s != null && s.clusterNode) {
-        i.info("Cluster identified XBX", d, s.width, t.node(d));
-        const { ranksep: w, nodesep: m } = t.graph();
-        s.graph.setGraph({
-          ...s.graph.graph(),
-          ranksep: w + 25,
-          nodesep: m
-        });
-        const E = await j(
-          g,
-          s.graph,
-          n,
-          o,
-          t.node(d),
-          a
-        ), S = E.elem;
-        U(s, S), s.diff = E.diff || 0, i.info(
-          "New compound node after recursive render XAX",
-          d,
-          "width",
-          // node,
-          s.width,
-          "height",
-          s.height
-          // node.x,
-          // node.y
-        ), $(S, s);
-      } else
-        t.children(d).length > 0 ? (i.trace(
-          "Cluster - the non recursive path XBX",
-          d,
-          s.id,
-          s,
-          s.width,
-          "Graph:",
-          t
-        ), i.trace(D(s.id, t)), f.set(s.id, { id: D(s.id, t), node: s })) : (i.trace("Node - the non recursive path XAX", d, g, t.node(d), r), await q(g, t.node(d), { config: a, dir: r }));
-    })
-  ), await (/* @__PURE__ */ b(async () => {
-    const d = t.edges().map(async function(s) {
-      const w = 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",
-        f,
-        "ids:",
-        s.v,
-        s.w,
-        "Translating: ",
-        f.get(s.v),
-        f.get(s.w)
-      ), await Z(C, w);
-    });
-    await Promise.all(d);
-  }, "processEdges"))(), i.info("Graph before layout:", JSON.stringify(p(t))), i.info("############################################# XXX"), i.info("###                Layout                 ### XXX"), i.info("############################################# XXX"), I(t), i.info("Graph after layout:", JSON.stringify(p(t)));
-  let y = 0, { subGraphTitleTotalMargin: X } = z(a);
-  return await Promise.all(
-    oe(t).map(async function(d) {
-      var w;
-      const s = t.node(d);
-      if (i.info(
-        "Position XBX => " + d + ": (" + s.x,
-        "," + s.y,
-        ") width: ",
-        s.width,
-        " height: ",
-        s.height
-      ), s != null && s.clusterNode)
-        s.y += X, i.info(
-          "A tainted cluster node XBX1",
-          d,
-          s.id,
-          s.width,
-          s.height,
-          s.x,
-          s.y,
-          t.parent(d)
-        ), f.get(s.id).node = s, P(s);
-      else if (t.children(d).length > 0) {
-        i.info(
-          "A pure cluster node XBX1",
-          d,
-          s.id,
-          s.x,
-          s.y,
-          s.width,
-          s.height,
-          t.parent(d)
-        ), s.height += X, t.node(s.parentId);
-        const m = (s == null ? void 0 : s.padding) / 2 || 0, E = ((w = s == null ? void 0 : s.labelBBox) == null ? void 0 : w.height) || 0, S = E - m || 0;
-        i.debug("OffsetY", S, "labelHeight", E, "halfPadding", m), await K(l, s), f.get(s.id).node = s;
-      } else {
-        const m = t.node(s.parentId);
-        s.y += X / 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",
-          m,
-          m == null ? void 0 : m.offsetY,
-          s
-        ), P(s);
-      }
-    })
-  ), t.edges().forEach(function(d) {
-    const s = t.edge(d);
-    i.info("Edge " + d.v + " -> " + d.w + ": " + JSON.stringify(s), s), s.points.forEach((S) => S.y += X / 2);
-    const w = t.node(d.v);
-    var m = t.node(d.w);
-    const E = Q(v, s, f, n, w, m, o);
-    W(s, E);
-  }), t.nodes().forEach(function(d) {
-    const s = t.node(d);
-    i.info(d, s.type, s.diff), s.isGroup && (y = s.diff);
-  }), i.warn("Returning from recursive render XAX", u, y), { elem: u, diff: y };
-}, "recursiveRender"), ge = /* @__PURE__ */ b(async (e, t) => {
-  var a, r, u, l, v, C;
-  const n = new B({
-    multigraph: !0,
-    compound: !0
-  }).setGraph({
-    rankdir: e.direction,
-    nodesep: ((a = e.config) == null ? void 0 : a.nodeSpacing) || ((u = (r = e.config) == null ? void 0 : r.flowchart) == null ? void 0 : u.nodeSpacing) || e.nodeSpacing,
-    ranksep: ((l = e.config) == null ? void 0 : l.rankSpacing) || ((C = (v = e.config) == null ? void 0 : v.flowchart) == null ? void 0 : C.rankSpacing) || e.rankSpacing,
-    marginx: 8,
-    marginy: 8
-  }).setDefaultEdgeLabel(function() {
-    return {};
-  }), o = t.select("g");
-  F(o, e.markers, e.type, e.diagramId), Y(), H(), _(), te(), e.nodes.forEach((g) => {
-    n.setNode(g.id, { ...g }), g.parentId && n.setParent(g.id, g.parentId);
-  }), i.debug("Edges:", e.edges), e.edges.forEach((g) => {
-    if (g.start === g.end) {
-      const h = g.start, y = h + "---" + h + "---1", X = h + "---" + h + "---2", d = n.node(h);
-      n.setNode(y, {
-        domId: y,
-        id: y,
-        parentId: d.parentId,
-        labelStyle: "",
-        label: "",
-        padding: 0,
-        shape: "labelRect",
-        // shape: 'rect',
-        style: "",
-        width: 10,
-        height: 10
-      }), n.setParent(y, d.parentId), n.setNode(X, {
-        domId: X,
-        id: X,
-        parentId: d.parentId,
-        labelStyle: "",
-        padding: 0,
-        // shape: 'rect',
-        shape: "labelRect",
-        label: "",
-        style: "",
-        width: 10,
-        height: 10
-      }), n.setParent(X, d.parentId);
-      const s = structuredClone(g), w = structuredClone(g), m = structuredClone(g);
-      s.label = "", s.arrowTypeEnd = "none", s.id = h + "-cyclic-special-1", w.arrowTypeStart = "none", w.arrowTypeEnd = "none", w.id = h + "-cyclic-special-mid", m.label = "", d.isGroup && (s.fromCluster = h, m.toCluster = h), m.id = h + "-cyclic-special-2", m.arrowTypeStart = "none", n.setEdge(h, y, s, h + "-cyclic-special-0"), n.setEdge(y, X, w, h + "-cyclic-special-1"), n.setEdge(X, h, m, h + "-cyc<lic-special-2");
-    } else
-      n.setEdge(g.start, g.end, { ...g }, g.id);
-  }), i.warn("Graph at first:", JSON.stringify(p(n))), re(n), i.warn("Graph after XAX:", JSON.stringify(p(n)));
-  const c = V();
-  await j(
-    o,
-    n,
-    e.type,
-    e.diagramId,
-    void 0,
-    c
-  );
-}, "render");
-export {
-  ge as render
-};