@ucap-llm/ai-ui 1.1.13 → 1.1.15

package/dagre-OKDRZEBW-CoMQYlxF-96274fb0.mjs

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

package/{diagram-SSKATNLV-1a562cb0.mjs → diagram-SSKATNLV-70f68e72.mjs}

@@ -1,38 +1,38 @@
-import { p as k } from "./chunk-4BMEZGHF-8d9a2e4f.mjs";
-import { C as R, _ as l, s as E, g as I, n as _, o as D, b as F, c as G, l as P, D as y, E as C, t as z, H, K as V } from "./index-f83d4b07.mjs";
-import { p as W } from "./mermaid-parser.core-55f134dc.mjs";
+import { p as k } from "./chunk-4BMEZGHF-705995af.mjs";
+import { c1 as R, bz as l, bB as E, bC as I, bP as D, bQ as F, bD as _, bE as P, bM as z, c2 as y, c3 as b, bW as G, c6 as W, cq as B } from "./index-433e2395.mjs";
+import { p as V } from "./mermaid-parser.core-6eb44241.mjs";
 import "vue";
-import "./_baseUniq-2bcae05e.mjs";
-import "./_basePickBy-12958109.mjs";
-import "./clone-1f18a17f.mjs";
+import "./_baseUniq-8cd7fbc4.mjs";
+import "./_basePickBy-e7598e72.mjs";
+import "./clone-327a1426.mjs";
 var h = {
   showLegend: !0,
   ticks: 5,
   max: null,
   min: 0,
   graticule: "circle"
-}, w = {
+}, C = {
   axes: [],
   curves: [],
   options: h
-}, m = structuredClone(w), B = R.radar, j = /* @__PURE__ */ l(() => y({
-  ...B,
-  ...C().radar
-}), "getConfig"), b = /* @__PURE__ */ l(() => m.axes, "getAxes"), K = /* @__PURE__ */ l(() => m.curves, "getCurves"), N = /* @__PURE__ */ l(() => m.options, "getOptions"), U = /* @__PURE__ */ l((a) => {
+}, m = structuredClone(C), H = R.radar, j = /* @__PURE__ */ l(() => y({
+  ...H,
+  ...b().radar
+}), "getConfig"), w = /* @__PURE__ */ l(() => m.axes, "getAxes"), q = /* @__PURE__ */ l(() => m.curves, "getCurves"), N = /* @__PURE__ */ l(() => m.options, "getOptions"), Q = /* @__PURE__ */ l((a) => {
   m.axes = a.map((t) => ({
     name: t.name,
     label: t.label ?? t.name
   }));
-}, "setAxes"), X = /* @__PURE__ */ l((a) => {
+}, "setAxes"), U = /* @__PURE__ */ l((a) => {
   m.curves = a.map((t) => ({
     name: t.name,
     label: t.label ?? t.name,
-    entries: Y(t.entries)
+    entries: X(t.entries)
   }));
-}, "setCurves"), Y = /* @__PURE__ */ l((a) => {
+}, "setCurves"), X = /* @__PURE__ */ l((a) => {
   if (a[0].axis == null)
     return a.map((e) => e.value);
-  const t = b();
+  const t = w();
   if (t.length === 0)
     throw new Error("Axes must be populated before curves for reference entries");
   return t.map((e) => {
@@ -44,7 +44,7 @@ var h = {
       throw new Error("Missing entry for axis " + e.label);
     return r.value;
   });
-}, "computeCurveEntries"), Z = /* @__PURE__ */ l((a) => {
+}, "computeCurveEntries"), Y = /* @__PURE__ */ l((a) => {
   var e, r, s, o, i;
   const t = a.reduce(
     (n, c) => (n[c.name] = c, n),
@@ -57,34 +57,34 @@ var h = {
     min: ((o = t.min) == null ? void 0 : o.value) ?? h.min,
     graticule: ((i = t.graticule) == null ? void 0 : i.value) ?? h.graticule
   };
-}, "setOptions"), q = /* @__PURE__ */ l(() => {
-  z(), m = structuredClone(w);
+}, "setOptions"), Z = /* @__PURE__ */ l(() => {
+  G(), m = structuredClone(C);
 }, "clear"), $ = {
-  getAxes: b,
-  getCurves: K,
+  getAxes: w,
+  getCurves: q,
   getOptions: N,
-  setAxes: U,
-  setCurves: X,
-  setOptions: Z,
+  setAxes: Q,
+  setCurves: U,
+  setOptions: Y,
   getConfig: j,
-  clear: q,
+  clear: Z,
   setAccTitle: E,
   getAccTitle: I,
-  setDiagramTitle: _,
-  getDiagramTitle: D,
-  getAccDescription: F,
-  setAccDescription: G
+  setDiagramTitle: D,
+  getDiagramTitle: F,
+  getAccDescription: _,
+  setAccDescription: P
 }, J = /* @__PURE__ */ l((a) => {
   k(a, $);
   const { axes: t, curves: e, options: r } = a;
   $.setAxes(t), $.setCurves(e), $.setOptions(r);
-}, "populate"), Q = {
+}, "populate"), K = {
   parse: /* @__PURE__ */ l(async (a) => {
-    const t = await W("radar", a);
-    P.debug(t), J(t);
+    const t = await V("radar", a);
+    z.debug(t), J(t);
   }, "parse")
 }, tt = /* @__PURE__ */ l((a, t, e, r) => {
-  const s = r.db, o = s.getAxes(), i = s.getCurves(), n = s.getOptions(), c = s.getConfig(), d = s.getDiagramTitle(), u = H(t), p = et(u, c), g = n.max ?? Math.max(...i.map((f) => Math.max(...f.entries))), x = n.min, v = Math.min(c.width, c.height) / 2;
+  const s = r.db, o = s.getAxes(), i = s.getCurves(), n = s.getOptions(), c = s.getConfig(), d = s.getDiagramTitle(), u = W(t), p = et(u, c), g = n.max ?? Math.max(...i.map((f) => Math.max(...f.entries))), x = n.min, v = Math.min(c.width, c.height) / 2;
   at(p, o, v, n.ticks, n.graticule), rt(p, o, v, c), M(p, o, i, x, g, n.graticule, c), T(p, i, n.showLegend, c), p.append("text").attr("class", "radarTitle").text(d).attr("x", 0).attr("y", -c.height / 2 - c.marginTop);
 }, "draw"), et = /* @__PURE__ */ l((a, t) => {
   const e = t.width + t.marginLeft + t.marginRight, r = t.height + t.marginTop + t.marginBottom, s = {
@@ -180,7 +180,7 @@ var st = { draw: tt }, nt = /* @__PURE__ */ l((a, t) => {
   }
   return e;
 }, "genIndexStyles"), ot = /* @__PURE__ */ l((a) => {
-  const t = V(), e = C(), r = y(t, e.themeVariables), s = y(r.radar, a);
+  const t = B(), e = b(), r = y(t, e.themeVariables), s = y(r.radar, a);
   return { themeVariables: r, radarOptions: s };
 }, "buildRadarStyleOptions"), it = /* @__PURE__ */ l(({ radar: a } = {}) => {
   const { themeVariables: t, radarOptions: e } = ot(a);
@@ -215,7 +215,7 @@ var st = { draw: tt }, nt = /* @__PURE__ */ l((a, t) => {
 	${nt(t, e)}
 	`;
 }, "styles"), ht = {
-  parser: Q,
+  parser: K,
   db: $,
   renderer: st,
   styles: it