@kong-ui-public/documentation 1.7.21 → 1.7.22-pr.3646.2d80ddaf3.0

package/dist/dagre-BM42HDAG-qMWMsyLb-DGMrq3i3.js

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