1199 lines
41 KiB
JavaScript
1199 lines
41 KiB
JavaScript
|
import { c as getConfig, g as getAccTitle, s as setAccTitle, a as getAccDescription, b as setAccDescription, D as getDiagramTitle, C as setDiagramTitle, E as clear$1, f as common, ar as defaultConfig, j as d3select, t as setupGraphViewbox } from "./mermaid-dcacb631.js";
|
||
|
|
import { o as ordinal } from "./ordinal-475e0c0c.js";
|
||
|
|
import { d as d3schemeTableau10 } from "./Tableau10-31042135.js";
|
||
|
|
import "./init-cc95ec8e.js";
|
||
|
|
var parser = function() {
|
||
|
|
var o = function(k, v, o2, l) {
|
||
|
|
for (o2 = o2 || {}, l = k.length; l--; o2[k[l]] = v)
|
||
|
|
;
|
||
|
|
return o2;
|
||
|
|
}, $V0 = [1, 9], $V1 = [1, 10], $V2 = [1, 5, 10, 12];
|
||
|
|
var parser2 = {
|
||
|
|
trace: 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: function anonymous(yytext, yyleng, yylineno, yy, yystate, $$, _$) {
|
||
|
|
var $0 = $$.length - 1;
|
||
|
|
switch (yystate) {
|
||
|
|
case 7:
|
||
|
|
const source = yy.findOrCreateNode($$[$0 - 4].trim().replaceAll('""', '"'));
|
||
|
|
const target = yy.findOrCreateNode($$[$0 - 2].trim().replaceAll('""', '"'));
|
||
|
|
const value2 = parseFloat($$[$0].trim());
|
||
|
|
yy.addLink(source, target, value2);
|
||
|
|
break;
|
||
|
|
case 8:
|
||
|
|
case 9:
|
||
|
|
case 11:
|
||
|
|
this.$ = $$[$0];
|
||
|
|
break;
|
||
|
|
case 10:
|
||
|
|
this.$ = $$[$0 - 1];
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
},
|
||
|
|
table: [{ 3: 1, 4: [1, 2] }, { 1: [3] }, { 5: [1, 3] }, { 6: 4, 8: 5, 15: 6, 16: 7, 17: 8, 18: $V0, 20: $V1 }, { 1: [2, 6], 7: 11, 10: [1, 12] }, o($V1, [2, 4], { 9: 13, 5: [1, 14] }), { 12: [1, 15] }, o($V2, [2, 8]), o($V2, [2, 9]), { 19: [1, 16] }, o($V2, [2, 11]), { 1: [2, 1] }, { 1: [2, 5] }, o($V1, [2, 2]), { 6: 17, 8: 5, 15: 6, 16: 7, 17: 8, 18: $V0, 20: $V1 }, { 15: 18, 16: 7, 17: 8, 18: $V0, 20: $V1 }, { 18: [1, 19] }, o($V1, [2, 3]), { 12: [1, 20] }, o($V2, [2, 10]), { 15: 21, 16: 7, 17: 8, 18: $V0, 20: $V1 }, o([1, 5, 10], [2, 7])],
|
||
|
|
defaultActions: { 11: [2, 1], 12: [2, 5] },
|
||
|
|
parseError: function parseError(str, hash) {
|
||
|
|
if (hash.recoverable) {
|
||
|
|
this.trace(str);
|
||
|
|
} else {
|
||
|
|
var error = new Error(str);
|
||
|
|
error.hash = hash;
|
||
|
|
throw error;
|
||
|
|
}
|
||
|
|
},
|
||
|
|
parse: function parse(input) {
|
||
|
|
var self = this, stack = [0], tstack = [], vstack = [null], lstack = [], table = this.table, yytext = "", yylineno = 0, yyleng = 0, TERROR = 2, EOF = 1;
|
||
|
|
var args = lstack.slice.call(arguments, 1);
|
||
|
|
var lexer2 = Object.create(this.lexer);
|
||
|
|
var sharedState = { yy: {} };
|
||
|
|
for (var k in this.yy) {
|
||
|
|
if (Object.prototype.hasOwnProperty.call(this.yy, k)) {
|
||
|
|
sharedState.yy[k] = this.yy[k];
|
||
|
|
}
|
||
|
|
}
|
||
|
|
lexer2.setInput(input, sharedState.yy);
|
||
|
|
sharedState.yy.lexer = lexer2;
|
||
|
|
sharedState.yy.parser = this;
|
||
|
|
if (typeof lexer2.yylloc == "undefined") {
|
||
|
|
lexer2.yylloc = {};
|
||
|
|
}
|
||
|
|
var yyloc = lexer2.yylloc;
|
||
|
|
lstack.push(yyloc);
|
||
|
|
var ranges = lexer2.options && lexer2.options.ranges;
|
||
|
|
if (typeof sharedState.yy.parseError === "function") {
|
||
|
|
this.parseError = sharedState.yy.parseError;
|
||
|
|
} else {
|
||
|
|
this.parseError = Object.getPrototypeOf(this).parseError;
|
||
|
|
}
|
||
|
|
function lex() {
|
||
|
|
var token;
|
||
|
|
token = tstack.pop() || lexer2.lex() || EOF;
|
||
|
|
if (typeof token !== "number") {
|
||
|
|
if (token instanceof Array) {
|
||
|
|
tstack = token;
|
||
|
|
token = tstack.pop();
|
||
|
|
}
|
||
|
|
token = self.symbols_[token] || token;
|
||
|
|
}
|
||
|
|
return token;
|
||
|
|
}
|
||
|
|
var symbol, state, action, r, yyval = {}, p, len, newState, expected;
|
||
|
|
while (true) {
|
||
|
|
state = stack[stack.length - 1];
|
||
|
|
if (this.defaultActions[state]) {
|
||
|
|
action = this.defaultActions[state];
|
||
|
|
} else {
|
||
|
|
if (symbol === null || typeof symbol == "undefined") {
|
||
|
|
symbol = lex();
|
||
|
|
}
|
||
|
|
action = table[state] && table[state][symbol];
|
||
|
|
}
|
||
|
|
if (typeof action === "undefined" || !action.length || !action[0]) {
|
||
|
|
var errStr = "";
|
||
|
|
expected = [];
|
||
|
|
for (p in table[state]) {
|
||
|
|
if (this.terminals_[p] && p > TERROR) {
|
||
|
|
expected.push("'" + this.terminals_[p] + "'");
|
||
|
|
}
|
||
|
|
}
|
||
|
|
if (lexer2.showPosition) {
|
||
|
|
errStr = "Parse error on line " + (yylineno + 1) + ":\n" + lexer2.showPosition() + "\nExpecting " + expected.join(", ") + ", got '" + (this.terminals_[symbol] || symbol) + "'";
|
||
|
|
} else {
|
||
|
|
errStr = "Parse error on line " + (yylineno + 1) + ": Unexpected " + (symbol == EOF ? "end of input" : "'" + (this.terminals_[symbol] || symbol) + "'");
|
||
|
|
}
|
||
|
|
this.parseError(errStr, {
|
||
|
|
text: lexer2.match,
|
||
|
|
token: this.terminals_[symbol] || symbol,
|
||
|
|
line: lexer2.yylineno,
|
||
|
|
loc: yyloc,
|
||
|
|
expected
|
||
|
|
});
|
||
|
|
}
|
||
|
|
if (action[0] instanceof Array && action.length > 1) {
|
||
|
|
throw new Error("Parse Error: multiple actions possible at state: " + state + ", token: " + symbol);
|
||
|
|
}
|
||
|
|
switch (action[0]) {
|
||
|
|
case 1:
|
||
|
|
stack.push(symbol);
|
||
|
|
vstack.push(lexer2.yytext);
|
||
|
|
lstack.push(lexer2.yylloc);
|
||
|
|
stack.push(action[1]);
|
||
|
|
symbol = null;
|
||
|
|
{
|
||
|
|
yyleng = lexer2.yyleng;
|
||
|
|
yytext = lexer2.yytext;
|
||
|
|
yylineno = lexer2.yylineno;
|
||
|
|
yyloc = lexer2.yylloc;
|
||
|
|
}
|
||
|
|
break;
|
||
|
|
case 2:
|
||
|
|
len = this.productions_[action[1]][1];
|
||
|
|
yyval.$ = vstack[vstack.length - len];
|
||
|
|
yyval._$ = {
|
||
|
|
first_line: lstack[lstack.length - (len || 1)].first_line,
|
||
|
|
last_line: lstack[lstack.length - 1].last_line,
|
||
|
|
first_column: lstack[lstack.length - (len || 1)].first_column,
|
||
|
|
last_column: lstack[lstack.length - 1].last_column
|
||
|
|
};
|
||
|
|
if (ranges) {
|
||
|
|
yyval._$.range = [
|
||
|
|
lstack[lstack.length - (len || 1)].range[0],
|
||
|
|
lstack[lstack.length - 1].range[1]
|
||
|
|
];
|
||
|
|
}
|
||
|
|
r = this.performAction.apply(yyval, [
|
||
|
|
yytext,
|
||
|
|
yyleng,
|
||
|
|
yylineno,
|
||
|
|
sharedState.yy,
|
||
|
|
action[1],
|
||
|
|
vstack,
|
||
|
|
lstack
|
||
|
|
].concat(args));
|
||
|
|
if (typeof r !== "undefined") {
|
||
|
|
return r;
|
||
|
|
}
|
||
|
|
if (len) {
|
||
|
|
stack = stack.slice(0, -1 * len * 2);
|
||
|
|
vstack = vstack.slice(0, -1 * len);
|
||
|
|
lstack = lstack.slice(0, -1 * len);
|
||
|
|
}
|
||
|
|
stack.push(this.productions_[action[1]][0]);
|
||
|
|
vstack.push(yyval.$);
|
||
|
|
lstack.push(yyval._$);
|
||
|
|
newState = table[stack[stack.length - 2]][stack[stack.length - 1]];
|
||
|
|
stack.push(newState);
|
||
|
|
break;
|
||
|
|
case 3:
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
};
|
||
|
|
var lexer = function() {
|
||
|
|
var lexer2 = {
|
||
|
|
EOF: 1,
|
||
|
|
parseError: function parseError(str, hash) {
|
||
|
|
if (this.yy.parser) {
|
||
|
|
this.yy.parser.parseError(str, hash);
|
||
|
|
} else {
|
||
|
|
throw new Error(str);
|
||
|
|
}
|
||
|
|
},
|
||
|
|
// resets the lexer, sets new input
|
||
|
|
setInput: function(input, yy) {
|
||
|
|
this.yy = yy || this.yy || {};
|
||
|
|
this._input = input;
|
||
|
|
this._more = this._backtrack = this.done = false;
|
||
|
|
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
|
||
|
|
};
|
||
|
|
if (this.options.ranges) {
|
||
|
|
this.yylloc.range = [0, 0];
|
||
|
|
}
|
||
|
|
this.offset = 0;
|
||
|
|
return this;
|
||
|
|
},
|
||
|
|
// consumes and returns one char from the input
|
||
|
|
input: function() {
|
||
|
|
var ch = this._input[0];
|
||
|
|
this.yytext += ch;
|
||
|
|
this.yyleng++;
|
||
|
|
this.offset++;
|
||
|
|
this.match += ch;
|
||
|
|
this.matched += ch;
|
||
|
|
var lines = ch.match(/(?:\r\n?|\n).*/g);
|
||
|
|
if (lines) {
|
||
|
|
this.yylineno++;
|
||
|
|
this.yylloc.last_line++;
|
||
|
|
} else {
|
||
|
|
this.yylloc.last_column++;
|
||
|
|
}
|
||
|
|
if (this.options.ranges) {
|
||
|
|
this.yylloc.range[1]++;
|
||
|
|
}
|
||
|
|
this._input = this._input.slice(1);
|
||
|
|
return ch;
|
||
|
|
},
|
||
|
|
// unshifts one char (or a string) into the input
|
||
|
|
unput: function(ch) {
|
||
|
|
var len = ch.length;
|
||
|
|
var lines = ch.split(/(?:\r\n?|\n)/g);
|
||
|
|
this._input = ch + this._input;
|
||
|
|
this.yytext = this.yytext.substr(0, this.yytext.length - len);
|
||
|
|
this.offset -= len;
|
||
|
|
var oldLines = 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);
|
||
|
|
if (lines.length - 1) {
|
||
|
|
this.yylineno -= lines.length - 1;
|
||
|
|
}
|
||
|
|
var r = this.yylloc.range;
|
||
|
|
this.yylloc = {
|
||
|
|
first_line: this.yylloc.first_line,
|
||
|
|
last_line: this.yylineno + 1,
|
||
|
|
first_column: this.yylloc.first_column,
|
||
|
|
last_column: lines ? (lines.length === oldLines.length ? this.yylloc.first_column : 0) + oldLines[oldLines.length - lines.length].length - lines[0].length : this.yylloc.first_column - len
|
||
|
|
};
|
||
|
|
if (this.options.ranges) {
|
||
|
|
this.yylloc.range = [r[0], r[0] + this.yyleng - len];
|
||
|
|
}
|
||
|
|
this.yyleng = this.yytext.length;
|
||
|
|
return this;
|
||
|
|
},
|
||
|
|
// When called from action, caches matched text and appends it on next action
|
||
|
|
more: function() {
|
||
|
|
this._more = true;
|
||
|
|
return this;
|
||
|
|
},
|
||
|
|
// When called from action, signals the lexer that this rule fails to match the input, so the next matching rule (regex) should be tested instead.
|
||
|
|
reject: function() {
|
||
|
|
if (this.options.backtrack_lexer) {
|
||
|
|
this._backtrack = true;
|
||
|
|
} 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).\n" + this.showPosition(), {
|
||
|
|
text: "",
|
||
|
|
token: null,
|
||
|
|
line: this.yylineno
|
||
|
|
});
|
||
|
|
}
|
||
|
|
return this;
|
||
|
|
},
|
||
|
|
// retain first n characters of the match
|
||
|
|
less: function(n) {
|
||
|
|
this.unput(this.match.slice(n));
|
||
|
|
},
|
||
|
|
// displays already matched input, i.e. for error messages
|
||
|
|
pastInput: function() {
|
||
|
|
var past = this.matched.substr(0, this.matched.length - this.match.length);
|
||
|
|
return (past.length > 20 ? "..." : "") + past.substr(-20).replace(/\n/g, "");
|
||
|
|
},
|
||
|
|
// displays upcoming input, i.e. for error messages
|
||
|
|
upcomingInput: function() {
|
||
|
|
var next = this.match;
|
||
|
|
if (next.length < 20) {
|
||
|
|
next += this._input.substr(0, 20 - next.length);
|
||
|
|
}
|
||
|
|
return (next.substr(0, 20) + (next.length > 20 ? "..." : "")).replace(/\n/g, "");
|
||
|
|
},
|
||
|
|
// displays the character position where the lexing error occurred, i.e. for error messages
|
||
|
|
showPosition: function() {
|
||
|
|
var pre = this.pastInput();
|
||
|
|
var c = new Array(pre.length + 1).join("-");
|
||
|
|
return pre + this.upcomingInput() + "\n" + c + "^";
|
||
|
|
},
|
||
|
|
// test the lexed token: return FALSE when not a match, otherwise return token
|
||
|
|
test_match: function(match, indexed_rule) {
|
||
|
|
var token, lines, backup;
|
||
|
|
if (this.options.backtrack_lexer) {
|
||
|
|
backup = {
|
||
|
|
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
|
||
|
|
};
|
||
|
|
if (this.options.ranges) {
|
||
|
|
backup.yylloc.range = this.yylloc.range.slice(0);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
lines = match[0].match(/(?:\r\n?|\n).*/g);
|
||
|
|
if (lines) {
|
||
|
|
this.yylineno += lines.length;
|
||
|
|
}
|
||
|
|
this.yylloc = {
|
||
|
|
first_line: this.yylloc.last_line,
|
||
|
|
last_line: this.yylineno + 1,
|
||
|
|
first_column: this.yylloc.last_column,
|
||
|
|
last_column: lines ? lines[lines.length - 1].length - lines[lines.length - 1].match(/\r?\n?/)[0].length : this.yylloc.last_column + match[0].length
|
||
|
|
};
|
||
|
|
this.yytext += match[0];
|
||
|
|
this.match += match[0];
|
||
|
|
this.matches = match;
|
||
|
|
this.yyleng = this.yytext.length;
|
||
|
|
if (this.options.ranges) {
|
||
|
|
this.yylloc.range = [this.offset, this.offset += this.yyleng];
|
||
|
|
}
|
||
|
|
this._more = false;
|
||
|
|
this._backtrack = false;
|
||
|
|
this._input = this._input.slice(match[0].length);
|
||
|
|
this.matched += match[0];
|
||
|
|
token = this.performAction.call(this, this.yy, this, indexed_rule, this.conditionStack[this.conditionStack.length - 1]);
|
||
|
|
if (this.done && this._input) {
|
||
|
|
this.done = false;
|
||
|
|
}
|
||
|
|
if (token) {
|
||
|
|
return token;
|
||
|
|
} else if (this._backtrack) {
|
||
|
|
for (var k in backup) {
|
||
|
|
this[k] = backup[k];
|
||
|
|
}
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
return false;
|
||
|
|
},
|
||
|
|
// return next match in input
|
||
|
|
next: function() {
|
||
|
|
if (this.done) {
|
||
|
|
return this.EOF;
|
||
|
|
}
|
||
|
|
if (!this._input) {
|
||
|
|
this.done = true;
|
||
|
|
}
|
||
|
|
var token, match, tempMatch, index;
|
||
|
|
if (!this._more) {
|
||
|
|
this.yytext = "";
|
||
|
|
this.match = "";
|
||
|
|
}
|
||
|
|
var rules = this._currentRules();
|
||
|
|
for (var i = 0; i < rules.length; i++) {
|
||
|
|
tempMatch = this._input.match(this.rules[rules[i]]);
|
||
|
|
if (tempMatch && (!match || tempMatch[0].length > match[0].length)) {
|
||
|
|
match = tempMatch;
|
||
|
|
index = i;
|
||
|
|
if (this.options.backtrack_lexer) {
|
||
|
|
token = this.test_match(tempMatch, rules[i]);
|
||
|
|
if (token !== false) {
|
||
|
|
return token;
|
||
|
|
} else if (this._backtrack) {
|
||
|
|
match = false;
|
||
|
|
continue;
|
||
|
|
} else {
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
} else if (!this.options.flex) {
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
if (match) {
|
||
|
|
token = this.test_match(match, rules[index]);
|
||
|
|
if (token !== false) {
|
||
|
|
return token;
|
||
|
|
}
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
if (this._input === "") {
|
||
|
|
return this.EOF;
|
||
|
|
} else {
|
||
|
|
return this.parseError("Lexical error on line " + (this.yylineno + 1) + ". Unrecognized text.\n" + this.showPosition(), {
|
||
|
|
text: "",
|
||
|
|
token: null,
|
||
|
|
line: this.yylineno
|
||
|
|
});
|
||
|
|
}
|
||
|
|
},
|
||
|
|
// return next match that has a token
|
||
|
|
lex: function lex() {
|
||
|
|
var r = this.next();
|
||
|
|
if (r) {
|
||
|
|
return r;
|
||
|
|
} else {
|
||
|
|
return this.lex();
|
||
|
|
}
|
||
|
|
},
|
||
|
|
// activates a new lexer condition state (pushes the new lexer condition state onto the condition stack)
|
||
|
|
begin: function begin(condition) {
|
||
|
|
this.conditionStack.push(condition);
|
||
|
|
},
|
||
|
|
// pop the previously active lexer condition state off the condition stack
|
||
|
|
popState: function popState() {
|
||
|
|
var n = this.conditionStack.length - 1;
|
||
|
|
if (n > 0) {
|
||
|
|
return this.conditionStack.pop();
|
||
|
|
} else {
|
||
|
|
return this.conditionStack[0];
|
||
|
|
}
|
||
|
|
},
|
||
|
|
// produce the lexer rule set which is active for the currently active lexer condition state
|
||
|
|
_currentRules: function _currentRules() {
|
||
|
|
if (this.conditionStack.length && this.conditionStack[this.conditionStack.length - 1]) {
|
||
|
|
return this.conditions[this.conditionStack[this.conditionStack.length - 1]].rules;
|
||
|
|
} else {
|
||
|
|
return this.conditions["INITIAL"].rules;
|
||
|
|
}
|
||
|
|
},
|
||
|
|
// return the currently active lexer condition state; when an index argument is provided it produces the N-th previous condition state, if available
|
||
|
|
topState: function topState(n) {
|
||
|
|
n = this.conditionStack.length - 1 - Math.abs(n || 0);
|
||
|
|
if (n >= 0) {
|
||
|
|
return this.conditionStack[n];
|
||
|
|
} else {
|
||
|
|
return "INITIAL";
|
||
|
|
}
|
||
|
|
},
|
||
|
|
// alias for begin(condition)
|
||
|
|
pushState: function pushState(condition) {
|
||
|
|
this.begin(condition);
|
||
|
|
},
|
||
|
|
// return the number of states currently on the stack
|
||
|
|
stateStackSize: function stateStackSize() {
|
||
|
|
return this.conditionStack.length;
|
||
|
|
},
|
||
|
|
options: { "case-insensitive": true },
|
||
|
|
performAction: function anonymous(yy, yy_, $avoiding_name_collisions, YY_START) {
|
||
|
|
switch ($avoiding_name_collisions) {
|
||
|
|
case 0:
|
||
|
|
this.pushState("csv");
|
||
|
|
return 4;
|
||
|
|
case 1:
|
||
|
|
return 10;
|
||
|
|
case 2:
|
||
|
|
return 5;
|
||
|
|
case 3:
|
||
|
|
return 12;
|
||
|
|
case 4:
|
||
|
|
this.pushState("escaped_text");
|
||
|
|
return 18;
|
||
|
|
case 5:
|
||
|
|
return 20;
|
||
|
|
case 6:
|
||
|
|
this.popState("escaped_text");
|
||
|
|
return 18;
|
||
|
|
case 7:
|
||
|
|
return 19;
|
||
|
|
}
|
||
|
|
},
|
||
|
|
rules: [/^(?:sankey-beta\b)/i, /^(?:$)/i, /^(?:((\u000D\u000A)|(\u000A)))/i, /^(?:(\u002C))/i, /^(?:(\u0022))/i, /^(?:([\u0020-\u0021\u0023-\u002B\u002D-\u007E])*)/i, /^(?:(\u0022)(?!(\u0022)))/i, /^(?:(([\u0020-\u0021\u0023-\u002B\u002D-\u007E])|(\u002C)|(\u000D)|(\u000A)|(\u0022)(\u0022))*)/i],
|
||
|
|
conditions: { "csv": { "rules": [1, 2, 3, 4, 5, 6, 7], "inclusive": false }, "escaped_text": { "rules": [6, 7], "inclusive": false }, "INITIAL": { "rules": [0, 1, 2, 3, 4, 5, 6, 7], "inclusive": true } }
|
||
|
|
};
|
||
|
|
return lexer2;
|
||
|
|
}();
|
||
|
|
parser2.lexer = lexer;
|
||
|
|
function Parser() {
|
||
|
|
this.yy = {};
|
||
|
|
}
|
||
|
|
Parser.prototype = parser2;
|
||
|
|
parser2.Parser = Parser;
|
||
|
|
return new Parser();
|
||
|
|
}();
|
||
|
|
parser.parser = parser;
|
||
|
|
const parser$1 = parser;
|
||
|
|
let links = [];
|
||
|
|
let nodes = [];
|
||
|
|
let nodesMap = {};
|
||
|
|
const clear = () => {
|
||
|
|
links = [];
|
||
|
|
nodes = [];
|
||
|
|
nodesMap = {};
|
||
|
|
clear$1();
|
||
|
|
};
|
||
|
|
class SankeyLink {
|
||
|
|
constructor(source, target, value2 = 0) {
|
||
|
|
this.source = source;
|
||
|
|
this.target = target;
|
||
|
|
this.value = value2;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
const addLink = (source, target, value2) => {
|
||
|
|
links.push(new SankeyLink(source, target, value2));
|
||
|
|
};
|
||
|
|
class SankeyNode {
|
||
|
|
constructor(ID) {
|
||
|
|
this.ID = ID;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
const findOrCreateNode = (ID) => {
|
||
|
|
ID = common.sanitizeText(ID, getConfig());
|
||
|
|
if (!nodesMap[ID]) {
|
||
|
|
nodesMap[ID] = new SankeyNode(ID);
|
||
|
|
nodes.push(nodesMap[ID]);
|
||
|
|
}
|
||
|
|
return nodesMap[ID];
|
||
|
|
};
|
||
|
|
const getNodes = () => nodes;
|
||
|
|
const getLinks = () => links;
|
||
|
|
const getGraph = () => ({
|
||
|
|
nodes: nodes.map((node) => ({ id: node.ID })),
|
||
|
|
links: links.map((link2) => ({
|
||
|
|
source: link2.source.ID,
|
||
|
|
target: link2.target.ID,
|
||
|
|
value: link2.value
|
||
|
|
}))
|
||
|
|
});
|
||
|
|
const db = {
|
||
|
|
nodesMap,
|
||
|
|
getConfig: () => getConfig().sankey,
|
||
|
|
getNodes,
|
||
|
|
getLinks,
|
||
|
|
getGraph,
|
||
|
|
addLink,
|
||
|
|
findOrCreateNode,
|
||
|
|
getAccTitle,
|
||
|
|
setAccTitle,
|
||
|
|
getAccDescription,
|
||
|
|
setAccDescription,
|
||
|
|
getDiagramTitle,
|
||
|
|
setDiagramTitle,
|
||
|
|
clear
|
||
|
|
};
|
||
|
|
function max(values, valueof) {
|
||
|
|
let max2;
|
||
|
|
if (valueof === void 0) {
|
||
|
|
for (const value2 of values) {
|
||
|
|
if (value2 != null && (max2 < value2 || max2 === void 0 && value2 >= value2)) {
|
||
|
|
max2 = value2;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} else {
|
||
|
|
let index = -1;
|
||
|
|
for (let value2 of values) {
|
||
|
|
if ((value2 = valueof(value2, ++index, values)) != null && (max2 < value2 || max2 === void 0 && value2 >= value2)) {
|
||
|
|
max2 = value2;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return max2;
|
||
|
|
}
|
||
|
|
function min(values, valueof) {
|
||
|
|
let min2;
|
||
|
|
if (valueof === void 0) {
|
||
|
|
for (const value2 of values) {
|
||
|
|
if (value2 != null && (min2 > value2 || min2 === void 0 && value2 >= value2)) {
|
||
|
|
min2 = value2;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} else {
|
||
|
|
let index = -1;
|
||
|
|
for (let value2 of values) {
|
||
|
|
if ((value2 = valueof(value2, ++index, values)) != null && (min2 > value2 || min2 === void 0 && value2 >= value2)) {
|
||
|
|
min2 = value2;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return min2;
|
||
|
|
}
|
||
|
|
function sum(values, valueof) {
|
||
|
|
let sum2 = 0;
|
||
|
|
if (valueof === void 0) {
|
||
|
|
for (let value2 of values) {
|
||
|
|
if (value2 = +value2) {
|
||
|
|
sum2 += value2;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} else {
|
||
|
|
let index = -1;
|
||
|
|
for (let value2 of values) {
|
||
|
|
if (value2 = +valueof(value2, ++index, values)) {
|
||
|
|
sum2 += value2;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return sum2;
|
||
|
|
}
|
||
|
|
function targetDepth(d) {
|
||
|
|
return d.target.depth;
|
||
|
|
}
|
||
|
|
function left(node) {
|
||
|
|
return node.depth;
|
||
|
|
}
|
||
|
|
function right(node, n) {
|
||
|
|
return n - 1 - node.height;
|
||
|
|
}
|
||
|
|
function justify(node, n) {
|
||
|
|
return node.sourceLinks.length ? node.depth : n - 1;
|
||
|
|
}
|
||
|
|
function center(node) {
|
||
|
|
return node.targetLinks.length ? node.depth : node.sourceLinks.length ? min(node.sourceLinks, targetDepth) - 1 : 0;
|
||
|
|
}
|
||
|
|
function constant$1(x2) {
|
||
|
|
return function() {
|
||
|
|
return x2;
|
||
|
|
};
|
||
|
|
}
|
||
|
|
function ascendingSourceBreadth(a, b) {
|
||
|
|
return ascendingBreadth(a.source, b.source) || a.index - b.index;
|
||
|
|
}
|
||
|
|
function ascendingTargetBreadth(a, b) {
|
||
|
|
return ascendingBreadth(a.target, b.target) || a.index - b.index;
|
||
|
|
}
|
||
|
|
function ascendingBreadth(a, b) {
|
||
|
|
return a.y0 - b.y0;
|
||
|
|
}
|
||
|
|
function value(d) {
|
||
|
|
return d.value;
|
||
|
|
}
|
||
|
|
function defaultId(d) {
|
||
|
|
return d.index;
|
||
|
|
}
|
||
|
|
function defaultNodes(graph) {
|
||
|
|
return graph.nodes;
|
||
|
|
}
|
||
|
|
function defaultLinks(graph) {
|
||
|
|
return graph.links;
|
||
|
|
}
|
||
|
|
function find(nodeById, id) {
|
||
|
|
const node = nodeById.get(id);
|
||
|
|
if (!node)
|
||
|
|
throw new Error("missing: " + id);
|
||
|
|
return node;
|
||
|
|
}
|
||
|
|
function computeLinkBreadths({ nodes: nodes2 }) {
|
||
|
|
for (const node of nodes2) {
|
||
|
|
let y0 = node.y0;
|
||
|
|
let y1 = y0;
|
||
|
|
for (const link2 of node.sourceLinks) {
|
||
|
|
link2.y0 = y0 + link2.width / 2;
|
||
|
|
y0 += link2.width;
|
||
|
|
}
|
||
|
|
for (const link2 of node.targetLinks) {
|
||
|
|
link2.y1 = y1 + link2.width / 2;
|
||
|
|
y1 += link2.width;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
function Sankey() {
|
||
|
|
let x0 = 0, y0 = 0, x1 = 1, y1 = 1;
|
||
|
|
let dx = 24;
|
||
|
|
let dy = 8, py;
|
||
|
|
let id = defaultId;
|
||
|
|
let align = justify;
|
||
|
|
let sort;
|
||
|
|
let linkSort;
|
||
|
|
let nodes2 = defaultNodes;
|
||
|
|
let links2 = defaultLinks;
|
||
|
|
let iterations = 6;
|
||
|
|
function sankey() {
|
||
|
|
const graph = { nodes: nodes2.apply(null, arguments), links: links2.apply(null, arguments) };
|
||
|
|
computeNodeLinks(graph);
|
||
|
|
computeNodeValues(graph);
|
||
|
|
computeNodeDepths(graph);
|
||
|
|
computeNodeHeights(graph);
|
||
|
|
computeNodeBreadths(graph);
|
||
|
|
computeLinkBreadths(graph);
|
||
|
|
return graph;
|
||
|
|
}
|
||
|
|
sankey.update = function(graph) {
|
||
|
|
computeLinkBreadths(graph);
|
||
|
|
return graph;
|
||
|
|
};
|
||
|
|
sankey.nodeId = function(_) {
|
||
|
|
return arguments.length ? (id = typeof _ === "function" ? _ : constant$1(_), sankey) : id;
|
||
|
|
};
|
||
|
|
sankey.nodeAlign = function(_) {
|
||
|
|
return arguments.length ? (align = typeof _ === "function" ? _ : constant$1(_), sankey) : align;
|
||
|
|
};
|
||
|
|
sankey.nodeSort = function(_) {
|
||
|
|
return arguments.length ? (sort = _, sankey) : sort;
|
||
|
|
};
|
||
|
|
sankey.nodeWidth = function(_) {
|
||
|
|
return arguments.length ? (dx = +_, sankey) : dx;
|
||
|
|
};
|
||
|
|
sankey.nodePadding = function(_) {
|
||
|
|
return arguments.length ? (dy = py = +_, sankey) : dy;
|
||
|
|
};
|
||
|
|
sankey.nodes = function(_) {
|
||
|
|
return arguments.length ? (nodes2 = typeof _ === "function" ? _ : constant$1(_), sankey) : nodes2;
|
||
|
|
};
|
||
|
|
sankey.links = function(_) {
|
||
|
|
return arguments.length ? (links2 = typeof _ === "function" ? _ : constant$1(_), sankey) : links2;
|
||
|
|
};
|
||
|
|
sankey.linkSort = function(_) {
|
||
|
|
return arguments.length ? (linkSort = _, sankey) : linkSort;
|
||
|
|
};
|
||
|
|
sankey.size = function(_) {
|
||
|
|
return arguments.length ? (x0 = y0 = 0, x1 = +_[0], y1 = +_[1], sankey) : [x1 - x0, y1 - y0];
|
||
|
|
};
|
||
|
|
sankey.extent = function(_) {
|
||
|
|
return arguments.length ? (x0 = +_[0][0], x1 = +_[1][0], y0 = +_[0][1], y1 = +_[1][1], sankey) : [[x0, y0], [x1, y1]];
|
||
|
|
};
|
||
|
|
sankey.iterations = function(_) {
|
||
|
|
return arguments.length ? (iterations = +_, sankey) : iterations;
|
||
|
|
};
|
||
|
|
function computeNodeLinks({ nodes: nodes3, links: links3 }) {
|
||
|
|
for (const [i, node] of nodes3.entries()) {
|
||
|
|
node.index = i;
|
||
|
|
node.sourceLinks = [];
|
||
|
|
node.targetLinks = [];
|
||
|
|
}
|
||
|
|
const nodeById = new Map(nodes3.map((d, i) => [id(d, i, nodes3), d]));
|
||
|
|
for (const [i, link2] of links3.entries()) {
|
||
|
|
link2.index = i;
|
||
|
|
let { source, target } = link2;
|
||
|
|
if (typeof source !== "object")
|
||
|
|
source = link2.source = find(nodeById, source);
|
||
|
|
if (typeof target !== "object")
|
||
|
|
target = link2.target = find(nodeById, target);
|
||
|
|
source.sourceLinks.push(link2);
|
||
|
|
target.targetLinks.push(link2);
|
||
|
|
}
|
||
|
|
if (linkSort != null) {
|
||
|
|
for (const { sourceLinks, targetLinks } of nodes3) {
|
||
|
|
sourceLinks.sort(linkSort);
|
||
|
|
targetLinks.sort(linkSort);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
function computeNodeValues({ nodes: nodes3 }) {
|
||
|
|
for (const node of nodes3) {
|
||
|
|
node.value = node.fixedValue === void 0 ? Math.max(sum(node.sourceLinks, value), sum(node.targetLinks, value)) : node.fixedValue;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
function computeNodeDepths({ nodes: nodes3 }) {
|
||
|
|
const n = nodes3.length;
|
||
|
|
let current = new Set(nodes3);
|
||
|
|
let next = /* @__PURE__ */ new Set();
|
||
|
|
let x2 = 0;
|
||
|
|
while (current.size) {
|
||
|
|
for (const node of current) {
|
||
|
|
node.depth = x2;
|
||
|
|
for (const { target } of node.sourceLinks) {
|
||
|
|
next.add(target);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
if (++x2 > n)
|
||
|
|
throw new Error("circular link");
|
||
|
|
current = next;
|
||
|
|
next = /* @__PURE__ */ new Set();
|
||
|
|
}
|
||
|
|
}
|
||
|
|
function computeNodeHeights({ nodes: nodes3 }) {
|
||
|
|
const n = nodes3.length;
|
||
|
|
let current = new Set(nodes3);
|
||
|
|
let next = /* @__PURE__ */ new Set();
|
||
|
|
let x2 = 0;
|
||
|
|
while (current.size) {
|
||
|
|
for (const node of current) {
|
||
|
|
node.height = x2;
|
||
|
|
for (const { source } of node.targetLinks) {
|
||
|
|
next.add(source);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
if (++x2 > n)
|
||
|
|
throw new Error("circular link");
|
||
|
|
current = next;
|
||
|
|
next = /* @__PURE__ */ new Set();
|
||
|
|
}
|
||
|
|
}
|
||
|
|
function computeNodeLayers({ nodes: nodes3 }) {
|
||
|
|
const x2 = max(nodes3, (d) => d.depth) + 1;
|
||
|
|
const kx = (x1 - x0 - dx) / (x2 - 1);
|
||
|
|
const columns = new Array(x2);
|
||
|
|
for (const node of nodes3) {
|
||
|
|
const i = Math.max(0, Math.min(x2 - 1, Math.floor(align.call(null, node, x2))));
|
||
|
|
node.layer = i;
|
||
|
|
node.x0 = x0 + i * kx;
|
||
|
|
node.x1 = node.x0 + dx;
|
||
|
|
if (columns[i])
|
||
|
|
columns[i].push(node);
|
||
|
|
else
|
||
|
|
columns[i] = [node];
|
||
|
|
}
|
||
|
|
if (sort)
|
||
|
|
for (const column of columns) {
|
||
|
|
column.sort(sort);
|
||
|
|
}
|
||
|
|
return columns;
|
||
|
|
}
|
||
|
|
function initializeNodeBreadths(columns) {
|
||
|
|
const ky = min(columns, (c) => (y1 - y0 - (c.length - 1) * py) / sum(c, value));
|
||
|
|
for (const nodes3 of columns) {
|
||
|
|
let y2 = y0;
|
||
|
|
for (const node of nodes3) {
|
||
|
|
node.y0 = y2;
|
||
|
|
node.y1 = y2 + node.value * ky;
|
||
|
|
y2 = node.y1 + py;
|
||
|
|
for (const link2 of node.sourceLinks) {
|
||
|
|
link2.width = link2.value * ky;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
y2 = (y1 - y2 + py) / (nodes3.length + 1);
|
||
|
|
for (let i = 0; i < nodes3.length; ++i) {
|
||
|
|
const node = nodes3[i];
|
||
|
|
node.y0 += y2 * (i + 1);
|
||
|
|
node.y1 += y2 * (i + 1);
|
||
|
|
}
|
||
|
|
reorderLinks(nodes3);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
function computeNodeBreadths(graph) {
|
||
|
|
const columns = computeNodeLayers(graph);
|
||
|
|
py = Math.min(dy, (y1 - y0) / (max(columns, (c) => c.length) - 1));
|
||
|
|
initializeNodeBreadths(columns);
|
||
|
|
for (let i = 0; i < iterations; ++i) {
|
||
|
|
const alpha = Math.pow(0.99, i);
|
||
|
|
const beta = Math.max(1 - alpha, (i + 1) / iterations);
|
||
|
|
relaxRightToLeft(columns, alpha, beta);
|
||
|
|
relaxLeftToRight(columns, alpha, beta);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
function relaxLeftToRight(columns, alpha, beta) {
|
||
|
|
for (let i = 1, n = columns.length; i < n; ++i) {
|
||
|
|
const column = columns[i];
|
||
|
|
for (const target of column) {
|
||
|
|
let y2 = 0;
|
||
|
|
let w = 0;
|
||
|
|
for (const { source, value: value2 } of target.targetLinks) {
|
||
|
|
let v = value2 * (target.layer - source.layer);
|
||
|
|
y2 += targetTop(source, target) * v;
|
||
|
|
w += v;
|
||
|
|
}
|
||
|
|
if (!(w > 0))
|
||
|
|
continue;
|
||
|
|
let dy2 = (y2 / w - target.y0) * alpha;
|
||
|
|
target.y0 += dy2;
|
||
|
|
target.y1 += dy2;
|
||
|
|
reorderNodeLinks(target);
|
||
|
|
}
|
||
|
|
if (sort === void 0)
|
||
|
|
column.sort(ascendingBreadth);
|
||
|
|
resolveCollisions(column, beta);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
function relaxRightToLeft(columns, alpha, beta) {
|
||
|
|
for (let n = columns.length, i = n - 2; i >= 0; --i) {
|
||
|
|
const column = columns[i];
|
||
|
|
for (const source of column) {
|
||
|
|
let y2 = 0;
|
||
|
|
let w = 0;
|
||
|
|
for (const { target, value: value2 } of source.sourceLinks) {
|
||
|
|
let v = value2 * (target.layer - source.layer);
|
||
|
|
y2 += sourceTop(source, target) * v;
|
||
|
|
w += v;
|
||
|
|
}
|
||
|
|
if (!(w > 0))
|
||
|
|
continue;
|
||
|
|
let dy2 = (y2 / w - source.y0) * alpha;
|
||
|
|
source.y0 += dy2;
|
||
|
|
source.y1 += dy2;
|
||
|
|
reorderNodeLinks(source);
|
||
|
|
}
|
||
|
|
if (sort === void 0)
|
||
|
|
column.sort(ascendingBreadth);
|
||
|
|
resolveCollisions(column, beta);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
function resolveCollisions(nodes3, alpha) {
|
||
|
|
const i = nodes3.length >> 1;
|
||
|
|
const subject = nodes3[i];
|
||
|
|
resolveCollisionsBottomToTop(nodes3, subject.y0 - py, i - 1, alpha);
|
||
|
|
resolveCollisionsTopToBottom(nodes3, subject.y1 + py, i + 1, alpha);
|
||
|
|
resolveCollisionsBottomToTop(nodes3, y1, nodes3.length - 1, alpha);
|
||
|
|
resolveCollisionsTopToBottom(nodes3, y0, 0, alpha);
|
||
|
|
}
|
||
|
|
function resolveCollisionsTopToBottom(nodes3, y2, i, alpha) {
|
||
|
|
for (; i < nodes3.length; ++i) {
|
||
|
|
const node = nodes3[i];
|
||
|
|
const dy2 = (y2 - node.y0) * alpha;
|
||
|
|
if (dy2 > 1e-6)
|
||
|
|
node.y0 += dy2, node.y1 += dy2;
|
||
|
|
y2 = node.y1 + py;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
function resolveCollisionsBottomToTop(nodes3, y2, i, alpha) {
|
||
|
|
for (; i >= 0; --i) {
|
||
|
|
const node = nodes3[i];
|
||
|
|
const dy2 = (node.y1 - y2) * alpha;
|
||
|
|
if (dy2 > 1e-6)
|
||
|
|
node.y0 -= dy2, node.y1 -= dy2;
|
||
|
|
y2 = node.y0 - py;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
function reorderNodeLinks({ sourceLinks, targetLinks }) {
|
||
|
|
if (linkSort === void 0) {
|
||
|
|
for (const { source: { sourceLinks: sourceLinks2 } } of targetLinks) {
|
||
|
|
sourceLinks2.sort(ascendingTargetBreadth);
|
||
|
|
}
|
||
|
|
for (const { target: { targetLinks: targetLinks2 } } of sourceLinks) {
|
||
|
|
targetLinks2.sort(ascendingSourceBreadth);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
function reorderLinks(nodes3) {
|
||
|
|
if (linkSort === void 0) {
|
||
|
|
for (const { sourceLinks, targetLinks } of nodes3) {
|
||
|
|
sourceLinks.sort(ascendingTargetBreadth);
|
||
|
|
targetLinks.sort(ascendingSourceBreadth);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
function targetTop(source, target) {
|
||
|
|
let y2 = source.y0 - (source.sourceLinks.length - 1) * py / 2;
|
||
|
|
for (const { target: node, width } of source.sourceLinks) {
|
||
|
|
if (node === target)
|
||
|
|
break;
|
||
|
|
y2 += width + py;
|
||
|
|
}
|
||
|
|
for (const { source: node, width } of target.targetLinks) {
|
||
|
|
if (node === source)
|
||
|
|
break;
|
||
|
|
y2 -= width;
|
||
|
|
}
|
||
|
|
return y2;
|
||
|
|
}
|
||
|
|
function sourceTop(source, target) {
|
||
|
|
let y2 = target.y0 - (target.targetLinks.length - 1) * py / 2;
|
||
|
|
for (const { source: node, width } of target.targetLinks) {
|
||
|
|
if (node === source)
|
||
|
|
break;
|
||
|
|
y2 += width + py;
|
||
|
|
}
|
||
|
|
for (const { target: node, width } of source.sourceLinks) {
|
||
|
|
if (node === target)
|
||
|
|
break;
|
||
|
|
y2 -= width;
|
||
|
|
}
|
||
|
|
return y2;
|
||
|
|
}
|
||
|
|
return sankey;
|
||
|
|
}
|
||
|
|
var pi = Math.PI, tau = 2 * pi, epsilon = 1e-6, tauEpsilon = tau - epsilon;
|
||
|
|
function Path() {
|
||
|
|
this._x0 = this._y0 = // start of current subpath
|
||
|
|
this._x1 = this._y1 = null;
|
||
|
|
this._ = "";
|
||
|
|
}
|
||
|
|
function path() {
|
||
|
|
return new Path();
|
||
|
|
}
|
||
|
|
Path.prototype = path.prototype = {
|
||
|
|
constructor: Path,
|
||
|
|
moveTo: function(x2, y2) {
|
||
|
|
this._ += "M" + (this._x0 = this._x1 = +x2) + "," + (this._y0 = this._y1 = +y2);
|
||
|
|
},
|
||
|
|
closePath: function() {
|
||
|
|
if (this._x1 !== null) {
|
||
|
|
this._x1 = this._x0, this._y1 = this._y0;
|
||
|
|
this._ += "Z";
|
||
|
|
}
|
||
|
|
},
|
||
|
|
lineTo: function(x2, y2) {
|
||
|
|
this._ += "L" + (this._x1 = +x2) + "," + (this._y1 = +y2);
|
||
|
|
},
|
||
|
|
quadraticCurveTo: function(x1, y1, x2, y2) {
|
||
|
|
this._ += "Q" + +x1 + "," + +y1 + "," + (this._x1 = +x2) + "," + (this._y1 = +y2);
|
||
|
|
},
|
||
|
|
bezierCurveTo: function(x1, y1, x2, y2, x3, y3) {
|
||
|
|
this._ += "C" + +x1 + "," + +y1 + "," + +x2 + "," + +y2 + "," + (this._x1 = +x3) + "," + (this._y1 = +y3);
|
||
|
|
},
|
||
|
|
arcTo: function(x1, y1, x2, y2, r) {
|
||
|
|
x1 = +x1, y1 = +y1, x2 = +x2, y2 = +y2, r = +r;
|
||
|
|
var x0 = this._x1, y0 = this._y1, x21 = x2 - x1, y21 = y2 - y1, x01 = x0 - x1, y01 = y0 - y1, l01_2 = x01 * x01 + y01 * y01;
|
||
|
|
if (r < 0)
|
||
|
|
throw new Error("negative radius: " + r);
|
||
|
|
if (this._x1 === null) {
|
||
|
|
this._ += "M" + (this._x1 = x1) + "," + (this._y1 = y1);
|
||
|
|
} else if (!(l01_2 > epsilon))
|
||
|
|
;
|
||
|
|
else if (!(Math.abs(y01 * x21 - y21 * x01) > epsilon) || !r) {
|
||
|
|
this._ += "L" + (this._x1 = x1) + "," + (this._y1 = y1);
|
||
|
|
} else {
|
||
|
|
var x20 = x2 - x0, y20 = y2 - y0, l21_2 = x21 * x21 + y21 * y21, l20_2 = x20 * x20 + y20 * y20, l21 = Math.sqrt(l21_2), l01 = Math.sqrt(l01_2), l = r * Math.tan((pi - Math.acos((l21_2 + l01_2 - l20_2) / (2 * l21 * l01))) / 2), t01 = l / l01, t21 = l / l21;
|
||
|
|
if (Math.abs(t01 - 1) > epsilon) {
|
||
|
|
this._ += "L" + (x1 + t01 * x01) + "," + (y1 + t01 * y01);
|
||
|
|
}
|
||
|
|
this._ += "A" + r + "," + r + ",0,0," + +(y01 * x20 > x01 * y20) + "," + (this._x1 = x1 + t21 * x21) + "," + (this._y1 = y1 + t21 * y21);
|
||
|
|
}
|
||
|
|
},
|
||
|
|
arc: function(x2, y2, r, a0, a1, ccw) {
|
||
|
|
x2 = +x2, y2 = +y2, r = +r, ccw = !!ccw;
|
||
|
|
var dx = r * Math.cos(a0), dy = r * Math.sin(a0), x0 = x2 + dx, y0 = y2 + dy, cw = 1 ^ ccw, da = ccw ? a0 - a1 : a1 - a0;
|
||
|
|
if (r < 0)
|
||
|
|
throw new Error("negative radius: " + r);
|
||
|
|
if (this._x1 === null) {
|
||
|
|
this._ += "M" + x0 + "," + y0;
|
||
|
|
} else if (Math.abs(this._x1 - x0) > epsilon || Math.abs(this._y1 - y0) > epsilon) {
|
||
|
|
this._ += "L" + x0 + "," + y0;
|
||
|
|
}
|
||
|
|
if (!r)
|
||
|
|
return;
|
||
|
|
if (da < 0)
|
||
|
|
da = da % tau + tau;
|
||
|
|
if (da > tauEpsilon) {
|
||
|
|
this._ += "A" + r + "," + r + ",0,1," + cw + "," + (x2 - dx) + "," + (y2 - dy) + "A" + r + "," + r + ",0,1," + cw + "," + (this._x1 = x0) + "," + (this._y1 = y0);
|
||
|
|
} else if (da > epsilon) {
|
||
|
|
this._ += "A" + r + "," + r + ",0," + +(da >= pi) + "," + cw + "," + (this._x1 = x2 + r * Math.cos(a1)) + "," + (this._y1 = y2 + r * Math.sin(a1));
|
||
|
|
}
|
||
|
|
},
|
||
|
|
rect: function(x2, y2, w, h) {
|
||
|
|
this._ += "M" + (this._x0 = this._x1 = +x2) + "," + (this._y0 = this._y1 = +y2) + "h" + +w + "v" + +h + "h" + -w + "Z";
|
||
|
|
},
|
||
|
|
toString: function() {
|
||
|
|
return this._;
|
||
|
|
}
|
||
|
|
};
|
||
|
|
function constant(x2) {
|
||
|
|
return function constant2() {
|
||
|
|
return x2;
|
||
|
|
};
|
||
|
|
}
|
||
|
|
function x(p) {
|
||
|
|
return p[0];
|
||
|
|
}
|
||
|
|
function y(p) {
|
||
|
|
return p[1];
|
||
|
|
}
|
||
|
|
var slice = Array.prototype.slice;
|
||
|
|
function linkSource(d) {
|
||
|
|
return d.source;
|
||
|
|
}
|
||
|
|
function linkTarget(d) {
|
||
|
|
return d.target;
|
||
|
|
}
|
||
|
|
function link(curve) {
|
||
|
|
var source = linkSource, target = linkTarget, x$1 = x, y$1 = y, context = null;
|
||
|
|
function link2() {
|
||
|
|
var buffer, argv = slice.call(arguments), s = source.apply(this, argv), t = target.apply(this, argv);
|
||
|
|
if (!context)
|
||
|
|
context = buffer = path();
|
||
|
|
curve(context, +x$1.apply(this, (argv[0] = s, argv)), +y$1.apply(this, argv), +x$1.apply(this, (argv[0] = t, argv)), +y$1.apply(this, argv));
|
||
|
|
if (buffer)
|
||
|
|
return context = null, buffer + "" || null;
|
||
|
|
}
|
||
|
|
link2.source = function(_) {
|
||
|
|
return arguments.length ? (source = _, link2) : source;
|
||
|
|
};
|
||
|
|
link2.target = function(_) {
|
||
|
|
return arguments.length ? (target = _, link2) : target;
|
||
|
|
};
|
||
|
|
link2.x = function(_) {
|
||
|
|
return arguments.length ? (x$1 = typeof _ === "function" ? _ : constant(+_), link2) : x$1;
|
||
|
|
};
|
||
|
|
link2.y = function(_) {
|
||
|
|
return arguments.length ? (y$1 = typeof _ === "function" ? _ : constant(+_), link2) : y$1;
|
||
|
|
};
|
||
|
|
link2.context = function(_) {
|
||
|
|
return arguments.length ? (context = _ == null ? null : _, link2) : context;
|
||
|
|
};
|
||
|
|
return link2;
|
||
|
|
}
|
||
|
|
function curveHorizontal(context, x0, y0, x1, y1) {
|
||
|
|
context.moveTo(x0, y0);
|
||
|
|
context.bezierCurveTo(x0 = (x0 + x1) / 2, y0, x0, y1, x1, y1);
|
||
|
|
}
|
||
|
|
function linkHorizontal() {
|
||
|
|
return link(curveHorizontal);
|
||
|
|
}
|
||
|
|
function horizontalSource(d) {
|
||
|
|
return [d.source.x1, d.y0];
|
||
|
|
}
|
||
|
|
function horizontalTarget(d) {
|
||
|
|
return [d.target.x0, d.y1];
|
||
|
|
}
|
||
|
|
function d3SankeyLinkHorizontal() {
|
||
|
|
return linkHorizontal().source(horizontalSource).target(horizontalTarget);
|
||
|
|
}
|
||
|
|
const _Uid = class _Uid2 {
|
||
|
|
static next(name) {
|
||
|
|
return new _Uid2(name + ++_Uid2.count);
|
||
|
|
}
|
||
|
|
constructor(id) {
|
||
|
|
this.id = id;
|
||
|
|
this.href = `#${id}`;
|
||
|
|
}
|
||
|
|
toString() {
|
||
|
|
return "url(" + this.href + ")";
|
||
|
|
}
|
||
|
|
};
|
||
|
|
_Uid.count = 0;
|
||
|
|
let Uid = _Uid;
|
||
|
|
const alignmentsMap = {
|
||
|
|
left,
|
||
|
|
right,
|
||
|
|
center,
|
||
|
|
justify
|
||
|
|
};
|
||
|
|
const draw = function(text, id, _version, diagObj) {
|
||
|
|
const { securityLevel, sankey: conf } = getConfig();
|
||
|
|
const defaultSankeyConfig = defaultConfig.sankey;
|
||
|
|
let sandboxElement;
|
||
|
|
if (securityLevel === "sandbox") {
|
||
|
|
sandboxElement = d3select("#i" + id);
|
||
|
|
}
|
||
|
|
const root = securityLevel === "sandbox" ? d3select(sandboxElement.nodes()[0].contentDocument.body) : d3select("body");
|
||
|
|
const svg = securityLevel === "sandbox" ? root.select(`[id="${id}"]`) : d3select(`[id="${id}"]`);
|
||
|
|
const width = (conf == null ? void 0 : conf.width) ?? defaultSankeyConfig.width;
|
||
|
|
const height = (conf == null ? void 0 : conf.height) ?? defaultSankeyConfig.width;
|
||
|
|
const useMaxWidth = (conf == null ? void 0 : conf.useMaxWidth) ?? defaultSankeyConfig.useMaxWidth;
|
||
|
|
const nodeAlignment = (conf == null ? void 0 : conf.nodeAlignment) ?? defaultSankeyConfig.nodeAlignment;
|
||
|
|
const prefix = (conf == null ? void 0 : conf.prefix) ?? defaultSankeyConfig.prefix;
|
||
|
|
const suffix = (conf == null ? void 0 : conf.suffix) ?? defaultSankeyConfig.suffix;
|
||
|
|
const showValues = (conf == null ? void 0 : conf.showValues) ?? defaultSankeyConfig.showValues;
|
||
|
|
const graph = diagObj.db.getGraph();
|
||
|
|
const nodeAlign = alignmentsMap[nodeAlignment];
|
||
|
|
const nodeWidth = 10;
|
||
|
|
const sankey = Sankey().nodeId((d) => d.id).nodeWidth(nodeWidth).nodePadding(10 + (showValues ? 15 : 0)).nodeAlign(nodeAlign).extent([
|
||
|
|
[0, 0],
|
||
|
|
[width, height]
|
||
|
|
]);
|
||
|
|
sankey(graph);
|
||
|
|
const colorScheme = ordinal(d3schemeTableau10);
|
||
|
|
svg.append("g").attr("class", "nodes").selectAll(".node").data(graph.nodes).join("g").attr("class", "node").attr("id", (d) => (d.uid = Uid.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) => {
|
||
|
|
return d.y1 - d.y0;
|
||
|
|
}).attr("width", (d) => d.x1 - d.x0).attr("fill", (d) => colorScheme(d.id));
|
||
|
|
const getText = ({ id: id2, value: value2 }) => {
|
||
|
|
if (!showValues) {
|
||
|
|
return id2;
|
||
|
|
}
|
||
|
|
return `${id2}
|
||
|
|
${prefix}${Math.round(value2 * 100) / 100}${suffix}`;
|
||
|
|
};
|
||
|
|
svg.append("g").attr("class", "node-labels").attr("font-family", "sans-serif").attr("font-size", 14).selectAll("text").data(graph.nodes).join("text").attr("x", (d) => d.x0 < width / 2 ? d.x1 + 6 : d.x0 - 6).attr("y", (d) => (d.y1 + d.y0) / 2).attr("dy", `${showValues ? "0" : "0.35"}em`).attr("text-anchor", (d) => d.x0 < width / 2 ? "start" : "end").text(getText);
|
||
|
|
const link2 = svg.append("g").attr("class", "links").attr("fill", "none").attr("stroke-opacity", 0.5).selectAll(".link").data(graph.links).join("g").attr("class", "link").style("mix-blend-mode", "multiply");
|
||
|
|
const linkColor = (conf == null ? void 0 : conf.linkColor) || "gradient";
|
||
|
|
if (linkColor === "gradient") {
|
||
|
|
const gradient = link2.append("linearGradient").attr("id", (d) => (d.uid = Uid.next("linearGradient-")).id).attr("gradientUnits", "userSpaceOnUse").attr("x1", (d) => d.source.x1).attr("x2", (d) => d.target.x0);
|
||
|
|
gradient.append("stop").attr("offset", "0%").attr("stop-color", (d) => colorScheme(d.source.id));
|
||
|
|
gradient.append("stop").attr("offset", "100%").attr("stop-color", (d) => colorScheme(d.target.id));
|
||
|
|
}
|
||
|
|
let coloring;
|
||
|
|
switch (linkColor) {
|
||
|
|
case "gradient":
|
||
|
|
coloring = (d) => d.uid;
|
||
|
|
break;
|
||
|
|
case "source":
|
||
|
|
coloring = (d) => colorScheme(d.source.id);
|
||
|
|
break;
|
||
|
|
case "target":
|
||
|
|
coloring = (d) => colorScheme(d.target.id);
|
||
|
|
break;
|
||
|
|
default:
|
||
|
|
coloring = linkColor;
|
||
|
|
}
|
||
|
|
link2.append("path").attr("d", d3SankeyLinkHorizontal()).attr("stroke", coloring).attr("stroke-width", (d) => Math.max(1, d.width));
|
||
|
|
setupGraphViewbox(void 0, svg, 0, useMaxWidth);
|
||
|
|
};
|
||
|
|
const renderer = {
|
||
|
|
draw
|
||
|
|
};
|
||
|
|
const prepareTextForParsing = (text) => {
|
||
|
|
const textToParse = text.replaceAll(/^[^\S\n\r]+|[^\S\n\r]+$/g, "").replaceAll(/([\n\r])+/g, "\n").trim();
|
||
|
|
return textToParse;
|
||
|
|
};
|
||
|
|
const originalParse = parser$1.parse.bind(parser$1);
|
||
|
|
parser$1.parse = (text) => originalParse(prepareTextForParsing(text));
|
||
|
|
const diagram = {
|
||
|
|
parser: parser$1,
|
||
|
|
db,
|
||
|
|
renderer
|
||
|
|
};
|
||
|
|
export {
|
||
|
|
diagram
|
||
|
|
};
|