@kong-ui-public/documentation 0.3.42 → 0.4.0

package/dist/sankeyDiagram-0acdec17-B4vNjMaS-Bauvtonp.js

@@ -0,0 +1,816 @@
+import { c as st, g as _t, s as mt, a as xt, b as kt, x as vt, v as bt, z as At, j as Et, u as wt, h as K, t as Lt } from "./index-B-5DuDrq.js";
+import { h as St } from "./ordinal-MUacOSdK-B1MUT0BL.js";
+import { r as Mt } from "./Tableau10-GLA_9iAD-BMurskAd.js";
+function ot(t, e) {
+  let r;
+  if (e === void 0)
+    for (const c of t)
+      c != null && (r < c || r === void 0 && c >= c) && (r = c);
+  else {
+    let c = -1;
+    for (let a of t)
+      (a = e(a, ++c, t)) != null && (r < a || r === void 0 && a >= a) && (r = a);
+  }
+  return r;
+}
+function yt(t, e) {
+  let r;
+  if (e === void 0)
+    for (const c of t)
+      c != null && (r > c || r === void 0 && c >= c) && (r = c);
+  else {
+    let c = -1;
+    for (let a of t)
+      (a = e(a, ++c, t)) != null && (r > a || r === void 0 && a >= a) && (r = a);
+  }
+  return r;
+}
+function H(t, e) {
+  let r = 0;
+  if (e === void 0)
+    for (let c of t)
+      (c = +c) && (r += c);
+  else {
+    let c = -1;
+    for (let a of t)
+      (a = +e(a, ++c, t)) && (r += a);
+  }
+  return r;
+}
+function It(t) {
+  return t.target.depth;
+}
+function Dt(t) {
+  return t.depth;
+}
+function Ct(t, e) {
+  return e - 1 - t.height;
+}
+function gt(t, e) {
+  return t.sourceLinks.length ? t.depth : e - 1;
+}
+function Pt(t) {
+  return t.targetLinks.length ? t.depth : t.sourceLinks.length ? yt(t.sourceLinks, It) - 1 : 0;
+}
+function Q(t) {
+  return function() {
+    return t;
+  };
+}
+function ct(t, e) {
+  return R(t.source, e.source) || t.index - e.index;
+}
+function at(t, e) {
+  return R(t.target, e.target) || t.index - e.index;
+}
+function R(t, e) {
+  return t.y0 - e.y0;
+}
+function J(t) {
+  return t.value;
+}
+function Nt(t) {
+  return t.index;
+}
+function Ot(t) {
+  return t.nodes;
+}
+function Tt(t) {
+  return t.links;
+}
+function lt(t, e) {
+  const r = t.get(e);
+  if (!r)
+    throw new Error("missing: " + e);
+  return r;
+}
+function ht({ nodes: t }) {
+  for (const e of t) {
+    let r = e.y0, c = r;
+    for (const a of e.sourceLinks)
+      a.y0 = r + a.width / 2, r += a.width;
+    for (const a of e.targetLinks)
+      a.y1 = c + a.width / 2, c += a.width;
+  }
+}
+function $t() {
+  let t = 0, e = 0, r = 1, c = 1, a = 24, x = 8, p, _ = Nt, i = gt, o, f, m = Ot, y = Tt, v = 6;
+  function k() {
+    const n = { nodes: m.apply(null, arguments), links: y.apply(null, arguments) };
+    return D(n), S(n), M(n), O(n), C(n), ht(n), n;
+  }
+  k.update = function(n) {
+    return ht(n), n;
+  }, k.nodeId = function(n) {
+    return arguments.length ? (_ = typeof n == "function" ? n : Q(n), k) : _;
+  }, k.nodeAlign = function(n) {
+    return arguments.length ? (i = typeof n == "function" ? n : Q(n), k) : i;
+  }, k.nodeSort = function(n) {
+    return arguments.length ? (o = n, k) : o;
+  }, k.nodeWidth = function(n) {
+    return arguments.length ? (a = +n, k) : a;
+  }, k.nodePadding = function(n) {
+    return arguments.length ? (x = p = +n, k) : x;
+  }, k.nodes = function(n) {
+    return arguments.length ? (m = typeof n == "function" ? n : Q(n), k) : m;
+  }, k.links = function(n) {
+    return arguments.length ? (y = typeof n == "function" ? n : Q(n), k) : y;
+  }, k.linkSort = function(n) {
+    return arguments.length ? (f = n, k) : f;
+  }, k.size = function(n) {
+    return arguments.length ? (t = e = 0, r = +n[0], c = +n[1], k) : [r - t, c - e];
+  }, k.extent = function(n) {
+    return arguments.length ? (t = +n[0][0], r = +n[1][0], e = +n[0][1], c = +n[1][1], k) : [[t, e], [r, c]];
+  }, k.iterations = function(n) {
+    return arguments.length ? (v = +n, k) : v;
+  };
+  function D({ nodes: n, links: l }) {
+    for (const [u, s] of n.entries())
+      s.index = u, s.sourceLinks = [], s.targetLinks = [];
+    const h = new Map(n.map((u, s) => [_(u, s, n), u]));
+    for (const [u, s] of l.entries()) {
+      s.index = u;
+      let { source: g, target: A } = s;
+      typeof g != "object" && (g = s.source = lt(h, g)), typeof A != "object" && (A = s.target = lt(h, A)), g.sourceLinks.push(s), A.targetLinks.push(s);
+    }
+    if (f != null)
+      for (const { sourceLinks: u, targetLinks: s } of n)
+        u.sort(f), s.sort(f);
+  }
+  function S({ nodes: n }) {
+    for (const l of n)
+      l.value = l.fixedValue === void 0 ? Math.max(H(l.sourceLinks, J), H(l.targetLinks, J)) : l.fixedValue;
+  }
+  function M({ nodes: n }) {
+    const l = n.length;
+    let h = new Set(n), u = /* @__PURE__ */ new Set(), s = 0;
+    for (; h.size; ) {
+      for (const g of h) {
+        g.depth = s;
+        for (const { target: A } of g.sourceLinks)
+          u.add(A);
+      }
+      if (++s > l)
+        throw new Error("circular link");
+      h = u, u = /* @__PURE__ */ new Set();
+    }
+  }
+  function O({ nodes: n }) {
+    const l = n.length;
+    let h = new Set(n), u = /* @__PURE__ */ new Set(), s = 0;
+    for (; h.size; ) {
+      for (const g of h) {
+        g.height = s;
+        for (const { source: A } of g.targetLinks)
+          u.add(A);
+      }
+      if (++s > l)
+        throw new Error("circular link");
+      h = u, u = /* @__PURE__ */ new Set();
+    }
+  }
+  function I({ nodes: n }) {
+    const l = ot(n, (s) => s.depth) + 1, h = (r - t - a) / (l - 1), u = new Array(l);
+    for (const s of n) {
+      const g = Math.max(0, Math.min(l - 1, Math.floor(i.call(null, s, l))));
+      s.layer = g, s.x0 = t + g * h, s.x1 = s.x0 + a, u[g] ? u[g].push(s) : u[g] = [s];
+    }
+    if (o)
+      for (const s of u)
+        s.sort(o);
+    return u;
+  }
+  function b(n) {
+    const l = yt(n, (h) => (c - e - (h.length - 1) * p) / H(h, J));
+    for (const h of n) {
+      let u = e;
+      for (const s of h) {
+        s.y0 = u, s.y1 = u + s.value * l, u = s.y1 + p;
+        for (const g of s.sourceLinks)
+          g.width = g.value * l;
+      }
+      u = (c - u + p) / (h.length + 1);
+      for (let s = 0; s < h.length; ++s) {
+        const g = h[s];
+        g.y0 += u * (s + 1), g.y1 += u * (s + 1);
+      }
+      L(h);
+    }
+  }
+  function C(n) {
+    const l = I(n);
+    p = Math.min(x, (c - e) / (ot(l, (h) => h.length) - 1)), b(l);
+    for (let h = 0; h < v; ++h) {
+      const u = Math.pow(0.99, h), s = Math.max(1 - u, (h + 1) / v);
+      P(l, u, s), T(l, u, s);
+    }
+  }
+  function T(n, l, h) {
+    for (let u = 1, s = n.length; u < s; ++u) {
+      const g = n[u];
+      for (const A of g) {
+        let W = 0, j = 0;
+        for (const { source: X, value: Z } of A.targetLinks) {
+          let q = Z * (A.layer - X.layer);
+          W += U(X, A) * q, j += q;
+        }
+        if (!(j > 0))
+          continue;
+        let G = (W / j - A.y0) * l;
+        A.y0 += G, A.y1 += G, N(A);
+      }
+      o === void 0 && g.sort(R), d(g, h);
+    }
+  }
+  function P(n, l, h) {
+    for (let u = n.length, s = u - 2; s >= 0; --s) {
+      const g = n[s];
+      for (const A of g) {
+        let W = 0, j = 0;
+        for (const { target: X, value: Z } of A.sourceLinks) {
+          let q = Z * (X.layer - A.layer);
+          W += $(A, X) * q, j += q;
+        }
+        if (!(j > 0))
+          continue;
+        let G = (W / j - A.y0) * l;
+        A.y0 += G, A.y1 += G, N(A);
+      }
+      o === void 0 && g.sort(R), d(g, h);
+    }
+  }
+  function d(n, l) {
+    const h = n.length >> 1, u = n[h];
+    E(n, u.y0 - p, h - 1, l), w(n, u.y1 + p, h + 1, l), E(n, c, n.length - 1, l), w(n, e, 0, l);
+  }
+  function w(n, l, h, u) {
+    for (; h < n.length; ++h) {
+      const s = n[h], g = (l - s.y0) * u;
+      g > 1e-6 && (s.y0 += g, s.y1 += g), l = s.y1 + p;
+    }
+  }
+  function E(n, l, h, u) {
+    for (; h >= 0; --h) {
+      const s = n[h], g = (s.y1 - l) * u;
+      g > 1e-6 && (s.y0 -= g, s.y1 -= g), l = s.y0 - p;
+    }
+  }
+  function N({ sourceLinks: n, targetLinks: l }) {
+    if (f === void 0) {
+      for (const { source: { sourceLinks: h } } of l)
+        h.sort(at);
+      for (const { target: { targetLinks: h } } of n)
+        h.sort(ct);
+    }
+  }
+  function L(n) {
+    if (f === void 0)
+      for (const { sourceLinks: l, targetLinks: h } of n)
+        l.sort(at), h.sort(ct);
+  }
+  function U(n, l) {
+    let h = n.y0 - (n.sourceLinks.length - 1) * p / 2;
+    for (const { target: u, width: s } of n.sourceLinks) {
+      if (u === l)
+        break;
+      h += s + p;
+    }
+    for (const { source: u, width: s } of l.targetLinks) {
+      if (u === n)
+        break;
+      h -= s;
+    }
+    return h;
+  }
+  function $(n, l) {
+    let h = l.y0 - (l.targetLinks.length - 1) * p / 2;
+    for (const { source: u, width: s } of l.targetLinks) {
+      if (u === n)
+        break;
+      h += s + p;
+    }
+    for (const { target: u, width: s } of n.sourceLinks) {
+      if (u === l)
+        break;
+      h -= s;
+    }
+    return h;
+  }
+  return k;
+}
+var tt = Math.PI, nt = 2 * tt, z = 1e-6, jt = nt - z;
+function et() {
+  this._x0 = this._y0 = // start of current subpath
+  this._x1 = this._y1 = null, this._ = "";
+}
+function dt() {
+  return new et();
+}
+et.prototype = dt.prototype = {
+  constructor: et,
+  moveTo: function(t, e) {
+    this._ += "M" + (this._x0 = this._x1 = +t) + "," + (this._y0 = this._y1 = +e);
+  },
+  closePath: function() {
+    this._x1 !== null && (this._x1 = this._x0, this._y1 = this._y0, this._ += "Z");
+  },
+  lineTo: function(t, e) {
+    this._ += "L" + (this._x1 = +t) + "," + (this._y1 = +e);
+  },
+  quadraticCurveTo: function(t, e, r, c) {
+    this._ += "Q" + +t + "," + +e + "," + (this._x1 = +r) + "," + (this._y1 = +c);
+  },
+  bezierCurveTo: function(t, e, r, c, a, x) {
+    this._ += "C" + +t + "," + +e + "," + +r + "," + +c + "," + (this._x1 = +a) + "," + (this._y1 = +x);
+  },
+  arcTo: function(t, e, r, c, a) {
+    t = +t, e = +e, r = +r, c = +c, a = +a;
+    var x = this._x1, p = this._y1, _ = r - t, i = c - e, o = x - t, f = p - e, m = o * o + f * f;
+    if (a < 0)
+      throw new Error("negative radius: " + a);
+    if (this._x1 === null)
+      this._ += "M" + (this._x1 = t) + "," + (this._y1 = e);
+    else if (m > z)
+      if (!(Math.abs(f * _ - i * o) > z) || !a)
+        this._ += "L" + (this._x1 = t) + "," + (this._y1 = e);
+      else {
+        var y = r - x, v = c - p, k = _ * _ + i * i, D = y * y + v * v, S = Math.sqrt(k), M = Math.sqrt(m), O = a * Math.tan((tt - Math.acos((k + m - D) / (2 * S * M))) / 2), I = O / M, b = O / S;
+        Math.abs(I - 1) > z && (this._ += "L" + (t + I * o) + "," + (e + I * f)), this._ += "A" + a + "," + a + ",0,0," + +(f * y > o * v) + "," + (this._x1 = t + b * _) + "," + (this._y1 = e + b * i);
+      }
+  },
+  arc: function(t, e, r, c, a, x) {
+    t = +t, e = +e, r = +r, x = !!x;
+    var p = r * Math.cos(c), _ = r * Math.sin(c), i = t + p, o = e + _, f = 1 ^ x, m = x ? c - a : a - c;
+    if (r < 0)
+      throw new Error("negative radius: " + r);
+    this._x1 === null ? this._ += "M" + i + "," + o : (Math.abs(this._x1 - i) > z || Math.abs(this._y1 - o) > z) && (this._ += "L" + i + "," + o), r && (m < 0 && (m = m % nt + nt), m > jt ? this._ += "A" + r + "," + r + ",0,1," + f + "," + (t - p) + "," + (e - _) + "A" + r + "," + r + ",0,1," + f + "," + (this._x1 = i) + "," + (this._y1 = o) : m > z && (this._ += "A" + r + "," + r + ",0," + +(m >= tt) + "," + f + "," + (this._x1 = t + r * Math.cos(a)) + "," + (this._y1 = e + r * Math.sin(a))));
+  },
+  rect: function(t, e, r, c) {
+    this._ += "M" + (this._x0 = this._x1 = +t) + "," + (this._y0 = this._y1 = +e) + "h" + +r + "v" + +c + "h" + -r + "Z";
+  },
+  toString: function() {
+    return this._;
+  }
+};
+function ut(t) {
+  return function() {
+    return t;
+  };
+}
+function zt(t) {
+  return t[0];
+}
+function Ft(t) {
+  return t[1];
+}
+var Ut = Array.prototype.slice;
+function Wt(t) {
+  return t.source;
+}
+function Gt(t) {
+  return t.target;
+}
+function Xt(t) {
+  var e = Wt, r = Gt, c = zt, a = Ft, x = null;
+  function p() {
+    var _, i = Ut.call(arguments), o = e.apply(this, i), f = r.apply(this, i);
+    if (x || (x = _ = dt()), t(x, +c.apply(this, (i[0] = o, i)), +a.apply(this, i), +c.apply(this, (i[0] = f, i)), +a.apply(this, i)), _)
+      return x = null, _ + "" || null;
+  }
+  return p.source = function(_) {
+    return arguments.length ? (e = _, p) : e;
+  }, p.target = function(_) {
+    return arguments.length ? (r = _, p) : r;
+  }, p.x = function(_) {
+    return arguments.length ? (c = typeof _ == "function" ? _ : ut(+_), p) : c;
+  }, p.y = function(_) {
+    return arguments.length ? (a = typeof _ == "function" ? _ : ut(+_), p) : a;
+  }, p.context = function(_) {
+    return arguments.length ? (x = _ ?? null, p) : x;
+  }, p;
+}
+function qt(t, e, r, c, a) {
+  t.moveTo(e, r), t.bezierCurveTo(e = (e + c) / 2, r, e, a, c, a);
+}
+function Kt() {
+  return Xt(qt);
+}
+function Qt(t) {
+  return [t.source.x1, t.y0];
+}
+function Rt(t) {
+  return [t.target.x0, t.y1];
+}
+function Vt() {
+  return Kt().source(Qt).target(Rt);
+}
+var it = function() {
+  var t = function(_, i, o, f) {
+    for (o = o || {}, f = _.length; f--; o[_[f]] = i)
+      ;
+    return o;
+  }, e = [1, 9], r = [1, 10], c = [1, 5, 10, 12], a = {
+    trace: function() {
+    },
+    yy: {},
+    symbols_: { error: 2, start: 3, SANKEY: 4, NEWLINE: 5, csv: 6, opt_eof: 7, record: 8, csv_tail: 9, EOF: 10, "field[source]": 11, COMMA: 12, "field[target]": 13, "field[value]": 14, field: 15, escaped: 16, non_escaped: 17, DQUOTE: 18, ESCAPED_TEXT: 19, NON_ESCAPED_TEXT: 20, $accept: 0, $end: 1 },
+    terminals_: { 2: "error", 4: "SANKEY", 5: "NEWLINE", 10: "EOF", 11: "field[source]", 12: "COMMA", 13: "field[target]", 14: "field[value]", 18: "DQUOTE", 19: "ESCAPED_TEXT", 20: "NON_ESCAPED_TEXT" },
+    productions_: [0, [3, 4], [6, 2], [9, 2], [9, 0], [7, 1], [7, 0], [8, 5], [15, 1], [15, 1], [16, 3], [17, 1]],
+    performAction: function(_, i, o, f, m, y, v) {
+      var k = y.length - 1;
+      switch (m) {
+        case 7:
+          const D = f.findOrCreateNode(y[k - 4].trim().replaceAll('""', '"')), S = f.findOrCreateNode(y[k - 2].trim().replaceAll('""', '"')), M = parseFloat(y[k].trim());
+          f.addLink(D, S, M);
+          break;
+        case 8:
+        case 9:
+        case 11:
+          this.$ = y[k];
+          break;
+        case 10:
+          this.$ = y[k - 1];
+          break;
+      }
+    },
+    table: [{ 3: 1, 4: [1, 2] }, { 1: [3] }, { 5: [1, 3] }, { 6: 4, 8: 5, 15: 6, 16: 7, 17: 8, 18: e, 20: r }, { 1: [2, 6], 7: 11, 10: [1, 12] }, t(r, [2, 4], { 9: 13, 5: [1, 14] }), { 12: [1, 15] }, t(c, [2, 8]), t(c, [2, 9]), { 19: [1, 16] }, t(c, [2, 11]), { 1: [2, 1] }, { 1: [2, 5] }, t(r, [2, 2]), { 6: 17, 8: 5, 15: 6, 16: 7, 17: 8, 18: e, 20: r }, { 15: 18, 16: 7, 17: 8, 18: e, 20: r }, { 18: [1, 19] }, t(r, [2, 3]), { 12: [1, 20] }, t(c, [2, 10]), { 15: 21, 16: 7, 17: 8, 18: e, 20: r }, t([1, 5, 10], [2, 7])],
+    defaultActions: { 11: [2, 1], 12: [2, 5] },
+    parseError: function(_, i) {
+      if (i.recoverable)
+        this.trace(_);
+      else {
+        var o = new Error(_);
+        throw o.hash = i, o;
+      }
+    },
+    parse: function(_) {
+      var i = this, o = [0], f = [], m = [null], y = [], v = this.table, k = "", D = 0, S = 0, M = 2, O = 1, I = y.slice.call(arguments, 1), b = Object.create(this.lexer), C = { yy: {} };
+      for (var T in this.yy)
+        Object.prototype.hasOwnProperty.call(this.yy, T) && (C.yy[T] = this.yy[T]);
+      b.setInput(_, C.yy), C.yy.lexer = b, C.yy.parser = this, typeof b.yylloc > "u" && (b.yylloc = {});
+      var P = b.yylloc;
+      y.push(P);
+      var d = b.options && b.options.ranges;
+      typeof C.yy.parseError == "function" ? this.parseError = C.yy.parseError : this.parseError = Object.getPrototypeOf(this).parseError;
+      function w() {
+        var g;
+        return g = f.pop() || b.lex() || O, typeof g != "number" && (g instanceof Array && (f = g, g = f.pop()), g = i.symbols_[g] || g), g;
+      }
+      for (var E, N, L, U, $ = {}, n, l, h, u; ; ) {
+        if (N = o[o.length - 1], this.defaultActions[N] ? L = this.defaultActions[N] : ((E === null || typeof E > "u") && (E = w()), L = v[N] && v[N][E]), typeof L > "u" || !L.length || !L[0]) {
+          var s = "";
+          u = [];
+          for (n in v[N])
+            this.terminals_[n] && n > M && u.push("'" + this.terminals_[n] + "'");
+          b.showPosition ? s = "Parse error on line " + (D + 1) + `:
+` + b.showPosition() + `
+Expecting ` + u.join(", ") + ", got '" + (this.terminals_[E] || E) + "'" : s = "Parse error on line " + (D + 1) + ": Unexpected " + (E == O ? "end of input" : "'" + (this.terminals_[E] || E) + "'"), this.parseError(s, {
+            text: b.match,
+            token: this.terminals_[E] || E,
+            line: b.yylineno,
+            loc: P,
+            expected: u
+          });
+        }
+        if (L[0] instanceof Array && L.length > 1)
+          throw new Error("Parse Error: multiple actions possible at state: " + N + ", token: " + E);
+        switch (L[0]) {
+          case 1:
+            o.push(E), m.push(b.yytext), y.push(b.yylloc), o.push(L[1]), E = null, S = b.yyleng, k = b.yytext, D = b.yylineno, P = b.yylloc;
+            break;
+          case 2:
+            if (l = this.productions_[L[1]][1], $.$ = m[m.length - l], $._$ = {
+              first_line: y[y.length - (l || 1)].first_line,
+              last_line: y[y.length - 1].last_line,
+              first_column: y[y.length - (l || 1)].first_column,
+              last_column: y[y.length - 1].last_column
+            }, d && ($._$.range = [
+              y[y.length - (l || 1)].range[0],
+              y[y.length - 1].range[1]
+            ]), U = this.performAction.apply($, [
+              k,
+              S,
+              D,
+              C.yy,
+              L[1],
+              m,
+              y
+            ].concat(I)), typeof U < "u")
+              return U;
+            l && (o = o.slice(0, -1 * l * 2), m = m.slice(0, -1 * l), y = y.slice(0, -1 * l)), o.push(this.productions_[L[1]][0]), m.push($.$), y.push($._$), h = v[o[o.length - 2]][o[o.length - 1]], o.push(h);
+            break;
+          case 3:
+            return !0;
+        }
+      }
+      return !0;
+    }
+  }, x = /* @__PURE__ */ function() {
+    var _ = {
+      EOF: 1,
+      parseError: function(i, o) {
+        if (this.yy.parser)
+          this.yy.parser.parseError(i, o);
+        else
+          throw new Error(i);
+      },
+      // resets the lexer, sets new input
+      setInput: function(i, o) {
+        return this.yy = o || this.yy || {}, this._input = i, this._more = this._backtrack = this.done = !1, this.yylineno = this.yyleng = 0, this.yytext = this.matched = this.match = "", this.conditionStack = ["INITIAL"], this.yylloc = {
+          first_line: 1,
+          first_column: 0,
+          last_line: 1,
+          last_column: 0
+        }, this.options.ranges && (this.yylloc.range = [0, 0]), this.offset = 0, this;
+      },
+      // consumes and returns one char from the input
+      input: function() {
+        var i = this._input[0];
+        this.yytext += i, this.yyleng++, this.offset++, this.match += i, this.matched += i;
+        var o = i.match(/(?:\r\n?|\n).*/g);
+        return o ? (this.yylineno++, this.yylloc.last_line++) : this.yylloc.last_column++, this.options.ranges && this.yylloc.range[1]++, this._input = this._input.slice(1), i;
+      },
+      // unshifts one char (or a string) into the input
+      unput: function(i) {
+        var o = i.length, f = i.split(/(?:\r\n?|\n)/g);
+        this._input = i + this._input, this.yytext = this.yytext.substr(0, this.yytext.length - o), this.offset -= o;
+        var m = this.match.split(/(?:\r\n?|\n)/g);
+        this.match = this.match.substr(0, this.match.length - 1), this.matched = this.matched.substr(0, this.matched.length - 1), f.length - 1 && (this.yylineno -= f.length - 1);
+        var y = this.yylloc.range;
+        return this.yylloc = {
+          first_line: this.yylloc.first_line,
+          last_line: this.yylineno + 1,
+          first_column: this.yylloc.first_column,
+          last_column: f ? (f.length === m.length ? this.yylloc.first_column : 0) + m[m.length - f.length].length - f[0].length : this.yylloc.first_column - o
+        }, this.options.ranges && (this.yylloc.range = [y[0], y[0] + this.yyleng - o]), this.yyleng = this.yytext.length, this;
+      },
+      // When called from action, caches matched text and appends it on next action
+      more: function() {
+        return this._more = !0, this;
+      },
+      // When called from action, signals the lexer that this rule fails to match the input, so the next matching rule (regex) should be tested instead.
+      reject: function() {
+        if (this.options.backtrack_lexer)
+          this._backtrack = !0;
+        else
+          return this.parseError("Lexical error on line " + (this.yylineno + 1) + `. You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).
+` + this.showPosition(), {
+            text: "",
+            token: null,
+            line: this.yylineno
+          });
+        return this;
+      },
+      // retain first n characters of the match
+      less: function(i) {
+        this.unput(this.match.slice(i));
+      },
+      // displays already matched input, i.e. for error messages
+      pastInput: function() {
+        var i = this.matched.substr(0, this.matched.length - this.match.length);
+        return (i.length > 20 ? "..." : "") + i.substr(-20).replace(/\n/g, "");
+      },
+      // displays upcoming input, i.e. for error messages
+      upcomingInput: function() {
+        var i = this.match;
+        return i.length < 20 && (i += this._input.substr(0, 20 - i.length)), (i.substr(0, 20) + (i.length > 20 ? "..." : "")).replace(/\n/g, "");
+      },
+      // displays the character position where the lexing error occurred, i.e. for error messages
+      showPosition: function() {
+        var i = this.pastInput(), o = new Array(i.length + 1).join("-");
+        return i + this.upcomingInput() + `
+` + o + "^";
+      },
+      // test the lexed token: return FALSE when not a match, otherwise return token
+      test_match: function(i, o) {
+        var f, m, y;
+        if (this.options.backtrack_lexer && (y = {
+          yylineno: this.yylineno,
+          yylloc: {
+            first_line: this.yylloc.first_line,
+            last_line: this.last_line,
+            first_column: this.yylloc.first_column,
+            last_column: this.yylloc.last_column
+          },
+          yytext: this.yytext,
+          match: this.match,
+          matches: this.matches,
+          matched: this.matched,
+          yyleng: this.yyleng,
+          offset: this.offset,
+          _more: this._more,
+          _input: this._input,
+          yy: this.yy,
+          conditionStack: this.conditionStack.slice(0),
+          done: this.done
+        }, this.options.ranges && (y.yylloc.range = this.yylloc.range.slice(0))), m = i[0].match(/(?:\r\n?|\n).*/g), m && (this.yylineno += m.length), this.yylloc = {
+          first_line: this.yylloc.last_line,
+          last_line: this.yylineno + 1,
+          first_column: this.yylloc.last_column,
+          last_column: m ? m[m.length - 1].length - m[m.length - 1].match(/\r?\n?/)[0].length : this.yylloc.last_column + i[0].length
+        }, this.yytext += i[0], this.match += i[0], this.matches = i, this.yyleng = this.yytext.length, this.options.ranges && (this.yylloc.range = [this.offset, this.offset += this.yyleng]), this._more = !1, this._backtrack = !1, this._input = this._input.slice(i[0].length), this.matched += i[0], f = this.performAction.call(this, this.yy, this, o, this.conditionStack[this.conditionStack.length - 1]), this.done && this._input && (this.done = !1), f)
+          return f;
+        if (this._backtrack) {
+          for (var v in y)
+            this[v] = y[v];
+          return !1;
+        }
+        return !1;
+      },
+      // return next match in input
+      next: function() {
+        if (this.done)
+          return this.EOF;
+        this._input || (this.done = !0);
+        var i, o, f, m;
+        this._more || (this.yytext = "", this.match = "");
+        for (var y = this._currentRules(), v = 0; v < y.length; v++)
+          if (f = this._input.match(this.rules[y[v]]), f && (!o || f[0].length > o[0].length)) {
+            if (o = f, m = v, this.options.backtrack_lexer) {
+              if (i = this.test_match(f, y[v]), i !== !1)
+                return i;
+              if (this._backtrack) {
+                o = !1;
+                continue;
+              } else
+                return !1;
+            } else if (!this.options.flex)
+              break;
+          }
+        return o ? (i = this.test_match(o, y[m]), i !== !1 ? i : !1) : this._input === "" ? this.EOF : this.parseError("Lexical error on line " + (this.yylineno + 1) + `. Unrecognized text.
+` + this.showPosition(), {
+          text: "",
+          token: null,
+          line: this.yylineno
+        });
+      },
+      // return next match that has a token
+      lex: function() {
+        var i = this.next();
+        return i || this.lex();
+      },
+      // activates a new lexer condition state (pushes the new lexer condition state onto the condition stack)
+      begin: function(i) {
+        this.conditionStack.push(i);
+      },
+      // pop the previously active lexer condition state off the condition stack
+      popState: function() {
+        var i = this.conditionStack.length - 1;
+        return i > 0 ? this.conditionStack.pop() : this.conditionStack[0];
+      },
+      // produce the lexer rule set which is active for the currently active lexer condition state
+      _currentRules: function() {
+        return this.conditionStack.length && this.conditionStack[this.conditionStack.length - 1] ? this.conditions[this.conditionStack[this.conditionStack.length - 1]].rules : this.conditions.INITIAL.rules;
+      },
+      // return the currently active lexer condition state; when an index argument is provided it produces the N-th previous condition state, if available
+      topState: function(i) {
+        return i = this.conditionStack.length - 1 - Math.abs(i || 0), i >= 0 ? this.conditionStack[i] : "INITIAL";
+      },
+      // alias for begin(condition)
+      pushState: function(i) {
+        this.begin(i);
+      },
+      // return the number of states currently on the stack
+      stateStackSize: function() {
+        return this.conditionStack.length;
+      },
+      options: { easy_keword_rules: !0 },
+      performAction: function(i, o, f, m) {
+        switch (f) {
+          case 0:
+            return this.pushState("csv"), 4;
+          case 1:
+            return 10;
+          case 2:
+            return 5;
+          case 3:
+            return 12;
+          case 4:
+            return this.pushState("escaped_text"), 18;
+          case 5:
+            return 20;
+          case 6:
+            return this.popState("escaped_text"), 18;
+          case 7:
+            return 19;
+        }
+      },
+      rules: [/^(?:sankey-beta\b)/, /^(?:$)/, /^(?:((\u000D\u000A)|(\u000A)))/, /^(?:(\u002C))/, /^(?:(\u0022))/, /^(?:([\u0020-\u0021\u0023-\u002B\u002D-\u007E])*)/, /^(?:(\u0022)(?!(\u0022)))/, /^(?:(([\u0020-\u0021\u0023-\u002B\u002D-\u007E])|(\u002C)|(\u000D)|(\u000A)|(\u0022)(\u0022))*)/],
+      conditions: { csv: { rules: [1, 2, 3, 4, 5, 6, 7], inclusive: !1 }, escaped_text: { rules: [6, 7], inclusive: !1 }, INITIAL: { rules: [0, 1, 2, 3, 4, 5, 6, 7], inclusive: !0 } }
+    };
+    return _;
+  }();
+  a.lexer = x;
+  function p() {
+    this.yy = {};
+  }
+  return p.prototype = a, a.Parser = p, new p();
+}();
+it.parser = it;
+const V = it;
+let Y = [], B = [], F = {};
+const Yt = () => {
+  Y = [], B = [], F = {}, At();
+};
+class Bt {
+  constructor(e, r, c = 0) {
+    this.source = e, this.target = r, this.value = c;
+  }
+}
+const Zt = (t, e, r) => {
+  Y.push(new Bt(t, e, r));
+};
+class Ht {
+  constructor(e) {
+    this.ID = e;
+  }
+}
+const Jt = (t) => (t = Et.sanitizeText(t, st()), F[t] || (F[t] = new Ht(t), B.push(F[t])), F[t]), tn = () => B, nn = () => Y, en = () => ({
+  nodes: B.map((t) => ({ id: t.ID })),
+  links: Y.map((t) => ({
+    source: t.source.ID,
+    target: t.target.ID,
+    value: t.value
+  }))
+}), rn = {
+  nodesMap: F,
+  getConfig: () => st().sankey,
+  getNodes: tn,
+  getLinks: nn,
+  getGraph: en,
+  addLink: Zt,
+  findOrCreateNode: Jt,
+  getAccTitle: _t,
+  setAccTitle: mt,
+  getAccDescription: xt,
+  setAccDescription: kt,
+  getDiagramTitle: vt,
+  setDiagramTitle: bt,
+  clear: Yt
+}, pt = class rt {
+  static next(e) {
+    return new rt(e + ++rt.count);
+  }
+  constructor(e) {
+    this.id = e, this.href = `#${e}`;
+  }
+  toString() {
+    return "url(" + this.href + ")";
+  }
+};
+pt.count = 0;
+let ft = pt;
+const sn = {
+  left: Dt,
+  right: Ct,
+  center: Pt,
+  justify: gt
+}, on = function(t, e, r, c) {
+  const { securityLevel: a, sankey: x } = st(), p = wt.sankey;
+  let _;
+  a === "sandbox" && (_ = K("#i" + e));
+  const i = a === "sandbox" ? K(_.nodes()[0].contentDocument.body) : K("body"), o = a === "sandbox" ? i.select(`[id="${e}"]`) : K(`[id="${e}"]`), f = (x == null ? void 0 : x.width) ?? p.width, m = (x == null ? void 0 : x.height) ?? p.width, y = (x == null ? void 0 : x.useMaxWidth) ?? p.useMaxWidth, v = (x == null ? void 0 : x.nodeAlignment) ?? p.nodeAlignment, k = (x == null ? void 0 : x.prefix) ?? p.prefix, D = (x == null ? void 0 : x.suffix) ?? p.suffix, S = (x == null ? void 0 : x.showValues) ?? p.showValues, M = c.db.getGraph(), O = sn[v];
+  $t().nodeId((d) => d.id).nodeWidth(10).nodePadding(10 + (S ? 15 : 0)).nodeAlign(O).extent([
+    [0, 0],
+    [f, m]
+  ])(M);
+  const I = St(Mt);
+  o.append("g").attr("class", "nodes").selectAll(".node").data(M.nodes).join("g").attr("class", "node").attr("id", (d) => (d.uid = ft.next("node-")).id).attr("transform", function(d) {
+    return "translate(" + d.x0 + "," + d.y0 + ")";
+  }).attr("x", (d) => d.x0).attr("y", (d) => d.y0).append("rect").attr("height", (d) => d.y1 - d.y0).attr("width", (d) => d.x1 - d.x0).attr("fill", (d) => I(d.id));
+  const b = ({ id: d, value: w }) => S ? `${d}
+${k}${Math.round(w * 100) / 100}${D}` : d;
+  o.append("g").attr("class", "node-labels").attr("font-family", "sans-serif").attr("font-size", 14).selectAll("text").data(M.nodes).join("text").attr("x", (d) => d.x0 < f / 2 ? d.x1 + 6 : d.x0 - 6).attr("y", (d) => (d.y1 + d.y0) / 2).attr("dy", `${S ? "0" : "0.35"}em`).attr("text-anchor", (d) => d.x0 < f / 2 ? "start" : "end").text(b);
+  const C = o.append("g").attr("class", "links").attr("fill", "none").attr("stroke-opacity", 0.5).selectAll(".link").data(M.links).join("g").attr("class", "link").style("mix-blend-mode", "multiply"), T = (x == null ? void 0 : x.linkColor) || "gradient";
+  if (T === "gradient") {
+    const d = C.append("linearGradient").attr("id", (w) => (w.uid = ft.next("linearGradient-")).id).attr("gradientUnits", "userSpaceOnUse").attr("x1", (w) => w.source.x1).attr("x2", (w) => w.target.x0);
+    d.append("stop").attr("offset", "0%").attr("stop-color", (w) => I(w.source.id)), d.append("stop").attr("offset", "100%").attr("stop-color", (w) => I(w.target.id));
+  }
+  let P;
+  switch (T) {
+    case "gradient":
+      P = (d) => d.uid;
+      break;
+    case "source":
+      P = (d) => I(d.source.id);
+      break;
+    case "target":
+      P = (d) => I(d.target.id);
+      break;
+    default:
+      P = T;
+  }
+  C.append("path").attr("d", Vt()).attr("stroke", P).attr("stroke-width", (d) => Math.max(1, d.width)), Lt(void 0, o, 0, y);
+}, cn = {
+  draw: on
+}, an = (t) => t.replaceAll(/^[^\S\n\r]+|[^\S\n\r]+$/g, "").replaceAll(/([\n\r])+/g, `
+`).trim(), ln = V.parse.bind(V);
+V.parse = (t) => ln(an(t));
+const yn = {
+  parser: V,
+  db: rn,
+  renderer: cn
+};
+export {
+  yn as diagram
+};