@sourcegraph/amp 0.0.1749585689-g82b91d → 0.0.1749600114-g5c00b8

package/dist/sankeyDiagram-C6NZRJHT-D1EcCYaw.js

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