@kong-ui-public/documentation 1.1.2 → 1.1.4

package/dist/{sankeyDiagram-Y46BX6SQ-D6EdYPdp-BA6cRE1h.js → sankeyDiagram-Y46BX6SQ-D6EdYPdp-ClC_w0Hg.js}

@@ -1,4 +1,4 @@
-import { _, g as lt, a6 as xt, a5 as kt, a7 as vt, a8 as bt, am as wt, al as St, ar as Et, ab as Lt, ak as Mt, af as Q, bm as At } from "./index-ZM4BlVwk.js";
+import { _, ak as xt, aj as kt, a5 as vt, a6 as bt, a8 as wt, a7 as St, g as lt, ap as Et, a9 as Q, bk as Lt, aq as Mt, ag as At } from "./index-BXOX6oou.js";
 import { h as Tt } from "./ordinal-DfAQgscy-BEJTu10r.js";
 function Dt(t) {
   for (var n = t.length / 6 | 0, r = new Array(n), a = 0; a < n; ) r[a] = "#" + t.slice(a * 6, ++a * 6);
@@ -61,10 +61,10 @@ function R(t) {
     return t;
   };
 }
-function ht(t, n) {
+function ut(t, n) {
   return X(t.source, n.source) || t.index - n.index;
 }
-function ut(t, n) {
+function ht(t, n) {
   return X(t.target, n.target) || t.index - n.index;
 }
 function X(t, n) {
@@ -73,10 +73,10 @@ function X(t, n) {
 function et(t) {
   return t.value;
 }
-function $t(t) {
+function jt(t) {
   return t.index;
 }
-function jt(t) {
+function $t(t) {
   return t.nodes;
 }
 function zt(t) {
@@ -97,7 +97,7 @@ function yt({ nodes: t }) {
   }
 }
 function Ft() {
-  let t = 0, n = 0, r = 1, a = 1, c = 24, k = 8, d, m = $t, i = _t, o, f, p = jt, y = zt, w = 6;
+  let t = 0, n = 0, r = 1, a = 1, c = 24, k = 8, d, m = jt, i = _t, o, f, p = $t, y = zt, w = 6;
   function v() {
     const e = { nodes: p.apply(null, arguments), links: y.apply(null, arguments) };
     return P(e), A(e), T(e), O(e), C(e), yt(e), e;
@@ -127,165 +127,165 @@ function Ft() {
   }, v.iterations = function(e) {
     return arguments.length ? (w = +e, v) : w;
   };
-  function P({ nodes: e, links: u }) {
-    for (const [h, s] of e.entries())
-      s.index = h, s.sourceLinks = [], s.targetLinks = [];
-    const l = new Map(e.map((h, s) => [m(h, s, e), h]));
-    for (const [h, s] of u.entries()) {
-      s.index = h;
+  function P({ nodes: e, links: h }) {
+    for (const [u, s] of e.entries())
+      s.index = u, s.sourceLinks = [], s.targetLinks = [];
+    const l = new Map(e.map((u, s) => [m(u, s, e), u]));
+    for (const [u, s] of h.entries()) {
+      s.index = u;
       let { source: x, target: b } = s;
       typeof x != "object" && (x = s.source = ft(l, x)), typeof b != "object" && (b = s.target = ft(l, b)), x.sourceLinks.push(s), b.targetLinks.push(s);
     }
     if (f != null)
-      for (const { sourceLinks: h, targetLinks: s } of e)
-        h.sort(f), s.sort(f);
+      for (const { sourceLinks: u, targetLinks: s } of e)
+        u.sort(f), s.sort(f);
   }
   function A({ nodes: e }) {
-    for (const u of e)
-      u.value = u.fixedValue === void 0 ? Math.max(tt(u.sourceLinks, et), tt(u.targetLinks, et)) : u.fixedValue;
+    for (const h of e)
+      h.value = h.fixedValue === void 0 ? Math.max(tt(h.sourceLinks, et), tt(h.targetLinks, et)) : h.fixedValue;
   }
   function T({ nodes: e }) {
-    const u = e.length;
-    let l = new Set(e), h = /* @__PURE__ */ new Set(), s = 0;
+    const h = e.length;
+    let l = new Set(e), u = /* @__PURE__ */ new Set(), s = 0;
     for (; l.size; ) {
       for (const x of l) {
         x.depth = s;
         for (const { target: b } of x.sourceLinks)
-          h.add(b);
+          u.add(b);
       }
-      if (++s > u) throw new Error("circular link");
-      l = h, h = /* @__PURE__ */ new Set();
+      if (++s > h) throw new Error("circular link");
+      l = u, u = /* @__PURE__ */ new Set();
     }
   }
   function O({ nodes: e }) {
-    const u = e.length;
-    let l = new Set(e), h = /* @__PURE__ */ new Set(), s = 0;
+    const h = e.length;
+    let l = new Set(e), u = /* @__PURE__ */ new Set(), s = 0;
     for (; l.size; ) {
       for (const x of l) {
         x.height = s;
         for (const { source: b } of x.targetLinks)
-          h.add(b);
+          u.add(b);
       }
-      if (++s > u) throw new Error("circular link");
-      l = h, h = /* @__PURE__ */ new Set();
+      if (++s > h) throw new Error("circular link");
+      l = u, u = /* @__PURE__ */ new Set();
     }
   }
   function D({ nodes: e }) {
-    const u = ct(e, (s) => s.depth) + 1, l = (r - t - c) / (u - 1), h = new Array(u);
+    const h = ct(e, (s) => s.depth) + 1, l = (r - t - c) / (h - 1), u = new Array(h);
     for (const s of e) {
-      const x = Math.max(0, Math.min(u - 1, Math.floor(i.call(null, s, u))));
-      s.layer = x, s.x0 = t + x * l, s.x1 = s.x0 + c, h[x] ? h[x].push(s) : h[x] = [s];
+      const x = Math.max(0, Math.min(h - 1, Math.floor(i.call(null, s, h))));
+      s.layer = x, s.x0 = t + x * l, s.x1 = s.x0 + c, u[x] ? u[x].push(s) : u[x] = [s];
     }
-    if (o) for (const s of h)
+    if (o) for (const s of u)
       s.sort(o);
-    return h;
+    return u;
   }
   function S(e) {
-    const u = dt(e, (l) => (a - n - (l.length - 1) * d) / tt(l, et));
+    const h = dt(e, (l) => (a - n - (l.length - 1) * d) / tt(l, et));
     for (const l of e) {
-      let h = n;
+      let u = n;
       for (const s of l) {
-        s.y0 = h, s.y1 = h + s.value * u, h = s.y1 + d;
+        s.y0 = u, s.y1 = u + s.value * h, u = s.y1 + d;
         for (const x of s.sourceLinks)
-          x.width = x.value * u;
+          x.width = x.value * h;
       }
-      h = (a - h + d) / (l.length + 1);
+      u = (a - u + d) / (l.length + 1);
       for (let s = 0; s < l.length; ++s) {
         const x = l[s];
-        x.y0 += h * (s + 1), x.y1 += h * (s + 1);
+        x.y0 += u * (s + 1), x.y1 += u * (s + 1);
       }
-      $(l);
+      j(l);
     }
   }
   function C(e) {
-    const u = D(e);
-    d = Math.min(k, (a - n) / (ct(u, (l) => l.length) - 1)), S(u);
+    const h = D(e);
+    d = Math.min(k, (a - n) / (ct(h, (l) => l.length) - 1)), S(h);
     for (let l = 0; l < w; ++l) {
-      const h = Math.pow(0.99, l), s = Math.max(1 - h, (l + 1) / w);
-      N(u, h, s), I(u, h, s);
+      const u = Math.pow(0.99, l), s = Math.max(1 - u, (l + 1) / w);
+      N(h, u, s), I(h, u, s);
     }
   }
-  function I(e, u, l) {
-    for (let h = 1, s = e.length; h < s; ++h) {
-      const x = e[h];
+  function I(e, h, l) {
+    for (let u = 1, s = e.length; u < s; ++u) {
+      const x = e[u];
       for (const b of x) {
-        let V = 0, j = 0;
-        for (const { source: Y, value: J } of b.targetLinks) {
-          let q = J * (b.layer - Y.layer);
-          V += M(Y, b) * q, j += q;
+        let V = 0, $ = 0;
+        for (const { source: q, value: J } of b.targetLinks) {
+          let Y = J * (b.layer - q.layer);
+          V += M(q, b) * Y, $ += Y;
         }
-        if (!(j > 0)) continue;
-        let W = (V / j - b.y0) * u;
+        if (!($ > 0)) continue;
+        let W = (V / $ - b.y0) * h;
         b.y0 += W, b.y1 += W, E(b);
       }
       o === void 0 && x.sort(X), g(x, l);
     }
   }
-  function N(e, u, l) {
-    for (let h = e.length, s = h - 2; s >= 0; --s) {
+  function N(e, h, l) {
+    for (let u = e.length, s = u - 2; s >= 0; --s) {
       const x = e[s];
       for (const b of x) {
-        let V = 0, j = 0;
-        for (const { target: Y, value: J } of b.sourceLinks) {
-          let q = J * (Y.layer - b.layer);
-          V += U(b, Y) * q, j += q;
+        let V = 0, $ = 0;
+        for (const { target: q, value: J } of b.sourceLinks) {
+          let Y = J * (q.layer - b.layer);
+          V += U(b, q) * Y, $ += Y;
         }
-        if (!(j > 0)) continue;
-        let W = (V / j - b.y0) * u;
+        if (!($ > 0)) continue;
+        let W = (V / $ - b.y0) * h;
         b.y0 += W, b.y1 += W, E(b);
       }
       o === void 0 && x.sort(X), g(x, l);
     }
   }
-  function g(e, u) {
-    const l = e.length >> 1, h = e[l];
-    G(e, h.y0 - d, l - 1, u), L(e, h.y1 + d, l + 1, u), G(e, a, e.length - 1, u), L(e, n, 0, u);
+  function g(e, h) {
+    const l = e.length >> 1, u = e[l];
+    G(e, u.y0 - d, l - 1, h), L(e, u.y1 + d, l + 1, h), G(e, a, e.length - 1, h), L(e, n, 0, h);
   }
-  function L(e, u, l, h) {
+  function L(e, h, l, u) {
     for (; l < e.length; ++l) {
-      const s = e[l], x = (u - s.y0) * h;
-      x > 1e-6 && (s.y0 += x, s.y1 += x), u = s.y1 + d;
+      const s = e[l], x = (h - s.y0) * u;
+      x > 1e-6 && (s.y0 += x, s.y1 += x), h = s.y1 + d;
     }
   }
-  function G(e, u, l, h) {
+  function G(e, h, l, u) {
     for (; l >= 0; --l) {
-      const s = e[l], x = (s.y1 - u) * h;
-      x > 1e-6 && (s.y0 -= x, s.y1 -= x), u = s.y0 - d;
+      const s = e[l], x = (s.y1 - h) * u;
+      x > 1e-6 && (s.y0 -= x, s.y1 -= x), h = s.y0 - d;
     }
   }
-  function E({ sourceLinks: e, targetLinks: u }) {
+  function E({ sourceLinks: e, targetLinks: h }) {
     if (f === void 0) {
-      for (const { source: { sourceLinks: l } } of u)
-        l.sort(ut);
-      for (const { target: { targetLinks: l } } of e)
+      for (const { source: { sourceLinks: l } } of h)
         l.sort(ht);
+      for (const { target: { targetLinks: l } } of e)
+        l.sort(ut);
     }
   }
-  function $(e) {
+  function j(e) {
     if (f === void 0)
-      for (const { sourceLinks: u, targetLinks: l } of e)
-        u.sort(ut), l.sort(ht);
+      for (const { sourceLinks: h, targetLinks: l } of e)
+        h.sort(ht), l.sort(ut);
   }
-  function M(e, u) {
+  function M(e, h) {
     let l = e.y0 - (e.sourceLinks.length - 1) * d / 2;
-    for (const { target: h, width: s } of e.sourceLinks) {
-      if (h === u) break;
+    for (const { target: u, width: s } of e.sourceLinks) {
+      if (u === h) break;
       l += s + d;
     }
-    for (const { source: h, width: s } of u.targetLinks) {
-      if (h === e) break;
+    for (const { source: u, width: s } of h.targetLinks) {
+      if (u === e) break;
       l -= s;
     }
     return l;
   }
-  function U(e, u) {
-    let l = u.y0 - (u.targetLinks.length - 1) * d / 2;
-    for (const { source: h, width: s } of u.targetLinks) {
-      if (h === e) break;
+  function U(e, h) {
+    let l = h.y0 - (h.targetLinks.length - 1) * d / 2;
+    for (const { source: u, width: s } of h.targetLinks) {
+      if (u === e) break;
       l += s + d;
     }
-    for (const { target: h, width: s } of e.sourceLinks) {
-      if (h === u) break;
+    for (const { target: u, width: s } of e.sourceLinks) {
+      if (u === h) break;
       l -= s;
     }
     return l;
@@ -355,14 +355,14 @@ function Vt(t) {
   return t[1];
 }
 var Wt = Array.prototype.slice;
-function Yt(t) {
+function qt(t) {
   return t.source;
 }
-function qt(t) {
+function Yt(t) {
   return t.target;
 }
 function Qt(t) {
-  var n = Yt, r = qt, a = Ut, c = Vt, k = null;
+  var n = qt, r = Yt, a = Ut, c = Vt, k = null;
   function d() {
     var m, i = Wt.call(arguments), o = n.apply(this, i), f = r.apply(this, i);
     if (k || (k = m = mt()), t(k, +a.apply(this, (i[0] = o, i)), +c.apply(this, i), +a.apply(this, (i[0] = f, i)), +c.apply(this, i)), m) return k = null, m + "" || null;
@@ -450,12 +450,12 @@ var at = function() {
         return b = f.pop() || S.lex() || O, typeof b != "number" && (b instanceof Array && (f = b, b = f.pop()), b = i.symbols_[b] || b), b;
       }
       _(G, "lex");
-      for (var E, $, M, U, e = {}, u, l, h, s; ; ) {
-        if ($ = o[o.length - 1], this.defaultActions[$] ? M = this.defaultActions[$] : ((E === null || typeof E > "u") && (E = G()), M = w[$] && w[$][E]), typeof M > "u" || !M.length || !M[0]) {
+      for (var E, j, M, U, e = {}, h, l, u, s; ; ) {
+        if (j = o[o.length - 1], this.defaultActions[j] ? M = this.defaultActions[j] : ((E === null || typeof E > "u") && (E = G()), M = w[j] && w[j][E]), typeof M > "u" || !M.length || !M[0]) {
           var x = "";
           s = [];
-          for (u in w[$])
-            this.terminals_[u] && u > T && s.push("'" + this.terminals_[u] + "'");
+          for (h in w[j])
+            this.terminals_[h] && h > T && s.push("'" + this.terminals_[h] + "'");
           S.showPosition ? x = "Parse error on line " + (P + 1) + `:
 ` + S.showPosition() + `
 Expecting ` + s.join(", ") + ", got '" + (this.terminals_[E] || E) + "'" : x = "Parse error on line " + (P + 1) + ": Unexpected " + (E == O ? "end of input" : "'" + (this.terminals_[E] || E) + "'"), this.parseError(x, {
@@ -467,7 +467,7 @@ Expecting ` + s.join(", ") + ", got '" + (this.terminals_[E] || E) + "'" : x = "
           });
         }
         if (M[0] instanceof Array && M.length > 1)
-          throw new Error("Parse Error: multiple actions possible at state: " + $ + ", token: " + E);
+          throw new Error("Parse Error: multiple actions possible at state: " + j + ", token: " + E);
         switch (M[0]) {
           case 1:
             o.push(E), p.push(S.yytext), y.push(S.yylloc), o.push(M[1]), E = null, A = S.yyleng, v = S.yytext, P = S.yylineno, N = S.yylloc;
@@ -491,7 +491,7 @@ Expecting ` + s.join(", ") + ", got '" + (this.terminals_[E] || E) + "'" : x = "
               y
             ].concat(D)), typeof U < "u")
               return U;
-            l && (o = o.slice(0, -1 * l * 2), p = p.slice(0, -1 * l), y = y.slice(0, -1 * l)), o.push(this.productions_[M[1]][0]), p.push(e.$), y.push(e._$), h = w[o[o.length - 2]][o[o.length - 1]], o.push(h);
+            l && (o = o.slice(0, -1 * l * 2), p = p.slice(0, -1 * l), y = y.slice(0, -1 * l)), o.push(this.productions_[M[1]][0]), p.push(e.$), y.push(e._$), u = w[o[o.length - 2]][o[o.length - 1]], o.push(u);
             break;
           case 3:
             return !0;
@@ -702,7 +702,7 @@ Expecting ` + s.join(", ") + ", got '" + (this.terminals_[E] || E) + "'" : x = "
 }();
 at.parser = at;
 var K = at, B = [], H = [], Z = /* @__PURE__ */ new Map(), Ht = /* @__PURE__ */ _(() => {
-  B = [], H = [], Z = /* @__PURE__ */ new Map(), Et();
+  B = [], H = [], Z = /* @__PURE__ */ new Map(), Mt();
 }, "clear"), nt, Jt = (nt = class {
   constructor(t, n, r = 0) {
     this.source = t, this.target = n, this.value = r;
@@ -714,7 +714,7 @@ var K = at, B = [], H = [], Z = /* @__PURE__ */ new Map(), Ht = /* @__PURE__ */
     this.ID = t;
   }
 }, _(it, "SankeyNode"), it), ne = /* @__PURE__ */ _((t) => {
-  t = Lt.sanitizeText(t, lt());
+  t = At.sanitizeText(t, lt());
   let n = Z.get(t);
   return n === void 0 && (n = new ee(t), Z.set(t, n), H.push(n)), n;
 }, "findOrCreateNode"), ie = /* @__PURE__ */ _(() => H, "getNodes"), re = /* @__PURE__ */ _(() => B, "getLinks"), se = /* @__PURE__ */ _(() => ({
@@ -732,12 +732,12 @@ var K = at, B = [], H = [], Z = /* @__PURE__ */ new Map(), Ht = /* @__PURE__ */
   getGraph: se,
   addLink: te,
   findOrCreateNode: ne,
-  getAccTitle: xt,
-  setAccTitle: kt,
-  getAccDescription: vt,
-  setAccDescription: bt,
-  getDiagramTitle: wt,
-  setDiagramTitle: St,
+  getAccTitle: St,
+  setAccTitle: wt,
+  getAccDescription: bt,
+  setAccDescription: vt,
+  getDiagramTitle: kt,
+  setDiagramTitle: xt,
   clear: Ht
 }, F, pt = (F = class {
   static next(t) {
@@ -755,7 +755,7 @@ var K = at, B = [], H = [], Z = /* @__PURE__ */ new Map(), Ht = /* @__PURE__ */
   center: It,
   justify: _t
 }, le = /* @__PURE__ */ _(function(t, n, r, a) {
-  const { securityLevel: c, sankey: k } = lt(), d = Mt.sankey;
+  const { securityLevel: c, sankey: k } = lt(), d = Et.sankey;
   let m;
   c === "sandbox" && (m = Q("#i" + n));
   const i = c === "sandbox" ? Q(m.nodes()[0].contentDocument.body) : Q("body"), o = c === "sandbox" ? i.select(`[id="${n}"]`) : Q(`[id="${n}"]`), f = (k == null ? void 0 : k.width) ?? d.width, p = (k == null ? void 0 : k.height) ?? d.width, y = (k == null ? void 0 : k.useMaxWidth) ?? d.useMaxWidth, w = (k == null ? void 0 : k.nodeAlignment) ?? d.nodeAlignment, v = (k == null ? void 0 : k.prefix) ?? d.prefix, P = (k == null ? void 0 : k.suffix) ?? d.suffix, A = (k == null ? void 0 : k.showValues) ?? d.showValues, T = a.db.getGraph(), O = ae[w];
@@ -789,12 +789,12 @@ ${v}${Math.round(L * 100) / 100}${P}` : g, "getText");
     default:
       N = I;
   }
-  C.append("path").attr("d", Bt()).attr("stroke", N).attr("stroke-width", (g) => Math.max(1, g.width)), At(void 0, o, 0, y);
+  C.append("path").attr("d", Bt()).attr("stroke", N).attr("stroke-width", (g) => Math.max(1, g.width)), Lt(void 0, o, 0, y);
 }, "draw"), ce = {
   draw: le
-}, he = /* @__PURE__ */ _((t) => t.replaceAll(/^[^\S\n\r]+|[^\S\n\r]+$/g, "").replaceAll(/([\n\r])+/g, `
-`).trim(), "prepareTextForParsing"), ue = K.parse.bind(K);
-K.parse = (t) => ue(he(t));
+}, ue = /* @__PURE__ */ _((t) => t.replaceAll(/^[^\S\n\r]+|[^\S\n\r]+$/g, "").replaceAll(/([\n\r])+/g, `
+`).trim(), "prepareTextForParsing"), he = K.parse.bind(K);
+K.parse = (t) => he(ue(t));
 var ge = {
   parser: K,
   db: oe,