@kong-ui-public/documentation 0.7.82 → 0.7.84

package/dist/dagre-P3YPLUS5-Bfaw7Bo9-DPdf44wL.js

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