mirror of
https://github.com/mfocko/blog.git
synced 2024-11-10 08:19:07 +01:00
1410 lines
No EOL
44 KiB
JavaScript
1410 lines
No EOL
44 KiB
JavaScript
"use strict";
|
||
exports.id = 240;
|
||
exports.ids = [240];
|
||
exports.modules = {
|
||
|
||
/***/ 10240:
|
||
/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
|
||
|
||
|
||
// EXPORTS
|
||
__webpack_require__.d(__webpack_exports__, {
|
||
diagram: () => (/* binding */ diagram)
|
||
});
|
||
|
||
// EXTERNAL MODULE: ./node_modules/mermaid/dist/mermaid-934d9bea.js + 8 modules
|
||
var mermaid_934d9bea = __webpack_require__(85322);
|
||
// EXTERNAL MODULE: ./node_modules/d3/src/index.js + 197 modules
|
||
var src = __webpack_require__(64218);
|
||
;// CONCATENATED MODULE: ./node_modules/d3-sankey/node_modules/d3-array/src/min.js
|
||
function min(values, valueof) {
|
||
let min;
|
||
if (valueof === undefined) {
|
||
for (const value of values) {
|
||
if (value != null
|
||
&& (min > value || (min === undefined && value >= value))) {
|
||
min = value;
|
||
}
|
||
}
|
||
} else {
|
||
let index = -1;
|
||
for (let value of values) {
|
||
if ((value = valueof(value, ++index, values)) != null
|
||
&& (min > value || (min === undefined && value >= value))) {
|
||
min = value;
|
||
}
|
||
}
|
||
}
|
||
return min;
|
||
}
|
||
|
||
;// CONCATENATED MODULE: ./node_modules/d3-sankey/src/align.js
|
||
|
||
|
||
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;
|
||
}
|
||
|
||
;// CONCATENATED MODULE: ./node_modules/d3-sankey/node_modules/d3-array/src/sum.js
|
||
function sum(values, valueof) {
|
||
let sum = 0;
|
||
if (valueof === undefined) {
|
||
for (let value of values) {
|
||
if (value = +value) {
|
||
sum += value;
|
||
}
|
||
}
|
||
} else {
|
||
let index = -1;
|
||
for (let value of values) {
|
||
if (value = +valueof(value, ++index, values)) {
|
||
sum += value;
|
||
}
|
||
}
|
||
}
|
||
return sum;
|
||
}
|
||
|
||
;// CONCATENATED MODULE: ./node_modules/d3-sankey/node_modules/d3-array/src/max.js
|
||
function max(values, valueof) {
|
||
let max;
|
||
if (valueof === undefined) {
|
||
for (const value of values) {
|
||
if (value != null
|
||
&& (max < value || (max === undefined && value >= value))) {
|
||
max = value;
|
||
}
|
||
}
|
||
} else {
|
||
let index = -1;
|
||
for (let value of values) {
|
||
if ((value = valueof(value, ++index, values)) != null
|
||
&& (max < value || (max === undefined && value >= value))) {
|
||
max = value;
|
||
}
|
||
}
|
||
}
|
||
return max;
|
||
}
|
||
|
||
;// CONCATENATED MODULE: ./node_modules/d3-sankey/src/constant.js
|
||
function constant(x) {
|
||
return function() {
|
||
return x;
|
||
};
|
||
}
|
||
|
||
;// CONCATENATED MODULE: ./node_modules/d3-sankey/src/sankey.js
|
||
|
||
|
||
|
||
|
||
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}) {
|
||
for (const node of nodes) {
|
||
let y0 = node.y0;
|
||
let y1 = y0;
|
||
for (const link of node.sourceLinks) {
|
||
link.y0 = y0 + link.width / 2;
|
||
y0 += link.width;
|
||
}
|
||
for (const link of node.targetLinks) {
|
||
link.y1 = y1 + link.width / 2;
|
||
y1 += link.width;
|
||
}
|
||
}
|
||
}
|
||
|
||
function Sankey() {
|
||
let x0 = 0, y0 = 0, x1 = 1, y1 = 1; // extent
|
||
let dx = 24; // nodeWidth
|
||
let dy = 8, py; // nodePadding
|
||
let id = defaultId;
|
||
let align = justify;
|
||
let sort;
|
||
let linkSort;
|
||
let nodes = defaultNodes;
|
||
let links = defaultLinks;
|
||
let iterations = 6;
|
||
|
||
function sankey() {
|
||
const graph = {nodes: nodes.apply(null, arguments), links: links.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(_), sankey) : id;
|
||
};
|
||
|
||
sankey.nodeAlign = function(_) {
|
||
return arguments.length ? (align = typeof _ === "function" ? _ : constant(_), 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 ? (nodes = typeof _ === "function" ? _ : constant(_), sankey) : nodes;
|
||
};
|
||
|
||
sankey.links = function(_) {
|
||
return arguments.length ? (links = typeof _ === "function" ? _ : constant(_), sankey) : links;
|
||
};
|
||
|
||
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, links}) {
|
||
for (const [i, node] of nodes.entries()) {
|
||
node.index = i;
|
||
node.sourceLinks = [];
|
||
node.targetLinks = [];
|
||
}
|
||
const nodeById = new Map(nodes.map((d, i) => [id(d, i, nodes), d]));
|
||
for (const [i, link] of links.entries()) {
|
||
link.index = i;
|
||
let {source, target} = link;
|
||
if (typeof source !== "object") source = link.source = find(nodeById, source);
|
||
if (typeof target !== "object") target = link.target = find(nodeById, target);
|
||
source.sourceLinks.push(link);
|
||
target.targetLinks.push(link);
|
||
}
|
||
if (linkSort != null) {
|
||
for (const {sourceLinks, targetLinks} of nodes) {
|
||
sourceLinks.sort(linkSort);
|
||
targetLinks.sort(linkSort);
|
||
}
|
||
}
|
||
}
|
||
|
||
function computeNodeValues({nodes}) {
|
||
for (const node of nodes) {
|
||
node.value = node.fixedValue === undefined
|
||
? Math.max(sum(node.sourceLinks, value), sum(node.targetLinks, value))
|
||
: node.fixedValue;
|
||
}
|
||
}
|
||
|
||
function computeNodeDepths({nodes}) {
|
||
const n = nodes.length;
|
||
let current = new Set(nodes);
|
||
let next = new Set;
|
||
let x = 0;
|
||
while (current.size) {
|
||
for (const node of current) {
|
||
node.depth = x;
|
||
for (const {target} of node.sourceLinks) {
|
||
next.add(target);
|
||
}
|
||
}
|
||
if (++x > n) throw new Error("circular link");
|
||
current = next;
|
||
next = new Set;
|
||
}
|
||
}
|
||
|
||
function computeNodeHeights({nodes}) {
|
||
const n = nodes.length;
|
||
let current = new Set(nodes);
|
||
let next = new Set;
|
||
let x = 0;
|
||
while (current.size) {
|
||
for (const node of current) {
|
||
node.height = x;
|
||
for (const {source} of node.targetLinks) {
|
||
next.add(source);
|
||
}
|
||
}
|
||
if (++x > n) throw new Error("circular link");
|
||
current = next;
|
||
next = new Set;
|
||
}
|
||
}
|
||
|
||
function computeNodeLayers({nodes}) {
|
||
const x = max(nodes, d => d.depth) + 1;
|
||
const kx = (x1 - x0 - dx) / (x - 1);
|
||
const columns = new Array(x);
|
||
for (const node of nodes) {
|
||
const i = Math.max(0, Math.min(x - 1, Math.floor(align.call(null, node, x))));
|
||
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 nodes of columns) {
|
||
let y = y0;
|
||
for (const node of nodes) {
|
||
node.y0 = y;
|
||
node.y1 = y + node.value * ky;
|
||
y = node.y1 + py;
|
||
for (const link of node.sourceLinks) {
|
||
link.width = link.value * ky;
|
||
}
|
||
}
|
||
y = (y1 - y + py) / (nodes.length + 1);
|
||
for (let i = 0; i < nodes.length; ++i) {
|
||
const node = nodes[i];
|
||
node.y0 += y * (i + 1);
|
||
node.y1 += y * (i + 1);
|
||
}
|
||
reorderLinks(nodes);
|
||
}
|
||
}
|
||
|
||
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);
|
||
}
|
||
}
|
||
|
||
// Reposition each node based on its incoming (target) links.
|
||
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 y = 0;
|
||
let w = 0;
|
||
for (const {source, value} of target.targetLinks) {
|
||
let v = value * (target.layer - source.layer);
|
||
y += targetTop(source, target) * v;
|
||
w += v;
|
||
}
|
||
if (!(w > 0)) continue;
|
||
let dy = (y / w - target.y0) * alpha;
|
||
target.y0 += dy;
|
||
target.y1 += dy;
|
||
reorderNodeLinks(target);
|
||
}
|
||
if (sort === undefined) column.sort(ascendingBreadth);
|
||
resolveCollisions(column, beta);
|
||
}
|
||
}
|
||
|
||
// Reposition each node based on its outgoing (source) links.
|
||
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 y = 0;
|
||
let w = 0;
|
||
for (const {target, value} of source.sourceLinks) {
|
||
let v = value * (target.layer - source.layer);
|
||
y += sourceTop(source, target) * v;
|
||
w += v;
|
||
}
|
||
if (!(w > 0)) continue;
|
||
let dy = (y / w - source.y0) * alpha;
|
||
source.y0 += dy;
|
||
source.y1 += dy;
|
||
reorderNodeLinks(source);
|
||
}
|
||
if (sort === undefined) column.sort(ascendingBreadth);
|
||
resolveCollisions(column, beta);
|
||
}
|
||
}
|
||
|
||
function resolveCollisions(nodes, alpha) {
|
||
const i = nodes.length >> 1;
|
||
const subject = nodes[i];
|
||
resolveCollisionsBottomToTop(nodes, subject.y0 - py, i - 1, alpha);
|
||
resolveCollisionsTopToBottom(nodes, subject.y1 + py, i + 1, alpha);
|
||
resolveCollisionsBottomToTop(nodes, y1, nodes.length - 1, alpha);
|
||
resolveCollisionsTopToBottom(nodes, y0, 0, alpha);
|
||
}
|
||
|
||
// Push any overlapping nodes down.
|
||
function resolveCollisionsTopToBottom(nodes, y, i, alpha) {
|
||
for (; i < nodes.length; ++i) {
|
||
const node = nodes[i];
|
||
const dy = (y - node.y0) * alpha;
|
||
if (dy > 1e-6) node.y0 += dy, node.y1 += dy;
|
||
y = node.y1 + py;
|
||
}
|
||
}
|
||
|
||
// Push any overlapping nodes up.
|
||
function resolveCollisionsBottomToTop(nodes, y, i, alpha) {
|
||
for (; i >= 0; --i) {
|
||
const node = nodes[i];
|
||
const dy = (node.y1 - y) * alpha;
|
||
if (dy > 1e-6) node.y0 -= dy, node.y1 -= dy;
|
||
y = node.y0 - py;
|
||
}
|
||
}
|
||
|
||
function reorderNodeLinks({sourceLinks, targetLinks}) {
|
||
if (linkSort === undefined) {
|
||
for (const {source: {sourceLinks}} of targetLinks) {
|
||
sourceLinks.sort(ascendingTargetBreadth);
|
||
}
|
||
for (const {target: {targetLinks}} of sourceLinks) {
|
||
targetLinks.sort(ascendingSourceBreadth);
|
||
}
|
||
}
|
||
}
|
||
|
||
function reorderLinks(nodes) {
|
||
if (linkSort === undefined) {
|
||
for (const {sourceLinks, targetLinks} of nodes) {
|
||
sourceLinks.sort(ascendingTargetBreadth);
|
||
targetLinks.sort(ascendingSourceBreadth);
|
||
}
|
||
}
|
||
}
|
||
|
||
// Returns the target.y0 that would produce an ideal link from source to target.
|
||
function targetTop(source, target) {
|
||
let y = source.y0 - (source.sourceLinks.length - 1) * py / 2;
|
||
for (const {target: node, width} of source.sourceLinks) {
|
||
if (node === target) break;
|
||
y += width + py;
|
||
}
|
||
for (const {source: node, width} of target.targetLinks) {
|
||
if (node === source) break;
|
||
y -= width;
|
||
}
|
||
return y;
|
||
}
|
||
|
||
// Returns the source.y0 that would produce an ideal link from source to target.
|
||
function sourceTop(source, target) {
|
||
let y = target.y0 - (target.targetLinks.length - 1) * py / 2;
|
||
for (const {source: node, width} of target.targetLinks) {
|
||
if (node === source) break;
|
||
y += width + py;
|
||
}
|
||
for (const {target: node, width} of source.sourceLinks) {
|
||
if (node === target) break;
|
||
y -= width;
|
||
}
|
||
return y;
|
||
}
|
||
|
||
return sankey;
|
||
}
|
||
|
||
;// CONCATENATED MODULE: ./node_modules/d3-sankey/node_modules/d3-path/src/path.js
|
||
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; // end of current subpath
|
||
this._ = "";
|
||
}
|
||
|
||
function path() {
|
||
return new Path;
|
||
}
|
||
|
||
Path.prototype = path.prototype = {
|
||
constructor: Path,
|
||
moveTo: function(x, y) {
|
||
this._ += "M" + (this._x0 = this._x1 = +x) + "," + (this._y0 = this._y1 = +y);
|
||
},
|
||
closePath: function() {
|
||
if (this._x1 !== null) {
|
||
this._x1 = this._x0, this._y1 = this._y0;
|
||
this._ += "Z";
|
||
}
|
||
},
|
||
lineTo: function(x, y) {
|
||
this._ += "L" + (this._x1 = +x) + "," + (this._y1 = +y);
|
||
},
|
||
quadraticCurveTo: function(x1, y1, x, y) {
|
||
this._ += "Q" + (+x1) + "," + (+y1) + "," + (this._x1 = +x) + "," + (this._y1 = +y);
|
||
},
|
||
bezierCurveTo: function(x1, y1, x2, y2, x, y) {
|
||
this._ += "C" + (+x1) + "," + (+y1) + "," + (+x2) + "," + (+y2) + "," + (this._x1 = +x) + "," + (this._y1 = +y);
|
||
},
|
||
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;
|
||
|
||
// Is the radius negative? Error.
|
||
if (r < 0) throw new Error("negative radius: " + r);
|
||
|
||
// Is this path empty? Move to (x1,y1).
|
||
if (this._x1 === null) {
|
||
this._ += "M" + (this._x1 = x1) + "," + (this._y1 = y1);
|
||
}
|
||
|
||
// Or, is (x1,y1) coincident with (x0,y0)? Do nothing.
|
||
else if (!(l01_2 > epsilon));
|
||
|
||
// Or, are (x0,y0), (x1,y1) and (x2,y2) collinear?
|
||
// Equivalently, is (x1,y1) coincident with (x2,y2)?
|
||
// Or, is the radius zero? Line to (x1,y1).
|
||
else if (!(Math.abs(y01 * x21 - y21 * x01) > epsilon) || !r) {
|
||
this._ += "L" + (this._x1 = x1) + "," + (this._y1 = y1);
|
||
}
|
||
|
||
// Otherwise, draw an arc!
|
||
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 the start tangent is not coincident with (x0,y0), line to.
|
||
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(x, y, r, a0, a1, ccw) {
|
||
x = +x, y = +y, r = +r, ccw = !!ccw;
|
||
var dx = r * Math.cos(a0),
|
||
dy = r * Math.sin(a0),
|
||
x0 = x + dx,
|
||
y0 = y + dy,
|
||
cw = 1 ^ ccw,
|
||
da = ccw ? a0 - a1 : a1 - a0;
|
||
|
||
// Is the radius negative? Error.
|
||
if (r < 0) throw new Error("negative radius: " + r);
|
||
|
||
// Is this path empty? Move to (x0,y0).
|
||
if (this._x1 === null) {
|
||
this._ += "M" + x0 + "," + y0;
|
||
}
|
||
|
||
// Or, is (x0,y0) not coincident with the previous point? Line to (x0,y0).
|
||
else if (Math.abs(this._x1 - x0) > epsilon || Math.abs(this._y1 - y0) > epsilon) {
|
||
this._ += "L" + x0 + "," + y0;
|
||
}
|
||
|
||
// Is this arc empty? We’re done.
|
||
if (!r) return;
|
||
|
||
// Does the angle go the wrong way? Flip the direction.
|
||
if (da < 0) da = da % tau + tau;
|
||
|
||
// Is this a complete circle? Draw two arcs to complete the circle.
|
||
if (da > tauEpsilon) {
|
||
this._ += "A" + r + "," + r + ",0,1," + cw + "," + (x - dx) + "," + (y - dy) + "A" + r + "," + r + ",0,1," + cw + "," + (this._x1 = x0) + "," + (this._y1 = y0);
|
||
}
|
||
|
||
// Is this arc non-empty? Draw an arc!
|
||
else if (da > epsilon) {
|
||
this._ += "A" + r + "," + r + ",0," + (+(da >= pi)) + "," + cw + "," + (this._x1 = x + r * Math.cos(a1)) + "," + (this._y1 = y + r * Math.sin(a1));
|
||
}
|
||
},
|
||
rect: function(x, y, w, h) {
|
||
this._ += "M" + (this._x0 = this._x1 = +x) + "," + (this._y0 = this._y1 = +y) + "h" + (+w) + "v" + (+h) + "h" + (-w) + "Z";
|
||
},
|
||
toString: function() {
|
||
return this._;
|
||
}
|
||
};
|
||
|
||
/* harmony default export */ const src_path = (path);
|
||
|
||
;// CONCATENATED MODULE: ./node_modules/d3-sankey/node_modules/d3-shape/src/array.js
|
||
var slice = Array.prototype.slice;
|
||
|
||
;// CONCATENATED MODULE: ./node_modules/d3-sankey/node_modules/d3-shape/src/constant.js
|
||
/* harmony default export */ function src_constant(x) {
|
||
return function constant() {
|
||
return x;
|
||
};
|
||
}
|
||
|
||
;// CONCATENATED MODULE: ./node_modules/d3-sankey/node_modules/d3-shape/src/point.js
|
||
function point_x(p) {
|
||
return p[0];
|
||
}
|
||
|
||
function point_y(p) {
|
||
return p[1];
|
||
}
|
||
|
||
;// CONCATENATED MODULE: ./node_modules/d3-sankey/node_modules/d3-shape/src/link/index.js
|
||
|
||
|
||
|
||
|
||
|
||
|
||
function linkSource(d) {
|
||
return d.source;
|
||
}
|
||
|
||
function linkTarget(d) {
|
||
return d.target;
|
||
}
|
||
|
||
function link_link(curve) {
|
||
var source = linkSource,
|
||
target = linkTarget,
|
||
x = point_x,
|
||
y = point_y,
|
||
context = null;
|
||
|
||
function link() {
|
||
var buffer, argv = slice.call(arguments), s = source.apply(this, argv), t = target.apply(this, argv);
|
||
if (!context) context = buffer = src_path();
|
||
curve(context, +x.apply(this, (argv[0] = s, argv)), +y.apply(this, argv), +x.apply(this, (argv[0] = t, argv)), +y.apply(this, argv));
|
||
if (buffer) return context = null, buffer + "" || null;
|
||
}
|
||
|
||
link.source = function(_) {
|
||
return arguments.length ? (source = _, link) : source;
|
||
};
|
||
|
||
link.target = function(_) {
|
||
return arguments.length ? (target = _, link) : target;
|
||
};
|
||
|
||
link.x = function(_) {
|
||
return arguments.length ? (x = typeof _ === "function" ? _ : src_constant(+_), link) : x;
|
||
};
|
||
|
||
link.y = function(_) {
|
||
return arguments.length ? (y = typeof _ === "function" ? _ : src_constant(+_), link) : y;
|
||
};
|
||
|
||
link.context = function(_) {
|
||
return arguments.length ? ((context = _ == null ? null : _), link) : context;
|
||
};
|
||
|
||
return link;
|
||
}
|
||
|
||
function curveHorizontal(context, x0, y0, x1, y1) {
|
||
context.moveTo(x0, y0);
|
||
context.bezierCurveTo(x0 = (x0 + x1) / 2, y0, x0, y1, x1, y1);
|
||
}
|
||
|
||
function curveVertical(context, x0, y0, x1, y1) {
|
||
context.moveTo(x0, y0);
|
||
context.bezierCurveTo(x0, y0 = (y0 + y1) / 2, x1, y0, x1, y1);
|
||
}
|
||
|
||
function curveRadial(context, x0, y0, x1, y1) {
|
||
var p0 = pointRadial(x0, y0),
|
||
p1 = pointRadial(x0, y0 = (y0 + y1) / 2),
|
||
p2 = pointRadial(x1, y0),
|
||
p3 = pointRadial(x1, y1);
|
||
context.moveTo(p0[0], p0[1]);
|
||
context.bezierCurveTo(p1[0], p1[1], p2[0], p2[1], p3[0], p3[1]);
|
||
}
|
||
|
||
function linkHorizontal() {
|
||
return link_link(curveHorizontal);
|
||
}
|
||
|
||
function linkVertical() {
|
||
return link_link(curveVertical);
|
||
}
|
||
|
||
function linkRadial() {
|
||
var l = link_link(curveRadial);
|
||
l.angle = l.x, delete l.x;
|
||
l.radius = l.y, delete l.y;
|
||
return l;
|
||
}
|
||
|
||
;// CONCATENATED MODULE: ./node_modules/d3-sankey/src/sankeyLinkHorizontal.js
|
||
|
||
|
||
function horizontalSource(d) {
|
||
return [d.source.x1, d.y0];
|
||
}
|
||
|
||
function horizontalTarget(d) {
|
||
return [d.target.x0, d.y1];
|
||
}
|
||
|
||
/* harmony default export */ function sankeyLinkHorizontal() {
|
||
return linkHorizontal()
|
||
.source(horizontalSource)
|
||
.target(horizontalTarget);
|
||
}
|
||
|
||
// EXTERNAL MODULE: ./node_modules/dayjs/dayjs.min.js
|
||
var dayjs_min = __webpack_require__(27484);
|
||
// EXTERNAL MODULE: ./node_modules/@braintree/sanitize-url/dist/index.js
|
||
var dist = __webpack_require__(17967);
|
||
// EXTERNAL MODULE: ./node_modules/dompurify/dist/purify.es.js
|
||
var purify_es = __webpack_require__(20683);
|
||
;// CONCATENATED MODULE: ./node_modules/mermaid/dist/sankeyDiagram-6db3d513.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 value = parseFloat($$[$0].trim());
|
||
yy.addLink(source, target, value);
|
||
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: { "easy_keword_rules": 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)/, /^(?:$)/, /^(?:((\u000D\u000A)|(\u000A)))/, /^(?:(\u002C))/, /^(?:(\u0022))/, /^(?:([\u0020-\u0021\u0023-\u002B\u002D-\u007E])*)/, /^(?:(\u0022)(?!(\u0022)))/, /^(?:(([\u0020-\u0021\u0023-\u002B\u002D-\u007E])|(\u002C)|(\u000D)|(\u000A)|(\u0022)(\u0022))*)/],
|
||
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 = {};
|
||
(0,mermaid_934d9bea.t)();
|
||
};
|
||
class SankeyLink {
|
||
constructor(source, target, value = 0) {
|
||
this.source = source;
|
||
this.target = target;
|
||
this.value = value;
|
||
}
|
||
}
|
||
const addLink = (source, target, value) => {
|
||
links.push(new SankeyLink(source, target, value));
|
||
};
|
||
class SankeyNode {
|
||
constructor(ID) {
|
||
this.ID = ID;
|
||
}
|
||
}
|
||
const findOrCreateNode = (ID) => {
|
||
ID = mermaid_934d9bea.e.sanitizeText(ID, (0,mermaid_934d9bea.c)());
|
||
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((link) => ({
|
||
source: link.source.ID,
|
||
target: link.target.ID,
|
||
value: link.value
|
||
}))
|
||
});
|
||
const db = {
|
||
nodesMap,
|
||
getConfig: () => (0,mermaid_934d9bea.c)().sankey,
|
||
getNodes,
|
||
getLinks,
|
||
getGraph,
|
||
addLink,
|
||
findOrCreateNode,
|
||
getAccTitle: mermaid_934d9bea.g,
|
||
setAccTitle: mermaid_934d9bea.s,
|
||
getAccDescription: mermaid_934d9bea.a,
|
||
setAccDescription: mermaid_934d9bea.b,
|
||
getDiagramTitle: mermaid_934d9bea.r,
|
||
setDiagramTitle: mermaid_934d9bea.q,
|
||
clear
|
||
};
|
||
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: left,
|
||
right: right,
|
||
center: center,
|
||
justify: justify
|
||
};
|
||
const draw = function(text, id, _version, diagObj) {
|
||
const { securityLevel, sankey: conf } = (0,mermaid_934d9bea.c)();
|
||
const defaultSankeyConfig = mermaid_934d9bea.I.sankey;
|
||
let sandboxElement;
|
||
if (securityLevel === "sandbox") {
|
||
sandboxElement = (0,src/* select */.Ys)("#i" + id);
|
||
}
|
||
const root = securityLevel === "sandbox" ? (0,src/* select */.Ys)(sandboxElement.nodes()[0].contentDocument.body) : (0,src/* select */.Ys)("body");
|
||
const svg = securityLevel === "sandbox" ? root.select(`[id="${id}"]`) : (0,src/* select */.Ys)(`[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;
|
||
(0,mermaid_934d9bea.i)(svg, height, width, useMaxWidth);
|
||
const graph = diagObj.db.getGraph();
|
||
const nodeAlign = alignmentsMap[nodeAlignment];
|
||
const nodeWidth = 10;
|
||
const sankey$1 = Sankey().nodeId((d) => d.id).nodeWidth(nodeWidth).nodePadding(10 + (showValues ? 15 : 0)).nodeAlign(nodeAlign).extent([
|
||
[0, 0],
|
||
[width, height]
|
||
]);
|
||
sankey$1(graph);
|
||
const colorScheme = (0,src/* scaleOrdinal */.PKp)(src/* schemeTableau10 */.K2I);
|
||
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 }) => {
|
||
if (!showValues) {
|
||
return id2;
|
||
}
|
||
return `${id2}
|
||
${prefix}${Math.round(value * 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 link = 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 = link.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;
|
||
}
|
||
link.append("path").attr("d", sankeyLinkHorizontal()).attr("stroke", coloring).attr("stroke-width", (d) => Math.max(1, d.width));
|
||
};
|
||
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
|
||
};
|
||
|
||
|
||
|
||
/***/ })
|
||
|
||
};
|
||
; |