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