@schmitech/chatbot-widget 0.5.3 → 0.5.4

package/dist/sankeyDiagram-a04cb91d-CBlXzOgd-CWJTc5AX.js

@@ -0,0 +1,802 @@
+import { x as _t, w as mt, y as xt, v as kt, a as vt, b as bt, g as rt, aJ as wt, P as G, ad as Et, d as Lt, m as At, l as St } from "./index-s6Yb6o1D.js";
+import { r as Mt } from "./Tableau10-D7jGxypv-BNlEL2G_.js";
+typeof window < "u" && (window.global = window);
+function ot(t, e) {
+  let s;
+  if (e === void 0)
+    for (const a of t)
+      a != null && (s < a || s === void 0 && a >= a) && (s = a);
+  else {
+    let a = -1;
+    for (let l of t)
+      (l = e(l, ++a, t)) != null && (s < l || s === void 0 && l >= l) && (s = l);
+  }
+  return s;
+}
+function yt(t, e) {
+  let s;
+  if (e === void 0)
+    for (const a of t)
+      a != null && (s > a || s === void 0 && a >= a) && (s = a);
+  else {
+    let a = -1;
+    for (let l of t)
+      (l = e(l, ++a, t)) != null && (s > l || s === void 0 && l >= l) && (s = l);
+  }
+  return s;
+}
+function Z(t, e) {
+  let s = 0;
+  if (e === void 0)
+    for (let a of t)
+      (a = +a) && (s += a);
+  else {
+    let a = -1;
+    for (let l of t)
+      (l = +e(l, ++a, t)) && (s += l);
+  }
+  return s;
+}
+function It(t) {
+  return t.target.depth;
+}
+function Pt(t) {
+  return t.depth;
+}
+function Dt(t, e) {
+  return e - 1 - t.height;
+}
+function gt(t, e) {
+  return t.sourceLinks.length ? t.depth : e - 1;
+}
+function Nt(t) {
+  return t.targetLinks.length ? t.depth : t.sourceLinks.length ? yt(t.sourceLinks, It) - 1 : 0;
+}
+function K(t) {
+  return function() {
+    return t;
+  };
+}
+function at(t, e) {
+  return Q(t.source, e.source) || t.index - e.index;
+}
+function lt(t, e) {
+  return Q(t.target, e.target) || t.index - e.index;
+}
+function Q(t, e) {
+  return t.y0 - e.y0;
+}
+function H(t) {
+  return t.value;
+}
+function Ct(t) {
+  return t.index;
+}
+function Ot(t) {
+  return t.nodes;
+}
+function Tt(t) {
+  return t.links;
+}
+function ct(t, e) {
+  const s = t.get(e);
+  if (!s) throw new Error("missing: " + e);
+  return s;
+}
+function ht({ nodes: t }) {
+  for (const e of t) {
+    let s = e.y0, a = s;
+    for (const l of e.sourceLinks)
+      l.y0 = s + l.width / 2, s += l.width;
+    for (const l of e.targetLinks)
+      l.y1 = a + l.width / 2, a += l.width;
+  }
+}
+function jt() {
+  let t = 0, e = 0, s = 1, a = 1, l = 24, x = 8, p, _ = Ct, 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 P(n), S(n), M(n), O(n), D(n), ht(n), n;
+  }
+  k.update = function(n) {
+    return ht(n), n;
+  }, k.nodeId = function(n) {
+    return arguments.length ? (_ = typeof n == "function" ? n : K(n), k) : _;
+  }, k.nodeAlign = function(n) {
+    return arguments.length ? (i = typeof n == "function" ? n : K(n), k) : i;
+  }, k.nodeSort = function(n) {
+    return arguments.length ? (o = n, k) : o;
+  }, k.nodeWidth = function(n) {
+    return arguments.length ? (l = +n, k) : l;
+  }, k.nodePadding = function(n) {
+    return arguments.length ? (x = p = +n, k) : x;
+  }, k.nodes = function(n) {
+    return arguments.length ? (m = typeof n == "function" ? n : K(n), k) : m;
+  }, k.links = function(n) {
+    return arguments.length ? (y = typeof n == "function" ? n : K(n), k) : y;
+  }, k.linkSort = function(n) {
+    return arguments.length ? (f = n, k) : f;
+  }, k.size = function(n) {
+    return arguments.length ? (t = e = 0, s = +n[0], a = +n[1], k) : [s - t, a - e];
+  }, k.extent = function(n) {
+    return arguments.length ? (t = +n[0][0], s = +n[1][0], e = +n[0][1], a = +n[1][1], k) : [[t, e], [s, a]];
+  }, k.iterations = function(n) {
+    return arguments.length ? (v = +n, k) : v;
+  };
+  function P({ nodes: n, links: c }) {
+    for (const [u, r] of n.entries())
+      r.index = u, r.sourceLinks = [], r.targetLinks = [];
+    const h = new Map(n.map((u, r) => [_(u, r, n), u]));
+    for (const [u, r] of c.entries()) {
+      r.index = u;
+      let { source: g, target: w } = r;
+      typeof g != "object" && (g = r.source = ct(h, g)), typeof w != "object" && (w = r.target = ct(h, w)), g.sourceLinks.push(r), w.targetLinks.push(r);
+    }
+    if (f != null)
+      for (const { sourceLinks: u, targetLinks: r } of n)
+        u.sort(f), r.sort(f);
+  }
+  function S({ nodes: n }) {
+    for (const c of n)
+      c.value = c.fixedValue === void 0 ? Math.max(Z(c.sourceLinks, H), Z(c.targetLinks, H)) : c.fixedValue;
+  }
+  function M({ nodes: n }) {
+    const c = n.length;
+    let h = new Set(n), u = /* @__PURE__ */ new Set(), r = 0;
+    for (; h.size; ) {
+      for (const g of h) {
+        g.depth = r;
+        for (const { target: w } of g.sourceLinks)
+          u.add(w);
+      }
+      if (++r > c) throw new Error("circular link");
+      h = u, u = /* @__PURE__ */ new Set();
+    }
+  }
+  function O({ nodes: n }) {
+    const c = n.length;
+    let h = new Set(n), u = /* @__PURE__ */ new Set(), r = 0;
+    for (; h.size; ) {
+      for (const g of h) {
+        g.height = r;
+        for (const { source: w } of g.targetLinks)
+          u.add(w);
+      }
+      if (++r > c) throw new Error("circular link");
+      h = u, u = /* @__PURE__ */ new Set();
+    }
+  }
+  function I({ nodes: n }) {
+    const c = ot(n, (r) => r.depth) + 1, h = (s - t - l) / (c - 1), u = new Array(c);
+    for (const r of n) {
+      const g = Math.max(0, Math.min(c - 1, Math.floor(i.call(null, r, c))));
+      r.layer = g, r.x0 = t + g * h, r.x1 = r.x0 + l, u[g] ? u[g].push(r) : u[g] = [r];
+    }
+    if (o) for (const r of u)
+      r.sort(o);
+    return u;
+  }
+  function b(n) {
+    const c = yt(n, (h) => (a - e - (h.length - 1) * p) / Z(h, H));
+    for (const h of n) {
+      let u = e;
+      for (const r of h) {
+        r.y0 = u, r.y1 = u + r.value * c, u = r.y1 + p;
+        for (const g of r.sourceLinks)
+          g.width = g.value * c;
+      }
+      u = (a - u + p) / (h.length + 1);
+      for (let r = 0; r < h.length; ++r) {
+        const g = h[r];
+        g.y0 += u * (r + 1), g.y1 += u * (r + 1);
+      }
+      A(h);
+    }
+  }
+  function D(n) {
+    const c = I(n);
+    p = Math.min(x, (a - e) / (ot(c, (h) => h.length) - 1)), b(c);
+    for (let h = 0; h < v; ++h) {
+      const u = Math.pow(0.99, h), r = Math.max(1 - u, (h + 1) / v);
+      N(c, u, r), T(c, u, r);
+    }
+  }
+  function T(n, c, h) {
+    for (let u = 1, r = n.length; u < r; ++u) {
+      const g = n[u];
+      for (const w of g) {
+        let W = 0, $ = 0;
+        for (const { source: X, value: V } of w.targetLinks) {
+          let q = V * (w.layer - X.layer);
+          W += U(X, w) * q, $ += q;
+        }
+        if (!($ > 0)) continue;
+        let R = (W / $ - w.y0) * c;
+        w.y0 += R, w.y1 += R, C(w);
+      }
+      o === void 0 && g.sort(Q), d(g, h);
+    }
+  }
+  function N(n, c, h) {
+    for (let u = n.length, r = u - 2; r >= 0; --r) {
+      const g = n[r];
+      for (const w of g) {
+        let W = 0, $ = 0;
+        for (const { target: X, value: V } of w.sourceLinks) {
+          let q = V * (X.layer - w.layer);
+          W += j(w, X) * q, $ += q;
+        }
+        if (!($ > 0)) continue;
+        let R = (W / $ - w.y0) * c;
+        w.y0 += R, w.y1 += R, C(w);
+      }
+      o === void 0 && g.sort(Q), d(g, h);
+    }
+  }
+  function d(n, c) {
+    const h = n.length >> 1, u = n[h];
+    E(n, u.y0 - p, h - 1, c), L(n, u.y1 + p, h + 1, c), E(n, a, n.length - 1, c), L(n, e, 0, c);
+  }
+  function L(n, c, h, u) {
+    for (; h < n.length; ++h) {
+      const r = n[h], g = (c - r.y0) * u;
+      g > 1e-6 && (r.y0 += g, r.y1 += g), c = r.y1 + p;
+    }
+  }
+  function E(n, c, h, u) {
+    for (; h >= 0; --h) {
+      const r = n[h], g = (r.y1 - c) * u;
+      g > 1e-6 && (r.y0 -= g, r.y1 -= g), c = r.y0 - p;
+    }
+  }
+  function C({ sourceLinks: n, targetLinks: c }) {
+    if (f === void 0) {
+      for (const { source: { sourceLinks: h } } of c)
+        h.sort(lt);
+      for (const { target: { targetLinks: h } } of n)
+        h.sort(at);
+    }
+  }
+  function A(n) {
+    if (f === void 0)
+      for (const { sourceLinks: c, targetLinks: h } of n)
+        c.sort(lt), h.sort(at);
+  }
+  function U(n, c) {
+    let h = n.y0 - (n.sourceLinks.length - 1) * p / 2;
+    for (const { target: u, width: r } of n.sourceLinks) {
+      if (u === c) break;
+      h += r + p;
+    }
+    for (const { source: u, width: r } of c.targetLinks) {
+      if (u === n) break;
+      h -= r;
+    }
+    return h;
+  }
+  function j(n, c) {
+    let h = c.y0 - (c.targetLinks.length - 1) * p / 2;
+    for (const { source: u, width: r } of c.targetLinks) {
+      if (u === n) break;
+      h += r + p;
+    }
+    for (const { target: u, width: r } of n.sourceLinks) {
+      if (u === c) break;
+      h -= r;
+    }
+    return h;
+  }
+  return k;
+}
+var tt = Math.PI, nt = 2 * tt, z = 1e-6, $t = 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, s, a) {
+    this._ += "Q" + +t + "," + +e + "," + (this._x1 = +s) + "," + (this._y1 = +a);
+  },
+  bezierCurveTo: function(t, e, s, a, l, x) {
+    this._ += "C" + +t + "," + +e + "," + +s + "," + +a + "," + (this._x1 = +l) + "," + (this._y1 = +x);
+  },
+  arcTo: function(t, e, s, a, l) {
+    t = +t, e = +e, s = +s, a = +a, l = +l;
+    var x = this._x1, p = this._y1, _ = s - t, i = a - e, o = x - t, f = p - e, m = o * o + f * f;
+    if (l < 0) throw new Error("negative radius: " + l);
+    if (this._x1 === null)
+      this._ += "M" + (this._x1 = t) + "," + (this._y1 = e);
+    else if (m > z) if (!(Math.abs(f * _ - i * o) > z) || !l)
+      this._ += "L" + (this._x1 = t) + "," + (this._y1 = e);
+    else {
+      var y = s - x, v = a - p, k = _ * _ + i * i, P = y * y + v * v, S = Math.sqrt(k), M = Math.sqrt(m), O = l * Math.tan((tt - Math.acos((k + m - P) / (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" + l + "," + l + ",0,0," + +(f * y > o * v) + "," + (this._x1 = t + b * _) + "," + (this._y1 = e + b * i);
+    }
+  },
+  arc: function(t, e, s, a, l, x) {
+    t = +t, e = +e, s = +s, x = !!x;
+    var p = s * Math.cos(a), _ = s * Math.sin(a), i = t + p, o = e + _, f = 1 ^ x, m = x ? a - l : l - a;
+    if (s < 0) throw new Error("negative radius: " + s);
+    this._x1 === null ? this._ += "M" + i + "," + o : (Math.abs(this._x1 - i) > z || Math.abs(this._y1 - o) > z) && (this._ += "L" + i + "," + o), s && (m < 0 && (m = m % nt + nt), m > $t ? this._ += "A" + s + "," + s + ",0,1," + f + "," + (t - p) + "," + (e - _) + "A" + s + "," + s + ",0,1," + f + "," + (this._x1 = i) + "," + (this._y1 = o) : m > z && (this._ += "A" + s + "," + s + ",0," + +(m >= tt) + "," + f + "," + (this._x1 = t + s * Math.cos(l)) + "," + (this._y1 = e + s * Math.sin(l))));
+  },
+  rect: function(t, e, s, a) {
+    this._ += "M" + (this._x0 = this._x1 = +t) + "," + (this._y0 = this._y1 = +e) + "h" + +s + "v" + +a + "h" + -s + "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 Rt(t) {
+  return t.target;
+}
+function Xt(t) {
+  var e = Wt, s = Rt, a = zt, l = Ft, x = null;
+  function p() {
+    var _, i = Ut.call(arguments), o = e.apply(this, i), f = s.apply(this, i);
+    if (x || (x = _ = dt()), t(x, +a.apply(this, (i[0] = o, i)), +l.apply(this, i), +a.apply(this, (i[0] = f, i)), +l.apply(this, i)), _) return x = null, _ + "" || null;
+  }
+  return p.source = function(_) {
+    return arguments.length ? (e = _, p) : e;
+  }, p.target = function(_) {
+    return arguments.length ? (s = _, p) : s;
+  }, p.x = function(_) {
+    return arguments.length ? (a = typeof _ == "function" ? _ : ut(+_), p) : a;
+  }, p.y = function(_) {
+    return arguments.length ? (l = typeof _ == "function" ? _ : ut(+_), p) : l;
+  }, p.context = function(_) {
+    return arguments.length ? (x = _ ?? null, p) : x;
+  }, p;
+}
+function qt(t, e, s, a, l) {
+  t.moveTo(e, s), t.bezierCurveTo(e = (e + a) / 2, s, e, l, a, l);
+}
+function Gt() {
+  return Xt(qt);
+}
+function Kt(t) {
+  return [t.source.x1, t.y0];
+}
+function Qt(t) {
+  return [t.target.x0, t.y1];
+}
+function Yt() {
+  return Gt().source(Kt).target(Qt);
+}
+var it = function() {
+  var t = function(_, i, o, f) {
+    for (o = o || {}, f = _.length; f--; o[_[f]] = i)
+      ;
+    return o;
+  }, e = [1, 9], s = [1, 10], a = [1, 5, 10, 12], l = {
+    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 P = f.findOrCreateNode(y[k - 4].trim().replaceAll('""', '"')), S = f.findOrCreateNode(y[k - 2].trim().replaceAll('""', '"')), M = parseFloat(y[k].trim());
+          f.addLink(P, 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: s }, { 1: [2, 6], 7: 11, 10: [1, 12] }, t(s, [2, 4], { 9: 13, 5: [1, 14] }), { 12: [1, 15] }, t(a, [2, 8]), t(a, [2, 9]), { 19: [1, 16] }, t(a, [2, 11]), { 1: [2, 1] }, { 1: [2, 5] }, t(s, [2, 2]), { 6: 17, 8: 5, 15: 6, 16: 7, 17: 8, 18: e, 20: s }, { 15: 18, 16: 7, 17: 8, 18: e, 20: s }, { 18: [1, 19] }, t(s, [2, 3]), { 12: [1, 20] }, t(a, [2, 10]), { 15: 21, 16: 7, 17: 8, 18: e, 20: s }, 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 = "", P = 0, S = 0, M = 2, O = 1, I = y.slice.call(arguments, 1), b = Object.create(this.lexer), D = { yy: {} };
+      for (var T in this.yy)
+        Object.prototype.hasOwnProperty.call(this.yy, T) && (D.yy[T] = this.yy[T]);
+      b.setInput(_, D.yy), D.yy.lexer = b, D.yy.parser = this, typeof b.yylloc > "u" && (b.yylloc = {});
+      var N = b.yylloc;
+      y.push(N);
+      var d = b.options && b.options.ranges;
+      typeof D.yy.parseError == "function" ? this.parseError = D.yy.parseError : this.parseError = Object.getPrototypeOf(this).parseError;
+      function L() {
+        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, C, A, U, j = {}, n, c, h, u; ; ) {
+        if (C = o[o.length - 1], this.defaultActions[C] ? A = this.defaultActions[C] : ((E === null || typeof E > "u") && (E = L()), A = v[C] && v[C][E]), typeof A > "u" || !A.length || !A[0]) {
+          var r = "";
+          u = [];
+          for (n in v[C])
+            this.terminals_[n] && n > M && u.push("'" + this.terminals_[n] + "'");
+          b.showPosition ? r = "Parse error on line " + (P + 1) + `:
+` + b.showPosition() + `
+Expecting ` + u.join(", ") + ", got '" + (this.terminals_[E] || E) + "'" : r = "Parse error on line " + (P + 1) + ": Unexpected " + (E == O ? "end of input" : "'" + (this.terminals_[E] || E) + "'"), this.parseError(r, {
+            text: b.match,
+            token: this.terminals_[E] || E,
+            line: b.yylineno,
+            loc: N,
+            expected: u
+          });
+        }
+        if (A[0] instanceof Array && A.length > 1)
+          throw new Error("Parse Error: multiple actions possible at state: " + C + ", token: " + E);
+        switch (A[0]) {
+          case 1:
+            o.push(E), m.push(b.yytext), y.push(b.yylloc), o.push(A[1]), E = null, S = b.yyleng, k = b.yytext, P = b.yylineno, N = b.yylloc;
+            break;
+          case 2:
+            if (c = this.productions_[A[1]][1], j.$ = m[m.length - c], j._$ = {
+              first_line: y[y.length - (c || 1)].first_line,
+              last_line: y[y.length - 1].last_line,
+              first_column: y[y.length - (c || 1)].first_column,
+              last_column: y[y.length - 1].last_column
+            }, d && (j._$.range = [
+              y[y.length - (c || 1)].range[0],
+              y[y.length - 1].range[1]
+            ]), U = this.performAction.apply(j, [
+              k,
+              S,
+              P,
+              D.yy,
+              A[1],
+              m,
+              y
+            ].concat(I)), typeof U < "u")
+              return U;
+            c && (o = o.slice(0, -1 * c * 2), m = m.slice(0, -1 * c), y = y.slice(0, -1 * c)), o.push(this.productions_[A[1]][0]), m.push(j.$), y.push(j._$), 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: { "case-insensitive": !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)/i, /^(?:$)/i, /^(?:((\u000D\u000A)|(\u000A)))/i, /^(?:(\u002C))/i, /^(?:(\u0022))/i, /^(?:([\u0020-\u0021\u0023-\u002B\u002D-\u007E])*)/i, /^(?:(\u0022)(?!(\u0022)))/i, /^(?:(([\u0020-\u0021\u0023-\u002B\u002D-\u007E])|(\u002C)|(\u000D)|(\u000A)|(\u0022)(\u0022))*)/i],
+      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 _;
+  }();
+  l.lexer = x;
+  function p() {
+    this.yy = {};
+  }
+  return p.prototype = l, l.Parser = p, new p();
+}();
+it.parser = it;
+const Y = it;
+let B = [], J = [], F = {};
+const Bt = () => {
+  B = [], J = [], F = {}, At();
+};
+class Jt {
+  constructor(e, s, a = 0) {
+    this.source = e, this.target = s, this.value = a;
+  }
+}
+const Vt = (t, e, s) => {
+  B.push(new Jt(t, e, s));
+};
+class Zt {
+  constructor(e) {
+    this.ID = e;
+  }
+}
+const Ht = (t) => (t = St.sanitizeText(t, rt()), F[t] || (F[t] = new Zt(t), J.push(F[t])), F[t]), tn = () => J, nn = () => B, en = () => ({
+  nodes: J.map((t) => ({ id: t.ID })),
+  links: B.map((t) => ({
+    source: t.source.ID,
+    target: t.target.ID,
+    value: t.value
+  }))
+}), sn = {
+  nodesMap: F,
+  getConfig: () => rt().sankey,
+  getNodes: tn,
+  getLinks: nn,
+  getGraph: en,
+  addLink: Vt,
+  findOrCreateNode: Ht,
+  getAccTitle: bt,
+  setAccTitle: vt,
+  getAccDescription: kt,
+  setAccDescription: xt,
+  getDiagramTitle: mt,
+  setDiagramTitle: _t,
+  clear: Bt
+}, pt = class st {
+  static next(e) {
+    return new st(e + ++st.count);
+  }
+  constructor(e) {
+    this.id = e, this.href = `#${e}`;
+  }
+  toString() {
+    return "url(" + this.href + ")";
+  }
+};
+pt.count = 0;
+let ft = pt;
+const rn = {
+  left: Pt,
+  right: Dt,
+  center: Nt,
+  justify: gt
+}, on = function(t, e, s, a) {
+  const { securityLevel: l, sankey: x } = rt(), p = wt.sankey;
+  let _;
+  l === "sandbox" && (_ = G("#i" + e));
+  const i = l === "sandbox" ? G(_.nodes()[0].contentDocument.body) : G("body"), o = l === "sandbox" ? i.select(`[id="${e}"]`) : G(`[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, P = (x == null ? void 0 : x.suffix) ?? p.suffix, S = (x == null ? void 0 : x.showValues) ?? p.showValues, M = a.db.getGraph(), O = rn[v];
+  jt().nodeId((d) => d.id).nodeWidth(10).nodePadding(10 + (S ? 15 : 0)).nodeAlign(O).extent([
+    [0, 0],
+    [f, m]
+  ])(M);
+  const I = Et(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: L }) => S ? `${d}
+${k}${Math.round(L * 100) / 100}${P}` : 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 D = 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 = D.append("linearGradient").attr("id", (L) => (L.uid = ft.next("linearGradient-")).id).attr("gradientUnits", "userSpaceOnUse").attr("x1", (L) => L.source.x1).attr("x2", (L) => L.target.x0);
+    d.append("stop").attr("offset", "0%").attr("stop-color", (L) => I(L.source.id)), d.append("stop").attr("offset", "100%").attr("stop-color", (L) => I(L.target.id));
+  }
+  let N;
+  switch (T) {
+    case "gradient":
+      N = (d) => d.uid;
+      break;
+    case "source":
+      N = (d) => I(d.source.id);
+      break;
+    case "target":
+      N = (d) => I(d.target.id);
+      break;
+    default:
+      N = T;
+  }
+  D.append("path").attr("d", Yt()).attr("stroke", N).attr("stroke-width", (d) => Math.max(1, d.width)), Lt(void 0, o, 0, y);
+}, an = {
+  draw: on
+}, ln = (t) => t.replaceAll(/^[^\S\n\r]+|[^\S\n\r]+$/g, "").replaceAll(/([\n\r])+/g, `
+`).trim(), cn = Y.parse.bind(Y);
+Y.parse = (t) => cn(ln(t));
+const fn = {
+  parser: Y,
+  db: sn,
+  renderer: an
+};
+export {
+  fn as diagram
+};