@ucap-llm/ai-ui 1.1.13 → 1.1.15

package/{dagre-OKDRZEBW-74e73dcf.mjs → dagre-OKDRZEBW-9059bb36.mjs}

@@ -1,9 +1,9 @@
-import { _ as X, aq as F, ar as Y, as as _, at as H, l as i, d as V, au as q, av as U, af as $, ak as z, ag as P, ae as K, aw as Q, ax as W, ay as Z } from "./index-f83d4b07.mjs";
-import { G as B } from "./graph-e71f0e3e.mjs";
-import { l as I } from "./layout-b9b9e407.mjs";
-import { i as x } from "./_baseUniq-2bcae05e.mjs";
-import { c as L } from "./clone-1f18a17f.mjs";
-import { m as A } from "./_basePickBy-12958109.mjs";
+import { bz as X, cV as Y, cW as j, cX as H, cY as _, bM as i, bF as V, cZ as $, c_ as z, cG as U, cL as W, cH as P, cF as Z, c$ as q, d0 as K, d1 as Q } from "./index-433e2395.mjs";
+import { G as B } from "./graph-9e073c5f.mjs";
+import { l as L } from "./layout-501d22f0.mjs";
+import { i as x } from "./_baseUniq-8cd7fbc4.mjs";
+import { c as I } from "./clone-327a1426.mjs";
+import { m as A } from "./_basePickBy-e7598e72.mjs";
 import "vue";
 function E(e) {
   var t = {
@@ -15,12 +15,12 @@ function E(e) {
     nodes: ee(e),
     edges: ne(e)
   };
-  return x(e.graph()) || (t.value = L(e.graph())), t;
+  return x(e.graph()) || (t.value = I(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;
+    var n = e.node(t), o = e.parent(t), a = { v: t };
+    return x(n) || (a.value = n), x(o) || (a.parent = o), a;
   });
 }
 function ne(e) {
@@ -29,15 +29,15 @@ function ne(e) {
     return x(t.name) || (o.name = t.name), x(n) || (o.value = n), o;
   });
 }
-var f = /* @__PURE__ */ new Map(), b = /* @__PURE__ */ new Map(), J = /* @__PURE__ */ new Map(), te = /* @__PURE__ */ X(() => {
-  b.clear(), J.clear(), f.clear();
+var f = /* @__PURE__ */ new Map(), b = /* @__PURE__ */ new Map(), G = /* @__PURE__ */ new Map(), te = /* @__PURE__ */ X(() => {
+  b.clear(), G.clear(), f.clear();
 }, "clear"), O = /* @__PURE__ */ X((e, t) => {
   const n = b.get(t) || [];
   return i.trace("In isDescendant", t, " ", e, " = ", n.includes(e)), n.includes(e);
 }, "isDescendant"), se = /* @__PURE__ */ X((e, t) => {
   const n = b.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__ */ X((e, t, n, o) => {
+}, "edgeInCluster"), J = /* @__PURE__ */ X((e, t, n, o) => {
   i.warn(
     "Copying children of ",
     e,
@@ -47,27 +47,27 @@ var f = /* @__PURE__ */ new Map(), b = /* @__PURE__ */ new Map(), J = /* @__PURE
     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);
+  const a = t.children(e) || [];
+  e !== o && a.push(e), i.warn("Copying (nodes) clusterId", e, "nodes", a), a.forEach((c) => {
+    if (t.children(c).length > 0)
+      J(c, 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(
+      const r = t.node(c);
+      i.info("cp ", c, " to ", o, " with parent ", e), n.setNode(c, r), o !== t.parent(c) && (i.warn("Setting parent", c, t.parent(c)), n.setParent(c, t.parent(c))), e !== o && c !== e ? (i.debug("Setting parent", c, e), n.setParent(c, e)) : (i.info("In copy ", e, "root", o, "data", t.node(e), o), i.debug(
         "Not Setting parent for node=",
-        a,
+        c,
         "cluster!==rootId",
         e !== o,
         "node!==clusterId",
-        a !== e
+        c !== e
       ));
-      const u = t.edges(a);
+      const u = t.edges(c);
       i.debug("Copying Edges", u), u.forEach((l) => {
         i.info("Edge", l);
-        const h = t.edge(l.v, l.w, l.name);
-        i.info("Edge data", h, o);
+        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, h, l.name), n.setEdge(l.v, l.w, h, l.name), i.info("newGraph edges ", n.edges(), n.edge(n.edges()[0]))) : i.info(
+          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,
             "-->",
@@ -82,31 +82,31 @@ var f = /* @__PURE__ */ new Map(), b = /* @__PURE__ */ new Map(), J = /* @__PURE
         }
       });
     }
-    i.debug("Removing node", a), t.removeNode(a);
+    i.debug("Removing node", c), t.removeNode(c);
   });
 }, "copy"), R = /* @__PURE__ */ X((e, t) => {
   const n = t.children(e);
   let o = [...n];
-  for (const c of n)
-    J.set(c, e), o = [...o, ...R(c, t)];
+  for (const a of n)
+    G.set(a, e), o = [...o, ...R(a, t)];
   return o;
 }, "extractDescendants"), ie = /* @__PURE__ */ X((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((h) => l.v === h.v && l.w === h.w));
+  const o = e.edges().filter((l) => l.v === t || l.w === t), a = e.edges().filter((l) => l.v === n || l.w === n), c = o.map((l) => ({ v: l.v === t ? n : l.v, w: l.w === t ? t : l.w })), r = a.map((l) => ({ v: l.v, w: l.w }));
+  return c.filter((l) => r.some((v) => l.v === v.v && l.w === v.w));
 }, "findCommonEdges"), D = /* @__PURE__ */ X((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);
+  let a;
+  for (const c of o) {
+    const r = D(c, t, n), u = ie(t, n, r);
     if (r)
       if (u.length > 0)
-        c = r;
+        a = r;
       else
         return r;
   }
-  return c;
+  return a;
 }, "findNonClusterChild"), k = /* @__PURE__ */ X((e) => !f.has(e) || !f.get(e).externalConnections ? e : f.has(e) ? f.get(e).id : e, "getAnchorId"), re = /* @__PURE__ */ X((e, t) => {
   if (!e || t > 10) {
     i.debug("Opting out, no graph ");
@@ -121,20 +121,20 @@ var f = /* @__PURE__ */ new Map(), b = /* @__PURE__ */ new Map(), J = /* @__PURE
       D(n, e, n)
     ), b.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, b), 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, ": ", b.get(n)), f.get(n).externalConnections = !0);
+    const o = e.children(n), a = e.edges();
+    o.length > 0 ? (i.debug("Cluster identified", n, b), a.forEach((c) => {
+      const r = O(c.v, n), u = O(c.w, n);
+      r ^ u && (i.warn("Edge: ", c, " leaves cluster ", n), i.warn("Descendants of XXX ", n, ": ", b.get(n)), f.get(n).externalConnections = !0);
     })) : i.debug("Not a cluster ", n, b);
   });
   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);
+    const o = f.get(n).id, a = e.parent(o);
+    a !== n && f.has(a) && !f.get(a).externalConnections && (f.get(n).id = a);
   }
   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;
+    let a = n.v, c = n.w;
     if (i.warn(
       "Fix XXX",
       f,
@@ -146,19 +146,19 @@ var f = /* @__PURE__ */ new Map(), b = /* @__PURE__ */ new Map(), J = /* @__PURE
       " --- ",
       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);
+      if (i.warn("Fixing and trying - removing XXX", n.v, n.w, n.name), a = k(n.v), c = k(n.w), e.removeEdge(n.v, n.w, n.name), a !== n.v) {
+        const r = e.parent(a);
         f.get(r).externalConnections = !0, o.fromCluster = n.v;
       }
-      if (a !== n.w) {
-        const r = e.parent(a);
+      if (c !== n.w) {
+        const r = e.parent(c);
         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("Fix Replacing with XXX", a, c, n.name), e.setEdge(a, c, o, n.name);
     }
   }), i.warn("Adjusted Graph", E(e)), T(e, 0), i.trace(f);
 }, "adjustClustersAndEdges"), T = /* @__PURE__ */ X((e, t) => {
-  var c, a;
+  var a, c;
   if (i.warn("extractor - ", t, E(e), e.children("D")), t > 10) {
     i.error("Bailing out");
     return;
@@ -193,8 +193,8 @@ var f = /* @__PURE__ */ new Map(), b = /* @__PURE__ */ new Map(), J = /* @__PURE
         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 h = new B({
+      (c = (a = f.get(r)) == null ? void 0 : a.clusterData) != null && c.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({
@@ -206,13 +206,13 @@ var f = /* @__PURE__ */ new Map(), b = /* @__PURE__ */ new Map(), J = /* @__PURE
       }).setDefaultEdgeLabel(function() {
         return {};
       });
-      i.warn("Old graph before copy", E(e)), G(r, e, h, r), e.setNode(r, {
+      i.warn("Old graph before copy", E(e)), J(r, e, v, r), e.setNode(r, {
         clusterNode: !0,
         id: r,
         clusterData: f.get(r).clusterData,
         label: f.get(r).label,
-        graph: h
-      }), i.warn("New graph after copy node: (", r, ")", E(h)), i.debug("Old graph after copy", E(e));
+        graph: v
+      }), i.warn("New graph after copy node: (", r, ")", E(v)), i.debug("Old graph after copy", E(e));
     } else
       i.warn(
         "Cluster ** ",
@@ -236,21 +236,21 @@ var f = /* @__PURE__ */ new Map(), b = /* @__PURE__ */ new Map(), J = /* @__PURE
     return [];
   let n = Object.assign([], t);
   return t.forEach((o) => {
-    const c = e.children(o), a = M(e, c);
-    n = [...n, ...a];
+    const a = e.children(o), c = M(e, a);
+    n = [...n, ...c];
   }), n;
-}, "sorter"), oe = /* @__PURE__ */ X((e) => M(e, e.children()), "sortNodesByHierarchy"), j = /* @__PURE__ */ X(async (e, t, n, o, c, a) => {
-  i.warn("Graph in recursive render:XAX", E(t), c);
+}, "sorter"), oe = /* @__PURE__ */ X((e) => M(e, e.children()), "sortNodesByHierarchy"), F = /* @__PURE__ */ X(async (e, t, n, o, a, c) => {
+  i.warn("Graph in recursive render:XAX", E(t), a);
   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"), h = u.insert("g").attr("class", "edgePaths"), C = u.insert("g").attr("class", "edgeLabels"), g = u.insert("g").attr("class", "nodes");
+  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));
+      if (a !== void 0) {
+        const w = JSON.parse(JSON.stringify(a.clusterData));
         i.trace(
           `Setting data for parent cluster XXX
  Node.id = `,
@@ -260,8 +260,8 @@ var f = /* @__PURE__ */ new Map(), b = /* @__PURE__ */ new Map(), J = /* @__PURE
           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));
+          a.height
+        ), t.setNode(a.id, w), t.parent(d) || (i.trace("Setting parent", d, a.id), t.setParent(d, a.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));
@@ -271,15 +271,15 @@ Parent cluster`,
           ranksep: w + 25,
           nodesep: m
         });
-        const N = await j(
+        const N = await F(
           g,
           s.graph,
           n,
           o,
           t.node(d),
-          a
+          c
         ), S = N.elem;
-        q(s, S), s.diff = N.diff || 0, i.info(
+        $(s, S), s.diff = N.diff || 0, i.info(
           "New compound node after recursive render XAX",
           d,
           "width",
@@ -289,7 +289,7 @@ Parent cluster`,
           s.height
           // node.x,
           // node.y
-        ), U(S, s);
+        ), z(S, s);
       } else
         t.children(d).length > 0 ? (i.trace(
           "Cluster - the non recursive path XBX",
@@ -299,7 +299,7 @@ Parent cluster`,
           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 $(g, t.node(d), { config: a, dir: r }));
+        ), 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 U(g, t.node(d), { config: c, dir: r }));
     })
   ), await (/* @__PURE__ */ X(async () => {
     const d = t.edges().map(async function(s) {
@@ -313,11 +313,11 @@ Parent cluster`,
         "Translating: ",
         f.get(s.v),
         f.get(s.w)
-      ), await Z(C, w);
+      ), await Q(C, w);
     });
     await Promise.all(d);
-  }, "processEdges"))(), i.info("Graph before layout:", JSON.stringify(E(t))), i.info("############################################# XXX"), i.info("###                Layout                 ### XXX"), i.info("############################################# XXX"), I(t), i.info("Graph after layout:", JSON.stringify(E(t)));
-  let p = 0, { subGraphTitleTotalMargin: y } = z(a);
+  }, "processEdges"))(), i.info("Graph before layout:", JSON.stringify(E(t))), i.info("############################################# XXX"), i.info("###                Layout                 ### XXX"), i.info("############################################# XXX"), L(t), i.info("Graph after layout:", JSON.stringify(E(t)));
+  let p = 0, { subGraphTitleTotalMargin: y } = W(c);
   return await Promise.all(
     oe(t).map(async function(d) {
       var w;
@@ -352,7 +352,7 @@ Parent cluster`,
           t.parent(d)
         ), s.height += y, t.node(s.parentId);
         const m = (s == null ? void 0 : s.padding) / 2 || 0, N = ((w = s == null ? void 0 : s.labelBBox) == null ? void 0 : w.height) || 0, S = N - m || 0;
-        i.debug("OffsetY", S, "labelHeight", N, "halfPadding", m), await K(l, s), f.get(s.id).node = s;
+        i.debug("OffsetY", S, "labelHeight", N, "halfPadding", m), await Z(l, s), f.get(s.id).node = s;
       } else {
         const m = t.node(s.parentId);
         s.y += y / 2, i.info(
@@ -378,31 +378,31 @@ Parent cluster`,
     i.info("Edge " + d.v + " -> " + d.w + ": " + JSON.stringify(s), s), s.points.forEach((S) => S.y += y / 2);
     const w = t.node(d.v);
     var m = t.node(d.w);
-    const N = Q(h, s, f, n, w, m, o);
-    W(s, N);
+    const N = q(v, s, f, n, w, m, o);
+    K(s, N);
   }), t.nodes().forEach(function(d) {
     const s = t.node(d);
     i.info(d, s.type, s.diff), s.isGroup && (p = s.diff);
   }), i.warn("Returning from recursive render XAX", u, p), { elem: u, diff: p };
 }, "recursiveRender"), we = /* @__PURE__ */ X(async (e, t) => {
-  var a, r, u, l, h, C;
+  var c, 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 = (h = e.config) == null ? void 0 : h.flowchart) == null ? void 0 : C.rankSpacing) || e.rankSpacing,
+    nodesep: ((c = e.config) == null ? void 0 : c.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) => {
+  Y(o, e.markers, e.type, e.diagramId), j(), 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 v = g.start, p = v + "---" + v + "---1", y = v + "---" + v + "---2", d = n.node(v);
+      const h = g.start, p = h + "---" + h + "---1", y = h + "---" + h + "---2", d = n.node(h);
       n.setNode(p, {
         domId: p,
         id: p,
@@ -429,18 +429,18 @@ Parent cluster`,
         height: 10
       }), n.setParent(y, d.parentId);
       const s = structuredClone(g), w = structuredClone(g), m = structuredClone(g);
-      s.label = "", s.arrowTypeEnd = "none", s.id = v + "-cyclic-special-1", w.arrowTypeStart = "none", w.arrowTypeEnd = "none", w.id = v + "-cyclic-special-mid", m.label = "", d.isGroup && (s.fromCluster = v, m.toCluster = v), m.id = v + "-cyclic-special-2", m.arrowTypeStart = "none", n.setEdge(v, p, s, v + "-cyclic-special-0"), n.setEdge(p, y, w, v + "-cyclic-special-1"), n.setEdge(y, v, m, v + "-cyc<lic-special-2");
+      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, p, s, h + "-cyclic-special-0"), n.setEdge(p, y, w, h + "-cyclic-special-1"), n.setEdge(y, h, m, h + "-cyc<lic-special-2");
     } else
       n.setEdge(g.start, g.end, { ...g }, g.id);
   }), i.warn("Graph at first:", JSON.stringify(E(n))), re(n), i.warn("Graph after XAX:", JSON.stringify(E(n)));
-  const c = V();
-  await j(
+  const a = V();
+  await F(
     o,
     n,
     e.type,
     e.diagramId,
     void 0,
-    c
+    a
   );
 }, "render");
 export {