@omg-dev/app 0.5.1 → 0.6.2

package/dist-lib/sankeyDiagram-HTMAVEWB-BjRyuB6L.js

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