@kong-ui-public/documentation 0.8.27-pr.2132.c7fba69a4.0 → 0.8.27

package/dist/dagre-4EVJKHTY-DMTVcQfE-C1Tr0EYY.js

@@ -0,0 +1,447 @@
+import { _ as w, m as L, c as M, a as j, b as F, l as t, g as Y, u as _, s as H, i as $, d as q, e as z, p as D, f as K, h as Q, j as U } from "./index-B_RqyDIa.js";
+import { L as k } from "./graph-_eClejaU-DigE4Bf5.js";
+import { o as V } from "./layout-DfjmtgNY-Bw6LFOXt.js";
+import { E as x } from "./_baseUniq-DefQzZRT-CTix3bMY.js";
+import { a as W } from "./clone-CmU1hwye-Lu5-ol5h.js";
+import { g as G } from "./_basePickBy-DF_KwdVi-HVXnmpaQ.js";
+function X(e) {
+  var n = {
+    options: {
+      directed: e.isDirected(),
+      multigraph: e.isMultigraph(),
+      compound: e.isCompound()
+    },
+    nodes: Z(e),
+    edges: ee(e)
+  };
+  return x(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 x(r) || (d.value = r), x(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 x(n.name) || (s.name = n.name), x(r) || (s.value = r), s;
+  });
+}
+var u = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), B = /* @__PURE__ */ new Map(), ne = /* @__PURE__ */ w(() => {
+  N.clear(), B.clear(), u.clear();
+}, "clear"), I = /* @__PURE__ */ w((e, n) => {
+  const r = N.get(n) || [];
+  return t.trace("In isDescendant", n, " ", e, " = ", r.includes(e)), r.includes(e);
+}, "isDescendant"), re = /* @__PURE__ */ w((e, n) => {
+  const r = N.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"), J = /* @__PURE__ */ w((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)
+      J(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((f) => {
+        t.info("Edge", f);
+        const E = n.edge(f.v, f.w, f.name);
+        t.info("Edge data", E, s);
+        try {
+          re(f, s) ? (t.info("Copying as ", f.v, f.w, E, f.name), r.setEdge(f.v, f.w, E, f.name), t.info("newGraph edges ", r.edges(), r.edge(r.edges()[0]))) : t.info(
+            "Skipping copy of edge ",
+            f.v,
+            "-->",
+            f.w,
+            " rootId: ",
+            s,
+            " clusterId:",
+            e
+          );
+        } catch (C) {
+          t.error(C);
+        }
+      });
+    }
+    t.debug("Removing node", c), n.removeNode(c);
+  });
+}, "copy"), P = /* @__PURE__ */ w((e, n) => {
+  const r = n.children(e);
+  let s = [...r];
+  for (const d of r)
+    B.set(d, e), s = [...s, ...P(d, n)];
+  return s;
+}, "extractDescendants"), te = /* @__PURE__ */ w((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((f) => l.v === f.v && l.w === f.w));
+}, "findCommonEdges"), S = /* @__PURE__ */ w((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 = S(c, n, r), l = te(n, r, o);
+    if (o)
+      if (l.length > 0)
+        d = o;
+      else
+        return o;
+  }
+  return d;
+}, "findNonClusterChild"), O = /* @__PURE__ */ w((e) => !u.has(e) || !u.get(e).externalConnections ? e : u.has(e) ? u.get(e).id : e, "getAnchorId"), ie = /* @__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: ",
+      S(r, e, r)
+    ), N.set(r, P(r, e)), u.set(r, { id: S(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, N), 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, ": ", N.get(r)), u.get(r).externalConnections = !0);
+    })) : t.debug("Not a cluster ", r, N);
+  });
+  for (let r of u.keys()) {
+    const s = u.get(r).id, d = e.parent(s);
+    d !== r && u.has(d) && !u.get(d).externalConnections && (u.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",
+      u,
+      "ids:",
+      r.v,
+      r.w,
+      "Translating: ",
+      u.get(r.v),
+      " --- ",
+      u.get(r.w)
+    ), u.get(r.v) || u.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);
+        u.get(o).externalConnections = !0, s.fromCluster = r.v;
+      }
+      if (c !== r.w) {
+        const o = e.parent(c);
+        u.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)), A(e, 0), t.trace(u);
+}, "adjustClustersAndEdges"), A = /* @__PURE__ */ w((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,
+      u,
+      u.has(o) && !u.get(o).externalConnections,
+      !e.parent(o),
+      e.node(o),
+      e.children("D"),
+      " Depth ",
+      n
+    ), !u.has(o))
+      t.debug("Not a cluster", o, n);
+    else if (!u.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 = u.get(o)) == null ? void 0 : r.clusterData) != null && s.dir && (l = u.get(o).clusterData.dir, t.warn("Fixing dir", u.get(o).clusterData.dir, l));
+      const f = 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)), J(o, e, f, o), e.setNode(o, {
+        clusterNode: !0,
+        id: o,
+        clusterData: u.get(o).clusterData,
+        label: u.get(o).label,
+        graph: f
+      }), t.warn("New graph after copy node: (", o, ")", X(f)), t.debug("Old graph after copy", X(e));
+    } else
+      t.warn(
+        "Cluster ** ",
+        o,
+        " **not meeting the criteria !externalConnections:",
+        !u.get(o).externalConnections,
+        " no parent: ",
+        !e.parent(o),
+        " children ",
+        e.children(o) && e.children(o).length > 0,
+        e.children("D"),
+        n
+      ), t.debug(u);
+  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 && A(l.graph, n + 1);
+  }
+}, "extractor"), R = /* @__PURE__ */ w((e, n) => {
+  if (n.length === 0)
+    return [];
+  let r = Object.assign([], n);
+  return n.forEach((s) => {
+    const d = e.children(s), c = R(e, d);
+    r = [...r, ...c];
+  }), r;
+}, "sorter"), oe = /* @__PURE__ */ w((e) => R(e, e.children()), "sortNodesByHierarchy"), T = /* @__PURE__ */ w(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 f = l.insert("g").attr("class", "clusters"), E = 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: v } = n.graph();
+        a.graph.setGraph({
+          ...a.graph.graph(),
+          ranksep: i + 25,
+          nodesep: v
+        });
+        const m = await T(
+          h,
+          a.graph,
+          r,
+          s,
+          n.node(g),
+          c
+        ), b = m.elem;
+        _(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
+        ), H(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(S(a.id, n)), u.set(a.id, { id: S(a.id, n), node: a })) : (t.trace("Node - the non recursive path XAX", g, h, n.node(g), o), await $(h, n.node(g), { config: c, dir: o }));
+    })
+  ), await (/* @__PURE__ */ w(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",
+        u,
+        "ids:",
+        a.v,
+        a.w,
+        "Translating: ",
+        u.get(a.v),
+        u.get(a.w)
+      ), await q(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"), V(n), t.info("Graph after layout:", JSON.stringify(X(n)));
+  let p = 0, { subGraphTitleTotalMargin: y } = z(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)
+        ), u.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 v = (i == null ? void 0 : i.padding) / 2 || 0, m = ((a = i == null ? void 0 : i.labelBBox) == null ? void 0 : a.height) || 0, b = m - v || 0;
+        t.debug("OffsetY", b, "labelHeight", m, "halfPadding", v), await K(f, i), u.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
+        ), 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 v = n.node(g.w);
+    const m = Q(E, a, u, r, i, v, s);
+    U(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__ */ w(async (e, n) => {
+  var r, s, d, c, o, l;
+  const f = 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 {};
+  }), E = n.select("g");
+  L(E, e.markers, e.type, e.diagramId), M(), j(), F(), ne(), e.nodes.forEach((h) => {
+    f.setNode(h.id, { ...h }), h.parentId && f.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 = f.node(p);
+      f.setNode(y, {
+        domId: y,
+        id: y,
+        parentId: a.parentId,
+        labelStyle: "",
+        label: "",
+        padding: 0,
+        shape: "labelRect",
+        // shape: 'rect',
+        style: "",
+        width: 10,
+        height: 10
+      }), f.setParent(y, a.parentId), f.setNode(g, {
+        domId: g,
+        id: g,
+        parentId: a.parentId,
+        labelStyle: "",
+        padding: 0,
+        // shape: 'rect',
+        shape: "labelRect",
+        label: "",
+        style: "",
+        width: 10,
+        height: 10
+      }), f.setParent(g, a.parentId);
+      const i = structuredClone(h), v = structuredClone(h), m = structuredClone(h);
+      i.label = "", i.arrowTypeEnd = "none", i.id = p + "-cyclic-special-1", v.arrowTypeEnd = "none", v.id = p + "-cyclic-special-mid", m.label = "", a.isGroup && (i.fromCluster = p, m.toCluster = p), m.id = p + "-cyclic-special-2", f.setEdge(p, y, i, p + "-cyclic-special-0"), f.setEdge(y, g, v, p + "-cyclic-special-1"), f.setEdge(g, p, m, p + "-cyc<lic-special-2");
+    } else
+      f.setEdge(h.start, h.end, { ...h }, h.id);
+  }), t.warn("Graph at first:", JSON.stringify(X(f))), ie(f), t.warn("Graph after XAX:", JSON.stringify(X(f)));
+  const C = Y();
+  await T(
+    E,
+    f,
+    e.type,
+    e.diagramId,
+    void 0,
+    C
+  );
+}, "render");
+export {
+  ue as render
+};

package/dist/diagram-QW4FP2JN-jc61JuWr-DOMFELfS.js

@@ -0,0 +1,126 @@
+import { m as B } from "./chunk-TMUBEWPD-C22TGOO0-Bl2u--DY.js";
+import { aB as S, a5 as D, a6 as T, al as W, am as z, a7 as P, a8 as A, _ as i, l as x, aC as $, aD as F, ar as v, aW as E, ag as R } from "./index-B_RqyDIa.js";
+import { D as Y } from "./mermaid-parser.core-DxgZuQQq-uP-grJig.js";
+var C = {
+  packet: []
+}, m = structuredClone(C), _ = S.packet, H = /* @__PURE__ */ i(() => {
+  const t = $({
+    ..._,
+    ...F().packet
+  });
+  return t.showBits && (t.paddingY += 10), t;
+}, "getConfig"), L = /* @__PURE__ */ i(() => m.packet, "getPacket"), M = /* @__PURE__ */ i((t) => {
+  t.length > 0 && m.packet.push(t);
+}, "pushWord"), I = /* @__PURE__ */ i(() => {
+  v(), m = structuredClone(C);
+}, "clear"), u = {
+  pushWord: M,
+  getPacket: L,
+  getConfig: H,
+  clear: I,
+  setAccTitle: D,
+  getAccTitle: T,
+  setDiagramTitle: W,
+  getDiagramTitle: z,
+  getAccDescription: P,
+  setAccDescription: A
+}, X = 1e4, j = /* @__PURE__ */ i((t) => {
+  B(t, u);
+  let e = -1, o = [], s = 1;
+  const { bitsPerRow: n } = u.getConfig();
+  for (let { start: a, end: r, label: p } of t.blocks) {
+    if (r && r < a)
+      throw new Error(`Packet block ${a} - ${r} is invalid. End must be greater than start.`);
+    if (a !== e + 1)
+      throw new Error(
+        `Packet block ${a} - ${r ?? a} is not contiguous. It should start from ${e + 1}.`
+      );
+    for (e = r ?? a, x.debug(`Packet block ${a} - ${e} with label ${p}`); o.length <= n + 1 && u.getPacket().length < X; ) {
+      const [f, c] = q({ start: a, end: r, label: p }, s, n);
+      if (o.push(f), f.end + 1 === s * n && (u.pushWord(o), o = [], s++), !c)
+        break;
+      ({ start: a, end: r, label: p } = c);
+    }
+  }
+  u.pushWord(o);
+}, "populate"), q = /* @__PURE__ */ i((t, e, o) => {
+  if (t.end === void 0 && (t.end = t.start), t.start > t.end)
+    throw new Error(`Block start ${t.start} is greater than block end ${t.end}.`);
+  return t.end + 1 <= e * o ? [t, void 0] : [
+    {
+      start: t.start,
+      end: e * o - 1,
+      label: t.label
+    },
+    {
+      start: e * o,
+      end: t.end,
+      label: t.label
+    }
+  ];
+}, "getNextFittingBlock"), G = {
+  parse: /* @__PURE__ */ i(async (t) => {
+    const e = await Y("packet", t);
+    x.debug(e), j(e);
+  }, "parse")
+}, J = /* @__PURE__ */ i((t, e, o, s) => {
+  const n = s.db, a = n.getConfig(), { rowHeight: r, paddingY: p, bitWidth: f, bitsPerRow: c } = a, h = n.getPacket(), l = n.getDiagramTitle(), g = r + p, d = g * (h.length + 1) - (l ? 0 : r), k = f * c + 2, b = E(e);
+  b.attr("viewbox", `0 0 ${k} ${d}`), R(b, d, k, a.useMaxWidth);
+  for (const [w, y] of h.entries())
+    K(b, y, w, a);
+  b.append("text").text(l).attr("x", k / 2).attr("y", d - g / 2).attr("dominant-baseline", "middle").attr("text-anchor", "middle").attr("class", "packetTitle");
+}, "draw"), K = /* @__PURE__ */ i((t, e, o, { rowHeight: s, paddingX: n, paddingY: a, bitWidth: r, bitsPerRow: p, showBits: f }) => {
+  const c = t.append("g"), h = o * (s + a) + a;
+  for (const l of e) {
+    const g = l.start % p * r + 1, d = (l.end - l.start + 1) * r - n;
+    if (c.append("rect").attr("x", g).attr("y", h).attr("width", d).attr("height", s).attr("class", "packetBlock"), c.append("text").attr("x", g + d / 2).attr("y", h + s / 2).attr("class", "packetLabel").attr("dominant-baseline", "middle").attr("text-anchor", "middle").text(l.label), !f)
+      continue;
+    const k = l.end === l.start, b = h - 2;
+    c.append("text").attr("x", g + (k ? d / 2 : 0)).attr("y", b).attr("class", "packetByte start").attr("dominant-baseline", "auto").attr("text-anchor", k ? "middle" : "start").text(l.start), k || c.append("text").attr("x", g + d).attr("y", b).attr("class", "packetByte end").attr("dominant-baseline", "auto").attr("text-anchor", "end").text(l.end);
+  }
+}, "drawWord"), N = { draw: J }, O = {
+  byteFontSize: "10px",
+  startByteColor: "black",
+  endByteColor: "black",
+  labelColor: "black",
+  labelFontSize: "12px",
+  titleColor: "black",
+  titleFontSize: "14px",
+  blockStrokeColor: "black",
+  blockStrokeWidth: "1",
+  blockFillColor: "#efefef"
+}, U = /* @__PURE__ */ i(({ packet: t } = {}) => {
+  const e = $(O, t);
+  return `
+	.packetByte {
+		font-size: ${e.byteFontSize};
+	}
+	.packetByte.start {
+		fill: ${e.startByteColor};
+	}
+	.packetByte.end {
+		fill: ${e.endByteColor};
+	}
+	.packetLabel {
+		fill: ${e.labelColor};
+		font-size: ${e.labelFontSize};
+	}
+	.packetTitle {
+		fill: ${e.titleColor};
+		font-size: ${e.titleFontSize};
+	}
+	.packetBlock {
+		stroke: ${e.blockStrokeColor};
+		stroke-width: ${e.blockStrokeWidth};
+		fill: ${e.blockFillColor};
+	}
+	`;
+}, "styles"), tt = {
+  parser: G,
+  db: u,
+  renderer: N,
+  styles: U
+};
+export {
+  tt as diagram
+};

package/dist/diff-XmNrvgM1-XmNrvgM1.js

@@ -0,0 +1,6 @@
+const n = Object.freeze(JSON.parse('{"displayName":"Diff","name":"diff","patterns":[{"captures":{"1":{"name":"punctuation.definition.separator.diff"}},"match":"^((\\\\*{15})|(={67})|(-{3}))$\\\\n?","name":"meta.separator.diff"},{"match":"^\\\\d+(,\\\\d+)*(a|d|c)\\\\d+(,\\\\d+)*$\\\\n?","name":"meta.diff.range.normal"},{"captures":{"1":{"name":"punctuation.definition.range.diff"},"2":{"name":"meta.toc-list.line-number.diff"},"3":{"name":"punctuation.definition.range.diff"}},"match":"^(@@)\\\\s*(.+?)\\\\s*(@@)($\\\\n?)?","name":"meta.diff.range.unified"},{"captures":{"3":{"name":"punctuation.definition.range.diff"},"4":{"name":"punctuation.definition.range.diff"},"6":{"name":"punctuation.definition.range.diff"},"7":{"name":"punctuation.definition.range.diff"}},"match":"^(((\\\\-{3}) .+ (\\\\-{4}))|((\\\\*{3}) .+ (\\\\*{4})))$\\\\n?","name":"meta.diff.range.context"},{"match":"^diff --git a/.*$\\\\n?","name":"meta.diff.header.git"},{"match":"^diff (-|\\\\S+\\\\s+\\\\S+).*$\\\\n?","name":"meta.diff.header.command"},{"captures":{"4":{"name":"punctuation.definition.from-file.diff"},"6":{"name":"punctuation.definition.from-file.diff"},"7":{"name":"punctuation.definition.from-file.diff"}},"match":"(^(((-{3}) .+)|((\\\\*{3}) .+))$\\\\n?|^(={4}) .+(?= - ))","name":"meta.diff.header.from-file"},{"captures":{"2":{"name":"punctuation.definition.to-file.diff"},"3":{"name":"punctuation.definition.to-file.diff"},"4":{"name":"punctuation.definition.to-file.diff"}},"match":"(^(\\\\+{3}) .+$\\\\n?| (-) .* (={4})$\\\\n?)","name":"meta.diff.header.to-file"},{"captures":{"3":{"name":"punctuation.definition.inserted.diff"},"6":{"name":"punctuation.definition.inserted.diff"}},"match":"^(((>)( .*)?)|((\\\\+).*))$\\\\n?","name":"markup.inserted.diff"},{"captures":{"1":{"name":"punctuation.definition.changed.diff"}},"match":"^(!).*$\\\\n?","name":"markup.changed.diff"},{"captures":{"3":{"name":"punctuation.definition.deleted.diff"},"6":{"name":"punctuation.definition.deleted.diff"}},"match":"^(((<)( .*)?)|((-).*))$\\\\n?","name":"markup.deleted.diff"},{"begin":"^(#)","captures":{"1":{"name":"punctuation.definition.comment.diff"}},"comment":"Git produces unified diffs with embedded comments\\"","end":"\\\\n","name":"comment.line.number-sign.diff"},{"match":"^index [0-9a-f]{7,40}\\\\.\\\\.[0-9a-f]{7,40}.*$\\\\n?","name":"meta.diff.index.git"},{"captures":{"1":{"name":"punctuation.separator.key-value.diff"},"2":{"name":"meta.toc-list.file-name.diff"}},"match":"^Index(:) (.+)$\\\\n?","name":"meta.diff.index"},{"match":"^Only in .*: .*$\\\\n?","name":"meta.diff.only-in"}],"scopeName":"source.diff"}')), e = [
+  n
+];
+export {
+  e as default
+};

package/dist/docker-DWH2onkn-DWH2onkn.js

@@ -0,0 +1,6 @@
+const e = Object.freeze(JSON.parse(`{"displayName":"Dockerfile","name":"docker","patterns":[{"captures":{"1":{"name":"keyword.other.special-method.dockerfile"},"2":{"name":"keyword.other.special-method.dockerfile"}},"match":"^\\\\s*\\\\b(?i:(FROM))\\\\b.*?\\\\b(?i:(AS))\\\\b"},{"captures":{"1":{"name":"keyword.control.dockerfile"},"2":{"name":"keyword.other.special-method.dockerfile"}},"match":"^\\\\s*(?i:(ONBUILD)\\\\s+)?(?i:(ADD|ARG|CMD|COPY|ENTRYPOINT|ENV|EXPOSE|FROM|HEALTHCHECK|LABEL|MAINTAINER|RUN|SHELL|STOPSIGNAL|USER|VOLUME|WORKDIR))\\\\s"},{"captures":{"1":{"name":"keyword.operator.dockerfile"},"2":{"name":"keyword.other.special-method.dockerfile"}},"match":"^\\\\s*(?i:(ONBUILD)\\\\s+)?(?i:(CMD|ENTRYPOINT))\\\\s"},{"include":"#string-character-escape"},{"begin":"\\"","beginCaptures":{"1":{"name":"punctuation.definition.string.begin.dockerfile"}},"end":"\\"","endCaptures":{"1":{"name":"punctuation.definition.string.end.dockerfile"}},"name":"string.quoted.double.dockerfile","patterns":[{"include":"#string-character-escape"}]},{"begin":"'","beginCaptures":{"1":{"name":"punctuation.definition.string.begin.dockerfile"}},"end":"'","endCaptures":{"1":{"name":"punctuation.definition.string.end.dockerfile"}},"name":"string.quoted.single.dockerfile","patterns":[{"include":"#string-character-escape"}]},{"captures":{"1":{"name":"punctuation.whitespace.comment.leading.dockerfile"},"2":{"name":"comment.line.number-sign.dockerfile"},"3":{"name":"punctuation.definition.comment.dockerfile"}},"comment":"comment.line","match":"^(\\\\s*)((#).*$\\\\n?)"}],"repository":{"string-character-escape":{"match":"\\\\\\\\.","name":"constant.character.escaped.dockerfile"}},"scopeName":"source.dockerfile","aliases":["dockerfile"]}`)), n = [
+  e
+];
+export {
+  n as default
+};

package/dist/documentation.es.js

@@ -0,0 +1,7 @@
+import { bz as a, bA as n, bB as e, bC as m } from "./index-B_RqyDIa.js";
+export {
+  a as DocumentationContent,
+  n as DocumentationDisplay,
+  e as DocumentationPageEmptyState,
+  m as ProductDocumentModal
+};