@kong-ui-public/documentation 1.1.2 → 1.1.3

package/dist/{dagre-4EVJKHTY-CcAruc30-DaOjmyb6.js → dagre-4EVJKHTY-CcAruc30-H9W22Yky.js}

@@ -1,9 +1,9 @@
-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-ZM4BlVwk.js";
-import { L as k } from "./graph-BYZMvqpu-BpeF1PUA.js";
-import { o as V } from "./layout-BHI4imdk-DgoNZaqw.js";
-import { E as x } from "./_baseUniq-SAfYgIkf-BO_CV6Oz.js";
-import { a as W } from "./clone-_5SW34SG-DtUOH1l1.js";
-import { g as G } from "./_basePickBy-zlkqRmFy-CQP0PMRw.js";
+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-BXOX6oou.js";
+import { L as k } from "./graph-BYZMvqpu-CWGqkYZM.js";
+import { o as V } from "./layout-BHI4imdk-BlkmyDbe.js";
+import { E as x } from "./_baseUniq-SAfYgIkf-DhYxnvgt.js";
+import { a as W } from "./clone-_5SW34SG-BWxdvZXA.js";
+import { g as G } from "./_basePickBy-zlkqRmFy-Dq-PK6tA.js";
 function X(e) {
   var n = {
     options: {
@@ -51,8 +51,8 @@ var u = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), B = /* @__PURE
     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(
+      const a = n.node(c);
+      t.info("cp ", c, " to ", s, " with parent ", e), r.setNode(c, a), 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",
@@ -90,20 +90,20 @@ var u = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), B = /* @__PURE
     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));
+  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 })), a = d.map((l) => ({ v: l.v, w: l.w }));
+  return c.filter((l) => a.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)
+    const a = S(c, n, r), l = te(n, r, a);
+    if (a)
       if (l.length > 0)
-        d = o;
+        d = a;
       else
-        return o;
+        return a;
   }
   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) => {
@@ -122,8 +122,8 @@ var u = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), B = /* @__PURE
   }), 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);
+      const a = I(c.v, r), l = I(c.w, r);
+      a ^ 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()) {
@@ -146,12 +146,12 @@ var u = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), B = /* @__PURE
       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;
+        const a = e.parent(d);
+        u.get(a).externalConnections = !0, s.fromCluster = r.v;
       }
       if (c !== r.w) {
-        const o = e.parent(c);
-        u.get(o).externalConnections = !0, s.toCluster = r.w;
+        const a = e.parent(c);
+        u.get(a).externalConnections = !0, s.toCluster = r.w;
       }
       t.warn("Fix Replacing with XXX", d, c, r.name), e.setEdge(d, c, s, r.name);
     }
@@ -163,8 +163,8 @@ var u = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), B = /* @__PURE
     return;
   }
   let d = e.nodes(), c = !1;
-  for (const o of d) {
-    const l = e.children(o);
+  for (const a of d) {
+    const l = e.children(a);
     c = c || l.length > 0;
   }
   if (!c) {
@@ -172,27 +172,27 @@ var u = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), B = /* @__PURE
     return;
   }
   t.debug("Nodes = ", d, n);
-  for (const o of d)
+  for (const a of d)
     if (t.debug(
       "Extracting node",
-      o,
+      a,
       u,
-      u.has(o) && !u.get(o).externalConnections,
-      !e.parent(o),
-      e.node(o),
+      u.has(a) && !u.get(a).externalConnections,
+      !e.parent(a),
+      e.node(a),
       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) {
+    ), !u.has(a))
+      t.debug("Not a cluster", a, n);
+    else if (!u.get(a).externalConnections && e.children(a) && e.children(a).length > 0) {
       t.warn(
         "Cluster without external connections, without a parent and with children",
-        o,
+        a,
         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));
+      (s = (r = u.get(a)) == null ? void 0 : r.clusterData) != null && s.dir && (l = u.get(a).clusterData.dir, t.warn("Fixing dir", u.get(a).clusterData.dir, l));
       const f = new k({
         multigraph: !0,
         compound: !0
@@ -205,30 +205,30 @@ var u = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), B = /* @__PURE
       }).setDefaultEdgeLabel(function() {
         return {};
       });
-      t.warn("Old graph before copy", X(e)), J(o, e, f, o), e.setNode(o, {
+      t.warn("Old graph before copy", X(e)), J(a, e, f, a), e.setNode(a, {
         clusterNode: !0,
-        id: o,
-        clusterData: u.get(o).clusterData,
-        label: u.get(o).label,
+        id: a,
+        clusterData: u.get(a).clusterData,
+        label: u.get(a).label,
         graph: f
-      }), t.warn("New graph after copy node: (", o, ")", X(f)), t.debug("Old graph after copy", X(e));
+      }), t.warn("New graph after copy node: (", a, ")", X(f)), t.debug("Old graph after copy", X(e));
     } else
       t.warn(
         "Cluster ** ",
-        o,
+        a,
         " **not meeting the criteria !externalConnections:",
-        !u.get(o).externalConnections,
+        !u.get(a).externalConnections,
         " no parent: ",
-        !e.parent(o),
+        !e.parent(a),
         " children ",
-        e.children(o) && e.children(o).length > 0,
+        e.children(a) && e.children(a).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);
+  for (const a of d) {
+    const l = e.node(a);
+    t.warn(" Now next level", a, l), l != null && l.clusterNode && A(l.graph, n + 1);
   }
 }, "extractor"), R = /* @__PURE__ */ w((e, n) => {
   if (n.length === 0)
@@ -238,16 +238,16 @@ var u = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), B = /* @__PURE
     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) => {
+}, "sorter"), ae = /* @__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 a = n.graph().rankdir;
+  t.trace("Dir in recursive render - dir:", a);
   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);
+      const o = n.node(g);
       if (d !== void 0) {
         const i = JSON.parse(JSON.stringify(d.clusterData));
         t.trace(
@@ -262,64 +262,64 @@ 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));
+      if (t.info("(Insert) Node XXX" + g + ": " + JSON.stringify(n.node(g))), o != null && o.clusterNode) {
+        t.info("Cluster identified XBX", g, o.width, n.node(g));
         const { ranksep: i, nodesep: v } = n.graph();
-        a.graph.setGraph({
-          ...a.graph.graph(),
+        o.graph.setGraph({
+          ...o.graph.graph(),
           ranksep: i + 25,
           nodesep: v
         });
         const m = await T(
           h,
-          a.graph,
+          o.graph,
           r,
           s,
           n.node(g),
           c
         ), b = m.elem;
-        _(a, b), a.diff = m.diff || 0, t.info(
+        _(o, b), o.diff = m.diff || 0, t.info(
           "New compound node after recursive render XAX",
           g,
           "width",
           // node,
-          a.width,
+          o.width,
           "height",
-          a.height
+          o.height
           // node.x,
           // node.y
-        ), H(b, a);
+        ), H(b, o);
       } else
         n.children(g).length > 0 ? (t.trace(
           "Cluster - the non recursive path XBX",
           g,
-          a.id,
-          a,
-          a.width,
+          o.id,
+          o,
+          o.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 }));
+        ), t.trace(S(o.id, n)), u.set(o.id, { id: S(o.id, n), node: o })) : (t.trace("Node - the non recursive path XAX", g, h, n.node(g), a), await $(h, n.node(g), { config: c, dir: a }));
     })
   ), 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(
+    const g = n.edges().map(async function(o) {
+      const i = n.edge(o.v, o.w, o.name);
+      t.info("Edge " + o.v + " -> " + o.w + ": " + JSON.stringify(o)), t.info("Edge " + o.v + " -> " + o.w + ": ", o, " ", JSON.stringify(n.edge(o))), t.info(
         "Fix",
         u,
         "ids:",
-        a.v,
-        a.w,
+        o.v,
+        o.w,
         "Translating: ",
-        u.get(a.v),
-        u.get(a.w)
+        u.get(o.v),
+        u.get(o.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;
+    ae(n).map(async function(g) {
+      var o;
       const i = n.node(g);
       if (t.info(
         "Position XBX => " + g + ": (" + i.x,
@@ -350,7 +350,7 @@ Parent cluster`,
           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;
+        const v = (i == null ? void 0 : i.padding) / 2 || 0, m = ((o = i == null ? void 0 : i.labelBBox) == null ? void 0 : o.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);
@@ -373,25 +373,25 @@ Parent cluster`,
       }
     })
   ), 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 o = n.edge(g);
+    t.info("Edge " + g.v + " -> " + g.w + ": " + JSON.stringify(o), o), o.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);
+    const m = Q(E, o, u, r, i, v, s);
+    U(o, m);
   }), n.nodes().forEach(function(g) {
-    const a = n.node(g);
-    t.info(g, a.type, a.diff), a.isGroup && (p = a.diff);
+    const o = n.node(g);
+    t.info(g, o.type, o.diff), o.isGroup && (p = o.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;
+  var r, s, d, c, a, 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,
+    ranksep: ((c = e.config) == null ? void 0 : c.rankSpacing) || ((l = (a = e.config) == null ? void 0 : a.flowchart) == null ? void 0 : l.rankSpacing) || e.rankSpacing,
     marginx: 8,
     marginy: 8
   }).setDefaultEdgeLabel(function() {
@@ -401,11 +401,11 @@ Parent cluster`,
     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);
+      const p = h.start, y = p + "---" + p + "---1", g = p + "---" + p + "---2", o = f.node(p);
       f.setNode(y, {
         domId: y,
         id: y,
-        parentId: a.parentId,
+        parentId: o.parentId,
         labelStyle: "",
         label: "",
         padding: 0,
@@ -414,10 +414,10 @@ Parent cluster`,
         style: "",
         width: 10,
         height: 10
-      }), f.setParent(y, a.parentId), f.setNode(g, {
+      }), f.setParent(y, o.parentId), f.setNode(g, {
         domId: g,
         id: g,
-        parentId: a.parentId,
+        parentId: o.parentId,
         labelStyle: "",
         padding: 0,
         // shape: 'rect',
@@ -426,9 +426,9 @@ Parent cluster`,
         style: "",
         width: 10,
         height: 10
-      }), f.setParent(g, a.parentId);
+      }), f.setParent(g, o.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");
+      i.label = "", i.arrowTypeEnd = "none", i.id = p + "-cyclic-special-1", v.arrowTypeEnd = "none", v.id = p + "-cyclic-special-mid", m.label = "", o.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)));

package/dist/{diagram-QW4FP2JN-DZT_0aFO-YCKYx1k-.js → diagram-QW4FP2JN-DZT_0aFO-AmG94tp5.js}

@@ -1,30 +1,30 @@
-import { m as B } from "./chunk-TMUBEWPD-BRIzn5gH-SlHeKBx9.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-ZM4BlVwk.js";
-import { D as Y } from "./mermaid-parser.core-Ce96PX3Q-DPc-bPXG.js";
+import { m as B } from "./chunk-TMUBEWPD-BRIzn5gH-Ch1SRQ7H.js";
+import { _ as i, a5 as S, a6 as D, aj as T, ak as W, a7 as z, a8 as P, aC as x, aW as A, aa as F, aq as v, aD as E, aE as R, l as $ } from "./index-BXOX6oou.js";
+import { D as Y } from "./mermaid-parser.core-Ce96PX3Q-DtNzRUJ7.js";
 var C = {
   packet: []
-}, m = structuredClone(C), _ = S.packet, H = /* @__PURE__ */ i(() => {
-  const t = $({
+}, m = structuredClone(C), _ = R.packet, H = /* @__PURE__ */ i(() => {
+  const t = x({
     ..._,
-    ...F().packet
+    ...E().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(() => {
+}, "pushWord"), j = /* @__PURE__ */ i(() => {
   v(), m = structuredClone(C);
 }, "clear"), u = {
   pushWord: M,
   getPacket: L,
   getConfig: H,
-  clear: I,
-  setAccTitle: D,
-  getAccTitle: T,
+  clear: j,
+  setAccTitle: P,
+  getAccTitle: z,
   setDiagramTitle: W,
-  getDiagramTitle: z,
-  getAccDescription: P,
-  setAccDescription: A
-}, X = 1e4, j = /* @__PURE__ */ i((t) => {
+  getDiagramTitle: T,
+  getAccDescription: D,
+  setAccDescription: S
+}, q = 1e4, I = /* @__PURE__ */ i((t) => {
   B(t, u);
   let e = -1, o = [], s = 1;
   const { bitsPerRow: n } = u.getConfig();
@@ -35,15 +35,15 @@ var C = {
       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);
+    for (e = r ?? a, $.debug(`Packet block ${a} - ${e} with label ${p}`); o.length <= n + 1 && u.getPacket().length < q; ) {
+      const [f, c] = X({ 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) => {
+}, "populate"), X = /* @__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] : [
@@ -61,11 +61,11 @@ var C = {
 }, "getNextFittingBlock"), G = {
   parse: /* @__PURE__ */ i(async (t) => {
     const e = await Y("packet", t);
-    x.debug(e), j(e);
+    $.debug(e), I(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);
+  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 = A(e);
+  b.attr("viewbox", `0 0 ${k} ${d}`), F(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");
@@ -90,7 +90,7 @@ var C = {
   blockStrokeWidth: "1",
   blockFillColor: "#efefef"
 }, U = /* @__PURE__ */ i(({ packet: t } = {}) => {
-  const e = $(O, t);
+  const e = x(O, t);
   return `
 	.packetByte {
 		font-size: ${e.byteFontSize};

package/dist/documentation.es.js

@@ -1,4 +1,4 @@
-import { bz as a, bA as n, bB as e, bC as m } from "./index-ZM4BlVwk.js";
+import { bz as a, bA as n, bB as e, bC as m } from "./index-BXOX6oou.js";
 export {
   a as DocumentationContent,
   n as DocumentationDisplay,