aboutsummaryrefslogtreecommitdiff
path: root/build/assets/js/635.c9ac7722.js
diff options
context:
space:
mode:
Diffstat (limited to 'build/assets/js/635.c9ac7722.js')
-rw-r--r--build/assets/js/635.c9ac7722.js26180
1 files changed, 0 insertions, 26180 deletions
diff --git a/build/assets/js/635.c9ac7722.js b/build/assets/js/635.c9ac7722.js
deleted file mode 100644
index a1fcbe18..00000000
--- a/build/assets/js/635.c9ac7722.js
+++ /dev/null
@@ -1,26180 +0,0 @@
-"use strict";
-exports.id = 635;
-exports.ids = [635];
-exports.modules = {
-
-/***/ 21176:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-
-// EXPORTS
-__webpack_require__.d(__webpack_exports__, {
- Zp: () => (/* reexport */ layout)
-});
-
-// UNUSED EXPORTS: acyclic, normalize, rank
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/forEach.js
-var forEach = __webpack_require__(8058);
-// EXTERNAL MODULE: ./node_modules/lodash-es/uniqueId.js
-var uniqueId = __webpack_require__(5664);
-// EXTERNAL MODULE: ./node_modules/lodash-es/has.js + 1 modules
-var has = __webpack_require__(48585);
-// EXTERNAL MODULE: ./node_modules/lodash-es/constant.js
-var constant = __webpack_require__(39142);
-// EXTERNAL MODULE: ./node_modules/lodash-es/flatten.js
-var flatten = __webpack_require__(34098);
-// EXTERNAL MODULE: ./node_modules/lodash-es/map.js
-var map = __webpack_require__(74722);
-// EXTERNAL MODULE: ./node_modules/lodash-es/range.js + 2 modules
-var range = __webpack_require__(91395);
-// EXTERNAL MODULE: ./node_modules/dagre-d3-es/src/graphlib/index.js
-var graphlib = __webpack_require__(697);
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/dagre/data/list.js
-/*
- * Simple doubly linked list implementation derived from Cormen, et al.,
- * "Introduction to Algorithms".
- */
-
-
-
-class List {
- constructor() {
- var sentinel = {};
- sentinel._next = sentinel._prev = sentinel;
- this._sentinel = sentinel;
- }
- dequeue() {
- var sentinel = this._sentinel;
- var entry = sentinel._prev;
- if (entry !== sentinel) {
- unlink(entry);
- return entry;
- }
- }
- enqueue(entry) {
- var sentinel = this._sentinel;
- if (entry._prev && entry._next) {
- unlink(entry);
- }
- entry._next = sentinel._next;
- sentinel._next._prev = entry;
- sentinel._next = entry;
- entry._prev = sentinel;
- }
- toString() {
- var strs = [];
- var sentinel = this._sentinel;
- var curr = sentinel._prev;
- while (curr !== sentinel) {
- strs.push(JSON.stringify(curr, filterOutLinks));
- curr = curr._prev;
- }
- return '[' + strs.join(', ') + ']';
- }
-}
-
-function unlink(entry) {
- entry._prev._next = entry._next;
- entry._next._prev = entry._prev;
- delete entry._next;
- delete entry._prev;
-}
-
-function filterOutLinks(k, v) {
- if (k !== '_next' && k !== '_prev') {
- return v;
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/dagre/greedy-fas.js
-
-
-
-
-/*
- * A greedy heuristic for finding a feedback arc set for a graph. A feedback
- * arc set is a set of edges that can be removed to make a graph acyclic.
- * The algorithm comes from: P. Eades, X. Lin, and W. F. Smyth, "A fast and
- * effective heuristic for the feedback arc set problem." This implementation
- * adjusts that from the paper to allow for weighted edges.
- */
-
-
-var DEFAULT_WEIGHT_FN = constant/* default */.A(1);
-
-function greedyFAS(g, weightFn) {
- if (g.nodeCount() <= 1) {
- return [];
- }
- var state = buildState(g, weightFn || DEFAULT_WEIGHT_FN);
- var results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);
-
- // Expand multi-edges
- return flatten/* default */.A(
- map/* default */.A(results, function (e) {
- return g.outEdges(e.v, e.w);
- })
- );
-}
-
-function doGreedyFAS(g, buckets, zeroIdx) {
- var results = [];
- var sources = buckets[buckets.length - 1];
- var sinks = buckets[0];
-
- var entry;
- while (g.nodeCount()) {
- while ((entry = sinks.dequeue())) {
- removeNode(g, buckets, zeroIdx, entry);
- }
- while ((entry = sources.dequeue())) {
- removeNode(g, buckets, zeroIdx, entry);
- }
- if (g.nodeCount()) {
- for (var i = buckets.length - 2; i > 0; --i) {
- entry = buckets[i].dequeue();
- if (entry) {
- results = results.concat(removeNode(g, buckets, zeroIdx, entry, true));
- break;
- }
- }
- }
- }
-
- return results;
-}
-
-function removeNode(g, buckets, zeroIdx, entry, collectPredecessors) {
- var results = collectPredecessors ? [] : undefined;
-
- forEach/* default */.A(g.inEdges(entry.v), function (edge) {
- var weight = g.edge(edge);
- var uEntry = g.node(edge.v);
-
- if (collectPredecessors) {
- results.push({ v: edge.v, w: edge.w });
- }
-
- uEntry.out -= weight;
- assignBucket(buckets, zeroIdx, uEntry);
- });
-
- forEach/* default */.A(g.outEdges(entry.v), function (edge) {
- var weight = g.edge(edge);
- var w = edge.w;
- var wEntry = g.node(w);
- wEntry['in'] -= weight;
- assignBucket(buckets, zeroIdx, wEntry);
- });
-
- g.removeNode(entry.v);
-
- return results;
-}
-
-function buildState(g, weightFn) {
- var fasGraph = new graphlib/* Graph */.T();
- var maxIn = 0;
- var maxOut = 0;
-
- forEach/* default */.A(g.nodes(), function (v) {
- fasGraph.setNode(v, { v: v, in: 0, out: 0 });
- });
-
- // Aggregate weights on nodes, but also sum the weights across multi-edges
- // into a single edge for the fasGraph.
- forEach/* default */.A(g.edges(), function (e) {
- var prevWeight = fasGraph.edge(e.v, e.w) || 0;
- var weight = weightFn(e);
- var edgeWeight = prevWeight + weight;
- fasGraph.setEdge(e.v, e.w, edgeWeight);
- maxOut = Math.max(maxOut, (fasGraph.node(e.v).out += weight));
- maxIn = Math.max(maxIn, (fasGraph.node(e.w)['in'] += weight));
- });
-
- var buckets = range/* default */.A(maxOut + maxIn + 3).map(function () {
- return new List();
- });
- var zeroIdx = maxIn + 1;
-
- forEach/* default */.A(fasGraph.nodes(), function (v) {
- assignBucket(buckets, zeroIdx, fasGraph.node(v));
- });
-
- return { graph: fasGraph, buckets: buckets, zeroIdx: zeroIdx };
-}
-
-function assignBucket(buckets, zeroIdx, entry) {
- if (!entry.out) {
- buckets[0].enqueue(entry);
- } else if (!entry['in']) {
- buckets[buckets.length - 1].enqueue(entry);
- } else {
- buckets[entry.out - entry['in'] + zeroIdx].enqueue(entry);
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/dagre/acyclic.js
-
-
-
-
-
-function run(g) {
- var fas = g.graph().acyclicer === 'greedy' ? greedyFAS(g, weightFn(g)) : dfsFAS(g);
- forEach/* default */.A(fas, function (e) {
- var label = g.edge(e);
- g.removeEdge(e);
- label.forwardName = e.name;
- label.reversed = true;
- g.setEdge(e.w, e.v, label, uniqueId/* default */.A('rev'));
- });
-
- function weightFn(g) {
- return function (e) {
- return g.edge(e).weight;
- };
- }
-}
-
-function dfsFAS(g) {
- var fas = [];
- var stack = {};
- var visited = {};
-
- function dfs(v) {
- if (has/* default */.A(visited, v)) {
- return;
- }
- visited[v] = true;
- stack[v] = true;
- forEach/* default */.A(g.outEdges(v), function (e) {
- if (has/* default */.A(stack, e.w)) {
- fas.push(e);
- } else {
- dfs(e.w);
- }
- });
- delete stack[v];
- }
-
- forEach/* default */.A(g.nodes(), dfs);
- return fas;
-}
-
-function undo(g) {
- forEach/* default */.A(g.edges(), function (e) {
- var label = g.edge(e);
- if (label.reversed) {
- g.removeEdge(e);
-
- var forwardName = label.forwardName;
- delete label.reversed;
- delete label.forwardName;
- g.setEdge(e.w, e.v, label, forwardName);
- }
- });
-}
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/merge.js + 6 modules
-var merge = __webpack_require__(98879);
-// EXTERNAL MODULE: ./node_modules/lodash-es/pick.js + 4 modules
-var pick = __webpack_require__(81942);
-// EXTERNAL MODULE: ./node_modules/lodash-es/defaults.js
-var defaults = __webpack_require__(23068);
-// EXTERNAL MODULE: ./node_modules/lodash-es/isSymbol.js
-var isSymbol = __webpack_require__(61882);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseExtremum.js
-
-
-/**
- * The base implementation of methods like `_.max` and `_.min` which accepts a
- * `comparator` to determine the extremum value.
- *
- * @private
- * @param {Array} array The array to iterate over.
- * @param {Function} iteratee The iteratee invoked per iteration.
- * @param {Function} comparator The comparator used to compare values.
- * @returns {*} Returns the extremum value.
- */
-function baseExtremum(array, iteratee, comparator) {
- var index = -1,
- length = array.length;
-
- while (++index < length) {
- var value = array[index],
- current = iteratee(value);
-
- if (current != null && (computed === undefined
- ? (current === current && !(0,isSymbol/* default */.A)(current))
- : comparator(current, computed)
- )) {
- var computed = current,
- result = value;
- }
- }
- return result;
-}
-
-/* harmony default export */ const _baseExtremum = (baseExtremum);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseGt.js
-/**
- * The base implementation of `_.gt` which doesn't coerce arguments.
- *
- * @private
- * @param {*} value The value to compare.
- * @param {*} other The other value to compare.
- * @returns {boolean} Returns `true` if `value` is greater than `other`,
- * else `false`.
- */
-function baseGt(value, other) {
- return value > other;
-}
-
-/* harmony default export */ const _baseGt = (baseGt);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/identity.js
-var identity = __webpack_require__(29008);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/max.js
-
-
-
-
-/**
- * Computes the maximum value of `array`. If `array` is empty or falsey,
- * `undefined` is returned.
- *
- * @static
- * @since 0.1.0
- * @memberOf _
- * @category Math
- * @param {Array} array The array to iterate over.
- * @returns {*} Returns the maximum value.
- * @example
- *
- * _.max([4, 2, 8, 6]);
- * // => 8
- *
- * _.max([]);
- * // => undefined
- */
-function max(array) {
- return (array && array.length)
- ? _baseExtremum(array, identity/* default */.A, _baseGt)
- : undefined;
-}
-
-/* harmony default export */ const lodash_es_max = (max);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/last.js
-/**
- * Gets the last element of `array`.
- *
- * @static
- * @memberOf _
- * @since 0.1.0
- * @category Array
- * @param {Array} array The array to query.
- * @returns {*} Returns the last element of `array`.
- * @example
- *
- * _.last([1, 2, 3]);
- * // => 3
- */
-function last(array) {
- var length = array == null ? 0 : array.length;
- return length ? array[length - 1] : undefined;
-}
-
-/* harmony default export */ const lodash_es_last = (last);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_baseAssignValue.js
-var _baseAssignValue = __webpack_require__(52528);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_baseForOwn.js
-var _baseForOwn = __webpack_require__(79841);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_baseIteratee.js + 16 modules
-var _baseIteratee = __webpack_require__(49574);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/mapValues.js
-
-
-
-
-/**
- * Creates an object with the same keys as `object` and values generated
- * by running each own enumerable string keyed property of `object` thru
- * `iteratee`. The iteratee is invoked with three arguments:
- * (value, key, object).
- *
- * @static
- * @memberOf _
- * @since 2.4.0
- * @category Object
- * @param {Object} object The object to iterate over.
- * @param {Function} [iteratee=_.identity] The function invoked per iteration.
- * @returns {Object} Returns the new mapped object.
- * @see _.mapKeys
- * @example
- *
- * var users = {
- * 'fred': { 'user': 'fred', 'age': 40 },
- * 'pebbles': { 'user': 'pebbles', 'age': 1 }
- * };
- *
- * _.mapValues(users, function(o) { return o.age; });
- * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)
- *
- * // The `_.property` iteratee shorthand.
- * _.mapValues(users, 'age');
- * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)
- */
-function mapValues(object, iteratee) {
- var result = {};
- iteratee = (0,_baseIteratee/* default */.A)(iteratee, 3);
-
- (0,_baseForOwn/* default */.A)(object, function(value, key, object) {
- (0,_baseAssignValue/* default */.A)(result, key, iteratee(value, key, object));
- });
- return result;
-}
-
-/* harmony default export */ const lodash_es_mapValues = (mapValues);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/isUndefined.js
-var isUndefined = __webpack_require__(69592);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseLt.js
-/**
- * The base implementation of `_.lt` which doesn't coerce arguments.
- *
- * @private
- * @param {*} value The value to compare.
- * @param {*} other The other value to compare.
- * @returns {boolean} Returns `true` if `value` is less than `other`,
- * else `false`.
- */
-function baseLt(value, other) {
- return value < other;
-}
-
-/* harmony default export */ const _baseLt = (baseLt);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/min.js
-
-
-
-
-/**
- * Computes the minimum value of `array`. If `array` is empty or falsey,
- * `undefined` is returned.
- *
- * @static
- * @since 0.1.0
- * @memberOf _
- * @category Math
- * @param {Array} array The array to iterate over.
- * @returns {*} Returns the minimum value.
- * @example
- *
- * _.min([4, 2, 8, 6]);
- * // => 2
- *
- * _.min([]);
- * // => undefined
- */
-function min(array) {
- return (array && array.length)
- ? _baseExtremum(array, identity/* default */.A, _baseLt)
- : undefined;
-}
-
-/* harmony default export */ const lodash_es_min = (min);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_root.js
-var _root = __webpack_require__(41917);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/now.js
-
-
-/**
- * Gets the timestamp of the number of milliseconds that have elapsed since
- * the Unix epoch (1 January 1970 00:00:00 UTC).
- *
- * @static
- * @memberOf _
- * @since 2.4.0
- * @category Date
- * @returns {number} Returns the timestamp.
- * @example
- *
- * _.defer(function(stamp) {
- * console.log(_.now() - stamp);
- * }, _.now());
- * // => Logs the number of milliseconds it took for the deferred invocation.
- */
-var now = function() {
- return _root/* default */.A.Date.now();
-};
-
-/* harmony default export */ const lodash_es_now = (now);
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/dagre/util.js
-
-
-
-
-
-/*
- * Adds a dummy node to the graph and return v.
- */
-function addDummyNode(g, type, attrs, name) {
- var v;
- do {
- v = uniqueId/* default */.A(name);
- } while (g.hasNode(v));
-
- attrs.dummy = type;
- g.setNode(v, attrs);
- return v;
-}
-
-/*
- * Returns a new graph with only simple edges. Handles aggregation of data
- * associated with multi-edges.
- */
-function simplify(g) {
- var simplified = new graphlib/* Graph */.T().setGraph(g.graph());
- forEach/* default */.A(g.nodes(), function (v) {
- simplified.setNode(v, g.node(v));
- });
- forEach/* default */.A(g.edges(), function (e) {
- var simpleLabel = simplified.edge(e.v, e.w) || { weight: 0, minlen: 1 };
- var label = g.edge(e);
- simplified.setEdge(e.v, e.w, {
- weight: simpleLabel.weight + label.weight,
- minlen: Math.max(simpleLabel.minlen, label.minlen),
- });
- });
- return simplified;
-}
-
-function asNonCompoundGraph(g) {
- var simplified = new graphlib/* Graph */.T({ multigraph: g.isMultigraph() }).setGraph(g.graph());
- forEach/* default */.A(g.nodes(), function (v) {
- if (!g.children(v).length) {
- simplified.setNode(v, g.node(v));
- }
- });
- forEach/* default */.A(g.edges(), function (e) {
- simplified.setEdge(e, g.edge(e));
- });
- return simplified;
-}
-
-function successorWeights(g) {
- var weightMap = _.map(g.nodes(), function (v) {
- var sucs = {};
- _.forEach(g.outEdges(v), function (e) {
- sucs[e.w] = (sucs[e.w] || 0) + g.edge(e).weight;
- });
- return sucs;
- });
- return _.zipObject(g.nodes(), weightMap);
-}
-
-function predecessorWeights(g) {
- var weightMap = _.map(g.nodes(), function (v) {
- var preds = {};
- _.forEach(g.inEdges(v), function (e) {
- preds[e.v] = (preds[e.v] || 0) + g.edge(e).weight;
- });
- return preds;
- });
- return _.zipObject(g.nodes(), weightMap);
-}
-
-/*
- * Finds where a line starting at point ({x, y}) would intersect a rectangle
- * ({x, y, width, height}) if it were pointing at the rectangle's center.
- */
-function intersectRect(rect, point) {
- var x = rect.x;
- var y = rect.y;
-
- // Rectangle intersection algorithm from:
- // http://math.stackexchange.com/questions/108113/find-edge-between-two-boxes
- var dx = point.x - x;
- var dy = point.y - y;
- var w = rect.width / 2;
- var h = rect.height / 2;
-
- if (!dx && !dy) {
- throw new Error('Not possible to find intersection inside of the rectangle');
- }
-
- var sx, sy;
- if (Math.abs(dy) * w > Math.abs(dx) * h) {
- // Intersection is top or bottom of rect.
- if (dy < 0) {
- h = -h;
- }
- sx = (h * dx) / dy;
- sy = h;
- } else {
- // Intersection is left or right of rect.
- if (dx < 0) {
- w = -w;
- }
- sx = w;
- sy = (w * dy) / dx;
- }
-
- return { x: x + sx, y: y + sy };
-}
-
-/*
- * Given a DAG with each node assigned "rank" and "order" properties, this
- * function will produce a matrix with the ids of each node.
- */
-function buildLayerMatrix(g) {
- var layering = map/* default */.A(range/* default */.A(util_maxRank(g) + 1), function () {
- return [];
- });
- forEach/* default */.A(g.nodes(), function (v) {
- var node = g.node(v);
- var rank = node.rank;
- if (!isUndefined/* default */.A(rank)) {
- layering[rank][node.order] = v;
- }
- });
- return layering;
-}
-
-/*
- * Adjusts the ranks for all nodes in the graph such that all nodes v have
- * rank(v) >= 0 and at least one node w has rank(w) = 0.
- */
-function normalizeRanks(g) {
- var min = lodash_es_min(
- map/* default */.A(g.nodes(), function (v) {
- return g.node(v).rank;
- })
- );
- forEach/* default */.A(g.nodes(), function (v) {
- var node = g.node(v);
- if (has/* default */.A(node, 'rank')) {
- node.rank -= min;
- }
- });
-}
-
-function removeEmptyRanks(g) {
- // Ranks may not start at 0, so we need to offset them
- var offset = lodash_es_min(
- map/* default */.A(g.nodes(), function (v) {
- return g.node(v).rank;
- })
- );
-
- var layers = [];
- forEach/* default */.A(g.nodes(), function (v) {
- var rank = g.node(v).rank - offset;
- if (!layers[rank]) {
- layers[rank] = [];
- }
- layers[rank].push(v);
- });
-
- var delta = 0;
- var nodeRankFactor = g.graph().nodeRankFactor;
- forEach/* default */.A(layers, function (vs, i) {
- if (isUndefined/* default */.A(vs) && i % nodeRankFactor !== 0) {
- --delta;
- } else if (delta) {
- forEach/* default */.A(vs, function (v) {
- g.node(v).rank += delta;
- });
- }
- });
-}
-
-function addBorderNode(g, prefix, rank, order) {
- var node = {
- width: 0,
- height: 0,
- };
- if (arguments.length >= 4) {
- node.rank = rank;
- node.order = order;
- }
- return addDummyNode(g, 'border', node, prefix);
-}
-
-function util_maxRank(g) {
- return lodash_es_max(
- map/* default */.A(g.nodes(), function (v) {
- var rank = g.node(v).rank;
- if (!isUndefined/* default */.A(rank)) {
- return rank;
- }
- })
- );
-}
-
-/*
- * Partition a collection into two groups: `lhs` and `rhs`. If the supplied
- * function returns true for an entry it goes into `lhs`. Otherwise it goes
- * into `rhs.
- */
-function partition(collection, fn) {
- var result = { lhs: [], rhs: [] };
- forEach/* default */.A(collection, function (value) {
- if (fn(value)) {
- result.lhs.push(value);
- } else {
- result.rhs.push(value);
- }
- });
- return result;
-}
-
-/*
- * Returns a new function that wraps `fn` with a timer. The wrapper logs the
- * time it takes to execute the function.
- */
-function util_time(name, fn) {
- var start = lodash_es_now();
- try {
- return fn();
- } finally {
- console.log(name + ' time: ' + (lodash_es_now() - start) + 'ms');
- }
-}
-
-function notime(name, fn) {
- return fn();
-}
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/dagre/add-border-segments.js
-
-
-
-
-
-function addBorderSegments(g) {
- function dfs(v) {
- var children = g.children(v);
- var node = g.node(v);
- if (children.length) {
- forEach/* default */.A(children, dfs);
- }
-
- if (has/* default */.A(node, 'minRank')) {
- node.borderLeft = [];
- node.borderRight = [];
- for (var rank = node.minRank, maxRank = node.maxRank + 1; rank < maxRank; ++rank) {
- add_border_segments_addBorderNode(g, 'borderLeft', '_bl', v, node, rank);
- add_border_segments_addBorderNode(g, 'borderRight', '_br', v, node, rank);
- }
- }
- }
-
- forEach/* default */.A(g.children(), dfs);
-}
-
-function add_border_segments_addBorderNode(g, prop, prefix, sg, sgNode, rank) {
- var label = { width: 0, height: 0, rank: rank, borderType: prop };
- var prev = sgNode[prop][rank - 1];
- var curr = addDummyNode(g, 'border', label, prefix);
- sgNode[prop][rank] = curr;
- g.setParent(curr, sg);
- if (prev) {
- g.setEdge(prev, curr, { weight: 1 });
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/dagre/coordinate-system.js
-
-
-
-
-function adjust(g) {
- var rankDir = g.graph().rankdir.toLowerCase();
- if (rankDir === 'lr' || rankDir === 'rl') {
- swapWidthHeight(g);
- }
-}
-
-function coordinate_system_undo(g) {
- var rankDir = g.graph().rankdir.toLowerCase();
- if (rankDir === 'bt' || rankDir === 'rl') {
- reverseY(g);
- }
-
- if (rankDir === 'lr' || rankDir === 'rl') {
- swapXY(g);
- swapWidthHeight(g);
- }
-}
-
-function swapWidthHeight(g) {
- forEach/* default */.A(g.nodes(), function (v) {
- swapWidthHeightOne(g.node(v));
- });
- forEach/* default */.A(g.edges(), function (e) {
- swapWidthHeightOne(g.edge(e));
- });
-}
-
-function swapWidthHeightOne(attrs) {
- var w = attrs.width;
- attrs.width = attrs.height;
- attrs.height = w;
-}
-
-function reverseY(g) {
- forEach/* default */.A(g.nodes(), function (v) {
- reverseYOne(g.node(v));
- });
-
- forEach/* default */.A(g.edges(), function (e) {
- var edge = g.edge(e);
- forEach/* default */.A(edge.points, reverseYOne);
- if (has/* default */.A(edge, 'y')) {
- reverseYOne(edge);
- }
- });
-}
-
-function reverseYOne(attrs) {
- attrs.y = -attrs.y;
-}
-
-function swapXY(g) {
- forEach/* default */.A(g.nodes(), function (v) {
- swapXYOne(g.node(v));
- });
-
- forEach/* default */.A(g.edges(), function (e) {
- var edge = g.edge(e);
- forEach/* default */.A(edge.points, swapXYOne);
- if (has/* default */.A(edge, 'x')) {
- swapXYOne(edge);
- }
- });
-}
-
-function swapXYOne(attrs) {
- var x = attrs.x;
- attrs.x = attrs.y;
- attrs.y = x;
-}
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/dagre/normalize.js
-
-
-
-
-
-/*
- * Breaks any long edges in the graph into short segments that span 1 layer
- * each. This operation is undoable with the denormalize function.
- *
- * Pre-conditions:
- *
- * 1. The input graph is a DAG.
- * 2. Each node in the graph has a "rank" property.
- *
- * Post-condition:
- *
- * 1. All edges in the graph have a length of 1.
- * 2. Dummy nodes are added where edges have been split into segments.
- * 3. The graph is augmented with a "dummyChains" attribute which contains
- * the first dummy in each chain of dummy nodes produced.
- */
-function normalize_run(g) {
- g.graph().dummyChains = [];
- forEach/* default */.A(g.edges(), function (edge) {
- normalizeEdge(g, edge);
- });
-}
-
-function normalizeEdge(g, e) {
- var v = e.v;
- var vRank = g.node(v).rank;
- var w = e.w;
- var wRank = g.node(w).rank;
- var name = e.name;
- var edgeLabel = g.edge(e);
- var labelRank = edgeLabel.labelRank;
-
- if (wRank === vRank + 1) return;
-
- g.removeEdge(e);
-
- var dummy, attrs, i;
- for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {
- edgeLabel.points = [];
- attrs = {
- width: 0,
- height: 0,
- edgeLabel: edgeLabel,
- edgeObj: e,
- rank: vRank,
- };
- dummy = addDummyNode(g, 'edge', attrs, '_d');
- if (vRank === labelRank) {
- attrs.width = edgeLabel.width;
- attrs.height = edgeLabel.height;
- // @ts-expect-error
- attrs.dummy = 'edge-label';
- // @ts-expect-error
- attrs.labelpos = edgeLabel.labelpos;
- }
- g.setEdge(v, dummy, { weight: edgeLabel.weight }, name);
- if (i === 0) {
- g.graph().dummyChains.push(dummy);
- }
- v = dummy;
- }
-
- g.setEdge(v, w, { weight: edgeLabel.weight }, name);
-}
-
-function normalize_undo(g) {
- forEach/* default */.A(g.graph().dummyChains, function (v) {
- var node = g.node(v);
- var origLabel = node.edgeLabel;
- var w;
- g.setEdge(node.edgeObj, origLabel);
- while (node.dummy) {
- w = g.successors(v)[0];
- g.removeNode(v);
- origLabel.points.push({ x: node.x, y: node.y });
- if (node.dummy === 'edge-label') {
- origLabel.x = node.x;
- origLabel.y = node.y;
- origLabel.width = node.width;
- origLabel.height = node.height;
- }
- v = w;
- node = g.node(v);
- }
- });
-}
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/minBy.js
-
-
-
-
-/**
- * This method is like `_.min` except that it accepts `iteratee` which is
- * invoked for each element in `array` to generate the criterion by which
- * the value is ranked. The iteratee is invoked with one argument: (value).
- *
- * @static
- * @memberOf _
- * @since 4.0.0
- * @category Math
- * @param {Array} array The array to iterate over.
- * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
- * @returns {*} Returns the minimum value.
- * @example
- *
- * var objects = [{ 'n': 1 }, { 'n': 2 }];
- *
- * _.minBy(objects, function(o) { return o.n; });
- * // => { 'n': 1 }
- *
- * // The `_.property` iteratee shorthand.
- * _.minBy(objects, 'n');
- * // => { 'n': 1 }
- */
-function minBy(array, iteratee) {
- return (array && array.length)
- ? _baseExtremum(array, (0,_baseIteratee/* default */.A)(iteratee, 2), _baseLt)
- : undefined;
-}
-
-/* harmony default export */ const lodash_es_minBy = (minBy);
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/dagre/rank/util.js
-
-
-
-
-/*
- * Initializes ranks for the input graph using the longest path algorithm. This
- * algorithm scales well and is fast in practice, it yields rather poor
- * solutions. Nodes are pushed to the lowest layer possible, leaving the bottom
- * ranks wide and leaving edges longer than necessary. However, due to its
- * speed, this algorithm is good for getting an initial ranking that can be fed
- * into other algorithms.
- *
- * This algorithm does not normalize layers because it will be used by other
- * algorithms in most cases. If using this algorithm directly, be sure to
- * run normalize at the end.
- *
- * Pre-conditions:
- *
- * 1. Input graph is a DAG.
- * 2. Input graph node labels can be assigned properties.
- *
- * Post-conditions:
- *
- * 1. Each node will be assign an (unnormalized) "rank" property.
- */
-function longestPath(g) {
- var visited = {};
-
- function dfs(v) {
- var label = g.node(v);
- if (has/* default */.A(visited, v)) {
- return label.rank;
- }
- visited[v] = true;
-
- var rank = lodash_es_min(
- map/* default */.A(g.outEdges(v), function (e) {
- return dfs(e.w) - g.edge(e).minlen;
- })
- );
-
- if (
- rank === Number.POSITIVE_INFINITY || // return value of _.map([]) for Lodash 3
- rank === undefined || // return value of _.map([]) for Lodash 4
- rank === null
- ) {
- // return value of _.map([null])
- rank = 0;
- }
-
- return (label.rank = rank);
- }
-
- forEach/* default */.A(g.sources(), dfs);
-}
-
-/*
- * Returns the amount of slack for the given edge. The slack is defined as the
- * difference between the length of the edge and its minimum length.
- */
-function slack(g, e) {
- return g.node(e.w).rank - g.node(e.v).rank - g.edge(e).minlen;
-}
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/dagre/rank/feasible-tree.js
-
-
-
-
-
-
-/*
- * Constructs a spanning tree with tight edges and adjusted the input node's
- * ranks to achieve this. A tight edge is one that is has a length that matches
- * its "minlen" attribute.
- *
- * The basic structure for this function is derived from Gansner, et al., "A
- * Technique for Drawing Directed Graphs."
- *
- * Pre-conditions:
- *
- * 1. Graph must be a DAG.
- * 2. Graph must be connected.
- * 3. Graph must have at least one node.
- * 5. Graph nodes must have been previously assigned a "rank" property that
- * respects the "minlen" property of incident edges.
- * 6. Graph edges must have a "minlen" property.
- *
- * Post-conditions:
- *
- * - Graph nodes will have their rank adjusted to ensure that all edges are
- * tight.
- *
- * Returns a tree (undirected graph) that is constructed using only "tight"
- * edges.
- */
-function feasibleTree(g) {
- var t = new graphlib/* Graph */.T({ directed: false });
-
- // Choose arbitrary node from which to start our tree
- var start = g.nodes()[0];
- var size = g.nodeCount();
- t.setNode(start, {});
-
- var edge, delta;
- while (tightTree(t, g) < size) {
- edge = findMinSlackEdge(t, g);
- delta = t.hasNode(edge.v) ? slack(g, edge) : -slack(g, edge);
- shiftRanks(t, g, delta);
- }
-
- return t;
-}
-
-/*
- * Finds a maximal tree of tight edges and returns the number of nodes in the
- * tree.
- */
-function tightTree(t, g) {
- function dfs(v) {
- forEach/* default */.A(g.nodeEdges(v), function (e) {
- var edgeV = e.v,
- w = v === edgeV ? e.w : edgeV;
- if (!t.hasNode(w) && !slack(g, e)) {
- t.setNode(w, {});
- t.setEdge(v, w, {});
- dfs(w);
- }
- });
- }
-
- forEach/* default */.A(t.nodes(), dfs);
- return t.nodeCount();
-}
-
-/*
- * Finds the edge with the smallest slack that is incident on tree and returns
- * it.
- */
-function findMinSlackEdge(t, g) {
- return lodash_es_minBy(g.edges(), function (e) {
- if (t.hasNode(e.v) !== t.hasNode(e.w)) {
- return slack(g, e);
- }
- });
-}
-
-function shiftRanks(t, g, delta) {
- forEach/* default */.A(t.nodes(), function (v) {
- g.node(v).rank += delta;
- });
-}
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/isArrayLike.js
-var isArrayLike = __webpack_require__(38446);
-// EXTERNAL MODULE: ./node_modules/lodash-es/keys.js
-var keys = __webpack_require__(27422);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_createFind.js
-
-
-
-
-/**
- * Creates a `_.find` or `_.findLast` function.
- *
- * @private
- * @param {Function} findIndexFunc The function to find the collection index.
- * @returns {Function} Returns the new find function.
- */
-function createFind(findIndexFunc) {
- return function(collection, predicate, fromIndex) {
- var iterable = Object(collection);
- if (!(0,isArrayLike/* default */.A)(collection)) {
- var iteratee = (0,_baseIteratee/* default */.A)(predicate, 3);
- collection = (0,keys/* default */.A)(collection);
- predicate = function(key) { return iteratee(iterable[key], key, iterable); };
- }
- var index = findIndexFunc(collection, predicate, fromIndex);
- return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;
- };
-}
-
-/* harmony default export */ const _createFind = (createFind);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_baseFindIndex.js
-var _baseFindIndex = __webpack_require__(25707);
-// EXTERNAL MODULE: ./node_modules/lodash-es/toFinite.js + 3 modules
-var toFinite = __webpack_require__(74342);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/toInteger.js
-
-
-/**
- * Converts `value` to an integer.
- *
- * **Note:** This method is loosely based on
- * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).
- *
- * @static
- * @memberOf _
- * @since 4.0.0
- * @category Lang
- * @param {*} value The value to convert.
- * @returns {number} Returns the converted integer.
- * @example
- *
- * _.toInteger(3.2);
- * // => 3
- *
- * _.toInteger(Number.MIN_VALUE);
- * // => 0
- *
- * _.toInteger(Infinity);
- * // => 1.7976931348623157e+308
- *
- * _.toInteger('3.2');
- * // => 3
- */
-function toInteger(value) {
- var result = (0,toFinite/* default */.A)(value),
- remainder = result % 1;
-
- return result === result ? (remainder ? result - remainder : result) : 0;
-}
-
-/* harmony default export */ const lodash_es_toInteger = (toInteger);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/findIndex.js
-
-
-
-
-/* Built-in method references for those with the same name as other `lodash` methods. */
-var nativeMax = Math.max;
-
-/**
- * This method is like `_.find` except that it returns the index of the first
- * element `predicate` returns truthy for instead of the element itself.
- *
- * @static
- * @memberOf _
- * @since 1.1.0
- * @category Array
- * @param {Array} array The array to inspect.
- * @param {Function} [predicate=_.identity] The function invoked per iteration.
- * @param {number} [fromIndex=0] The index to search from.
- * @returns {number} Returns the index of the found element, else `-1`.
- * @example
- *
- * var users = [
- * { 'user': 'barney', 'active': false },
- * { 'user': 'fred', 'active': false },
- * { 'user': 'pebbles', 'active': true }
- * ];
- *
- * _.findIndex(users, function(o) { return o.user == 'barney'; });
- * // => 0
- *
- * // The `_.matches` iteratee shorthand.
- * _.findIndex(users, { 'user': 'fred', 'active': false });
- * // => 1
- *
- * // The `_.matchesProperty` iteratee shorthand.
- * _.findIndex(users, ['active', false]);
- * // => 0
- *
- * // The `_.property` iteratee shorthand.
- * _.findIndex(users, 'active');
- * // => 2
- */
-function findIndex(array, predicate, fromIndex) {
- var length = array == null ? 0 : array.length;
- if (!length) {
- return -1;
- }
- var index = fromIndex == null ? 0 : lodash_es_toInteger(fromIndex);
- if (index < 0) {
- index = nativeMax(length + index, 0);
- }
- return (0,_baseFindIndex/* default */.A)(array, (0,_baseIteratee/* default */.A)(predicate, 3), index);
-}
-
-/* harmony default export */ const lodash_es_findIndex = (findIndex);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/find.js
-
-
-
-/**
- * Iterates over elements of `collection`, returning the first element
- * `predicate` returns truthy for. The predicate is invoked with three
- * arguments: (value, index|key, collection).
- *
- * @static
- * @memberOf _
- * @since 0.1.0
- * @category Collection
- * @param {Array|Object} collection The collection to inspect.
- * @param {Function} [predicate=_.identity] The function invoked per iteration.
- * @param {number} [fromIndex=0] The index to search from.
- * @returns {*} Returns the matched element, else `undefined`.
- * @example
- *
- * var users = [
- * { 'user': 'barney', 'age': 36, 'active': true },
- * { 'user': 'fred', 'age': 40, 'active': false },
- * { 'user': 'pebbles', 'age': 1, 'active': true }
- * ];
- *
- * _.find(users, function(o) { return o.age < 40; });
- * // => object for 'barney'
- *
- * // The `_.matches` iteratee shorthand.
- * _.find(users, { 'age': 1, 'active': true });
- * // => object for 'pebbles'
- *
- * // The `_.matchesProperty` iteratee shorthand.
- * _.find(users, ['active', false]);
- * // => object for 'fred'
- *
- * // The `_.property` iteratee shorthand.
- * _.find(users, 'active');
- * // => object for 'barney'
- */
-var find = _createFind(lodash_es_findIndex);
-
-/* harmony default export */ const lodash_es_find = (find);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/filter.js + 1 modules
-var filter = __webpack_require__(11662);
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/graphlib/alg/dijkstra.js
-
-
-
-
-
-var DEFAULT_WEIGHT_FUNC = constant/* default */.A(1);
-
-function dijkstra_dijkstra(g, source, weightFn, edgeFn) {
- return runDijkstra(
- g,
- String(source),
- weightFn || DEFAULT_WEIGHT_FUNC,
- edgeFn ||
- function (v) {
- return g.outEdges(v);
- }
- );
-}
-
-function runDijkstra(g, source, weightFn, edgeFn) {
- var results = {};
- var pq = new PriorityQueue();
- var v, vEntry;
-
- var updateNeighbors = function (edge) {
- var w = edge.v !== v ? edge.v : edge.w;
- var wEntry = results[w];
- var weight = weightFn(edge);
- var distance = vEntry.distance + weight;
-
- if (weight < 0) {
- throw new Error(
- 'dijkstra does not allow negative edge weights. ' +
- 'Bad edge: ' +
- edge +
- ' Weight: ' +
- weight
- );
- }
-
- if (distance < wEntry.distance) {
- wEntry.distance = distance;
- wEntry.predecessor = v;
- pq.decrease(w, distance);
- }
- };
-
- g.nodes().forEach(function (v) {
- var distance = v === source ? 0 : Number.POSITIVE_INFINITY;
- results[v] = { distance: distance };
- pq.add(v, distance);
- });
-
- while (pq.size() > 0) {
- v = pq.removeMin();
- vEntry = results[v];
- if (vEntry.distance === Number.POSITIVE_INFINITY) {
- break;
- }
-
- edgeFn(v).forEach(updateNeighbors);
- }
-
- return results;
-}
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/graphlib/alg/dijkstra-all.js
-
-
-
-
-
-function dijkstraAll(g, weightFunc, edgeFunc) {
- return _.transform(
- g.nodes(),
- function (acc, v) {
- acc[v] = dijkstra(g, v, weightFunc, edgeFunc);
- },
- {}
- );
-}
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/graphlib/alg/floyd-warshall.js
-
-
-
-
-var floyd_warshall_DEFAULT_WEIGHT_FUNC = constant/* default */.A(1);
-
-function floydWarshall(g, weightFn, edgeFn) {
- return runFloydWarshall(
- g,
- weightFn || floyd_warshall_DEFAULT_WEIGHT_FUNC,
- edgeFn ||
- function (v) {
- return g.outEdges(v);
- }
- );
-}
-
-function runFloydWarshall(g, weightFn, edgeFn) {
- var results = {};
- var nodes = g.nodes();
-
- nodes.forEach(function (v) {
- results[v] = {};
- results[v][v] = { distance: 0 };
- nodes.forEach(function (w) {
- if (v !== w) {
- results[v][w] = { distance: Number.POSITIVE_INFINITY };
- }
- });
- edgeFn(v).forEach(function (edge) {
- var w = edge.v === v ? edge.w : edge.v;
- var d = weightFn(edge);
- results[v][w] = { distance: d, predecessor: v };
- });
- });
-
- nodes.forEach(function (k) {
- var rowK = results[k];
- nodes.forEach(function (i) {
- var rowI = results[i];
- nodes.forEach(function (j) {
- var ik = rowI[k];
- var kj = rowK[j];
- var ij = rowI[j];
- var altDistance = ik.distance + kj.distance;
- if (altDistance < ij.distance) {
- ij.distance = altDistance;
- ij.predecessor = kj.predecessor;
- }
- });
- });
- });
-
- return results;
-}
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_baseKeys.js + 1 modules
-var _baseKeys = __webpack_require__(69471);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_getTag.js + 3 modules
-var _getTag = __webpack_require__(9779);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_baseGetTag.js + 2 modules
-var _baseGetTag = __webpack_require__(88496);
-// EXTERNAL MODULE: ./node_modules/lodash-es/isArray.js
-var isArray = __webpack_require__(92049);
-// EXTERNAL MODULE: ./node_modules/lodash-es/isObjectLike.js
-var isObjectLike = __webpack_require__(53098);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/isString.js
-
-
-
-
-/** `Object#toString` result references. */
-var stringTag = '[object String]';
-
-/**
- * Checks if `value` is classified as a `String` primitive or object.
- *
- * @static
- * @since 0.1.0
- * @memberOf _
- * @category Lang
- * @param {*} value The value to check.
- * @returns {boolean} Returns `true` if `value` is a string, else `false`.
- * @example
- *
- * _.isString('abc');
- * // => true
- *
- * _.isString(1);
- * // => false
- */
-function isString(value) {
- return typeof value == 'string' ||
- (!(0,isArray/* default */.A)(value) && (0,isObjectLike/* default */.A)(value) && (0,_baseGetTag/* default */.A)(value) == stringTag);
-}
-
-/* harmony default export */ const lodash_es_isString = (isString);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_baseProperty.js
-var _baseProperty = __webpack_require__(70805);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_asciiSize.js
-
-
-/**
- * Gets the size of an ASCII `string`.
- *
- * @private
- * @param {string} string The string inspect.
- * @returns {number} Returns the string size.
- */
-var asciiSize = (0,_baseProperty/* default */.A)('length');
-
-/* harmony default export */ const _asciiSize = (asciiSize);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_hasUnicode.js
-/** Used to compose unicode character classes. */
-var rsAstralRange = '\\ud800-\\udfff',
- rsComboMarksRange = '\\u0300-\\u036f',
- reComboHalfMarksRange = '\\ufe20-\\ufe2f',
- rsComboSymbolsRange = '\\u20d0-\\u20ff',
- rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,
- rsVarRange = '\\ufe0e\\ufe0f';
-
-/** Used to compose unicode capture groups. */
-var rsZWJ = '\\u200d';
-
-/** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */
-var reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange + rsComboRange + rsVarRange + ']');
-
-/**
- * Checks if `string` contains Unicode symbols.
- *
- * @private
- * @param {string} string The string to inspect.
- * @returns {boolean} Returns `true` if a symbol is found, else `false`.
- */
-function hasUnicode(string) {
- return reHasUnicode.test(string);
-}
-
-/* harmony default export */ const _hasUnicode = (hasUnicode);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_unicodeSize.js
-/** Used to compose unicode character classes. */
-var _unicodeSize_rsAstralRange = '\\ud800-\\udfff',
- _unicodeSize_rsComboMarksRange = '\\u0300-\\u036f',
- _unicodeSize_reComboHalfMarksRange = '\\ufe20-\\ufe2f',
- _unicodeSize_rsComboSymbolsRange = '\\u20d0-\\u20ff',
- _unicodeSize_rsComboRange = _unicodeSize_rsComboMarksRange + _unicodeSize_reComboHalfMarksRange + _unicodeSize_rsComboSymbolsRange,
- _unicodeSize_rsVarRange = '\\ufe0e\\ufe0f';
-
-/** Used to compose unicode capture groups. */
-var rsAstral = '[' + _unicodeSize_rsAstralRange + ']',
- rsCombo = '[' + _unicodeSize_rsComboRange + ']',
- rsFitz = '\\ud83c[\\udffb-\\udfff]',
- rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',
- rsNonAstral = '[^' + _unicodeSize_rsAstralRange + ']',
- rsRegional = '(?:\\ud83c[\\udde6-\\uddff]){2}',
- rsSurrPair = '[\\ud800-\\udbff][\\udc00-\\udfff]',
- _unicodeSize_rsZWJ = '\\u200d';
-
-/** Used to compose unicode regexes. */
-var reOptMod = rsModifier + '?',
- rsOptVar = '[' + _unicodeSize_rsVarRange + ']?',
- rsOptJoin = '(?:' + _unicodeSize_rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',
- rsSeq = rsOptVar + reOptMod + rsOptJoin,
- rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';
-
-/** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */
-var reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');
-
-/**
- * Gets the size of a Unicode `string`.
- *
- * @private
- * @param {string} string The string inspect.
- * @returns {number} Returns the string size.
- */
-function unicodeSize(string) {
- var result = reUnicode.lastIndex = 0;
- while (reUnicode.test(string)) {
- ++result;
- }
- return result;
-}
-
-/* harmony default export */ const _unicodeSize = (unicodeSize);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_stringSize.js
-
-
-
-
-/**
- * Gets the number of symbols in `string`.
- *
- * @private
- * @param {string} string The string to inspect.
- * @returns {number} Returns the string size.
- */
-function stringSize(string) {
- return _hasUnicode(string)
- ? _unicodeSize(string)
- : _asciiSize(string);
-}
-
-/* harmony default export */ const _stringSize = (stringSize);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/size.js
-
-
-
-
-
-
-/** `Object#toString` result references. */
-var mapTag = '[object Map]',
- setTag = '[object Set]';
-
-/**
- * Gets the size of `collection` by returning its length for array-like
- * values or the number of own enumerable string keyed properties for objects.
- *
- * @static
- * @memberOf _
- * @since 0.1.0
- * @category Collection
- * @param {Array|Object|string} collection The collection to inspect.
- * @returns {number} Returns the collection size.
- * @example
- *
- * _.size([1, 2, 3]);
- * // => 3
- *
- * _.size({ 'a': 1, 'b': 2 });
- * // => 2
- *
- * _.size('pebbles');
- * // => 7
- */
-function size(collection) {
- if (collection == null) {
- return 0;
- }
- if ((0,isArrayLike/* default */.A)(collection)) {
- return lodash_es_isString(collection) ? _stringSize(collection) : collection.length;
- }
- var tag = (0,_getTag/* default */.A)(collection);
- if (tag == mapTag || tag == setTag) {
- return collection.size;
- }
- return (0,_baseKeys/* default */.A)(collection).length;
-}
-
-/* harmony default export */ const lodash_es_size = (size);
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/graphlib/alg/topsort.js
-
-
-
-
-topsort_topsort.CycleException = topsort_CycleException;
-
-function topsort_topsort(g) {
- var visited = {};
- var stack = {};
- var results = [];
-
- function visit(node) {
- if (has/* default */.A(stack, node)) {
- throw new topsort_CycleException();
- }
-
- if (!has/* default */.A(visited, node)) {
- stack[node] = true;
- visited[node] = true;
- forEach/* default */.A(g.predecessors(node), visit);
- delete stack[node];
- results.push(node);
- }
- }
-
- forEach/* default */.A(g.sinks(), visit);
-
- if (lodash_es_size(visited) !== g.nodeCount()) {
- throw new topsort_CycleException();
- }
-
- return results;
-}
-
-function topsort_CycleException() {}
-topsort_CycleException.prototype = new Error(); // must be an instance of Error to pass testing
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/graphlib/alg/is-acyclic.js
-
-
-
-
-function isAcyclic(g) {
- try {
- topsort(g);
- } catch (e) {
- if (e instanceof CycleException) {
- return false;
- }
- throw e;
- }
- return true;
-}
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/graphlib/alg/dfs.js
-
-
-
-
-/*
- * A helper that preforms a pre- or post-order traversal on the input graph
- * and returns the nodes in the order they were visited. If the graph is
- * undirected then this algorithm will navigate using neighbors. If the graph
- * is directed then this algorithm will navigate using successors.
- *
- * Order must be one of "pre" or "post".
- */
-function dfs(g, vs, order) {
- if (!isArray/* default */.A(vs)) {
- vs = [vs];
- }
-
- var navigation = (g.isDirected() ? g.successors : g.neighbors).bind(g);
-
- var acc = [];
- var visited = {};
- forEach/* default */.A(vs, function (v) {
- if (!g.hasNode(v)) {
- throw new Error('Graph does not have node: ' + v);
- }
-
- doDfs(g, v, order === 'post', visited, navigation, acc);
- });
- return acc;
-}
-
-function doDfs(g, v, postorder, visited, navigation, acc) {
- if (!has/* default */.A(visited, v)) {
- visited[v] = true;
-
- if (!postorder) {
- acc.push(v);
- }
- forEach/* default */.A(navigation(v), function (w) {
- doDfs(g, w, postorder, visited, navigation, acc);
- });
- if (postorder) {
- acc.push(v);
- }
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/graphlib/alg/postorder.js
-
-
-
-
-function postorder(g, vs) {
- return dfs(g, vs, 'post');
-}
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/graphlib/alg/preorder.js
-
-
-
-
-function preorder(g, vs) {
- return dfs(g, vs, 'pre');
-}
-
-// EXTERNAL MODULE: ./node_modules/dagre-d3-es/src/graphlib/graph.js + 9 modules
-var graph = __webpack_require__(73046);
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/graphlib/alg/prim.js
-
-
-
-
-
-
-function prim(g, weightFunc) {
- var result = new Graph();
- var parents = {};
- var pq = new PriorityQueue();
- var v;
-
- function updateNeighbors(edge) {
- var w = edge.v === v ? edge.w : edge.v;
- var pri = pq.priority(w);
- if (pri !== undefined) {
- var edgeWeight = weightFunc(edge);
- if (edgeWeight < pri) {
- parents[w] = v;
- pq.decrease(w, edgeWeight);
- }
- }
- }
-
- if (g.nodeCount() === 0) {
- return result;
- }
-
- _.each(g.nodes(), function (v) {
- pq.add(v, Number.POSITIVE_INFINITY);
- result.setNode(v);
- });
-
- // Start from an arbitrary node
- pq.decrease(g.nodes()[0], 0);
-
- var init = false;
- while (pq.size() > 0) {
- v = pq.removeMin();
- if (_.has(parents, v)) {
- result.setEdge(v, parents[v]);
- } else if (init) {
- throw new Error('Input graph is not connected: ' + g);
- } else {
- init = true;
- }
-
- g.nodeEdges(v).forEach(updateNeighbors);
- }
-
- return result;
-}
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/graphlib/alg/index.js
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/dagre/rank/network-simplex.js
-
-
-
-
-
-
-
-
-// Expose some internals for testing purposes
-networkSimplex.initLowLimValues = initLowLimValues;
-networkSimplex.initCutValues = initCutValues;
-networkSimplex.calcCutValue = calcCutValue;
-networkSimplex.leaveEdge = leaveEdge;
-networkSimplex.enterEdge = enterEdge;
-networkSimplex.exchangeEdges = exchangeEdges;
-
-/*
- * The network simplex algorithm assigns ranks to each node in the input graph
- * and iteratively improves the ranking to reduce the length of edges.
- *
- * Preconditions:
- *
- * 1. The input graph must be a DAG.
- * 2. All nodes in the graph must have an object value.
- * 3. All edges in the graph must have "minlen" and "weight" attributes.
- *
- * Postconditions:
- *
- * 1. All nodes in the graph will have an assigned "rank" attribute that has
- * been optimized by the network simplex algorithm. Ranks start at 0.
- *
- *
- * A rough sketch of the algorithm is as follows:
- *
- * 1. Assign initial ranks to each node. We use the longest path algorithm,
- * which assigns ranks to the lowest position possible. In general this
- * leads to very wide bottom ranks and unnecessarily long edges.
- * 2. Construct a feasible tight tree. A tight tree is one such that all
- * edges in the tree have no slack (difference between length of edge
- * and minlen for the edge). This by itself greatly improves the assigned
- * rankings by shorting edges.
- * 3. Iteratively find edges that have negative cut values. Generally a
- * negative cut value indicates that the edge could be removed and a new
- * tree edge could be added to produce a more compact graph.
- *
- * Much of the algorithms here are derived from Gansner, et al., "A Technique
- * for Drawing Directed Graphs." The structure of the file roughly follows the
- * structure of the overall algorithm.
- */
-function networkSimplex(g) {
- g = simplify(g);
- longestPath(g);
- var t = feasibleTree(g);
- initLowLimValues(t);
- initCutValues(t, g);
-
- var e, f;
- while ((e = leaveEdge(t))) {
- f = enterEdge(t, g, e);
- exchangeEdges(t, g, e, f);
- }
-}
-
-/*
- * Initializes cut values for all edges in the tree.
- */
-function initCutValues(t, g) {
- var vs = postorder(t, t.nodes());
- vs = vs.slice(0, vs.length - 1);
- forEach/* default */.A(vs, function (v) {
- assignCutValue(t, g, v);
- });
-}
-
-function assignCutValue(t, g, child) {
- var childLab = t.node(child);
- var parent = childLab.parent;
- t.edge(child, parent).cutvalue = calcCutValue(t, g, child);
-}
-
-/*
- * Given the tight tree, its graph, and a child in the graph calculate and
- * return the cut value for the edge between the child and its parent.
- */
-function calcCutValue(t, g, child) {
- var childLab = t.node(child);
- var parent = childLab.parent;
- // True if the child is on the tail end of the edge in the directed graph
- var childIsTail = true;
- // The graph's view of the tree edge we're inspecting
- var graphEdge = g.edge(child, parent);
- // The accumulated cut value for the edge between this node and its parent
- var cutValue = 0;
-
- if (!graphEdge) {
- childIsTail = false;
- graphEdge = g.edge(parent, child);
- }
-
- cutValue = graphEdge.weight;
-
- forEach/* default */.A(g.nodeEdges(child), function (e) {
- var isOutEdge = e.v === child,
- other = isOutEdge ? e.w : e.v;
-
- if (other !== parent) {
- var pointsToHead = isOutEdge === childIsTail,
- otherWeight = g.edge(e).weight;
-
- cutValue += pointsToHead ? otherWeight : -otherWeight;
- if (isTreeEdge(t, child, other)) {
- var otherCutValue = t.edge(child, other).cutvalue;
- cutValue += pointsToHead ? -otherCutValue : otherCutValue;
- }
- }
- });
-
- return cutValue;
-}
-
-function initLowLimValues(tree, root) {
- if (arguments.length < 2) {
- root = tree.nodes()[0];
- }
- dfsAssignLowLim(tree, {}, 1, root);
-}
-
-function dfsAssignLowLim(tree, visited, nextLim, v, parent) {
- var low = nextLim;
- var label = tree.node(v);
-
- visited[v] = true;
- forEach/* default */.A(tree.neighbors(v), function (w) {
- if (!has/* default */.A(visited, w)) {
- nextLim = dfsAssignLowLim(tree, visited, nextLim, w, v);
- }
- });
-
- label.low = low;
- label.lim = nextLim++;
- if (parent) {
- label.parent = parent;
- } else {
- // TODO should be able to remove this when we incrementally update low lim
- delete label.parent;
- }
-
- return nextLim;
-}
-
-function leaveEdge(tree) {
- return lodash_es_find(tree.edges(), function (e) {
- return tree.edge(e).cutvalue < 0;
- });
-}
-
-function enterEdge(t, g, edge) {
- var v = edge.v;
- var w = edge.w;
-
- // For the rest of this function we assume that v is the tail and w is the
- // head, so if we don't have this edge in the graph we should flip it to
- // match the correct orientation.
- if (!g.hasEdge(v, w)) {
- v = edge.w;
- w = edge.v;
- }
-
- var vLabel = t.node(v);
- var wLabel = t.node(w);
- var tailLabel = vLabel;
- var flip = false;
-
- // If the root is in the tail of the edge then we need to flip the logic that
- // checks for the head and tail nodes in the candidates function below.
- if (vLabel.lim > wLabel.lim) {
- tailLabel = wLabel;
- flip = true;
- }
-
- var candidates = filter/* default */.A(g.edges(), function (edge) {
- return (
- flip === isDescendant(t, t.node(edge.v), tailLabel) &&
- flip !== isDescendant(t, t.node(edge.w), tailLabel)
- );
- });
-
- return lodash_es_minBy(candidates, function (edge) {
- return slack(g, edge);
- });
-}
-
-function exchangeEdges(t, g, e, f) {
- var v = e.v;
- var w = e.w;
- t.removeEdge(v, w);
- t.setEdge(f.v, f.w, {});
- initLowLimValues(t);
- initCutValues(t, g);
- updateRanks(t, g);
-}
-
-function updateRanks(t, g) {
- var root = lodash_es_find(t.nodes(), function (v) {
- return !g.node(v).parent;
- });
- var vs = preorder(t, root);
- vs = vs.slice(1);
- forEach/* default */.A(vs, function (v) {
- var parent = t.node(v).parent,
- edge = g.edge(v, parent),
- flipped = false;
-
- if (!edge) {
- edge = g.edge(parent, v);
- flipped = true;
- }
-
- g.node(v).rank = g.node(parent).rank + (flipped ? edge.minlen : -edge.minlen);
- });
-}
-
-/*
- * Returns true if the edge is in the tree.
- */
-function isTreeEdge(tree, u, v) {
- return tree.hasEdge(u, v);
-}
-
-/*
- * Returns true if the specified node is descendant of the root node per the
- * assigned low and lim attributes in the tree.
- */
-function isDescendant(tree, vLabel, rootLabel) {
- return rootLabel.low <= vLabel.lim && vLabel.lim <= rootLabel.lim;
-}
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/dagre/rank/index.js
-
-
-
-
-
-
-/*
- * Assigns a rank to each node in the input graph that respects the "minlen"
- * constraint specified on edges between nodes.
- *
- * This basic structure is derived from Gansner, et al., "A Technique for
- * Drawing Directed Graphs."
- *
- * Pre-conditions:
- *
- * 1. Graph must be a connected DAG
- * 2. Graph nodes must be objects
- * 3. Graph edges must have "weight" and "minlen" attributes
- *
- * Post-conditions:
- *
- * 1. Graph nodes will have a "rank" attribute based on the results of the
- * algorithm. Ranks can start at any index (including negative), we'll
- * fix them up later.
- */
-function rank(g) {
- switch (g.graph().ranker) {
- case 'network-simplex':
- networkSimplexRanker(g);
- break;
- case 'tight-tree':
- tightTreeRanker(g);
- break;
- case 'longest-path':
- longestPathRanker(g);
- break;
- default:
- networkSimplexRanker(g);
- }
-}
-
-// A fast and simple ranker, but results are far from optimal.
-var longestPathRanker = longestPath;
-
-function tightTreeRanker(g) {
- longestPath(g);
- feasibleTree(g);
-}
-
-function networkSimplexRanker(g) {
- networkSimplex(g);
-}
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/values.js + 1 modules
-var values = __webpack_require__(38207);
-// EXTERNAL MODULE: ./node_modules/lodash-es/reduce.js + 2 modules
-var reduce = __webpack_require__(89463);
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/dagre/nesting-graph.js
-
-
-
-
-
-/*
- * A nesting graph creates dummy nodes for the tops and bottoms of subgraphs,
- * adds appropriate edges to ensure that all cluster nodes are placed between
- * these boundries, and ensures that the graph is connected.
- *
- * In addition we ensure, through the use of the minlen property, that nodes
- * and subgraph border nodes to not end up on the same rank.
- *
- * Preconditions:
- *
- * 1. Input graph is a DAG
- * 2. Nodes in the input graph has a minlen attribute
- *
- * Postconditions:
- *
- * 1. Input graph is connected.
- * 2. Dummy nodes are added for the tops and bottoms of subgraphs.
- * 3. The minlen attribute for nodes is adjusted to ensure nodes do not
- * get placed on the same rank as subgraph border nodes.
- *
- * The nesting graph idea comes from Sander, "Layout of Compound Directed
- * Graphs."
- */
-function nesting_graph_run(g) {
- var root = addDummyNode(g, 'root', {}, '_root');
- var depths = treeDepths(g);
- var height = lodash_es_max(values/* default */.A(depths)) - 1; // Note: depths is an Object not an array
- var nodeSep = 2 * height + 1;
-
- g.graph().nestingRoot = root;
-
- // Multiply minlen by nodeSep to align nodes on non-border ranks.
- forEach/* default */.A(g.edges(), function (e) {
- g.edge(e).minlen *= nodeSep;
- });
-
- // Calculate a weight that is sufficient to keep subgraphs vertically compact
- var weight = sumWeights(g) + 1;
-
- // Create border nodes and link them up
- forEach/* default */.A(g.children(), function (child) {
- nesting_graph_dfs(g, root, nodeSep, weight, height, depths, child);
- });
-
- // Save the multiplier for node layers for later removal of empty border
- // layers.
- g.graph().nodeRankFactor = nodeSep;
-}
-
-function nesting_graph_dfs(g, root, nodeSep, weight, height, depths, v) {
- var children = g.children(v);
- if (!children.length) {
- if (v !== root) {
- g.setEdge(root, v, { weight: 0, minlen: nodeSep });
- }
- return;
- }
-
- var top = addBorderNode(g, '_bt');
- var bottom = addBorderNode(g, '_bb');
- var label = g.node(v);
-
- g.setParent(top, v);
- label.borderTop = top;
- g.setParent(bottom, v);
- label.borderBottom = bottom;
-
- forEach/* default */.A(children, function (child) {
- nesting_graph_dfs(g, root, nodeSep, weight, height, depths, child);
-
- var childNode = g.node(child);
- var childTop = childNode.borderTop ? childNode.borderTop : child;
- var childBottom = childNode.borderBottom ? childNode.borderBottom : child;
- var thisWeight = childNode.borderTop ? weight : 2 * weight;
- var minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;
-
- g.setEdge(top, childTop, {
- weight: thisWeight,
- minlen: minlen,
- nestingEdge: true,
- });
-
- g.setEdge(childBottom, bottom, {
- weight: thisWeight,
- minlen: minlen,
- nestingEdge: true,
- });
- });
-
- if (!g.parent(v)) {
- g.setEdge(root, top, { weight: 0, minlen: height + depths[v] });
- }
-}
-
-function treeDepths(g) {
- var depths = {};
- function dfs(v, depth) {
- var children = g.children(v);
- if (children && children.length) {
- forEach/* default */.A(children, function (child) {
- dfs(child, depth + 1);
- });
- }
- depths[v] = depth;
- }
- forEach/* default */.A(g.children(), function (v) {
- dfs(v, 1);
- });
- return depths;
-}
-
-function sumWeights(g) {
- return reduce/* default */.A(
- g.edges(),
- function (acc, e) {
- return acc + g.edge(e).weight;
- },
- 0
- );
-}
-
-function cleanup(g) {
- var graphLabel = g.graph();
- g.removeNode(graphLabel.nestingRoot);
- delete graphLabel.nestingRoot;
- forEach/* default */.A(g.edges(), function (e) {
- var edge = g.edge(e);
- if (edge.nestingEdge) {
- g.removeEdge(e);
- }
- });
-}
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_baseClone.js + 15 modules
-var _baseClone = __webpack_require__(91641);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/cloneDeep.js
-
-
-/** Used to compose bitmasks for cloning. */
-var CLONE_DEEP_FLAG = 1,
- CLONE_SYMBOLS_FLAG = 4;
-
-/**
- * This method is like `_.clone` except that it recursively clones `value`.
- *
- * @static
- * @memberOf _
- * @since 1.0.0
- * @category Lang
- * @param {*} value The value to recursively clone.
- * @returns {*} Returns the deep cloned value.
- * @see _.clone
- * @example
- *
- * var objects = [{ 'a': 1 }, { 'b': 2 }];
- *
- * var deep = _.cloneDeep(objects);
- * console.log(deep[0] === objects[0]);
- * // => false
- */
-function cloneDeep(value) {
- return (0,_baseClone/* default */.A)(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);
-}
-
-/* harmony default export */ const lodash_es_cloneDeep = (cloneDeep);
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/dagre/order/add-subgraph-constraints.js
-
-
-
-
-function addSubgraphConstraints(g, cg, vs) {
- var prev = {},
- rootPrev;
-
- forEach/* default */.A(vs, function (v) {
- var child = g.parent(v),
- parent,
- prevChild;
- while (child) {
- parent = g.parent(child);
- if (parent) {
- prevChild = prev[parent];
- prev[parent] = child;
- } else {
- prevChild = rootPrev;
- rootPrev = child;
- }
- if (prevChild && prevChild !== child) {
- cg.setEdge(prevChild, child);
- return;
- }
- child = parent;
- }
- });
-
- /*
- function dfs(v) {
- var children = v ? g.children(v) : g.children();
- if (children.length) {
- var min = Number.POSITIVE_INFINITY,
- subgraphs = [];
- _.each(children, function(child) {
- var childMin = dfs(child);
- if (g.children(child).length) {
- subgraphs.push({ v: child, order: childMin });
- }
- min = Math.min(min, childMin);
- });
- _.reduce(_.sortBy(subgraphs, "order"), function(prev, curr) {
- cg.setEdge(prev.v, curr.v);
- return curr;
- });
- return min;
- }
- return g.node(v).order;
- }
- dfs(undefined);
- */
-}
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/dagre/order/build-layer-graph.js
-
-
-
-
-
-/*
- * Constructs a graph that can be used to sort a layer of nodes. The graph will
- * contain all base and subgraph nodes from the request layer in their original
- * hierarchy and any edges that are incident on these nodes and are of the type
- * requested by the "relationship" parameter.
- *
- * Nodes from the requested rank that do not have parents are assigned a root
- * node in the output graph, which is set in the root graph attribute. This
- * makes it easy to walk the hierarchy of movable nodes during ordering.
- *
- * Pre-conditions:
- *
- * 1. Input graph is a DAG
- * 2. Base nodes in the input graph have a rank attribute
- * 3. Subgraph nodes in the input graph has minRank and maxRank attributes
- * 4. Edges have an assigned weight
- *
- * Post-conditions:
- *
- * 1. Output graph has all nodes in the movable rank with preserved
- * hierarchy.
- * 2. Root nodes in the movable layer are made children of the node
- * indicated by the root attribute of the graph.
- * 3. Non-movable nodes incident on movable nodes, selected by the
- * relationship parameter, are included in the graph (without hierarchy).
- * 4. Edges incident on movable nodes, selected by the relationship
- * parameter, are added to the output graph.
- * 5. The weights for copied edges are aggregated as need, since the output
- * graph is not a multi-graph.
- */
-function buildLayerGraph(g, rank, relationship) {
- var root = createRootNode(g),
- result = new graphlib/* Graph */.T({ compound: true })
- .setGraph({ root: root })
- .setDefaultNodeLabel(function (v) {
- return g.node(v);
- });
-
- forEach/* default */.A(g.nodes(), function (v) {
- var node = g.node(v),
- parent = g.parent(v);
-
- if (node.rank === rank || (node.minRank <= rank && rank <= node.maxRank)) {
- result.setNode(v);
- result.setParent(v, parent || root);
-
- // This assumes we have only short edges!
- forEach/* default */.A(g[relationship](v), function (e) {
- var u = e.v === v ? e.w : e.v,
- edge = result.edge(u, v),
- weight = !isUndefined/* default */.A(edge) ? edge.weight : 0;
- result.setEdge(u, v, { weight: g.edge(e).weight + weight });
- });
-
- if (has/* default */.A(node, 'minRank')) {
- result.setNode(v, {
- borderLeft: node.borderLeft[rank],
- borderRight: node.borderRight[rank],
- });
- }
- }
- });
-
- return result;
-}
-
-function createRootNode(g) {
- var v;
- while (g.hasNode((v = uniqueId/* default */.A('_root'))));
- return v;
-}
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_assignValue.js
-var _assignValue = __webpack_require__(52851);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseZipObject.js
-/**
- * This base implementation of `_.zipObject` which assigns values using `assignFunc`.
- *
- * @private
- * @param {Array} props The property identifiers.
- * @param {Array} values The property values.
- * @param {Function} assignFunc The function to assign values.
- * @returns {Object} Returns the new object.
- */
-function baseZipObject(props, values, assignFunc) {
- var index = -1,
- length = props.length,
- valsLength = values.length,
- result = {};
-
- while (++index < length) {
- var value = index < valsLength ? values[index] : undefined;
- assignFunc(result, props[index], value);
- }
- return result;
-}
-
-/* harmony default export */ const _baseZipObject = (baseZipObject);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/zipObject.js
-
-
-
-/**
- * This method is like `_.fromPairs` except that it accepts two arrays,
- * one of property identifiers and one of corresponding values.
- *
- * @static
- * @memberOf _
- * @since 0.4.0
- * @category Array
- * @param {Array} [props=[]] The property identifiers.
- * @param {Array} [values=[]] The property values.
- * @returns {Object} Returns the new object.
- * @example
- *
- * _.zipObject(['a', 'b'], [1, 2]);
- * // => { 'a': 1, 'b': 2 }
- */
-function zipObject(props, values) {
- return _baseZipObject(props || [], values || [], _assignValue/* default */.A);
-}
-
-/* harmony default export */ const lodash_es_zipObject = (zipObject);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_baseFlatten.js + 1 modules
-var _baseFlatten = __webpack_require__(13588);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_arrayMap.js
-var _arrayMap = __webpack_require__(45572);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_baseGet.js
-var _baseGet = __webpack_require__(66318);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_baseMap.js
-var _baseMap = __webpack_require__(52568);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseSortBy.js
-/**
- * The base implementation of `_.sortBy` which uses `comparer` to define the
- * sort order of `array` and replaces criteria objects with their corresponding
- * values.
- *
- * @private
- * @param {Array} array The array to sort.
- * @param {Function} comparer The function to define sort order.
- * @returns {Array} Returns `array`.
- */
-function baseSortBy(array, comparer) {
- var length = array.length;
-
- array.sort(comparer);
- while (length--) {
- array[length] = array[length].value;
- }
- return array;
-}
-
-/* harmony default export */ const _baseSortBy = (baseSortBy);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_baseUnary.js
-var _baseUnary = __webpack_require__(52789);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_compareAscending.js
-
-
-/**
- * Compares values to sort them in ascending order.
- *
- * @private
- * @param {*} value The value to compare.
- * @param {*} other The other value to compare.
- * @returns {number} Returns the sort order indicator for `value`.
- */
-function compareAscending(value, other) {
- if (value !== other) {
- var valIsDefined = value !== undefined,
- valIsNull = value === null,
- valIsReflexive = value === value,
- valIsSymbol = (0,isSymbol/* default */.A)(value);
-
- var othIsDefined = other !== undefined,
- othIsNull = other === null,
- othIsReflexive = other === other,
- othIsSymbol = (0,isSymbol/* default */.A)(other);
-
- if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) ||
- (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) ||
- (valIsNull && othIsDefined && othIsReflexive) ||
- (!valIsDefined && othIsReflexive) ||
- !valIsReflexive) {
- return 1;
- }
- if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) ||
- (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) ||
- (othIsNull && valIsDefined && valIsReflexive) ||
- (!othIsDefined && valIsReflexive) ||
- !othIsReflexive) {
- return -1;
- }
- }
- return 0;
-}
-
-/* harmony default export */ const _compareAscending = (compareAscending);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_compareMultiple.js
-
-
-/**
- * Used by `_.orderBy` to compare multiple properties of a value to another
- * and stable sort them.
- *
- * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,
- * specify an order of "desc" for descending or "asc" for ascending sort order
- * of corresponding values.
- *
- * @private
- * @param {Object} object The object to compare.
- * @param {Object} other The other object to compare.
- * @param {boolean[]|string[]} orders The order to sort by for each property.
- * @returns {number} Returns the sort order indicator for `object`.
- */
-function compareMultiple(object, other, orders) {
- var index = -1,
- objCriteria = object.criteria,
- othCriteria = other.criteria,
- length = objCriteria.length,
- ordersLength = orders.length;
-
- while (++index < length) {
- var result = _compareAscending(objCriteria[index], othCriteria[index]);
- if (result) {
- if (index >= ordersLength) {
- return result;
- }
- var order = orders[index];
- return result * (order == 'desc' ? -1 : 1);
- }
- }
- // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications
- // that causes it, under certain circumstances, to provide the same value for
- // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247
- // for more details.
- //
- // This also ensures a stable sort in V8 and other engines.
- // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.
- return object.index - other.index;
-}
-
-/* harmony default export */ const _compareMultiple = (compareMultiple);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseOrderBy.js
-
-
-
-
-
-
-
-
-
-
-/**
- * The base implementation of `_.orderBy` without param guards.
- *
- * @private
- * @param {Array|Object} collection The collection to iterate over.
- * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.
- * @param {string[]} orders The sort orders of `iteratees`.
- * @returns {Array} Returns the new sorted array.
- */
-function baseOrderBy(collection, iteratees, orders) {
- if (iteratees.length) {
- iteratees = (0,_arrayMap/* default */.A)(iteratees, function(iteratee) {
- if ((0,isArray/* default */.A)(iteratee)) {
- return function(value) {
- return (0,_baseGet/* default */.A)(value, iteratee.length === 1 ? iteratee[0] : iteratee);
- }
- }
- return iteratee;
- });
- } else {
- iteratees = [identity/* default */.A];
- }
-
- var index = -1;
- iteratees = (0,_arrayMap/* default */.A)(iteratees, (0,_baseUnary/* default */.A)(_baseIteratee/* default */.A));
-
- var result = (0,_baseMap/* default */.A)(collection, function(value, key, collection) {
- var criteria = (0,_arrayMap/* default */.A)(iteratees, function(iteratee) {
- return iteratee(value);
- });
- return { 'criteria': criteria, 'index': ++index, 'value': value };
- });
-
- return _baseSortBy(result, function(object, other) {
- return _compareMultiple(object, other, orders);
- });
-}
-
-/* harmony default export */ const _baseOrderBy = (baseOrderBy);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_baseRest.js
-var _baseRest = __webpack_require__(24326);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_isIterateeCall.js
-var _isIterateeCall = __webpack_require__(6832);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/sortBy.js
-
-
-
-
-
-/**
- * Creates an array of elements, sorted in ascending order by the results of
- * running each element in a collection thru each iteratee. This method
- * performs a stable sort, that is, it preserves the original sort order of
- * equal elements. The iteratees are invoked with one argument: (value).
- *
- * @static
- * @memberOf _
- * @since 0.1.0
- * @category Collection
- * @param {Array|Object} collection The collection to iterate over.
- * @param {...(Function|Function[])} [iteratees=[_.identity]]
- * The iteratees to sort by.
- * @returns {Array} Returns the new sorted array.
- * @example
- *
- * var users = [
- * { 'user': 'fred', 'age': 48 },
- * { 'user': 'barney', 'age': 36 },
- * { 'user': 'fred', 'age': 30 },
- * { 'user': 'barney', 'age': 34 }
- * ];
- *
- * _.sortBy(users, [function(o) { return o.user; }]);
- * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 30]]
- *
- * _.sortBy(users, ['user', 'age']);
- * // => objects for [['barney', 34], ['barney', 36], ['fred', 30], ['fred', 48]]
- */
-var sortBy = (0,_baseRest/* default */.A)(function(collection, iteratees) {
- if (collection == null) {
- return [];
- }
- var length = iteratees.length;
- if (length > 1 && (0,_isIterateeCall/* default */.A)(collection, iteratees[0], iteratees[1])) {
- iteratees = [];
- } else if (length > 2 && (0,_isIterateeCall/* default */.A)(iteratees[0], iteratees[1], iteratees[2])) {
- iteratees = [iteratees[0]];
- }
- return _baseOrderBy(collection, (0,_baseFlatten/* default */.A)(iteratees, 1), []);
-});
-
-/* harmony default export */ const lodash_es_sortBy = (sortBy);
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/dagre/order/cross-count.js
-
-
-
-
-/*
- * A function that takes a layering (an array of layers, each with an array of
- * ordererd nodes) and a graph and returns a weighted crossing count.
- *
- * Pre-conditions:
- *
- * 1. Input graph must be simple (not a multigraph), directed, and include
- * only simple edges.
- * 2. Edges in the input graph must have assigned weights.
- *
- * Post-conditions:
- *
- * 1. The graph and layering matrix are left unchanged.
- *
- * This algorithm is derived from Barth, et al., "Bilayer Cross Counting."
- */
-function crossCount(g, layering) {
- var cc = 0;
- for (var i = 1; i < layering.length; ++i) {
- cc += twoLayerCrossCount(g, layering[i - 1], layering[i]);
- }
- return cc;
-}
-
-function twoLayerCrossCount(g, northLayer, southLayer) {
- // Sort all of the edges between the north and south layers by their position
- // in the north layer and then the south. Map these edges to the position of
- // their head in the south layer.
- var southPos = lodash_es_zipObject(
- southLayer,
- map/* default */.A(southLayer, function (v, i) {
- return i;
- })
- );
- var southEntries = flatten/* default */.A(
- map/* default */.A(northLayer, function (v) {
- return lodash_es_sortBy(
- map/* default */.A(g.outEdges(v), function (e) {
- return { pos: southPos[e.w], weight: g.edge(e).weight };
- }),
- 'pos'
- );
- })
- );
-
- // Build the accumulator tree
- var firstIndex = 1;
- while (firstIndex < southLayer.length) firstIndex <<= 1;
- var treeSize = 2 * firstIndex - 1;
- firstIndex -= 1;
- var tree = map/* default */.A(new Array(treeSize), function () {
- return 0;
- });
-
- // Calculate the weighted crossings
- var cc = 0;
- forEach/* default */.A(
- // @ts-expect-error
- southEntries.forEach(function (entry) {
- var index = entry.pos + firstIndex;
- tree[index] += entry.weight;
- var weightSum = 0;
- // @ts-expect-error
- while (index > 0) {
- // @ts-expect-error
- if (index % 2) {
- weightSum += tree[index + 1];
- }
- // @ts-expect-error
- index = (index - 1) >> 1;
- tree[index] += entry.weight;
- }
- cc += entry.weight * weightSum;
- })
- );
-
- return cc;
-}
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/dagre/order/init-order.js
-
-
-
-
-/*
- * Assigns an initial order value for each node by performing a DFS search
- * starting from nodes in the first rank. Nodes are assigned an order in their
- * rank as they are first visited.
- *
- * This approach comes from Gansner, et al., "A Technique for Drawing Directed
- * Graphs."
- *
- * Returns a layering matrix with an array per layer and each layer sorted by
- * the order of its nodes.
- */
-function initOrder(g) {
- var visited = {};
- var simpleNodes = filter/* default */.A(g.nodes(), function (v) {
- return !g.children(v).length;
- });
- var maxRank = lodash_es_max(
- map/* default */.A(simpleNodes, function (v) {
- return g.node(v).rank;
- })
- );
- var layers = map/* default */.A(range/* default */.A(maxRank + 1), function () {
- return [];
- });
-
- function dfs(v) {
- if (has/* default */.A(visited, v)) return;
- visited[v] = true;
- var node = g.node(v);
- layers[node.rank].push(v);
- forEach/* default */.A(g.successors(v), dfs);
- }
-
- var orderedVs = lodash_es_sortBy(simpleNodes, function (v) {
- return g.node(v).rank;
- });
- forEach/* default */.A(orderedVs, dfs);
-
- return layers;
-}
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/dagre/order/barycenter.js
-
-
-
-
-function barycenter(g, movable) {
- return map/* default */.A(movable, function (v) {
- var inV = g.inEdges(v);
- if (!inV.length) {
- return { v: v };
- } else {
- var result = reduce/* default */.A(
- inV,
- function (acc, e) {
- var edge = g.edge(e),
- nodeU = g.node(e.v);
- return {
- sum: acc.sum + edge.weight * nodeU.order,
- weight: acc.weight + edge.weight,
- };
- },
- { sum: 0, weight: 0 }
- );
-
- return {
- v: v,
- barycenter: result.sum / result.weight,
- weight: result.weight,
- };
- }
- });
-}
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/dagre/order/resolve-conflicts.js
-
-
-
-
-/*
- * Given a list of entries of the form {v, barycenter, weight} and a
- * constraint graph this function will resolve any conflicts between the
- * constraint graph and the barycenters for the entries. If the barycenters for
- * an entry would violate a constraint in the constraint graph then we coalesce
- * the nodes in the conflict into a new node that respects the contraint and
- * aggregates barycenter and weight information.
- *
- * This implementation is based on the description in Forster, "A Fast and
- * Simple Hueristic for Constrained Two-Level Crossing Reduction," thought it
- * differs in some specific details.
- *
- * Pre-conditions:
- *
- * 1. Each entry has the form {v, barycenter, weight}, or if the node has
- * no barycenter, then {v}.
- *
- * Returns:
- *
- * A new list of entries of the form {vs, i, barycenter, weight}. The list
- * `vs` may either be a singleton or it may be an aggregation of nodes
- * ordered such that they do not violate constraints from the constraint
- * graph. The property `i` is the lowest original index of any of the
- * elements in `vs`.
- */
-function resolveConflicts(entries, cg) {
- var mappedEntries = {};
- forEach/* default */.A(entries, function (entry, i) {
- var tmp = (mappedEntries[entry.v] = {
- indegree: 0,
- in: [],
- out: [],
- vs: [entry.v],
- i: i,
- });
- if (!isUndefined/* default */.A(entry.barycenter)) {
- // @ts-expect-error
- tmp.barycenter = entry.barycenter;
- // @ts-expect-error
- tmp.weight = entry.weight;
- }
- });
-
- forEach/* default */.A(cg.edges(), function (e) {
- var entryV = mappedEntries[e.v];
- var entryW = mappedEntries[e.w];
- if (!isUndefined/* default */.A(entryV) && !isUndefined/* default */.A(entryW)) {
- entryW.indegree++;
- entryV.out.push(mappedEntries[e.w]);
- }
- });
-
- var sourceSet = filter/* default */.A(mappedEntries, function (entry) {
- // @ts-expect-error
- return !entry.indegree;
- });
-
- return doResolveConflicts(sourceSet);
-}
-
-function doResolveConflicts(sourceSet) {
- var entries = [];
-
- function handleIn(vEntry) {
- return function (uEntry) {
- if (uEntry.merged) {
- return;
- }
- if (
- isUndefined/* default */.A(uEntry.barycenter) ||
- isUndefined/* default */.A(vEntry.barycenter) ||
- uEntry.barycenter >= vEntry.barycenter
- ) {
- mergeEntries(vEntry, uEntry);
- }
- };
- }
-
- function handleOut(vEntry) {
- return function (wEntry) {
- wEntry['in'].push(vEntry);
- if (--wEntry.indegree === 0) {
- sourceSet.push(wEntry);
- }
- };
- }
-
- while (sourceSet.length) {
- var entry = sourceSet.pop();
- entries.push(entry);
- forEach/* default */.A(entry['in'].reverse(), handleIn(entry));
- forEach/* default */.A(entry.out, handleOut(entry));
- }
-
- return map/* default */.A(
- filter/* default */.A(entries, function (entry) {
- return !entry.merged;
- }),
- function (entry) {
- return pick/* default */.A(entry, ['vs', 'i', 'barycenter', 'weight']);
- }
- );
-}
-
-function mergeEntries(target, source) {
- var sum = 0;
- var weight = 0;
-
- if (target.weight) {
- sum += target.barycenter * target.weight;
- weight += target.weight;
- }
-
- if (source.weight) {
- sum += source.barycenter * source.weight;
- weight += source.weight;
- }
-
- target.vs = source.vs.concat(target.vs);
- target.barycenter = sum / weight;
- target.weight = weight;
- target.i = Math.min(source.i, target.i);
- source.merged = true;
-}
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/dagre/order/sort.js
-
-
-
-
-
-function sort(entries, biasRight) {
- var parts = partition(entries, function (entry) {
- return has/* default */.A(entry, 'barycenter');
- });
- var sortable = parts.lhs,
- unsortable = lodash_es_sortBy(parts.rhs, function (entry) {
- return -entry.i;
- }),
- vs = [],
- sum = 0,
- weight = 0,
- vsIndex = 0;
-
- sortable.sort(compareWithBias(!!biasRight));
-
- vsIndex = consumeUnsortable(vs, unsortable, vsIndex);
-
- forEach/* default */.A(sortable, function (entry) {
- vsIndex += entry.vs.length;
- vs.push(entry.vs);
- sum += entry.barycenter * entry.weight;
- weight += entry.weight;
- vsIndex = consumeUnsortable(vs, unsortable, vsIndex);
- });
-
- var result = { vs: flatten/* default */.A(vs) };
- if (weight) {
- result.barycenter = sum / weight;
- result.weight = weight;
- }
- return result;
-}
-
-function consumeUnsortable(vs, unsortable, index) {
- var last;
- while (unsortable.length && (last = lodash_es_last(unsortable)).i <= index) {
- unsortable.pop();
- vs.push(last.vs);
- index++;
- }
- return index;
-}
-
-function compareWithBias(bias) {
- return function (entryV, entryW) {
- if (entryV.barycenter < entryW.barycenter) {
- return -1;
- } else if (entryV.barycenter > entryW.barycenter) {
- return 1;
- }
-
- return !bias ? entryV.i - entryW.i : entryW.i - entryV.i;
- };
-}
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/dagre/order/sort-subgraph.js
-
-
-
-
-
-
-
-function sortSubgraph(g, v, cg, biasRight) {
- var movable = g.children(v);
- var node = g.node(v);
- var bl = node ? node.borderLeft : undefined;
- var br = node ? node.borderRight : undefined;
- var subgraphs = {};
-
- if (bl) {
- movable = filter/* default */.A(movable, function (w) {
- return w !== bl && w !== br;
- });
- }
-
- var barycenters = barycenter(g, movable);
- forEach/* default */.A(barycenters, function (entry) {
- if (g.children(entry.v).length) {
- var subgraphResult = sortSubgraph(g, entry.v, cg, biasRight);
- subgraphs[entry.v] = subgraphResult;
- if (has/* default */.A(subgraphResult, 'barycenter')) {
- mergeBarycenters(entry, subgraphResult);
- }
- }
- });
-
- var entries = resolveConflicts(barycenters, cg);
- expandSubgraphs(entries, subgraphs);
-
- var result = sort(entries, biasRight);
-
- if (bl) {
- result.vs = flatten/* default */.A([bl, result.vs, br]);
- if (g.predecessors(bl).length) {
- var blPred = g.node(g.predecessors(bl)[0]),
- brPred = g.node(g.predecessors(br)[0]);
- if (!has/* default */.A(result, 'barycenter')) {
- result.barycenter = 0;
- result.weight = 0;
- }
- result.barycenter =
- (result.barycenter * result.weight + blPred.order + brPred.order) / (result.weight + 2);
- result.weight += 2;
- }
- }
-
- return result;
-}
-
-function expandSubgraphs(entries, subgraphs) {
- forEach/* default */.A(entries, function (entry) {
- entry.vs = flatten/* default */.A(
- entry.vs.map(function (v) {
- if (subgraphs[v]) {
- return subgraphs[v].vs;
- }
- return v;
- })
- );
- });
-}
-
-function mergeBarycenters(target, other) {
- if (!isUndefined/* default */.A(target.barycenter)) {
- target.barycenter =
- (target.barycenter * target.weight + other.barycenter * other.weight) /
- (target.weight + other.weight);
- target.weight += other.weight;
- } else {
- target.barycenter = other.barycenter;
- target.weight = other.weight;
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/dagre/order/index.js
-
-
-
-
-
-
-
-
-
-
-
-/*
- * Applies heuristics to minimize edge crossings in the graph and sets the best
- * order solution as an order attribute on each node.
- *
- * Pre-conditions:
- *
- * 1. Graph must be DAG
- * 2. Graph nodes must be objects with a "rank" attribute
- * 3. Graph edges must have the "weight" attribute
- *
- * Post-conditions:
- *
- * 1. Graph nodes will have an "order" attribute based on the results of the
- * algorithm.
- */
-function order(g) {
- var maxRank = util_maxRank(g),
- downLayerGraphs = buildLayerGraphs(g, range/* default */.A(1, maxRank + 1), 'inEdges'),
- upLayerGraphs = buildLayerGraphs(g, range/* default */.A(maxRank - 1, -1, -1), 'outEdges');
-
- var layering = initOrder(g);
- assignOrder(g, layering);
-
- var bestCC = Number.POSITIVE_INFINITY,
- best;
-
- for (var i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {
- sweepLayerGraphs(i % 2 ? downLayerGraphs : upLayerGraphs, i % 4 >= 2);
-
- layering = buildLayerMatrix(g);
- var cc = crossCount(g, layering);
- if (cc < bestCC) {
- lastBest = 0;
- best = lodash_es_cloneDeep(layering);
- bestCC = cc;
- }
- }
-
- assignOrder(g, best);
-}
-
-function buildLayerGraphs(g, ranks, relationship) {
- return map/* default */.A(ranks, function (rank) {
- return buildLayerGraph(g, rank, relationship);
- });
-}
-
-function sweepLayerGraphs(layerGraphs, biasRight) {
- var cg = new graphlib/* Graph */.T();
- forEach/* default */.A(layerGraphs, function (lg) {
- var root = lg.graph().root;
- var sorted = sortSubgraph(lg, root, cg, biasRight);
- forEach/* default */.A(sorted.vs, function (v, i) {
- lg.node(v).order = i;
- });
- addSubgraphConstraints(lg, cg, sorted.vs);
- });
-}
-
-function assignOrder(g, layering) {
- forEach/* default */.A(layering, function (layer) {
- forEach/* default */.A(layer, function (v, i) {
- g.node(v).order = i;
- });
- });
-}
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/dagre/parent-dummy-chains.js
-
-
-
-
-function parentDummyChains(g) {
- var postorderNums = parent_dummy_chains_postorder(g);
-
- forEach/* default */.A(g.graph().dummyChains, function (v) {
- var node = g.node(v);
- var edgeObj = node.edgeObj;
- var pathData = findPath(g, postorderNums, edgeObj.v, edgeObj.w);
- var path = pathData.path;
- var lca = pathData.lca;
- var pathIdx = 0;
- var pathV = path[pathIdx];
- var ascending = true;
-
- while (v !== edgeObj.w) {
- node = g.node(v);
-
- if (ascending) {
- while ((pathV = path[pathIdx]) !== lca && g.node(pathV).maxRank < node.rank) {
- pathIdx++;
- }
-
- if (pathV === lca) {
- ascending = false;
- }
- }
-
- if (!ascending) {
- while (
- pathIdx < path.length - 1 &&
- g.node((pathV = path[pathIdx + 1])).minRank <= node.rank
- ) {
- pathIdx++;
- }
- pathV = path[pathIdx];
- }
-
- g.setParent(v, pathV);
- v = g.successors(v)[0];
- }
- });
-}
-
-// Find a path from v to w through the lowest common ancestor (LCA). Return the
-// full path and the LCA.
-function findPath(g, postorderNums, v, w) {
- var vPath = [];
- var wPath = [];
- var low = Math.min(postorderNums[v].low, postorderNums[w].low);
- var lim = Math.max(postorderNums[v].lim, postorderNums[w].lim);
- var parent;
- var lca;
-
- // Traverse up from v to find the LCA
- parent = v;
- do {
- parent = g.parent(parent);
- vPath.push(parent);
- } while (parent && (postorderNums[parent].low > low || lim > postorderNums[parent].lim));
- lca = parent;
-
- // Traverse from w to LCA
- parent = w;
- while ((parent = g.parent(parent)) !== lca) {
- wPath.push(parent);
- }
-
- return { path: vPath.concat(wPath.reverse()), lca: lca };
-}
-
-function parent_dummy_chains_postorder(g) {
- var result = {};
- var lim = 0;
-
- function dfs(v) {
- var low = lim;
- forEach/* default */.A(g.children(v), dfs);
- result[v] = { low: low, lim: lim++ };
- }
- forEach/* default */.A(g.children(), dfs);
-
- return result;
-}
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_castFunction.js
-var _castFunction = __webpack_require__(99922);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/forOwn.js
-
-
-
-/**
- * Iterates over own enumerable string keyed properties of an object and
- * invokes `iteratee` for each property. The iteratee is invoked with three
- * arguments: (value, key, object). Iteratee functions may exit iteration
- * early by explicitly returning `false`.
- *
- * @static
- * @memberOf _
- * @since 0.3.0
- * @category Object
- * @param {Object} object The object to iterate over.
- * @param {Function} [iteratee=_.identity] The function invoked per iteration.
- * @returns {Object} Returns `object`.
- * @see _.forOwnRight
- * @example
- *
- * function Foo() {
- * this.a = 1;
- * this.b = 2;
- * }
- *
- * Foo.prototype.c = 3;
- *
- * _.forOwn(new Foo, function(value, key) {
- * console.log(key);
- * });
- * // => Logs 'a' then 'b' (iteration order is not guaranteed).
- */
-function forOwn(object, iteratee) {
- return object && (0,_baseForOwn/* default */.A)(object, (0,_castFunction/* default */.A)(iteratee));
-}
-
-/* harmony default export */ const lodash_es_forOwn = (forOwn);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_baseFor.js + 1 modules
-var _baseFor = __webpack_require__(4574);
-// EXTERNAL MODULE: ./node_modules/lodash-es/keysIn.js + 2 modules
-var keysIn = __webpack_require__(55615);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/forIn.js
-
-
-
-
-/**
- * Iterates over own and inherited enumerable string keyed properties of an
- * object and invokes `iteratee` for each property. The iteratee is invoked
- * with three arguments: (value, key, object). Iteratee functions may exit
- * iteration early by explicitly returning `false`.
- *
- * @static
- * @memberOf _
- * @since 0.3.0
- * @category Object
- * @param {Object} object The object to iterate over.
- * @param {Function} [iteratee=_.identity] The function invoked per iteration.
- * @returns {Object} Returns `object`.
- * @see _.forInRight
- * @example
- *
- * function Foo() {
- * this.a = 1;
- * this.b = 2;
- * }
- *
- * Foo.prototype.c = 3;
- *
- * _.forIn(new Foo, function(value, key) {
- * console.log(key);
- * });
- * // => Logs 'a', 'b', then 'c' (iteration order is not guaranteed).
- */
-function forIn(object, iteratee) {
- return object == null
- ? object
- : (0,_baseFor/* default */.A)(object, (0,_castFunction/* default */.A)(iteratee), keysIn/* default */.A);
-}
-
-/* harmony default export */ const lodash_es_forIn = (forIn);
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/dagre/position/bk.js
-
-
-
-
-/*
- * This module provides coordinate assignment based on Brandes and Köpf, "Fast
- * and Simple Horizontal Coordinate Assignment."
- */
-
-
-
-/*
- * Marks all edges in the graph with a type-1 conflict with the "type1Conflict"
- * property. A type-1 conflict is one where a non-inner segment crosses an
- * inner segment. An inner segment is an edge with both incident nodes marked
- * with the "dummy" property.
- *
- * This algorithm scans layer by layer, starting with the second, for type-1
- * conflicts between the current layer and the previous layer. For each layer
- * it scans the nodes from left to right until it reaches one that is incident
- * on an inner segment. It then scans predecessors to determine if they have
- * edges that cross that inner segment. At the end a final scan is done for all
- * nodes on the current rank to see if they cross the last visited inner
- * segment.
- *
- * This algorithm (safely) assumes that a dummy node will only be incident on a
- * single node in the layers being scanned.
- */
-function findType1Conflicts(g, layering) {
- var conflicts = {};
-
- function visitLayer(prevLayer, layer) {
- var // last visited node in the previous layer that is incident on an inner
- // segment.
- k0 = 0,
- // Tracks the last node in this layer scanned for crossings with a type-1
- // segment.
- scanPos = 0,
- prevLayerLength = prevLayer.length,
- lastNode = lodash_es_last(layer);
-
- forEach/* default */.A(layer, function (v, i) {
- var w = findOtherInnerSegmentNode(g, v),
- k1 = w ? g.node(w).order : prevLayerLength;
-
- if (w || v === lastNode) {
- forEach/* default */.A(layer.slice(scanPos, i + 1), function (scanNode) {
- forEach/* default */.A(g.predecessors(scanNode), function (u) {
- var uLabel = g.node(u),
- uPos = uLabel.order;
- if ((uPos < k0 || k1 < uPos) && !(uLabel.dummy && g.node(scanNode).dummy)) {
- addConflict(conflicts, u, scanNode);
- }
- });
- });
- // @ts-expect-error
- scanPos = i + 1;
- k0 = k1;
- }
- });
-
- return layer;
- }
-
- reduce/* default */.A(layering, visitLayer);
- return conflicts;
-}
-
-function findType2Conflicts(g, layering) {
- var conflicts = {};
-
- function scan(south, southPos, southEnd, prevNorthBorder, nextNorthBorder) {
- var v;
- forEach/* default */.A(range/* default */.A(southPos, southEnd), function (i) {
- v = south[i];
- if (g.node(v).dummy) {
- forEach/* default */.A(g.predecessors(v), function (u) {
- var uNode = g.node(u);
- if (uNode.dummy && (uNode.order < prevNorthBorder || uNode.order > nextNorthBorder)) {
- addConflict(conflicts, u, v);
- }
- });
- }
- });
- }
-
- function visitLayer(north, south) {
- var prevNorthPos = -1,
- nextNorthPos,
- southPos = 0;
-
- forEach/* default */.A(south, function (v, southLookahead) {
- if (g.node(v).dummy === 'border') {
- var predecessors = g.predecessors(v);
- if (predecessors.length) {
- nextNorthPos = g.node(predecessors[0]).order;
- scan(south, southPos, southLookahead, prevNorthPos, nextNorthPos);
- // @ts-expect-error
- southPos = southLookahead;
- prevNorthPos = nextNorthPos;
- }
- }
- scan(south, southPos, south.length, nextNorthPos, north.length);
- });
-
- return south;
- }
-
- reduce/* default */.A(layering, visitLayer);
- return conflicts;
-}
-
-function findOtherInnerSegmentNode(g, v) {
- if (g.node(v).dummy) {
- return lodash_es_find(g.predecessors(v), function (u) {
- return g.node(u).dummy;
- });
- }
-}
-
-function addConflict(conflicts, v, w) {
- if (v > w) {
- var tmp = v;
- v = w;
- w = tmp;
- }
-
- var conflictsV = conflicts[v];
- if (!conflictsV) {
- conflicts[v] = conflictsV = {};
- }
- conflictsV[w] = true;
-}
-
-function hasConflict(conflicts, v, w) {
- if (v > w) {
- var tmp = v;
- v = w;
- w = tmp;
- }
- return has/* default */.A(conflicts[v], w);
-}
-
-/*
- * Try to align nodes into vertical "blocks" where possible. This algorithm
- * attempts to align a node with one of its median neighbors. If the edge
- * connecting a neighbor is a type-1 conflict then we ignore that possibility.
- * If a previous node has already formed a block with a node after the node
- * we're trying to form a block with, we also ignore that possibility - our
- * blocks would be split in that scenario.
- */
-function verticalAlignment(g, layering, conflicts, neighborFn) {
- var root = {},
- align = {},
- pos = {};
-
- // We cache the position here based on the layering because the graph and
- // layering may be out of sync. The layering matrix is manipulated to
- // generate different extreme alignments.
- forEach/* default */.A(layering, function (layer) {
- forEach/* default */.A(layer, function (v, order) {
- root[v] = v;
- align[v] = v;
- pos[v] = order;
- });
- });
-
- forEach/* default */.A(layering, function (layer) {
- var prevIdx = -1;
- forEach/* default */.A(layer, function (v) {
- var ws = neighborFn(v);
- if (ws.length) {
- ws = lodash_es_sortBy(ws, function (w) {
- return pos[w];
- });
- var mp = (ws.length - 1) / 2;
- for (var i = Math.floor(mp), il = Math.ceil(mp); i <= il; ++i) {
- var w = ws[i];
- if (align[v] === v && prevIdx < pos[w] && !hasConflict(conflicts, v, w)) {
- align[w] = v;
- align[v] = root[v] = root[w];
- prevIdx = pos[w];
- }
- }
- }
- });
- });
-
- return { root: root, align: align };
-}
-
-function horizontalCompaction(g, layering, root, align, reverseSep) {
- // This portion of the algorithm differs from BK due to a number of problems.
- // Instead of their algorithm we construct a new block graph and do two
- // sweeps. The first sweep places blocks with the smallest possible
- // coordinates. The second sweep removes unused space by moving blocks to the
- // greatest coordinates without violating separation.
- var xs = {},
- blockG = buildBlockGraph(g, layering, root, reverseSep),
- borderType = reverseSep ? 'borderLeft' : 'borderRight';
-
- function iterate(setXsFunc, nextNodesFunc) {
- var stack = blockG.nodes();
- var elem = stack.pop();
- var visited = {};
- while (elem) {
- if (visited[elem]) {
- setXsFunc(elem);
- } else {
- visited[elem] = true;
- stack.push(elem);
- stack = stack.concat(nextNodesFunc(elem));
- }
-
- elem = stack.pop();
- }
- }
-
- // First pass, assign smallest coordinates
- function pass1(elem) {
- xs[elem] = blockG.inEdges(elem).reduce(function (acc, e) {
- return Math.max(acc, xs[e.v] + blockG.edge(e));
- }, 0);
- }
-
- // Second pass, assign greatest coordinates
- function pass2(elem) {
- var min = blockG.outEdges(elem).reduce(function (acc, e) {
- return Math.min(acc, xs[e.w] - blockG.edge(e));
- }, Number.POSITIVE_INFINITY);
-
- var node = g.node(elem);
- if (min !== Number.POSITIVE_INFINITY && node.borderType !== borderType) {
- xs[elem] = Math.max(xs[elem], min);
- }
- }
-
- iterate(pass1, blockG.predecessors.bind(blockG));
- iterate(pass2, blockG.successors.bind(blockG));
-
- // Assign x coordinates to all nodes
- forEach/* default */.A(align, function (v) {
- xs[v] = xs[root[v]];
- });
-
- return xs;
-}
-
-function buildBlockGraph(g, layering, root, reverseSep) {
- var blockGraph = new graphlib/* Graph */.T(),
- graphLabel = g.graph(),
- sepFn = sep(graphLabel.nodesep, graphLabel.edgesep, reverseSep);
-
- forEach/* default */.A(layering, function (layer) {
- var u;
- forEach/* default */.A(layer, function (v) {
- var vRoot = root[v];
- blockGraph.setNode(vRoot);
- if (u) {
- var uRoot = root[u],
- prevMax = blockGraph.edge(uRoot, vRoot);
- blockGraph.setEdge(uRoot, vRoot, Math.max(sepFn(g, v, u), prevMax || 0));
- }
- u = v;
- });
- });
-
- return blockGraph;
-}
-
-/*
- * Returns the alignment that has the smallest width of the given alignments.
- */
-function findSmallestWidthAlignment(g, xss) {
- return lodash_es_minBy(values/* default */.A(xss), function (xs) {
- var max = Number.NEGATIVE_INFINITY;
- var min = Number.POSITIVE_INFINITY;
-
- lodash_es_forIn(xs, function (x, v) {
- var halfWidth = width(g, v) / 2;
-
- max = Math.max(x + halfWidth, max);
- min = Math.min(x - halfWidth, min);
- });
-
- return max - min;
- });
-}
-
-/*
- * Align the coordinates of each of the layout alignments such that
- * left-biased alignments have their minimum coordinate at the same point as
- * the minimum coordinate of the smallest width alignment and right-biased
- * alignments have their maximum coordinate at the same point as the maximum
- * coordinate of the smallest width alignment.
- */
-function alignCoordinates(xss, alignTo) {
- var alignToVals = values/* default */.A(alignTo),
- alignToMin = lodash_es_min(alignToVals),
- alignToMax = lodash_es_max(alignToVals);
-
- forEach/* default */.A(['u', 'd'], function (vert) {
- forEach/* default */.A(['l', 'r'], function (horiz) {
- var alignment = vert + horiz,
- xs = xss[alignment],
- delta;
- if (xs === alignTo) return;
-
- var xsVals = values/* default */.A(xs);
- delta = horiz === 'l' ? alignToMin - lodash_es_min(xsVals) : alignToMax - lodash_es_max(xsVals);
-
- if (delta) {
- xss[alignment] = lodash_es_mapValues(xs, function (x) {
- return x + delta;
- });
- }
- });
- });
-}
-
-function balance(xss, align) {
- return lodash_es_mapValues(xss.ul, function (ignore, v) {
- if (align) {
- return xss[align.toLowerCase()][v];
- } else {
- var xs = lodash_es_sortBy(map/* default */.A(xss, v));
- return (xs[1] + xs[2]) / 2;
- }
- });
-}
-
-function positionX(g) {
- var layering = buildLayerMatrix(g);
- var conflicts = merge/* default */.A(findType1Conflicts(g, layering), findType2Conflicts(g, layering));
-
- var xss = {};
- var adjustedLayering;
- forEach/* default */.A(['u', 'd'], function (vert) {
- adjustedLayering = vert === 'u' ? layering : values/* default */.A(layering).reverse();
- forEach/* default */.A(['l', 'r'], function (horiz) {
- if (horiz === 'r') {
- adjustedLayering = map/* default */.A(adjustedLayering, function (inner) {
- return values/* default */.A(inner).reverse();
- });
- }
-
- var neighborFn = (vert === 'u' ? g.predecessors : g.successors).bind(g);
- var align = verticalAlignment(g, adjustedLayering, conflicts, neighborFn);
- var xs = horizontalCompaction(g, adjustedLayering, align.root, align.align, horiz === 'r');
- if (horiz === 'r') {
- xs = lodash_es_mapValues(xs, function (x) {
- return -x;
- });
- }
- xss[vert + horiz] = xs;
- });
- });
-
- var smallestWidth = findSmallestWidthAlignment(g, xss);
- alignCoordinates(xss, smallestWidth);
- return balance(xss, g.graph().align);
-}
-
-function sep(nodeSep, edgeSep, reverseSep) {
- return function (g, v, w) {
- var vLabel = g.node(v);
- var wLabel = g.node(w);
- var sum = 0;
- var delta;
-
- sum += vLabel.width / 2;
- if (has/* default */.A(vLabel, 'labelpos')) {
- switch (vLabel.labelpos.toLowerCase()) {
- case 'l':
- delta = -vLabel.width / 2;
- break;
- case 'r':
- delta = vLabel.width / 2;
- break;
- }
- }
- if (delta) {
- sum += reverseSep ? delta : -delta;
- }
- delta = 0;
-
- sum += (vLabel.dummy ? edgeSep : nodeSep) / 2;
- sum += (wLabel.dummy ? edgeSep : nodeSep) / 2;
-
- sum += wLabel.width / 2;
- if (has/* default */.A(wLabel, 'labelpos')) {
- switch (wLabel.labelpos.toLowerCase()) {
- case 'l':
- delta = wLabel.width / 2;
- break;
- case 'r':
- delta = -wLabel.width / 2;
- break;
- }
- }
- if (delta) {
- sum += reverseSep ? delta : -delta;
- }
- delta = 0;
-
- return sum;
- };
-}
-
-function width(g, v) {
- return g.node(v).width;
-}
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/dagre/position/index.js
-
-
-
-
-
-
-function position(g) {
- g = asNonCompoundGraph(g);
-
- positionY(g);
- lodash_es_forOwn(positionX(g), function (x, v) {
- g.node(v).x = x;
- });
-}
-
-function positionY(g) {
- var layering = buildLayerMatrix(g);
- var rankSep = g.graph().ranksep;
- var prevY = 0;
- forEach/* default */.A(layering, function (layer) {
- var maxHeight = lodash_es_max(
- map/* default */.A(layer, function (v) {
- return g.node(v).height;
- })
- );
- forEach/* default */.A(layer, function (v) {
- g.node(v).y = prevY + maxHeight / 2;
- });
- prevY += maxHeight + rankSep;
- });
-}
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/dagre/layout.js
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-function layout(g, opts) {
- var time = opts && opts.debugTiming ? util_time : notime;
- time('layout', function () {
- var layoutGraph = time(' buildLayoutGraph', function () {
- return buildLayoutGraph(g);
- });
- time(' runLayout', function () {
- runLayout(layoutGraph, time);
- });
- time(' updateInputGraph', function () {
- updateInputGraph(g, layoutGraph);
- });
- });
-}
-
-function runLayout(g, time) {
- time(' makeSpaceForEdgeLabels', function () {
- makeSpaceForEdgeLabels(g);
- });
- time(' removeSelfEdges', function () {
- removeSelfEdges(g);
- });
- time(' acyclic', function () {
- run(g);
- });
- time(' nestingGraph.run', function () {
- nesting_graph_run(g);
- });
- time(' rank', function () {
- rank(asNonCompoundGraph(g));
- });
- time(' injectEdgeLabelProxies', function () {
- injectEdgeLabelProxies(g);
- });
- time(' removeEmptyRanks', function () {
- removeEmptyRanks(g);
- });
- time(' nestingGraph.cleanup', function () {
- cleanup(g);
- });
- time(' normalizeRanks', function () {
- normalizeRanks(g);
- });
- time(' assignRankMinMax', function () {
- assignRankMinMax(g);
- });
- time(' removeEdgeLabelProxies', function () {
- removeEdgeLabelProxies(g);
- });
- time(' normalize.run', function () {
- normalize_run(g);
- });
- time(' parentDummyChains', function () {
- parentDummyChains(g);
- });
- time(' addBorderSegments', function () {
- addBorderSegments(g);
- });
- time(' order', function () {
- order(g);
- });
- time(' insertSelfEdges', function () {
- insertSelfEdges(g);
- });
- time(' adjustCoordinateSystem', function () {
- adjust(g);
- });
- time(' position', function () {
- position(g);
- });
- time(' positionSelfEdges', function () {
- positionSelfEdges(g);
- });
- time(' removeBorderNodes', function () {
- removeBorderNodes(g);
- });
- time(' normalize.undo', function () {
- normalize_undo(g);
- });
- time(' fixupEdgeLabelCoords', function () {
- fixupEdgeLabelCoords(g);
- });
- time(' undoCoordinateSystem', function () {
- coordinate_system_undo(g);
- });
- time(' translateGraph', function () {
- translateGraph(g);
- });
- time(' assignNodeIntersects', function () {
- assignNodeIntersects(g);
- });
- time(' reversePoints', function () {
- reversePointsForReversedEdges(g);
- });
- time(' acyclic.undo', function () {
- undo(g);
- });
-}
-
-/*
- * Copies final layout information from the layout graph back to the input
- * graph. This process only copies whitelisted attributes from the layout graph
- * to the input graph, so it serves as a good place to determine what
- * attributes can influence layout.
- */
-function updateInputGraph(inputGraph, layoutGraph) {
- forEach/* default */.A(inputGraph.nodes(), function (v) {
- var inputLabel = inputGraph.node(v);
- var layoutLabel = layoutGraph.node(v);
-
- if (inputLabel) {
- inputLabel.x = layoutLabel.x;
- inputLabel.y = layoutLabel.y;
-
- if (layoutGraph.children(v).length) {
- inputLabel.width = layoutLabel.width;
- inputLabel.height = layoutLabel.height;
- }
- }
- });
-
- forEach/* default */.A(inputGraph.edges(), function (e) {
- var inputLabel = inputGraph.edge(e);
- var layoutLabel = layoutGraph.edge(e);
-
- inputLabel.points = layoutLabel.points;
- if (has/* default */.A(layoutLabel, 'x')) {
- inputLabel.x = layoutLabel.x;
- inputLabel.y = layoutLabel.y;
- }
- });
-
- inputGraph.graph().width = layoutGraph.graph().width;
- inputGraph.graph().height = layoutGraph.graph().height;
-}
-
-var graphNumAttrs = ['nodesep', 'edgesep', 'ranksep', 'marginx', 'marginy'];
-var graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: 'tb' };
-var graphAttrs = ['acyclicer', 'ranker', 'rankdir', 'align'];
-var nodeNumAttrs = ['width', 'height'];
-var nodeDefaults = { width: 0, height: 0 };
-var edgeNumAttrs = ['minlen', 'weight', 'width', 'height', 'labeloffset'];
-var edgeDefaults = {
- minlen: 1,
- weight: 1,
- width: 0,
- height: 0,
- labeloffset: 10,
- labelpos: 'r',
-};
-var edgeAttrs = ['labelpos'];
-
-/*
- * Constructs a new graph from the input graph, which can be used for layout.
- * This process copies only whitelisted attributes from the input graph to the
- * layout graph. Thus this function serves as a good place to determine what
- * attributes can influence layout.
- */
-function buildLayoutGraph(inputGraph) {
- var g = new graphlib/* Graph */.T({ multigraph: true, compound: true });
- var graph = canonicalize(inputGraph.graph());
-
- g.setGraph(
- merge/* default */.A({}, graphDefaults, selectNumberAttrs(graph, graphNumAttrs), pick/* default */.A(graph, graphAttrs))
- );
-
- forEach/* default */.A(inputGraph.nodes(), function (v) {
- var node = canonicalize(inputGraph.node(v));
- g.setNode(v, defaults/* default */.A(selectNumberAttrs(node, nodeNumAttrs), nodeDefaults));
- g.setParent(v, inputGraph.parent(v));
- });
-
- forEach/* default */.A(inputGraph.edges(), function (e) {
- var edge = canonicalize(inputGraph.edge(e));
- g.setEdge(
- e,
- merge/* default */.A({}, edgeDefaults, selectNumberAttrs(edge, edgeNumAttrs), pick/* default */.A(edge, edgeAttrs))
- );
- });
-
- return g;
-}
-
-/*
- * This idea comes from the Gansner paper: to account for edge labels in our
- * layout we split each rank in half by doubling minlen and halving ranksep.
- * Then we can place labels at these mid-points between nodes.
- *
- * We also add some minimal padding to the width to push the label for the edge
- * away from the edge itself a bit.
- */
-function makeSpaceForEdgeLabels(g) {
- var graph = g.graph();
- graph.ranksep /= 2;
- forEach/* default */.A(g.edges(), function (e) {
- var edge = g.edge(e);
- edge.minlen *= 2;
- if (edge.labelpos.toLowerCase() !== 'c') {
- if (graph.rankdir === 'TB' || graph.rankdir === 'BT') {
- edge.width += edge.labeloffset;
- } else {
- edge.height += edge.labeloffset;
- }
- }
- });
-}
-
-/*
- * Creates temporary dummy nodes that capture the rank in which each edge's
- * label is going to, if it has one of non-zero width and height. We do this
- * so that we can safely remove empty ranks while preserving balance for the
- * label's position.
- */
-function injectEdgeLabelProxies(g) {
- forEach/* default */.A(g.edges(), function (e) {
- var edge = g.edge(e);
- if (edge.width && edge.height) {
- var v = g.node(e.v);
- var w = g.node(e.w);
- var label = { rank: (w.rank - v.rank) / 2 + v.rank, e: e };
- addDummyNode(g, 'edge-proxy', label, '_ep');
- }
- });
-}
-
-function assignRankMinMax(g) {
- var maxRank = 0;
- forEach/* default */.A(g.nodes(), function (v) {
- var node = g.node(v);
- if (node.borderTop) {
- node.minRank = g.node(node.borderTop).rank;
- node.maxRank = g.node(node.borderBottom).rank;
- // @ts-expect-error
- maxRank = lodash_es_max(maxRank, node.maxRank);
- }
- });
- g.graph().maxRank = maxRank;
-}
-
-function removeEdgeLabelProxies(g) {
- forEach/* default */.A(g.nodes(), function (v) {
- var node = g.node(v);
- if (node.dummy === 'edge-proxy') {
- g.edge(node.e).labelRank = node.rank;
- g.removeNode(v);
- }
- });
-}
-
-function translateGraph(g) {
- var minX = Number.POSITIVE_INFINITY;
- var maxX = 0;
- var minY = Number.POSITIVE_INFINITY;
- var maxY = 0;
- var graphLabel = g.graph();
- var marginX = graphLabel.marginx || 0;
- var marginY = graphLabel.marginy || 0;
-
- function getExtremes(attrs) {
- var x = attrs.x;
- var y = attrs.y;
- var w = attrs.width;
- var h = attrs.height;
- minX = Math.min(minX, x - w / 2);
- maxX = Math.max(maxX, x + w / 2);
- minY = Math.min(minY, y - h / 2);
- maxY = Math.max(maxY, y + h / 2);
- }
-
- forEach/* default */.A(g.nodes(), function (v) {
- getExtremes(g.node(v));
- });
- forEach/* default */.A(g.edges(), function (e) {
- var edge = g.edge(e);
- if (has/* default */.A(edge, 'x')) {
- getExtremes(edge);
- }
- });
-
- minX -= marginX;
- minY -= marginY;
-
- forEach/* default */.A(g.nodes(), function (v) {
- var node = g.node(v);
- node.x -= minX;
- node.y -= minY;
- });
-
- forEach/* default */.A(g.edges(), function (e) {
- var edge = g.edge(e);
- forEach/* default */.A(edge.points, function (p) {
- p.x -= minX;
- p.y -= minY;
- });
- if (has/* default */.A(edge, 'x')) {
- edge.x -= minX;
- }
- if (has/* default */.A(edge, 'y')) {
- edge.y -= minY;
- }
- });
-
- graphLabel.width = maxX - minX + marginX;
- graphLabel.height = maxY - minY + marginY;
-}
-
-function assignNodeIntersects(g) {
- forEach/* default */.A(g.edges(), function (e) {
- var edge = g.edge(e);
- var nodeV = g.node(e.v);
- var nodeW = g.node(e.w);
- var p1, p2;
- if (!edge.points) {
- edge.points = [];
- p1 = nodeW;
- p2 = nodeV;
- } else {
- p1 = edge.points[0];
- p2 = edge.points[edge.points.length - 1];
- }
- edge.points.unshift(intersectRect(nodeV, p1));
- edge.points.push(intersectRect(nodeW, p2));
- });
-}
-
-function fixupEdgeLabelCoords(g) {
- forEach/* default */.A(g.edges(), function (e) {
- var edge = g.edge(e);
- if (has/* default */.A(edge, 'x')) {
- if (edge.labelpos === 'l' || edge.labelpos === 'r') {
- edge.width -= edge.labeloffset;
- }
- switch (edge.labelpos) {
- case 'l':
- edge.x -= edge.width / 2 + edge.labeloffset;
- break;
- case 'r':
- edge.x += edge.width / 2 + edge.labeloffset;
- break;
- }
- }
- });
-}
-
-function reversePointsForReversedEdges(g) {
- forEach/* default */.A(g.edges(), function (e) {
- var edge = g.edge(e);
- if (edge.reversed) {
- edge.points.reverse();
- }
- });
-}
-
-function removeBorderNodes(g) {
- forEach/* default */.A(g.nodes(), function (v) {
- if (g.children(v).length) {
- var node = g.node(v);
- var t = g.node(node.borderTop);
- var b = g.node(node.borderBottom);
- var l = g.node(lodash_es_last(node.borderLeft));
- var r = g.node(lodash_es_last(node.borderRight));
-
- node.width = Math.abs(r.x - l.x);
- node.height = Math.abs(b.y - t.y);
- node.x = l.x + node.width / 2;
- node.y = t.y + node.height / 2;
- }
- });
-
- forEach/* default */.A(g.nodes(), function (v) {
- if (g.node(v).dummy === 'border') {
- g.removeNode(v);
- }
- });
-}
-
-function removeSelfEdges(g) {
- forEach/* default */.A(g.edges(), function (e) {
- if (e.v === e.w) {
- var node = g.node(e.v);
- if (!node.selfEdges) {
- node.selfEdges = [];
- }
- node.selfEdges.push({ e: e, label: g.edge(e) });
- g.removeEdge(e);
- }
- });
-}
-
-function insertSelfEdges(g) {
- var layers = buildLayerMatrix(g);
- forEach/* default */.A(layers, function (layer) {
- var orderShift = 0;
- forEach/* default */.A(layer, function (v, i) {
- var node = g.node(v);
- node.order = i + orderShift;
- forEach/* default */.A(node.selfEdges, function (selfEdge) {
- addDummyNode(
- g,
- 'selfedge',
- {
- width: selfEdge.label.width,
- height: selfEdge.label.height,
- rank: node.rank,
- order: i + ++orderShift,
- e: selfEdge.e,
- label: selfEdge.label,
- },
- '_se'
- );
- });
- delete node.selfEdges;
- });
- });
-}
-
-function positionSelfEdges(g) {
- forEach/* default */.A(g.nodes(), function (v) {
- var node = g.node(v);
- if (node.dummy === 'selfedge') {
- var selfNode = g.node(node.e.v);
- var x = selfNode.x + selfNode.width / 2;
- var y = selfNode.y;
- var dx = node.x - x;
- var dy = selfNode.height / 2;
- g.setEdge(node.e, node.label);
- g.removeNode(v);
- node.label.points = [
- { x: x + (2 * dx) / 3, y: y - dy },
- { x: x + (5 * dx) / 6, y: y - dy },
- { x: x + dx, y: y },
- { x: x + (5 * dx) / 6, y: y + dy },
- { x: x + (2 * dx) / 3, y: y + dy },
- ];
- node.label.x = node.x;
- node.label.y = node.y;
- }
- });
-}
-
-function selectNumberAttrs(obj, attrs) {
- return lodash_es_mapValues(pick/* default */.A(obj, attrs), Number);
-}
-
-function canonicalize(attrs) {
- var newAttrs = {};
- forEach/* default */.A(attrs, function (v, k) {
- newAttrs[k.toLowerCase()] = v;
- });
- return newAttrs;
-}
-
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/dagre/index.js
-
-
-
-
-
-
-
-
-/***/ }),
-
-/***/ 73046:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-
-// EXPORTS
-__webpack_require__.d(__webpack_exports__, {
- T: () => (/* binding */ Graph)
-});
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/has.js + 1 modules
-var has = __webpack_require__(48585);
-// EXTERNAL MODULE: ./node_modules/lodash-es/constant.js
-var constant = __webpack_require__(39142);
-// EXTERNAL MODULE: ./node_modules/lodash-es/isFunction.js
-var isFunction = __webpack_require__(89610);
-// EXTERNAL MODULE: ./node_modules/lodash-es/keys.js
-var keys = __webpack_require__(27422);
-// EXTERNAL MODULE: ./node_modules/lodash-es/filter.js + 1 modules
-var filter = __webpack_require__(11662);
-// EXTERNAL MODULE: ./node_modules/lodash-es/isEmpty.js
-var isEmpty = __webpack_require__(66401);
-// EXTERNAL MODULE: ./node_modules/lodash-es/forEach.js
-var forEach = __webpack_require__(8058);
-// EXTERNAL MODULE: ./node_modules/lodash-es/isUndefined.js
-var isUndefined = __webpack_require__(69592);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_baseFlatten.js + 1 modules
-var _baseFlatten = __webpack_require__(13588);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_baseRest.js
-var _baseRest = __webpack_require__(24326);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_SetCache.js + 2 modules
-var _SetCache = __webpack_require__(62062);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_baseFindIndex.js
-var _baseFindIndex = __webpack_require__(25707);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseIsNaN.js
-/**
- * The base implementation of `_.isNaN` without support for number objects.
- *
- * @private
- * @param {*} value The value to check.
- * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.
- */
-function baseIsNaN(value) {
- return value !== value;
-}
-
-/* harmony default export */ const _baseIsNaN = (baseIsNaN);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_strictIndexOf.js
-/**
- * A specialized version of `_.indexOf` which performs strict equality
- * comparisons of values, i.e. `===`.
- *
- * @private
- * @param {Array} array The array to inspect.
- * @param {*} value The value to search for.
- * @param {number} fromIndex The index to search from.
- * @returns {number} Returns the index of the matched value, else `-1`.
- */
-function strictIndexOf(array, value, fromIndex) {
- var index = fromIndex - 1,
- length = array.length;
-
- while (++index < length) {
- if (array[index] === value) {
- return index;
- }
- }
- return -1;
-}
-
-/* harmony default export */ const _strictIndexOf = (strictIndexOf);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseIndexOf.js
-
-
-
-
-/**
- * The base implementation of `_.indexOf` without `fromIndex` bounds checks.
- *
- * @private
- * @param {Array} array The array to inspect.
- * @param {*} value The value to search for.
- * @param {number} fromIndex The index to search from.
- * @returns {number} Returns the index of the matched value, else `-1`.
- */
-function baseIndexOf(array, value, fromIndex) {
- return value === value
- ? _strictIndexOf(array, value, fromIndex)
- : (0,_baseFindIndex/* default */.A)(array, _baseIsNaN, fromIndex);
-}
-
-/* harmony default export */ const _baseIndexOf = (baseIndexOf);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_arrayIncludes.js
-
-
-/**
- * A specialized version of `_.includes` for arrays without support for
- * specifying an index to search from.
- *
- * @private
- * @param {Array} [array] The array to inspect.
- * @param {*} target The value to search for.
- * @returns {boolean} Returns `true` if `target` is found, else `false`.
- */
-function arrayIncludes(array, value) {
- var length = array == null ? 0 : array.length;
- return !!length && _baseIndexOf(array, value, 0) > -1;
-}
-
-/* harmony default export */ const _arrayIncludes = (arrayIncludes);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_arrayIncludesWith.js
-/**
- * This function is like `arrayIncludes` except that it accepts a comparator.
- *
- * @private
- * @param {Array} [array] The array to inspect.
- * @param {*} target The value to search for.
- * @param {Function} comparator The comparator invoked per element.
- * @returns {boolean} Returns `true` if `target` is found, else `false`.
- */
-function arrayIncludesWith(array, value, comparator) {
- var index = -1,
- length = array == null ? 0 : array.length;
-
- while (++index < length) {
- if (comparator(value, array[index])) {
- return true;
- }
- }
- return false;
-}
-
-/* harmony default export */ const _arrayIncludesWith = (arrayIncludesWith);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_cacheHas.js
-var _cacheHas = __webpack_require__(64099);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_Set.js
-var _Set = __webpack_require__(39857);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/noop.js
-/**
- * This method returns `undefined`.
- *
- * @static
- * @memberOf _
- * @since 2.3.0
- * @category Util
- * @example
- *
- * _.times(2, _.noop);
- * // => [undefined, undefined]
- */
-function noop() {
- // No operation performed.
-}
-
-/* harmony default export */ const lodash_es_noop = (noop);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_setToArray.js
-var _setToArray = __webpack_require__(29959);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_createSet.js
-
-
-
-
-/** Used as references for various `Number` constants. */
-var INFINITY = 1 / 0;
-
-/**
- * Creates a set object of `values`.
- *
- * @private
- * @param {Array} values The values to add to the set.
- * @returns {Object} Returns the new set.
- */
-var createSet = !(_Set/* default */.A && (1 / (0,_setToArray/* default */.A)(new _Set/* default */.A([,-0]))[1]) == INFINITY) ? lodash_es_noop : function(values) {
- return new _Set/* default */.A(values);
-};
-
-/* harmony default export */ const _createSet = (createSet);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseUniq.js
-
-
-
-
-
-
-
-/** Used as the size to enable large array optimizations. */
-var LARGE_ARRAY_SIZE = 200;
-
-/**
- * The base implementation of `_.uniqBy` without support for iteratee shorthands.
- *
- * @private
- * @param {Array} array The array to inspect.
- * @param {Function} [iteratee] The iteratee invoked per element.
- * @param {Function} [comparator] The comparator invoked per element.
- * @returns {Array} Returns the new duplicate free array.
- */
-function baseUniq(array, iteratee, comparator) {
- var index = -1,
- includes = _arrayIncludes,
- length = array.length,
- isCommon = true,
- result = [],
- seen = result;
-
- if (comparator) {
- isCommon = false;
- includes = _arrayIncludesWith;
- }
- else if (length >= LARGE_ARRAY_SIZE) {
- var set = iteratee ? null : _createSet(array);
- if (set) {
- return (0,_setToArray/* default */.A)(set);
- }
- isCommon = false;
- includes = _cacheHas/* default */.A;
- seen = new _SetCache/* default */.A;
- }
- else {
- seen = iteratee ? [] : result;
- }
- outer:
- while (++index < length) {
- var value = array[index],
- computed = iteratee ? iteratee(value) : value;
-
- value = (comparator || value !== 0) ? value : 0;
- if (isCommon && computed === computed) {
- var seenIndex = seen.length;
- while (seenIndex--) {
- if (seen[seenIndex] === computed) {
- continue outer;
- }
- }
- if (iteratee) {
- seen.push(computed);
- }
- result.push(value);
- }
- else if (!includes(seen, computed, comparator)) {
- if (seen !== result) {
- seen.push(computed);
- }
- result.push(value);
- }
- }
- return result;
-}
-
-/* harmony default export */ const _baseUniq = (baseUniq);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/isArrayLikeObject.js
-var isArrayLikeObject = __webpack_require__(53533);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/union.js
-
-
-
-
-
-/**
- * Creates an array of unique values, in order, from all given arrays using
- * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
- * for equality comparisons.
- *
- * @static
- * @memberOf _
- * @since 0.1.0
- * @category Array
- * @param {...Array} [arrays] The arrays to inspect.
- * @returns {Array} Returns the new array of combined values.
- * @example
- *
- * _.union([2], [1, 2]);
- * // => [2, 1]
- */
-var union = (0,_baseRest/* default */.A)(function(arrays) {
- return _baseUniq((0,_baseFlatten/* default */.A)(arrays, 1, isArrayLikeObject/* default */.A, true));
-});
-
-/* harmony default export */ const lodash_es_union = (union);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/values.js + 1 modules
-var values = __webpack_require__(38207);
-// EXTERNAL MODULE: ./node_modules/lodash-es/reduce.js + 2 modules
-var reduce = __webpack_require__(89463);
-;// CONCATENATED MODULE: ./node_modules/dagre-d3-es/src/graphlib/graph.js
-
-
-var DEFAULT_EDGE_NAME = '\x00';
-var GRAPH_NODE = '\x00';
-var EDGE_KEY_DELIM = '\x01';
-
-// Implementation notes:
-//
-// * Node id query functions should return string ids for the nodes
-// * Edge id query functions should return an "edgeObj", edge object, that is
-// composed of enough information to uniquely identify an edge: {v, w, name}.
-// * Internally we use an "edgeId", a stringified form of the edgeObj, to
-// reference edges. This is because we need a performant way to look these
-// edges up and, object properties, which have string keys, are the closest
-// we're going to get to a performant hashtable in JavaScript.
-
-// Implementation notes:
-//
-// * Node id query functions should return string ids for the nodes
-// * Edge id query functions should return an "edgeObj", edge object, that is
-// composed of enough information to uniquely identify an edge: {v, w, name}.
-// * Internally we use an "edgeId", a stringified form of the edgeObj, to
-// reference edges. This is because we need a performant way to look these
-// edges up and, object properties, which have string keys, are the closest
-// we're going to get to a performant hashtable in JavaScript.
-class Graph {
- constructor(opts = {}) {
- this._isDirected = has/* default */.A(opts, 'directed') ? opts.directed : true;
- this._isMultigraph = has/* default */.A(opts, 'multigraph') ? opts.multigraph : false;
- this._isCompound = has/* default */.A(opts, 'compound') ? opts.compound : false;
-
- // Label for the graph itself
- this._label = undefined;
-
- // Defaults to be set when creating a new node
- this._defaultNodeLabelFn = constant/* default */.A(undefined);
-
- // Defaults to be set when creating a new edge
- this._defaultEdgeLabelFn = constant/* default */.A(undefined);
-
- // v -> label
- this._nodes = {};
-
- if (this._isCompound) {
- // v -> parent
- this._parent = {};
-
- // v -> children
- this._children = {};
- this._children[GRAPH_NODE] = {};
- }
-
- // v -> edgeObj
- this._in = {};
-
- // u -> v -> Number
- this._preds = {};
-
- // v -> edgeObj
- this._out = {};
-
- // v -> w -> Number
- this._sucs = {};
-
- // e -> edgeObj
- this._edgeObjs = {};
-
- // e -> label
- this._edgeLabels = {};
- }
- /* === Graph functions ========= */
- isDirected() {
- return this._isDirected;
- }
- isMultigraph() {
- return this._isMultigraph;
- }
- isCompound() {
- return this._isCompound;
- }
- setGraph(label) {
- this._label = label;
- return this;
- }
- graph() {
- return this._label;
- }
- /* === Node functions ========== */
- setDefaultNodeLabel(newDefault) {
- if (!isFunction/* default */.A(newDefault)) {
- newDefault = constant/* default */.A(newDefault);
- }
- this._defaultNodeLabelFn = newDefault;
- return this;
- }
- nodeCount() {
- return this._nodeCount;
- }
- nodes() {
- return keys/* default */.A(this._nodes);
- }
- sources() {
- var self = this;
- return filter/* default */.A(this.nodes(), function (v) {
- return isEmpty/* default */.A(self._in[v]);
- });
- }
- sinks() {
- var self = this;
- return filter/* default */.A(this.nodes(), function (v) {
- return isEmpty/* default */.A(self._out[v]);
- });
- }
- setNodes(vs, value) {
- var args = arguments;
- var self = this;
- forEach/* default */.A(vs, function (v) {
- if (args.length > 1) {
- self.setNode(v, value);
- } else {
- self.setNode(v);
- }
- });
- return this;
- }
- setNode(v, value) {
- if (has/* default */.A(this._nodes, v)) {
- if (arguments.length > 1) {
- this._nodes[v] = value;
- }
- return this;
- }
-
- // @ts-expect-error
- this._nodes[v] = arguments.length > 1 ? value : this._defaultNodeLabelFn(v);
- if (this._isCompound) {
- this._parent[v] = GRAPH_NODE;
- this._children[v] = {};
- this._children[GRAPH_NODE][v] = true;
- }
- this._in[v] = {};
- this._preds[v] = {};
- this._out[v] = {};
- this._sucs[v] = {};
- ++this._nodeCount;
- return this;
- }
- node(v) {
- return this._nodes[v];
- }
- hasNode(v) {
- return has/* default */.A(this._nodes, v);
- }
- removeNode(v) {
- var self = this;
- if (has/* default */.A(this._nodes, v)) {
- var removeEdge = function (e) {
- self.removeEdge(self._edgeObjs[e]);
- };
- delete this._nodes[v];
- if (this._isCompound) {
- this._removeFromParentsChildList(v);
- delete this._parent[v];
- forEach/* default */.A(this.children(v), function (child) {
- self.setParent(child);
- });
- delete this._children[v];
- }
- forEach/* default */.A(keys/* default */.A(this._in[v]), removeEdge);
- delete this._in[v];
- delete this._preds[v];
- forEach/* default */.A(keys/* default */.A(this._out[v]), removeEdge);
- delete this._out[v];
- delete this._sucs[v];
- --this._nodeCount;
- }
- return this;
- }
- setParent(v, parent) {
- if (!this._isCompound) {
- throw new Error('Cannot set parent in a non-compound graph');
- }
-
- if (isUndefined/* default */.A(parent)) {
- parent = GRAPH_NODE;
- } else {
- // Coerce parent to string
- parent += '';
- for (var ancestor = parent; !isUndefined/* default */.A(ancestor); ancestor = this.parent(ancestor)) {
- if (ancestor === v) {
- throw new Error('Setting ' + parent + ' as parent of ' + v + ' would create a cycle');
- }
- }
-
- this.setNode(parent);
- }
-
- this.setNode(v);
- this._removeFromParentsChildList(v);
- this._parent[v] = parent;
- this._children[parent][v] = true;
- return this;
- }
- _removeFromParentsChildList(v) {
- delete this._children[this._parent[v]][v];
- }
- parent(v) {
- if (this._isCompound) {
- var parent = this._parent[v];
- if (parent !== GRAPH_NODE) {
- return parent;
- }
- }
- }
- children(v) {
- if (isUndefined/* default */.A(v)) {
- v = GRAPH_NODE;
- }
-
- if (this._isCompound) {
- var children = this._children[v];
- if (children) {
- return keys/* default */.A(children);
- }
- } else if (v === GRAPH_NODE) {
- return this.nodes();
- } else if (this.hasNode(v)) {
- return [];
- }
- }
- predecessors(v) {
- var predsV = this._preds[v];
- if (predsV) {
- return keys/* default */.A(predsV);
- }
- }
- successors(v) {
- var sucsV = this._sucs[v];
- if (sucsV) {
- return keys/* default */.A(sucsV);
- }
- }
- neighbors(v) {
- var preds = this.predecessors(v);
- if (preds) {
- return lodash_es_union(preds, this.successors(v));
- }
- }
- isLeaf(v) {
- var neighbors;
- if (this.isDirected()) {
- neighbors = this.successors(v);
- } else {
- neighbors = this.neighbors(v);
- }
- return neighbors.length === 0;
- }
- filterNodes(filter) {
- // @ts-expect-error
- var copy = new this.constructor({
- directed: this._isDirected,
- multigraph: this._isMultigraph,
- compound: this._isCompound,
- });
-
- copy.setGraph(this.graph());
-
- var self = this;
- forEach/* default */.A(this._nodes, function (value, v) {
- if (filter(v)) {
- copy.setNode(v, value);
- }
- });
-
- forEach/* default */.A(this._edgeObjs, function (e) {
- // @ts-expect-error
- if (copy.hasNode(e.v) && copy.hasNode(e.w)) {
- copy.setEdge(e, self.edge(e));
- }
- });
-
- var parents = {};
- function findParent(v) {
- var parent = self.parent(v);
- if (parent === undefined || copy.hasNode(parent)) {
- parents[v] = parent;
- return parent;
- } else if (parent in parents) {
- return parents[parent];
- } else {
- return findParent(parent);
- }
- }
-
- if (this._isCompound) {
- forEach/* default */.A(copy.nodes(), function (v) {
- copy.setParent(v, findParent(v));
- });
- }
-
- return copy;
- }
- /* === Edge functions ========== */
- setDefaultEdgeLabel(newDefault) {
- if (!isFunction/* default */.A(newDefault)) {
- newDefault = constant/* default */.A(newDefault);
- }
- this._defaultEdgeLabelFn = newDefault;
- return this;
- }
- edgeCount() {
- return this._edgeCount;
- }
- edges() {
- return values/* default */.A(this._edgeObjs);
- }
- setPath(vs, value) {
- var self = this;
- var args = arguments;
- reduce/* default */.A(vs, function (v, w) {
- if (args.length > 1) {
- self.setEdge(v, w, value);
- } else {
- self.setEdge(v, w);
- }
- return w;
- });
- return this;
- }
- /*
- * setEdge(v, w, [value, [name]])
- * setEdge({ v, w, [name] }, [value])
- */
- setEdge() {
- var v, w, name, value;
- var valueSpecified = false;
- var arg0 = arguments[0];
-
- if (typeof arg0 === 'object' && arg0 !== null && 'v' in arg0) {
- v = arg0.v;
- w = arg0.w;
- name = arg0.name;
- if (arguments.length === 2) {
- value = arguments[1];
- valueSpecified = true;
- }
- } else {
- v = arg0;
- w = arguments[1];
- name = arguments[3];
- if (arguments.length > 2) {
- value = arguments[2];
- valueSpecified = true;
- }
- }
-
- v = '' + v;
- w = '' + w;
- if (!isUndefined/* default */.A(name)) {
- name = '' + name;
- }
-
- var e = edgeArgsToId(this._isDirected, v, w, name);
- if (has/* default */.A(this._edgeLabels, e)) {
- if (valueSpecified) {
- this._edgeLabels[e] = value;
- }
- return this;
- }
-
- if (!isUndefined/* default */.A(name) && !this._isMultigraph) {
- throw new Error('Cannot set a named edge when isMultigraph = false');
- }
-
- // It didn't exist, so we need to create it.
- // First ensure the nodes exist.
- this.setNode(v);
- this.setNode(w);
-
- // @ts-expect-error
- this._edgeLabels[e] = valueSpecified ? value : this._defaultEdgeLabelFn(v, w, name);
-
- var edgeObj = edgeArgsToObj(this._isDirected, v, w, name);
- // Ensure we add undirected edges in a consistent way.
- v = edgeObj.v;
- w = edgeObj.w;
-
- Object.freeze(edgeObj);
- this._edgeObjs[e] = edgeObj;
- incrementOrInitEntry(this._preds[w], v);
- incrementOrInitEntry(this._sucs[v], w);
- this._in[w][e] = edgeObj;
- this._out[v][e] = edgeObj;
- this._edgeCount++;
- return this;
- }
- edge(v, w, name) {
- var e =
- arguments.length === 1
- ? edgeObjToId(this._isDirected, arguments[0])
- : edgeArgsToId(this._isDirected, v, w, name);
- return this._edgeLabels[e];
- }
- hasEdge(v, w, name) {
- var e =
- arguments.length === 1
- ? edgeObjToId(this._isDirected, arguments[0])
- : edgeArgsToId(this._isDirected, v, w, name);
- return has/* default */.A(this._edgeLabels, e);
- }
- removeEdge(v, w, name) {
- var e =
- arguments.length === 1
- ? edgeObjToId(this._isDirected, arguments[0])
- : edgeArgsToId(this._isDirected, v, w, name);
- var edge = this._edgeObjs[e];
- if (edge) {
- v = edge.v;
- w = edge.w;
- delete this._edgeLabels[e];
- delete this._edgeObjs[e];
- decrementOrRemoveEntry(this._preds[w], v);
- decrementOrRemoveEntry(this._sucs[v], w);
- delete this._in[w][e];
- delete this._out[v][e];
- this._edgeCount--;
- }
- return this;
- }
- inEdges(v, u) {
- var inV = this._in[v];
- if (inV) {
- var edges = values/* default */.A(inV);
- if (!u) {
- return edges;
- }
- return filter/* default */.A(edges, function (edge) {
- return edge.v === u;
- });
- }
- }
- outEdges(v, w) {
- var outV = this._out[v];
- if (outV) {
- var edges = values/* default */.A(outV);
- if (!w) {
- return edges;
- }
- return filter/* default */.A(edges, function (edge) {
- return edge.w === w;
- });
- }
- }
- nodeEdges(v, w) {
- var inEdges = this.inEdges(v, w);
- if (inEdges) {
- return inEdges.concat(this.outEdges(v, w));
- }
- }
-}
-
-/* Number of nodes in the graph. Should only be changed by the implementation. */
-Graph.prototype._nodeCount = 0;
-
-/* Number of edges in the graph. Should only be changed by the implementation. */
-Graph.prototype._edgeCount = 0;
-
-function incrementOrInitEntry(map, k) {
- if (map[k]) {
- map[k]++;
- } else {
- map[k] = 1;
- }
-}
-
-function decrementOrRemoveEntry(map, k) {
- if (!--map[k]) {
- delete map[k];
- }
-}
-
-function edgeArgsToId(isDirected, v_, w_, name) {
- var v = '' + v_;
- var w = '' + w_;
- if (!isDirected && v > w) {
- var tmp = v;
- v = w;
- w = tmp;
- }
- return v + EDGE_KEY_DELIM + w + EDGE_KEY_DELIM + (isUndefined/* default */.A(name) ? DEFAULT_EDGE_NAME : name);
-}
-
-function edgeArgsToObj(isDirected, v_, w_, name) {
- var v = '' + v_;
- var w = '' + w_;
- if (!isDirected && v > w) {
- var tmp = v;
- v = w;
- w = tmp;
- }
- var edgeObj = { v: v, w: w };
- if (name) {
- edgeObj.name = name;
- }
- return edgeObj;
-}
-
-function edgeObjToId(isDirected, edgeObj) {
- return edgeArgsToId(isDirected, edgeObj.v, edgeObj.w, edgeObj.name);
-}
-
-
-/***/ }),
-
-/***/ 697:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ T: () => (/* reexport safe */ _graph_js__WEBPACK_IMPORTED_MODULE_0__.T)
-/* harmony export */ });
-/* unused harmony export version */
-/* harmony import */ var _graph_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(73046);
-// Includes only the "core" of graphlib
-
-
-
-const version = '2.1.9-pre';
-
-
-
-
-/***/ }),
-
-/***/ 14075:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ M: () => (/* binding */ write)
-/* harmony export */ });
-/* unused harmony export read */
-/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(69592);
-/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(50053);
-/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(74722);
-/* harmony import */ var _graph_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(73046);
-
-
-
-
-
-function write(g) {
- var json = {
- options: {
- directed: g.isDirected(),
- multigraph: g.isMultigraph(),
- compound: g.isCompound(),
- },
- nodes: writeNodes(g),
- edges: writeEdges(g),
- };
- if (!lodash_es__WEBPACK_IMPORTED_MODULE_1__/* ["default"] */ .A(g.graph())) {
- json.value = lodash_es__WEBPACK_IMPORTED_MODULE_2__/* ["default"] */ .A(g.graph());
- }
- return json;
-}
-
-function writeNodes(g) {
- return lodash_es__WEBPACK_IMPORTED_MODULE_3__/* ["default"] */ .A(g.nodes(), function (v) {
- var nodeValue = g.node(v);
- var parent = g.parent(v);
- var node = { v: v };
- if (!lodash_es__WEBPACK_IMPORTED_MODULE_1__/* ["default"] */ .A(nodeValue)) {
- node.value = nodeValue;
- }
- if (!lodash_es__WEBPACK_IMPORTED_MODULE_1__/* ["default"] */ .A(parent)) {
- node.parent = parent;
- }
- return node;
- });
-}
-
-function writeEdges(g) {
- return lodash_es__WEBPACK_IMPORTED_MODULE_3__/* ["default"] */ .A(g.edges(), function (e) {
- var edgeValue = g.edge(e);
- var edge = { v: e.v, w: e.w };
- if (!lodash_es__WEBPACK_IMPORTED_MODULE_1__/* ["default"] */ .A(e.name)) {
- edge.name = e.name;
- }
- if (!lodash_es__WEBPACK_IMPORTED_MODULE_1__/* ["default"] */ .A(edgeValue)) {
- edge.value = edgeValue;
- }
- return edge;
- });
-}
-
-function read(json) {
- var g = new Graph(json.options).setGraph(json.value);
- _.each(json.nodes, function (entry) {
- g.setNode(entry.v, entry.value);
- if (entry.parent) {
- g.setParent(entry.v, entry.parent);
- }
- });
- _.each(json.edges, function (entry) {
- g.setEdge({ v: entry.v, w: entry.w, name: entry.name }, entry.value);
- });
- return g;
-}
-
-
-/***/ }),
-
-/***/ 62062:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-
-// EXPORTS
-__webpack_require__.d(__webpack_exports__, {
- A: () => (/* binding */ _SetCache)
-});
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_MapCache.js + 14 modules
-var _MapCache = __webpack_require__(29471);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_setCacheAdd.js
-/** Used to stand-in for `undefined` hash values. */
-var HASH_UNDEFINED = '__lodash_hash_undefined__';
-
-/**
- * Adds `value` to the array cache.
- *
- * @private
- * @name add
- * @memberOf SetCache
- * @alias push
- * @param {*} value The value to cache.
- * @returns {Object} Returns the cache instance.
- */
-function setCacheAdd(value) {
- this.__data__.set(value, HASH_UNDEFINED);
- return this;
-}
-
-/* harmony default export */ const _setCacheAdd = (setCacheAdd);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_setCacheHas.js
-/**
- * Checks if `value` is in the array cache.
- *
- * @private
- * @name has
- * @memberOf SetCache
- * @param {*} value The value to search for.
- * @returns {number} Returns `true` if `value` is found, else `false`.
- */
-function setCacheHas(value) {
- return this.__data__.has(value);
-}
-
-/* harmony default export */ const _setCacheHas = (setCacheHas);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_SetCache.js
-
-
-
-
-/**
- *
- * Creates an array cache object to store unique values.
- *
- * @private
- * @constructor
- * @param {Array} [values] The values to cache.
- */
-function SetCache(values) {
- var index = -1,
- length = values == null ? 0 : values.length;
-
- this.__data__ = new _MapCache/* default */.A;
- while (++index < length) {
- this.add(values[index]);
- }
-}
-
-// Add methods to `SetCache`.
-SetCache.prototype.add = SetCache.prototype.push = _setCacheAdd;
-SetCache.prototype.has = _setCacheHas;
-
-/* harmony default export */ const _SetCache = (SetCache);
-
-
-/***/ }),
-
-/***/ 72641:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ A: () => (__WEBPACK_DEFAULT_EXPORT__)
-/* harmony export */ });
-/**
- * A specialized version of `_.forEach` for arrays without support for
- * iteratee shorthands.
- *
- * @private
- * @param {Array} [array] The array to iterate over.
- * @param {Function} iteratee The function invoked per iteration.
- * @returns {Array} Returns `array`.
- */
-function arrayEach(array, iteratee) {
- var index = -1,
- length = array == null ? 0 : array.length;
-
- while (++index < length) {
- if (iteratee(array[index], index, array) === false) {
- break;
- }
- }
- return array;
-}
-
-/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (arrayEach);
-
-
-/***/ }),
-
-/***/ 2634:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ A: () => (__WEBPACK_DEFAULT_EXPORT__)
-/* harmony export */ });
-/**
- * A specialized version of `_.filter` for arrays without support for
- * iteratee shorthands.
- *
- * @private
- * @param {Array} [array] The array to iterate over.
- * @param {Function} predicate The function invoked per iteration.
- * @returns {Array} Returns the new filtered array.
- */
-function arrayFilter(array, predicate) {
- var index = -1,
- length = array == null ? 0 : array.length,
- resIndex = 0,
- result = [];
-
- while (++index < length) {
- var value = array[index];
- if (predicate(value, index, array)) {
- result[resIndex++] = value;
- }
- }
- return result;
-}
-
-/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (arrayFilter);
-
-
-/***/ }),
-
-/***/ 45572:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ A: () => (__WEBPACK_DEFAULT_EXPORT__)
-/* harmony export */ });
-/**
- * A specialized version of `_.map` for arrays without support for iteratee
- * shorthands.
- *
- * @private
- * @param {Array} [array] The array to iterate over.
- * @param {Function} iteratee The function invoked per iteration.
- * @returns {Array} Returns the new mapped array.
- */
-function arrayMap(array, iteratee) {
- var index = -1,
- length = array == null ? 0 : array.length,
- result = Array(length);
-
- while (++index < length) {
- result[index] = iteratee(array[index], index, array);
- }
- return result;
-}
-
-/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (arrayMap);
-
-
-/***/ }),
-
-/***/ 76912:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ A: () => (__WEBPACK_DEFAULT_EXPORT__)
-/* harmony export */ });
-/**
- * Appends the elements of `values` to `array`.
- *
- * @private
- * @param {Array} array The array to modify.
- * @param {Array} values The values to append.
- * @returns {Array} Returns `array`.
- */
-function arrayPush(array, values) {
- var index = -1,
- length = values.length,
- offset = array.length;
-
- while (++index < length) {
- array[offset + index] = values[index];
- }
- return array;
-}
-
-/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (arrayPush);
-
-
-/***/ }),
-
-/***/ 91641:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-
-// EXPORTS
-__webpack_require__.d(__webpack_exports__, {
- A: () => (/* binding */ _baseClone)
-});
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_Stack.js + 5 modules
-var _Stack = __webpack_require__(11754);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_arrayEach.js
-var _arrayEach = __webpack_require__(72641);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_assignValue.js
-var _assignValue = __webpack_require__(52851);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_copyObject.js
-var _copyObject = __webpack_require__(22031);
-// EXTERNAL MODULE: ./node_modules/lodash-es/keys.js
-var keys = __webpack_require__(27422);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseAssign.js
-
-
-
-/**
- * The base implementation of `_.assign` without support for multiple sources
- * or `customizer` functions.
- *
- * @private
- * @param {Object} object The destination object.
- * @param {Object} source The source object.
- * @returns {Object} Returns `object`.
- */
-function baseAssign(object, source) {
- return object && (0,_copyObject/* default */.A)(source, (0,keys/* default */.A)(source), object);
-}
-
-/* harmony default export */ const _baseAssign = (baseAssign);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/keysIn.js + 2 modules
-var keysIn = __webpack_require__(55615);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseAssignIn.js
-
-
-
-/**
- * The base implementation of `_.assignIn` without support for multiple sources
- * or `customizer` functions.
- *
- * @private
- * @param {Object} object The destination object.
- * @param {Object} source The source object.
- * @returns {Object} Returns `object`.
- */
-function baseAssignIn(object, source) {
- return object && (0,_copyObject/* default */.A)(source, (0,keysIn/* default */.A)(source), object);
-}
-
-/* harmony default export */ const _baseAssignIn = (baseAssignIn);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_cloneBuffer.js
-var _cloneBuffer = __webpack_require__(80154);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_copyArray.js
-var _copyArray = __webpack_require__(39759);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_getSymbols.js
-var _getSymbols = __webpack_require__(14792);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_copySymbols.js
-
-
-
-/**
- * Copies own symbols of `source` to `object`.
- *
- * @private
- * @param {Object} source The object to copy symbols from.
- * @param {Object} [object={}] The object to copy symbols to.
- * @returns {Object} Returns `object`.
- */
-function copySymbols(source, object) {
- return (0,_copyObject/* default */.A)(source, (0,_getSymbols/* default */.A)(source), object);
-}
-
-/* harmony default export */ const _copySymbols = (copySymbols);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_arrayPush.js
-var _arrayPush = __webpack_require__(76912);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_getPrototype.js
-var _getPrototype = __webpack_require__(15647);
-// EXTERNAL MODULE: ./node_modules/lodash-es/stubArray.js
-var stubArray = __webpack_require__(13153);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_getSymbolsIn.js
-
-
-
-
-
-/* Built-in method references for those with the same name as other `lodash` methods. */
-var nativeGetSymbols = Object.getOwnPropertySymbols;
-
-/**
- * Creates an array of the own and inherited enumerable symbols of `object`.
- *
- * @private
- * @param {Object} object The object to query.
- * @returns {Array} Returns the array of symbols.
- */
-var getSymbolsIn = !nativeGetSymbols ? stubArray/* default */.A : function(object) {
- var result = [];
- while (object) {
- (0,_arrayPush/* default */.A)(result, (0,_getSymbols/* default */.A)(object));
- object = (0,_getPrototype/* default */.A)(object);
- }
- return result;
-};
-
-/* harmony default export */ const _getSymbolsIn = (getSymbolsIn);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_copySymbolsIn.js
-
-
-
-/**
- * Copies own and inherited symbols of `source` to `object`.
- *
- * @private
- * @param {Object} source The object to copy symbols from.
- * @param {Object} [object={}] The object to copy symbols to.
- * @returns {Object} Returns `object`.
- */
-function copySymbolsIn(source, object) {
- return (0,_copyObject/* default */.A)(source, _getSymbolsIn(source), object);
-}
-
-/* harmony default export */ const _copySymbolsIn = (copySymbolsIn);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_getAllKeys.js
-var _getAllKeys = __webpack_require__(19042);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_baseGetAllKeys.js
-var _baseGetAllKeys = __webpack_require__(33831);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_getAllKeysIn.js
-
-
-
-
-/**
- * Creates an array of own and inherited enumerable property names and
- * symbols of `object`.
- *
- * @private
- * @param {Object} object The object to query.
- * @returns {Array} Returns the array of property names and symbols.
- */
-function getAllKeysIn(object) {
- return (0,_baseGetAllKeys/* default */.A)(object, keysIn/* default */.A, _getSymbolsIn);
-}
-
-/* harmony default export */ const _getAllKeysIn = (getAllKeysIn);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_getTag.js + 3 modules
-var _getTag = __webpack_require__(9779);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_initCloneArray.js
-/** Used for built-in method references. */
-var objectProto = Object.prototype;
-
-/** Used to check objects for own properties. */
-var _initCloneArray_hasOwnProperty = objectProto.hasOwnProperty;
-
-/**
- * Initializes an array clone.
- *
- * @private
- * @param {Array} array The array to clone.
- * @returns {Array} Returns the initialized clone.
- */
-function initCloneArray(array) {
- var length = array.length,
- result = new array.constructor(length);
-
- // Add properties assigned by `RegExp#exec`.
- if (length && typeof array[0] == 'string' && _initCloneArray_hasOwnProperty.call(array, 'index')) {
- result.index = array.index;
- result.input = array.input;
- }
- return result;
-}
-
-/* harmony default export */ const _initCloneArray = (initCloneArray);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_cloneArrayBuffer.js
-var _cloneArrayBuffer = __webpack_require__(90565);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_cloneDataView.js
-
-
-/**
- * Creates a clone of `dataView`.
- *
- * @private
- * @param {Object} dataView The data view to clone.
- * @param {boolean} [isDeep] Specify a deep clone.
- * @returns {Object} Returns the cloned data view.
- */
-function cloneDataView(dataView, isDeep) {
- var buffer = isDeep ? (0,_cloneArrayBuffer/* default */.A)(dataView.buffer) : dataView.buffer;
- return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);
-}
-
-/* harmony default export */ const _cloneDataView = (cloneDataView);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_cloneRegExp.js
-/** Used to match `RegExp` flags from their coerced string values. */
-var reFlags = /\w*$/;
-
-/**
- * Creates a clone of `regexp`.
- *
- * @private
- * @param {Object} regexp The regexp to clone.
- * @returns {Object} Returns the cloned regexp.
- */
-function cloneRegExp(regexp) {
- var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));
- result.lastIndex = regexp.lastIndex;
- return result;
-}
-
-/* harmony default export */ const _cloneRegExp = (cloneRegExp);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_Symbol.js
-var _Symbol = __webpack_require__(241);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_cloneSymbol.js
-
-
-/** Used to convert symbols to primitives and strings. */
-var symbolProto = _Symbol/* default */.A ? _Symbol/* default */.A.prototype : undefined,
- symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;
-
-/**
- * Creates a clone of the `symbol` object.
- *
- * @private
- * @param {Object} symbol The symbol object to clone.
- * @returns {Object} Returns the cloned symbol object.
- */
-function cloneSymbol(symbol) {
- return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};
-}
-
-/* harmony default export */ const _cloneSymbol = (cloneSymbol);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_cloneTypedArray.js
-var _cloneTypedArray = __webpack_require__(1801);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_initCloneByTag.js
-
-
-
-
-
-
-/** `Object#toString` result references. */
-var boolTag = '[object Boolean]',
- dateTag = '[object Date]',
- mapTag = '[object Map]',
- numberTag = '[object Number]',
- regexpTag = '[object RegExp]',
- setTag = '[object Set]',
- stringTag = '[object String]',
- symbolTag = '[object Symbol]';
-
-var arrayBufferTag = '[object ArrayBuffer]',
- dataViewTag = '[object DataView]',
- float32Tag = '[object Float32Array]',
- float64Tag = '[object Float64Array]',
- int8Tag = '[object Int8Array]',
- int16Tag = '[object Int16Array]',
- int32Tag = '[object Int32Array]',
- uint8Tag = '[object Uint8Array]',
- uint8ClampedTag = '[object Uint8ClampedArray]',
- uint16Tag = '[object Uint16Array]',
- uint32Tag = '[object Uint32Array]';
-
-/**
- * Initializes an object clone based on its `toStringTag`.
- *
- * **Note:** This function only supports cloning values with tags of
- * `Boolean`, `Date`, `Error`, `Map`, `Number`, `RegExp`, `Set`, or `String`.
- *
- * @private
- * @param {Object} object The object to clone.
- * @param {string} tag The `toStringTag` of the object to clone.
- * @param {boolean} [isDeep] Specify a deep clone.
- * @returns {Object} Returns the initialized clone.
- */
-function initCloneByTag(object, tag, isDeep) {
- var Ctor = object.constructor;
- switch (tag) {
- case arrayBufferTag:
- return (0,_cloneArrayBuffer/* default */.A)(object);
-
- case boolTag:
- case dateTag:
- return new Ctor(+object);
-
- case dataViewTag:
- return _cloneDataView(object, isDeep);
-
- case float32Tag: case float64Tag:
- case int8Tag: case int16Tag: case int32Tag:
- case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:
- return (0,_cloneTypedArray/* default */.A)(object, isDeep);
-
- case mapTag:
- return new Ctor;
-
- case numberTag:
- case stringTag:
- return new Ctor(object);
-
- case regexpTag:
- return _cloneRegExp(object);
-
- case setTag:
- return new Ctor;
-
- case symbolTag:
- return _cloneSymbol(object);
- }
-}
-
-/* harmony default export */ const _initCloneByTag = (initCloneByTag);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_initCloneObject.js + 1 modules
-var _initCloneObject = __webpack_require__(18598);
-// EXTERNAL MODULE: ./node_modules/lodash-es/isArray.js
-var isArray = __webpack_require__(92049);
-// EXTERNAL MODULE: ./node_modules/lodash-es/isBuffer.js + 1 modules
-var isBuffer = __webpack_require__(99912);
-// EXTERNAL MODULE: ./node_modules/lodash-es/isObjectLike.js
-var isObjectLike = __webpack_require__(53098);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseIsMap.js
-
-
-
-/** `Object#toString` result references. */
-var _baseIsMap_mapTag = '[object Map]';
-
-/**
- * The base implementation of `_.isMap` without Node.js optimizations.
- *
- * @private
- * @param {*} value The value to check.
- * @returns {boolean} Returns `true` if `value` is a map, else `false`.
- */
-function baseIsMap(value) {
- return (0,isObjectLike/* default */.A)(value) && (0,_getTag/* default */.A)(value) == _baseIsMap_mapTag;
-}
-
-/* harmony default export */ const _baseIsMap = (baseIsMap);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_baseUnary.js
-var _baseUnary = __webpack_require__(52789);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_nodeUtil.js
-var _nodeUtil = __webpack_require__(64841);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/isMap.js
-
-
-
-
-/* Node.js helper references. */
-var nodeIsMap = _nodeUtil/* default */.A && _nodeUtil/* default */.A.isMap;
-
-/**
- * Checks if `value` is classified as a `Map` object.
- *
- * @static
- * @memberOf _
- * @since 4.3.0
- * @category Lang
- * @param {*} value The value to check.
- * @returns {boolean} Returns `true` if `value` is a map, else `false`.
- * @example
- *
- * _.isMap(new Map);
- * // => true
- *
- * _.isMap(new WeakMap);
- * // => false
- */
-var isMap = nodeIsMap ? (0,_baseUnary/* default */.A)(nodeIsMap) : _baseIsMap;
-
-/* harmony default export */ const lodash_es_isMap = (isMap);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/isObject.js
-var isObject = __webpack_require__(23149);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseIsSet.js
-
-
-
-/** `Object#toString` result references. */
-var _baseIsSet_setTag = '[object Set]';
-
-/**
- * The base implementation of `_.isSet` without Node.js optimizations.
- *
- * @private
- * @param {*} value The value to check.
- * @returns {boolean} Returns `true` if `value` is a set, else `false`.
- */
-function baseIsSet(value) {
- return (0,isObjectLike/* default */.A)(value) && (0,_getTag/* default */.A)(value) == _baseIsSet_setTag;
-}
-
-/* harmony default export */ const _baseIsSet = (baseIsSet);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/isSet.js
-
-
-
-
-/* Node.js helper references. */
-var nodeIsSet = _nodeUtil/* default */.A && _nodeUtil/* default */.A.isSet;
-
-/**
- * Checks if `value` is classified as a `Set` object.
- *
- * @static
- * @memberOf _
- * @since 4.3.0
- * @category Lang
- * @param {*} value The value to check.
- * @returns {boolean} Returns `true` if `value` is a set, else `false`.
- * @example
- *
- * _.isSet(new Set);
- * // => true
- *
- * _.isSet(new WeakSet);
- * // => false
- */
-var isSet = nodeIsSet ? (0,_baseUnary/* default */.A)(nodeIsSet) : _baseIsSet;
-
-/* harmony default export */ const lodash_es_isSet = (isSet);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseClone.js
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-/** Used to compose bitmasks for cloning. */
-var CLONE_DEEP_FLAG = 1,
- CLONE_FLAT_FLAG = 2,
- CLONE_SYMBOLS_FLAG = 4;
-
-/** `Object#toString` result references. */
-var argsTag = '[object Arguments]',
- arrayTag = '[object Array]',
- _baseClone_boolTag = '[object Boolean]',
- _baseClone_dateTag = '[object Date]',
- errorTag = '[object Error]',
- funcTag = '[object Function]',
- genTag = '[object GeneratorFunction]',
- _baseClone_mapTag = '[object Map]',
- _baseClone_numberTag = '[object Number]',
- objectTag = '[object Object]',
- _baseClone_regexpTag = '[object RegExp]',
- _baseClone_setTag = '[object Set]',
- _baseClone_stringTag = '[object String]',
- _baseClone_symbolTag = '[object Symbol]',
- weakMapTag = '[object WeakMap]';
-
-var _baseClone_arrayBufferTag = '[object ArrayBuffer]',
- _baseClone_dataViewTag = '[object DataView]',
- _baseClone_float32Tag = '[object Float32Array]',
- _baseClone_float64Tag = '[object Float64Array]',
- _baseClone_int8Tag = '[object Int8Array]',
- _baseClone_int16Tag = '[object Int16Array]',
- _baseClone_int32Tag = '[object Int32Array]',
- _baseClone_uint8Tag = '[object Uint8Array]',
- _baseClone_uint8ClampedTag = '[object Uint8ClampedArray]',
- _baseClone_uint16Tag = '[object Uint16Array]',
- _baseClone_uint32Tag = '[object Uint32Array]';
-
-/** Used to identify `toStringTag` values supported by `_.clone`. */
-var cloneableTags = {};
-cloneableTags[argsTag] = cloneableTags[arrayTag] =
-cloneableTags[_baseClone_arrayBufferTag] = cloneableTags[_baseClone_dataViewTag] =
-cloneableTags[_baseClone_boolTag] = cloneableTags[_baseClone_dateTag] =
-cloneableTags[_baseClone_float32Tag] = cloneableTags[_baseClone_float64Tag] =
-cloneableTags[_baseClone_int8Tag] = cloneableTags[_baseClone_int16Tag] =
-cloneableTags[_baseClone_int32Tag] = cloneableTags[_baseClone_mapTag] =
-cloneableTags[_baseClone_numberTag] = cloneableTags[objectTag] =
-cloneableTags[_baseClone_regexpTag] = cloneableTags[_baseClone_setTag] =
-cloneableTags[_baseClone_stringTag] = cloneableTags[_baseClone_symbolTag] =
-cloneableTags[_baseClone_uint8Tag] = cloneableTags[_baseClone_uint8ClampedTag] =
-cloneableTags[_baseClone_uint16Tag] = cloneableTags[_baseClone_uint32Tag] = true;
-cloneableTags[errorTag] = cloneableTags[funcTag] =
-cloneableTags[weakMapTag] = false;
-
-/**
- * The base implementation of `_.clone` and `_.cloneDeep` which tracks
- * traversed objects.
- *
- * @private
- * @param {*} value The value to clone.
- * @param {boolean} bitmask The bitmask flags.
- * 1 - Deep clone
- * 2 - Flatten inherited properties
- * 4 - Clone symbols
- * @param {Function} [customizer] The function to customize cloning.
- * @param {string} [key] The key of `value`.
- * @param {Object} [object] The parent object of `value`.
- * @param {Object} [stack] Tracks traversed objects and their clone counterparts.
- * @returns {*} Returns the cloned value.
- */
-function baseClone(value, bitmask, customizer, key, object, stack) {
- var result,
- isDeep = bitmask & CLONE_DEEP_FLAG,
- isFlat = bitmask & CLONE_FLAT_FLAG,
- isFull = bitmask & CLONE_SYMBOLS_FLAG;
-
- if (customizer) {
- result = object ? customizer(value, key, object, stack) : customizer(value);
- }
- if (result !== undefined) {
- return result;
- }
- if (!(0,isObject/* default */.A)(value)) {
- return value;
- }
- var isArr = (0,isArray/* default */.A)(value);
- if (isArr) {
- result = _initCloneArray(value);
- if (!isDeep) {
- return (0,_copyArray/* default */.A)(value, result);
- }
- } else {
- var tag = (0,_getTag/* default */.A)(value),
- isFunc = tag == funcTag || tag == genTag;
-
- if ((0,isBuffer/* default */.A)(value)) {
- return (0,_cloneBuffer/* default */.A)(value, isDeep);
- }
- if (tag == objectTag || tag == argsTag || (isFunc && !object)) {
- result = (isFlat || isFunc) ? {} : (0,_initCloneObject/* default */.A)(value);
- if (!isDeep) {
- return isFlat
- ? _copySymbolsIn(value, _baseAssignIn(result, value))
- : _copySymbols(value, _baseAssign(result, value));
- }
- } else {
- if (!cloneableTags[tag]) {
- return object ? value : {};
- }
- result = _initCloneByTag(value, tag, isDeep);
- }
- }
- // Check for circular references and return its corresponding clone.
- stack || (stack = new _Stack/* default */.A);
- var stacked = stack.get(value);
- if (stacked) {
- return stacked;
- }
- stack.set(value, result);
-
- if (lodash_es_isSet(value)) {
- value.forEach(function(subValue) {
- result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));
- });
- } else if (lodash_es_isMap(value)) {
- value.forEach(function(subValue, key) {
- result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));
- });
- }
-
- var keysFunc = isFull
- ? (isFlat ? _getAllKeysIn : _getAllKeys/* default */.A)
- : (isFlat ? keysIn/* default */.A : keys/* default */.A);
-
- var props = isArr ? undefined : keysFunc(value);
- (0,_arrayEach/* default */.A)(props || value, function(subValue, key) {
- if (props) {
- key = subValue;
- subValue = value[key];
- }
- // Recursively populate clone (susceptible to call stack limits).
- (0,_assignValue/* default */.A)(result, key, baseClone(subValue, bitmask, customizer, key, value, stack));
- });
- return result;
-}
-
-/* harmony default export */ const _baseClone = (baseClone);
-
-
-/***/ }),
-
-/***/ 6240:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-
-// EXPORTS
-__webpack_require__.d(__webpack_exports__, {
- A: () => (/* binding */ _baseEach)
-});
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_baseForOwn.js
-var _baseForOwn = __webpack_require__(79841);
-// EXTERNAL MODULE: ./node_modules/lodash-es/isArrayLike.js
-var isArrayLike = __webpack_require__(38446);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_createBaseEach.js
-
-
-/**
- * Creates a `baseEach` or `baseEachRight` function.
- *
- * @private
- * @param {Function} eachFunc The function to iterate over a collection.
- * @param {boolean} [fromRight] Specify iterating from right to left.
- * @returns {Function} Returns the new base function.
- */
-function createBaseEach(eachFunc, fromRight) {
- return function(collection, iteratee) {
- if (collection == null) {
- return collection;
- }
- if (!(0,isArrayLike/* default */.A)(collection)) {
- return eachFunc(collection, iteratee);
- }
- var length = collection.length,
- index = fromRight ? length : -1,
- iterable = Object(collection);
-
- while ((fromRight ? index-- : ++index < length)) {
- if (iteratee(iterable[index], index, iterable) === false) {
- break;
- }
- }
- return collection;
- };
-}
-
-/* harmony default export */ const _createBaseEach = (createBaseEach);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseEach.js
-
-
-
-/**
- * The base implementation of `_.forEach` without support for iteratee shorthands.
- *
- * @private
- * @param {Array|Object} collection The collection to iterate over.
- * @param {Function} iteratee The function invoked per iteration.
- * @returns {Array|Object} Returns `collection`.
- */
-var baseEach = _createBaseEach(_baseForOwn/* default */.A);
-
-/* harmony default export */ const _baseEach = (baseEach);
-
-
-/***/ }),
-
-/***/ 25707:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ A: () => (__WEBPACK_DEFAULT_EXPORT__)
-/* harmony export */ });
-/**
- * The base implementation of `_.findIndex` and `_.findLastIndex` without
- * support for iteratee shorthands.
- *
- * @private
- * @param {Array} array The array to inspect.
- * @param {Function} predicate The function invoked per iteration.
- * @param {number} fromIndex The index to search from.
- * @param {boolean} [fromRight] Specify iterating from right to left.
- * @returns {number} Returns the index of the matched value, else `-1`.
- */
-function baseFindIndex(array, predicate, fromIndex, fromRight) {
- var length = array.length,
- index = fromIndex + (fromRight ? 1 : -1);
-
- while ((fromRight ? index-- : ++index < length)) {
- if (predicate(array[index], index, array)) {
- return index;
- }
- }
- return -1;
-}
-
-/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (baseFindIndex);
-
-
-/***/ }),
-
-/***/ 13588:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-
-// EXPORTS
-__webpack_require__.d(__webpack_exports__, {
- A: () => (/* binding */ _baseFlatten)
-});
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_arrayPush.js
-var _arrayPush = __webpack_require__(76912);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_Symbol.js
-var _Symbol = __webpack_require__(241);
-// EXTERNAL MODULE: ./node_modules/lodash-es/isArguments.js + 1 modules
-var isArguments = __webpack_require__(52274);
-// EXTERNAL MODULE: ./node_modules/lodash-es/isArray.js
-var isArray = __webpack_require__(92049);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_isFlattenable.js
-
-
-
-
-/** Built-in value references. */
-var spreadableSymbol = _Symbol/* default */.A ? _Symbol/* default */.A.isConcatSpreadable : undefined;
-
-/**
- * Checks if `value` is a flattenable `arguments` object or array.
- *
- * @private
- * @param {*} value The value to check.
- * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.
- */
-function isFlattenable(value) {
- return (0,isArray/* default */.A)(value) || (0,isArguments/* default */.A)(value) ||
- !!(spreadableSymbol && value && value[spreadableSymbol]);
-}
-
-/* harmony default export */ const _isFlattenable = (isFlattenable);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseFlatten.js
-
-
-
-/**
- * The base implementation of `_.flatten` with support for restricting flattening.
- *
- * @private
- * @param {Array} array The array to flatten.
- * @param {number} depth The maximum recursion depth.
- * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.
- * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.
- * @param {Array} [result=[]] The initial result value.
- * @returns {Array} Returns the new flattened array.
- */
-function baseFlatten(array, depth, predicate, isStrict, result) {
- var index = -1,
- length = array.length;
-
- predicate || (predicate = _isFlattenable);
- result || (result = []);
-
- while (++index < length) {
- var value = array[index];
- if (depth > 0 && predicate(value)) {
- if (depth > 1) {
- // Recursively flatten arrays (susceptible to call stack limits).
- baseFlatten(value, depth - 1, predicate, isStrict, result);
- } else {
- (0,_arrayPush/* default */.A)(result, value);
- }
- } else if (!isStrict) {
- result[result.length] = value;
- }
- }
- return result;
-}
-
-/* harmony default export */ const _baseFlatten = (baseFlatten);
-
-
-/***/ }),
-
-/***/ 79841:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ A: () => (__WEBPACK_DEFAULT_EXPORT__)
-/* harmony export */ });
-/* harmony import */ var _baseFor_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(4574);
-/* harmony import */ var _keys_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(27422);
-
-
-
-/**
- * The base implementation of `_.forOwn` without support for iteratee shorthands.
- *
- * @private
- * @param {Object} object The object to iterate over.
- * @param {Function} iteratee The function invoked per iteration.
- * @returns {Object} Returns `object`.
- */
-function baseForOwn(object, iteratee) {
- return object && (0,_baseFor_js__WEBPACK_IMPORTED_MODULE_0__/* ["default"] */ .A)(object, iteratee, _keys_js__WEBPACK_IMPORTED_MODULE_1__/* ["default"] */ .A);
-}
-
-/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (baseForOwn);
-
-
-/***/ }),
-
-/***/ 66318:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ A: () => (__WEBPACK_DEFAULT_EXPORT__)
-/* harmony export */ });
-/* harmony import */ var _castPath_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(7819);
-/* harmony import */ var _toKey_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(30901);
-
-
-
-/**
- * The base implementation of `_.get` without support for default values.
- *
- * @private
- * @param {Object} object The object to query.
- * @param {Array|string} path The path of the property to get.
- * @returns {*} Returns the resolved value.
- */
-function baseGet(object, path) {
- path = (0,_castPath_js__WEBPACK_IMPORTED_MODULE_0__/* ["default"] */ .A)(path, object);
-
- var index = 0,
- length = path.length;
-
- while (object != null && index < length) {
- object = object[(0,_toKey_js__WEBPACK_IMPORTED_MODULE_1__/* ["default"] */ .A)(path[index++])];
- }
- return (index && index == length) ? object : undefined;
-}
-
-/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (baseGet);
-
-
-/***/ }),
-
-/***/ 33831:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ A: () => (__WEBPACK_DEFAULT_EXPORT__)
-/* harmony export */ });
-/* harmony import */ var _arrayPush_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(76912);
-/* harmony import */ var _isArray_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(92049);
-
-
-
-/**
- * The base implementation of `getAllKeys` and `getAllKeysIn` which uses
- * `keysFunc` and `symbolsFunc` to get the enumerable property names and
- * symbols of `object`.
- *
- * @private
- * @param {Object} object The object to query.
- * @param {Function} keysFunc The function to get the keys of `object`.
- * @param {Function} symbolsFunc The function to get the symbols of `object`.
- * @returns {Array} Returns the array of property names and symbols.
- */
-function baseGetAllKeys(object, keysFunc, symbolsFunc) {
- var result = keysFunc(object);
- return (0,_isArray_js__WEBPACK_IMPORTED_MODULE_0__/* ["default"] */ .A)(object) ? result : (0,_arrayPush_js__WEBPACK_IMPORTED_MODULE_1__/* ["default"] */ .A)(result, symbolsFunc(object));
-}
-
-/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (baseGetAllKeys);
-
-
-/***/ }),
-
-/***/ 49574:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-
-// EXPORTS
-__webpack_require__.d(__webpack_exports__, {
- A: () => (/* binding */ _baseIteratee)
-});
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_Stack.js + 5 modules
-var _Stack = __webpack_require__(11754);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_SetCache.js + 2 modules
-var _SetCache = __webpack_require__(62062);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_arraySome.js
-/**
- * A specialized version of `_.some` for arrays without support for iteratee
- * shorthands.
- *
- * @private
- * @param {Array} [array] The array to iterate over.
- * @param {Function} predicate The function invoked per iteration.
- * @returns {boolean} Returns `true` if any element passes the predicate check,
- * else `false`.
- */
-function arraySome(array, predicate) {
- var index = -1,
- length = array == null ? 0 : array.length;
-
- while (++index < length) {
- if (predicate(array[index], index, array)) {
- return true;
- }
- }
- return false;
-}
-
-/* harmony default export */ const _arraySome = (arraySome);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_cacheHas.js
-var _cacheHas = __webpack_require__(64099);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_equalArrays.js
-
-
-
-
-/** Used to compose bitmasks for value comparisons. */
-var COMPARE_PARTIAL_FLAG = 1,
- COMPARE_UNORDERED_FLAG = 2;
-
-/**
- * A specialized version of `baseIsEqualDeep` for arrays with support for
- * partial deep comparisons.
- *
- * @private
- * @param {Array} array The array to compare.
- * @param {Array} other The other array to compare.
- * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
- * @param {Function} customizer The function to customize comparisons.
- * @param {Function} equalFunc The function to determine equivalents of values.
- * @param {Object} stack Tracks traversed `array` and `other` objects.
- * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.
- */
-function equalArrays(array, other, bitmask, customizer, equalFunc, stack) {
- var isPartial = bitmask & COMPARE_PARTIAL_FLAG,
- arrLength = array.length,
- othLength = other.length;
-
- if (arrLength != othLength && !(isPartial && othLength > arrLength)) {
- return false;
- }
- // Check that cyclic values are equal.
- var arrStacked = stack.get(array);
- var othStacked = stack.get(other);
- if (arrStacked && othStacked) {
- return arrStacked == other && othStacked == array;
- }
- var index = -1,
- result = true,
- seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new _SetCache/* default */.A : undefined;
-
- stack.set(array, other);
- stack.set(other, array);
-
- // Ignore non-index properties.
- while (++index < arrLength) {
- var arrValue = array[index],
- othValue = other[index];
-
- if (customizer) {
- var compared = isPartial
- ? customizer(othValue, arrValue, index, other, array, stack)
- : customizer(arrValue, othValue, index, array, other, stack);
- }
- if (compared !== undefined) {
- if (compared) {
- continue;
- }
- result = false;
- break;
- }
- // Recursively compare arrays (susceptible to call stack limits).
- if (seen) {
- if (!_arraySome(other, function(othValue, othIndex) {
- if (!(0,_cacheHas/* default */.A)(seen, othIndex) &&
- (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {
- return seen.push(othIndex);
- }
- })) {
- result = false;
- break;
- }
- } else if (!(
- arrValue === othValue ||
- equalFunc(arrValue, othValue, bitmask, customizer, stack)
- )) {
- result = false;
- break;
- }
- }
- stack['delete'](array);
- stack['delete'](other);
- return result;
-}
-
-/* harmony default export */ const _equalArrays = (equalArrays);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_Symbol.js
-var _Symbol = __webpack_require__(241);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_Uint8Array.js
-var _Uint8Array = __webpack_require__(43988);
-// EXTERNAL MODULE: ./node_modules/lodash-es/eq.js
-var eq = __webpack_require__(66984);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_mapToArray.js
-/**
- * Converts `map` to its key-value pairs.
- *
- * @private
- * @param {Object} map The map to convert.
- * @returns {Array} Returns the key-value pairs.
- */
-function mapToArray(map) {
- var index = -1,
- result = Array(map.size);
-
- map.forEach(function(value, key) {
- result[++index] = [key, value];
- });
- return result;
-}
-
-/* harmony default export */ const _mapToArray = (mapToArray);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_setToArray.js
-var _setToArray = __webpack_require__(29959);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_equalByTag.js
-
-
-
-
-
-
-
-/** Used to compose bitmasks for value comparisons. */
-var _equalByTag_COMPARE_PARTIAL_FLAG = 1,
- _equalByTag_COMPARE_UNORDERED_FLAG = 2;
-
-/** `Object#toString` result references. */
-var boolTag = '[object Boolean]',
- dateTag = '[object Date]',
- errorTag = '[object Error]',
- mapTag = '[object Map]',
- numberTag = '[object Number]',
- regexpTag = '[object RegExp]',
- setTag = '[object Set]',
- stringTag = '[object String]',
- symbolTag = '[object Symbol]';
-
-var arrayBufferTag = '[object ArrayBuffer]',
- dataViewTag = '[object DataView]';
-
-/** Used to convert symbols to primitives and strings. */
-var symbolProto = _Symbol/* default */.A ? _Symbol/* default */.A.prototype : undefined,
- symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;
-
-/**
- * A specialized version of `baseIsEqualDeep` for comparing objects of
- * the same `toStringTag`.
- *
- * **Note:** This function only supports comparing values with tags of
- * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.
- *
- * @private
- * @param {Object} object The object to compare.
- * @param {Object} other The other object to compare.
- * @param {string} tag The `toStringTag` of the objects to compare.
- * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
- * @param {Function} customizer The function to customize comparisons.
- * @param {Function} equalFunc The function to determine equivalents of values.
- * @param {Object} stack Tracks traversed `object` and `other` objects.
- * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
- */
-function equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {
- switch (tag) {
- case dataViewTag:
- if ((object.byteLength != other.byteLength) ||
- (object.byteOffset != other.byteOffset)) {
- return false;
- }
- object = object.buffer;
- other = other.buffer;
-
- case arrayBufferTag:
- if ((object.byteLength != other.byteLength) ||
- !equalFunc(new _Uint8Array/* default */.A(object), new _Uint8Array/* default */.A(other))) {
- return false;
- }
- return true;
-
- case boolTag:
- case dateTag:
- case numberTag:
- // Coerce booleans to `1` or `0` and dates to milliseconds.
- // Invalid dates are coerced to `NaN`.
- return (0,eq/* default */.A)(+object, +other);
-
- case errorTag:
- return object.name == other.name && object.message == other.message;
-
- case regexpTag:
- case stringTag:
- // Coerce regexes to strings and treat strings, primitives and objects,
- // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring
- // for more details.
- return object == (other + '');
-
- case mapTag:
- var convert = _mapToArray;
-
- case setTag:
- var isPartial = bitmask & _equalByTag_COMPARE_PARTIAL_FLAG;
- convert || (convert = _setToArray/* default */.A);
-
- if (object.size != other.size && !isPartial) {
- return false;
- }
- // Assume cyclic values are equal.
- var stacked = stack.get(object);
- if (stacked) {
- return stacked == other;
- }
- bitmask |= _equalByTag_COMPARE_UNORDERED_FLAG;
-
- // Recursively compare objects (susceptible to call stack limits).
- stack.set(object, other);
- var result = _equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);
- stack['delete'](object);
- return result;
-
- case symbolTag:
- if (symbolValueOf) {
- return symbolValueOf.call(object) == symbolValueOf.call(other);
- }
- }
- return false;
-}
-
-/* harmony default export */ const _equalByTag = (equalByTag);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_getAllKeys.js
-var _getAllKeys = __webpack_require__(19042);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_equalObjects.js
-
-
-/** Used to compose bitmasks for value comparisons. */
-var _equalObjects_COMPARE_PARTIAL_FLAG = 1;
-
-/** Used for built-in method references. */
-var objectProto = Object.prototype;
-
-/** Used to check objects for own properties. */
-var _equalObjects_hasOwnProperty = objectProto.hasOwnProperty;
-
-/**
- * A specialized version of `baseIsEqualDeep` for objects with support for
- * partial deep comparisons.
- *
- * @private
- * @param {Object} object The object to compare.
- * @param {Object} other The other object to compare.
- * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
- * @param {Function} customizer The function to customize comparisons.
- * @param {Function} equalFunc The function to determine equivalents of values.
- * @param {Object} stack Tracks traversed `object` and `other` objects.
- * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
- */
-function equalObjects(object, other, bitmask, customizer, equalFunc, stack) {
- var isPartial = bitmask & _equalObjects_COMPARE_PARTIAL_FLAG,
- objProps = (0,_getAllKeys/* default */.A)(object),
- objLength = objProps.length,
- othProps = (0,_getAllKeys/* default */.A)(other),
- othLength = othProps.length;
-
- if (objLength != othLength && !isPartial) {
- return false;
- }
- var index = objLength;
- while (index--) {
- var key = objProps[index];
- if (!(isPartial ? key in other : _equalObjects_hasOwnProperty.call(other, key))) {
- return false;
- }
- }
- // Check that cyclic values are equal.
- var objStacked = stack.get(object);
- var othStacked = stack.get(other);
- if (objStacked && othStacked) {
- return objStacked == other && othStacked == object;
- }
- var result = true;
- stack.set(object, other);
- stack.set(other, object);
-
- var skipCtor = isPartial;
- while (++index < objLength) {
- key = objProps[index];
- var objValue = object[key],
- othValue = other[key];
-
- if (customizer) {
- var compared = isPartial
- ? customizer(othValue, objValue, key, other, object, stack)
- : customizer(objValue, othValue, key, object, other, stack);
- }
- // Recursively compare objects (susceptible to call stack limits).
- if (!(compared === undefined
- ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))
- : compared
- )) {
- result = false;
- break;
- }
- skipCtor || (skipCtor = key == 'constructor');
- }
- if (result && !skipCtor) {
- var objCtor = object.constructor,
- othCtor = other.constructor;
-
- // Non `Object` object instances with different constructors are not equal.
- if (objCtor != othCtor &&
- ('constructor' in object && 'constructor' in other) &&
- !(typeof objCtor == 'function' && objCtor instanceof objCtor &&
- typeof othCtor == 'function' && othCtor instanceof othCtor)) {
- result = false;
- }
- }
- stack['delete'](object);
- stack['delete'](other);
- return result;
-}
-
-/* harmony default export */ const _equalObjects = (equalObjects);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_getTag.js + 3 modules
-var _getTag = __webpack_require__(9779);
-// EXTERNAL MODULE: ./node_modules/lodash-es/isArray.js
-var isArray = __webpack_require__(92049);
-// EXTERNAL MODULE: ./node_modules/lodash-es/isBuffer.js + 1 modules
-var isBuffer = __webpack_require__(99912);
-// EXTERNAL MODULE: ./node_modules/lodash-es/isTypedArray.js + 1 modules
-var isTypedArray = __webpack_require__(33858);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseIsEqualDeep.js
-
-
-
-
-
-
-
-
-
-/** Used to compose bitmasks for value comparisons. */
-var _baseIsEqualDeep_COMPARE_PARTIAL_FLAG = 1;
-
-/** `Object#toString` result references. */
-var argsTag = '[object Arguments]',
- arrayTag = '[object Array]',
- objectTag = '[object Object]';
-
-/** Used for built-in method references. */
-var _baseIsEqualDeep_objectProto = Object.prototype;
-
-/** Used to check objects for own properties. */
-var _baseIsEqualDeep_hasOwnProperty = _baseIsEqualDeep_objectProto.hasOwnProperty;
-
-/**
- * A specialized version of `baseIsEqual` for arrays and objects which performs
- * deep comparisons and tracks traversed objects enabling objects with circular
- * references to be compared.
- *
- * @private
- * @param {Object} object The object to compare.
- * @param {Object} other The other object to compare.
- * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
- * @param {Function} customizer The function to customize comparisons.
- * @param {Function} equalFunc The function to determine equivalents of values.
- * @param {Object} [stack] Tracks traversed `object` and `other` objects.
- * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
- */
-function baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {
- var objIsArr = (0,isArray/* default */.A)(object),
- othIsArr = (0,isArray/* default */.A)(other),
- objTag = objIsArr ? arrayTag : (0,_getTag/* default */.A)(object),
- othTag = othIsArr ? arrayTag : (0,_getTag/* default */.A)(other);
-
- objTag = objTag == argsTag ? objectTag : objTag;
- othTag = othTag == argsTag ? objectTag : othTag;
-
- var objIsObj = objTag == objectTag,
- othIsObj = othTag == objectTag,
- isSameTag = objTag == othTag;
-
- if (isSameTag && (0,isBuffer/* default */.A)(object)) {
- if (!(0,isBuffer/* default */.A)(other)) {
- return false;
- }
- objIsArr = true;
- objIsObj = false;
- }
- if (isSameTag && !objIsObj) {
- stack || (stack = new _Stack/* default */.A);
- return (objIsArr || (0,isTypedArray/* default */.A)(object))
- ? _equalArrays(object, other, bitmask, customizer, equalFunc, stack)
- : _equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);
- }
- if (!(bitmask & _baseIsEqualDeep_COMPARE_PARTIAL_FLAG)) {
- var objIsWrapped = objIsObj && _baseIsEqualDeep_hasOwnProperty.call(object, '__wrapped__'),
- othIsWrapped = othIsObj && _baseIsEqualDeep_hasOwnProperty.call(other, '__wrapped__');
-
- if (objIsWrapped || othIsWrapped) {
- var objUnwrapped = objIsWrapped ? object.value() : object,
- othUnwrapped = othIsWrapped ? other.value() : other;
-
- stack || (stack = new _Stack/* default */.A);
- return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);
- }
- }
- if (!isSameTag) {
- return false;
- }
- stack || (stack = new _Stack/* default */.A);
- return _equalObjects(object, other, bitmask, customizer, equalFunc, stack);
-}
-
-/* harmony default export */ const _baseIsEqualDeep = (baseIsEqualDeep);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/isObjectLike.js
-var isObjectLike = __webpack_require__(53098);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseIsEqual.js
-
-
-
-/**
- * The base implementation of `_.isEqual` which supports partial comparisons
- * and tracks traversed objects.
- *
- * @private
- * @param {*} value The value to compare.
- * @param {*} other The other value to compare.
- * @param {boolean} bitmask The bitmask flags.
- * 1 - Unordered comparison
- * 2 - Partial comparison
- * @param {Function} [customizer] The function to customize comparisons.
- * @param {Object} [stack] Tracks traversed `value` and `other` objects.
- * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
- */
-function baseIsEqual(value, other, bitmask, customizer, stack) {
- if (value === other) {
- return true;
- }
- if (value == null || other == null || (!(0,isObjectLike/* default */.A)(value) && !(0,isObjectLike/* default */.A)(other))) {
- return value !== value && other !== other;
- }
- return _baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);
-}
-
-/* harmony default export */ const _baseIsEqual = (baseIsEqual);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseIsMatch.js
-
-
-
-/** Used to compose bitmasks for value comparisons. */
-var _baseIsMatch_COMPARE_PARTIAL_FLAG = 1,
- _baseIsMatch_COMPARE_UNORDERED_FLAG = 2;
-
-/**
- * The base implementation of `_.isMatch` without support for iteratee shorthands.
- *
- * @private
- * @param {Object} object The object to inspect.
- * @param {Object} source The object of property values to match.
- * @param {Array} matchData The property names, values, and compare flags to match.
- * @param {Function} [customizer] The function to customize comparisons.
- * @returns {boolean} Returns `true` if `object` is a match, else `false`.
- */
-function baseIsMatch(object, source, matchData, customizer) {
- var index = matchData.length,
- length = index,
- noCustomizer = !customizer;
-
- if (object == null) {
- return !length;
- }
- object = Object(object);
- while (index--) {
- var data = matchData[index];
- if ((noCustomizer && data[2])
- ? data[1] !== object[data[0]]
- : !(data[0] in object)
- ) {
- return false;
- }
- }
- while (++index < length) {
- data = matchData[index];
- var key = data[0],
- objValue = object[key],
- srcValue = data[1];
-
- if (noCustomizer && data[2]) {
- if (objValue === undefined && !(key in object)) {
- return false;
- }
- } else {
- var stack = new _Stack/* default */.A;
- if (customizer) {
- var result = customizer(objValue, srcValue, key, object, source, stack);
- }
- if (!(result === undefined
- ? _baseIsEqual(srcValue, objValue, _baseIsMatch_COMPARE_PARTIAL_FLAG | _baseIsMatch_COMPARE_UNORDERED_FLAG, customizer, stack)
- : result
- )) {
- return false;
- }
- }
- }
- return true;
-}
-
-/* harmony default export */ const _baseIsMatch = (baseIsMatch);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/isObject.js
-var isObject = __webpack_require__(23149);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_isStrictComparable.js
-
-
-/**
- * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.
- *
- * @private
- * @param {*} value The value to check.
- * @returns {boolean} Returns `true` if `value` if suitable for strict
- * equality comparisons, else `false`.
- */
-function isStrictComparable(value) {
- return value === value && !(0,isObject/* default */.A)(value);
-}
-
-/* harmony default export */ const _isStrictComparable = (isStrictComparable);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/keys.js
-var keys = __webpack_require__(27422);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_getMatchData.js
-
-
-
-/**
- * Gets the property names, values, and compare flags of `object`.
- *
- * @private
- * @param {Object} object The object to query.
- * @returns {Array} Returns the match data of `object`.
- */
-function getMatchData(object) {
- var result = (0,keys/* default */.A)(object),
- length = result.length;
-
- while (length--) {
- var key = result[length],
- value = object[key];
-
- result[length] = [key, value, _isStrictComparable(value)];
- }
- return result;
-}
-
-/* harmony default export */ const _getMatchData = (getMatchData);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_matchesStrictComparable.js
-/**
- * A specialized version of `matchesProperty` for source values suitable
- * for strict equality comparisons, i.e. `===`.
- *
- * @private
- * @param {string} key The key of the property to get.
- * @param {*} srcValue The value to match.
- * @returns {Function} Returns the new spec function.
- */
-function matchesStrictComparable(key, srcValue) {
- return function(object) {
- if (object == null) {
- return false;
- }
- return object[key] === srcValue &&
- (srcValue !== undefined || (key in Object(object)));
- };
-}
-
-/* harmony default export */ const _matchesStrictComparable = (matchesStrictComparable);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseMatches.js
-
-
-
-
-/**
- * The base implementation of `_.matches` which doesn't clone `source`.
- *
- * @private
- * @param {Object} source The object of property values to match.
- * @returns {Function} Returns the new spec function.
- */
-function baseMatches(source) {
- var matchData = _getMatchData(source);
- if (matchData.length == 1 && matchData[0][2]) {
- return _matchesStrictComparable(matchData[0][0], matchData[0][1]);
- }
- return function(object) {
- return object === source || _baseIsMatch(object, source, matchData);
- };
-}
-
-/* harmony default export */ const _baseMatches = (baseMatches);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_baseGet.js
-var _baseGet = __webpack_require__(66318);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/get.js
-
-
-/**
- * Gets the value at `path` of `object`. If the resolved value is
- * `undefined`, the `defaultValue` is returned in its place.
- *
- * @static
- * @memberOf _
- * @since 3.7.0
- * @category Object
- * @param {Object} object The object to query.
- * @param {Array|string} path The path of the property to get.
- * @param {*} [defaultValue] The value returned for `undefined` resolved values.
- * @returns {*} Returns the resolved value.
- * @example
- *
- * var object = { 'a': [{ 'b': { 'c': 3 } }] };
- *
- * _.get(object, 'a[0].b.c');
- * // => 3
- *
- * _.get(object, ['a', '0', 'b', 'c']);
- * // => 3
- *
- * _.get(object, 'a.b.c', 'default');
- * // => 'default'
- */
-function get(object, path, defaultValue) {
- var result = object == null ? undefined : (0,_baseGet/* default */.A)(object, path);
- return result === undefined ? defaultValue : result;
-}
-
-/* harmony default export */ const lodash_es_get = (get);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/hasIn.js + 1 modules
-var hasIn = __webpack_require__(39188);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_isKey.js
-var _isKey = __webpack_require__(86586);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_toKey.js
-var _toKey = __webpack_require__(30901);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseMatchesProperty.js
-
-
-
-
-
-
-
-
-/** Used to compose bitmasks for value comparisons. */
-var _baseMatchesProperty_COMPARE_PARTIAL_FLAG = 1,
- _baseMatchesProperty_COMPARE_UNORDERED_FLAG = 2;
-
-/**
- * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.
- *
- * @private
- * @param {string} path The path of the property to get.
- * @param {*} srcValue The value to match.
- * @returns {Function} Returns the new spec function.
- */
-function baseMatchesProperty(path, srcValue) {
- if ((0,_isKey/* default */.A)(path) && _isStrictComparable(srcValue)) {
- return _matchesStrictComparable((0,_toKey/* default */.A)(path), srcValue);
- }
- return function(object) {
- var objValue = lodash_es_get(object, path);
- return (objValue === undefined && objValue === srcValue)
- ? (0,hasIn/* default */.A)(object, path)
- : _baseIsEqual(srcValue, objValue, _baseMatchesProperty_COMPARE_PARTIAL_FLAG | _baseMatchesProperty_COMPARE_UNORDERED_FLAG);
- };
-}
-
-/* harmony default export */ const _baseMatchesProperty = (baseMatchesProperty);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/identity.js
-var identity = __webpack_require__(29008);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_baseProperty.js
-var _baseProperty = __webpack_require__(70805);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_basePropertyDeep.js
-
-
-/**
- * A specialized version of `baseProperty` which supports deep paths.
- *
- * @private
- * @param {Array|string} path The path of the property to get.
- * @returns {Function} Returns the new accessor function.
- */
-function basePropertyDeep(path) {
- return function(object) {
- return (0,_baseGet/* default */.A)(object, path);
- };
-}
-
-/* harmony default export */ const _basePropertyDeep = (basePropertyDeep);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/property.js
-
-
-
-
-
-/**
- * Creates a function that returns the value at `path` of a given object.
- *
- * @static
- * @memberOf _
- * @since 2.4.0
- * @category Util
- * @param {Array|string} path The path of the property to get.
- * @returns {Function} Returns the new accessor function.
- * @example
- *
- * var objects = [
- * { 'a': { 'b': 2 } },
- * { 'a': { 'b': 1 } }
- * ];
- *
- * _.map(objects, _.property('a.b'));
- * // => [2, 1]
- *
- * _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b');
- * // => [1, 2]
- */
-function property(path) {
- return (0,_isKey/* default */.A)(path) ? (0,_baseProperty/* default */.A)((0,_toKey/* default */.A)(path)) : _basePropertyDeep(path);
-}
-
-/* harmony default export */ const lodash_es_property = (property);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseIteratee.js
-
-
-
-
-
-
-/**
- * The base implementation of `_.iteratee`.
- *
- * @private
- * @param {*} [value=_.identity] The value to convert to an iteratee.
- * @returns {Function} Returns the iteratee.
- */
-function baseIteratee(value) {
- // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.
- // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.
- if (typeof value == 'function') {
- return value;
- }
- if (value == null) {
- return identity/* default */.A;
- }
- if (typeof value == 'object') {
- return (0,isArray/* default */.A)(value)
- ? _baseMatchesProperty(value[0], value[1])
- : _baseMatches(value);
- }
- return lodash_es_property(value);
-}
-
-/* harmony default export */ const _baseIteratee = (baseIteratee);
-
-
-/***/ }),
-
-/***/ 52568:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ A: () => (__WEBPACK_DEFAULT_EXPORT__)
-/* harmony export */ });
-/* harmony import */ var _baseEach_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(6240);
-/* harmony import */ var _isArrayLike_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(38446);
-
-
-
-/**
- * The base implementation of `_.map` without support for iteratee shorthands.
- *
- * @private
- * @param {Array|Object} collection The collection to iterate over.
- * @param {Function} iteratee The function invoked per iteration.
- * @returns {Array} Returns the new mapped array.
- */
-function baseMap(collection, iteratee) {
- var index = -1,
- result = (0,_isArrayLike_js__WEBPACK_IMPORTED_MODULE_0__/* ["default"] */ .A)(collection) ? Array(collection.length) : [];
-
- (0,_baseEach_js__WEBPACK_IMPORTED_MODULE_1__/* ["default"] */ .A)(collection, function(value, key, collection) {
- result[++index] = iteratee(value, key, collection);
- });
- return result;
-}
-
-/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (baseMap);
-
-
-/***/ }),
-
-/***/ 70805:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ A: () => (__WEBPACK_DEFAULT_EXPORT__)
-/* harmony export */ });
-/**
- * The base implementation of `_.property` without support for deep paths.
- *
- * @private
- * @param {string} key The key of the property to get.
- * @returns {Function} Returns the new accessor function.
- */
-function baseProperty(key) {
- return function(object) {
- return object == null ? undefined : object[key];
- };
-}
-
-/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (baseProperty);
-
-
-/***/ }),
-
-/***/ 64099:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ A: () => (__WEBPACK_DEFAULT_EXPORT__)
-/* harmony export */ });
-/**
- * Checks if a `cache` value for `key` exists.
- *
- * @private
- * @param {Object} cache The cache to query.
- * @param {string} key The key of the entry to check.
- * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
- */
-function cacheHas(cache, key) {
- return cache.has(key);
-}
-
-/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (cacheHas);
-
-
-/***/ }),
-
-/***/ 99922:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ A: () => (__WEBPACK_DEFAULT_EXPORT__)
-/* harmony export */ });
-/* harmony import */ var _identity_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(29008);
-
-
-/**
- * Casts `value` to `identity` if it's not a function.
- *
- * @private
- * @param {*} value The value to inspect.
- * @returns {Function} Returns cast function.
- */
-function castFunction(value) {
- return typeof value == 'function' ? value : _identity_js__WEBPACK_IMPORTED_MODULE_0__/* ["default"] */ .A;
-}
-
-/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (castFunction);
-
-
-/***/ }),
-
-/***/ 7819:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-
-// EXPORTS
-__webpack_require__.d(__webpack_exports__, {
- A: () => (/* binding */ _castPath)
-});
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/isArray.js
-var isArray = __webpack_require__(92049);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_isKey.js
-var _isKey = __webpack_require__(86586);
-// EXTERNAL MODULE: ./node_modules/lodash-es/memoize.js
-var memoize = __webpack_require__(46632);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_memoizeCapped.js
-
-
-/** Used as the maximum memoize cache size. */
-var MAX_MEMOIZE_SIZE = 500;
-
-/**
- * A specialized version of `_.memoize` which clears the memoized function's
- * cache when it exceeds `MAX_MEMOIZE_SIZE`.
- *
- * @private
- * @param {Function} func The function to have its output memoized.
- * @returns {Function} Returns the new memoized function.
- */
-function memoizeCapped(func) {
- var result = (0,memoize/* default */.A)(func, function(key) {
- if (cache.size === MAX_MEMOIZE_SIZE) {
- cache.clear();
- }
- return key;
- });
-
- var cache = result.cache;
- return result;
-}
-
-/* harmony default export */ const _memoizeCapped = (memoizeCapped);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_stringToPath.js
-
-
-/** Used to match property names within property paths. */
-var rePropName = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g;
-
-/** Used to match backslashes in property paths. */
-var reEscapeChar = /\\(\\)?/g;
-
-/**
- * Converts `string` to a property path array.
- *
- * @private
- * @param {string} string The string to convert.
- * @returns {Array} Returns the property path array.
- */
-var stringToPath = _memoizeCapped(function(string) {
- var result = [];
- if (string.charCodeAt(0) === 46 /* . */) {
- result.push('');
- }
- string.replace(rePropName, function(match, number, quote, subString) {
- result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));
- });
- return result;
-});
-
-/* harmony default export */ const _stringToPath = (stringToPath);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/toString.js + 1 modules
-var lodash_es_toString = __webpack_require__(28894);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_castPath.js
-
-
-
-
-
-/**
- * Casts `value` to a path array if it's not one.
- *
- * @private
- * @param {*} value The value to inspect.
- * @param {Object} [object] The object to query keys on.
- * @returns {Array} Returns the cast property path array.
- */
-function castPath(value, object) {
- if ((0,isArray/* default */.A)(value)) {
- return value;
- }
- return (0,_isKey/* default */.A)(value, object) ? [value] : _stringToPath((0,lodash_es_toString/* default */.A)(value));
-}
-
-/* harmony default export */ const _castPath = (castPath);
-
-
-/***/ }),
-
-/***/ 19042:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ A: () => (__WEBPACK_DEFAULT_EXPORT__)
-/* harmony export */ });
-/* harmony import */ var _baseGetAllKeys_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(33831);
-/* harmony import */ var _getSymbols_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(14792);
-/* harmony import */ var _keys_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(27422);
-
-
-
-
-/**
- * Creates an array of own enumerable property names and symbols of `object`.
- *
- * @private
- * @param {Object} object The object to query.
- * @returns {Array} Returns the array of property names and symbols.
- */
-function getAllKeys(object) {
- return (0,_baseGetAllKeys_js__WEBPACK_IMPORTED_MODULE_0__/* ["default"] */ .A)(object, _keys_js__WEBPACK_IMPORTED_MODULE_1__/* ["default"] */ .A, _getSymbols_js__WEBPACK_IMPORTED_MODULE_2__/* ["default"] */ .A);
-}
-
-/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (getAllKeys);
-
-
-/***/ }),
-
-/***/ 14792:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ A: () => (__WEBPACK_DEFAULT_EXPORT__)
-/* harmony export */ });
-/* harmony import */ var _arrayFilter_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(2634);
-/* harmony import */ var _stubArray_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(13153);
-
-
-
-/** Used for built-in method references. */
-var objectProto = Object.prototype;
-
-/** Built-in value references. */
-var propertyIsEnumerable = objectProto.propertyIsEnumerable;
-
-/* Built-in method references for those with the same name as other `lodash` methods. */
-var nativeGetSymbols = Object.getOwnPropertySymbols;
-
-/**
- * Creates an array of the own enumerable symbols of `object`.
- *
- * @private
- * @param {Object} object The object to query.
- * @returns {Array} Returns the array of symbols.
- */
-var getSymbols = !nativeGetSymbols ? _stubArray_js__WEBPACK_IMPORTED_MODULE_0__/* ["default"] */ .A : function(object) {
- if (object == null) {
- return [];
- }
- object = Object(object);
- return (0,_arrayFilter_js__WEBPACK_IMPORTED_MODULE_1__/* ["default"] */ .A)(nativeGetSymbols(object), function(symbol) {
- return propertyIsEnumerable.call(object, symbol);
- });
-};
-
-/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (getSymbols);
-
-
-/***/ }),
-
-/***/ 85054:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ A: () => (__WEBPACK_DEFAULT_EXPORT__)
-/* harmony export */ });
-/* harmony import */ var _castPath_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(7819);
-/* harmony import */ var _isArguments_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(52274);
-/* harmony import */ var _isArray_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(92049);
-/* harmony import */ var _isIndex_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(25353);
-/* harmony import */ var _isLength_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(5254);
-/* harmony import */ var _toKey_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(30901);
-
-
-
-
-
-
-
-/**
- * Checks if `path` exists on `object`.
- *
- * @private
- * @param {Object} object The object to query.
- * @param {Array|string} path The path to check.
- * @param {Function} hasFunc The function to check properties.
- * @returns {boolean} Returns `true` if `path` exists, else `false`.
- */
-function hasPath(object, path, hasFunc) {
- path = (0,_castPath_js__WEBPACK_IMPORTED_MODULE_0__/* ["default"] */ .A)(path, object);
-
- var index = -1,
- length = path.length,
- result = false;
-
- while (++index < length) {
- var key = (0,_toKey_js__WEBPACK_IMPORTED_MODULE_1__/* ["default"] */ .A)(path[index]);
- if (!(result = object != null && hasFunc(object, key))) {
- break;
- }
- object = object[key];
- }
- if (result || ++index != length) {
- return result;
- }
- length = object == null ? 0 : object.length;
- return !!length && (0,_isLength_js__WEBPACK_IMPORTED_MODULE_2__/* ["default"] */ .A)(length) && (0,_isIndex_js__WEBPACK_IMPORTED_MODULE_3__/* ["default"] */ .A)(key, length) &&
- ((0,_isArray_js__WEBPACK_IMPORTED_MODULE_4__/* ["default"] */ .A)(object) || (0,_isArguments_js__WEBPACK_IMPORTED_MODULE_5__/* ["default"] */ .A)(object));
-}
-
-/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (hasPath);
-
-
-/***/ }),
-
-/***/ 86586:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ A: () => (__WEBPACK_DEFAULT_EXPORT__)
-/* harmony export */ });
-/* harmony import */ var _isArray_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(92049);
-/* harmony import */ var _isSymbol_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(61882);
-
-
-
-/** Used to match property names within property paths. */
-var reIsDeepProp = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/,
- reIsPlainProp = /^\w*$/;
-
-/**
- * Checks if `value` is a property name and not a property path.
- *
- * @private
- * @param {*} value The value to check.
- * @param {Object} [object] The object to query keys on.
- * @returns {boolean} Returns `true` if `value` is a property name, else `false`.
- */
-function isKey(value, object) {
- if ((0,_isArray_js__WEBPACK_IMPORTED_MODULE_0__/* ["default"] */ .A)(value)) {
- return false;
- }
- var type = typeof value;
- if (type == 'number' || type == 'symbol' || type == 'boolean' ||
- value == null || (0,_isSymbol_js__WEBPACK_IMPORTED_MODULE_1__/* ["default"] */ .A)(value)) {
- return true;
- }
- return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||
- (object != null && value in Object(object));
-}
-
-/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (isKey);
-
-
-/***/ }),
-
-/***/ 29959:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ A: () => (__WEBPACK_DEFAULT_EXPORT__)
-/* harmony export */ });
-/**
- * Converts `set` to an array of its values.
- *
- * @private
- * @param {Object} set The set to convert.
- * @returns {Array} Returns the values.
- */
-function setToArray(set) {
- var index = -1,
- result = Array(set.size);
-
- set.forEach(function(value) {
- result[++index] = value;
- });
- return result;
-}
-
-/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (setToArray);
-
-
-/***/ }),
-
-/***/ 30901:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ A: () => (__WEBPACK_DEFAULT_EXPORT__)
-/* harmony export */ });
-/* harmony import */ var _isSymbol_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(61882);
-
-
-/** Used as references for various `Number` constants. */
-var INFINITY = 1 / 0;
-
-/**
- * Converts `value` to a string key if it's not a string or symbol.
- *
- * @private
- * @param {*} value The value to inspect.
- * @returns {string|symbol} Returns the key.
- */
-function toKey(value) {
- if (typeof value == 'string' || (0,_isSymbol_js__WEBPACK_IMPORTED_MODULE_0__/* ["default"] */ .A)(value)) {
- return value;
- }
- var result = (value + '');
- return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;
-}
-
-/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (toKey);
-
-
-/***/ }),
-
-/***/ 50053:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ A: () => (__WEBPACK_DEFAULT_EXPORT__)
-/* harmony export */ });
-/* harmony import */ var _baseClone_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(91641);
-
-
-/** Used to compose bitmasks for cloning. */
-var CLONE_SYMBOLS_FLAG = 4;
-
-/**
- * Creates a shallow clone of `value`.
- *
- * **Note:** This method is loosely based on the
- * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)
- * and supports cloning arrays, array buffers, booleans, date objects, maps,
- * numbers, `Object` objects, regexes, sets, strings, symbols, and typed
- * arrays. The own enumerable properties of `arguments` objects are cloned
- * as plain objects. An empty object is returned for uncloneable values such
- * as error objects, functions, DOM nodes, and WeakMaps.
- *
- * @static
- * @memberOf _
- * @since 0.1.0
- * @category Lang
- * @param {*} value The value to clone.
- * @returns {*} Returns the cloned value.
- * @see _.cloneDeep
- * @example
- *
- * var objects = [{ 'a': 1 }, { 'b': 2 }];
- *
- * var shallow = _.clone(objects);
- * console.log(shallow[0] === objects[0]);
- * // => true
- */
-function clone(value) {
- return (0,_baseClone_js__WEBPACK_IMPORTED_MODULE_0__/* ["default"] */ .A)(value, CLONE_SYMBOLS_FLAG);
-}
-
-/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (clone);
-
-
-/***/ }),
-
-/***/ 23068:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ A: () => (__WEBPACK_DEFAULT_EXPORT__)
-/* harmony export */ });
-/* harmony import */ var _baseRest_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(24326);
-/* harmony import */ var _eq_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(66984);
-/* harmony import */ var _isIterateeCall_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(6832);
-/* harmony import */ var _keysIn_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(55615);
-
-
-
-
-
-/** Used for built-in method references. */
-var objectProto = Object.prototype;
-
-/** Used to check objects for own properties. */
-var hasOwnProperty = objectProto.hasOwnProperty;
-
-/**
- * Assigns own and inherited enumerable string keyed properties of source
- * objects to the destination object for all destination properties that
- * resolve to `undefined`. Source objects are applied from left to right.
- * Once a property is set, additional values of the same property are ignored.
- *
- * **Note:** This method mutates `object`.
- *
- * @static
- * @since 0.1.0
- * @memberOf _
- * @category Object
- * @param {Object} object The destination object.
- * @param {...Object} [sources] The source objects.
- * @returns {Object} Returns `object`.
- * @see _.defaultsDeep
- * @example
- *
- * _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });
- * // => { 'a': 1, 'b': 2 }
- */
-var defaults = (0,_baseRest_js__WEBPACK_IMPORTED_MODULE_0__/* ["default"] */ .A)(function(object, sources) {
- object = Object(object);
-
- var index = -1;
- var length = sources.length;
- var guard = length > 2 ? sources[2] : undefined;
-
- if (guard && (0,_isIterateeCall_js__WEBPACK_IMPORTED_MODULE_1__/* ["default"] */ .A)(sources[0], sources[1], guard)) {
- length = 1;
- }
-
- while (++index < length) {
- var source = sources[index];
- var props = (0,_keysIn_js__WEBPACK_IMPORTED_MODULE_2__/* ["default"] */ .A)(source);
- var propsIndex = -1;
- var propsLength = props.length;
-
- while (++propsIndex < propsLength) {
- var key = props[propsIndex];
- var value = object[key];
-
- if (value === undefined ||
- ((0,_eq_js__WEBPACK_IMPORTED_MODULE_3__/* ["default"] */ .A)(value, objectProto[key]) && !hasOwnProperty.call(object, key))) {
- object[key] = source[key];
- }
- }
- }
-
- return object;
-});
-
-/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (defaults);
-
-
-/***/ }),
-
-/***/ 11662:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-
-// EXPORTS
-__webpack_require__.d(__webpack_exports__, {
- A: () => (/* binding */ lodash_es_filter)
-});
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_arrayFilter.js
-var _arrayFilter = __webpack_require__(2634);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_baseEach.js + 1 modules
-var _baseEach = __webpack_require__(6240);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseFilter.js
-
-
-/**
- * The base implementation of `_.filter` without support for iteratee shorthands.
- *
- * @private
- * @param {Array|Object} collection The collection to iterate over.
- * @param {Function} predicate The function invoked per iteration.
- * @returns {Array} Returns the new filtered array.
- */
-function baseFilter(collection, predicate) {
- var result = [];
- (0,_baseEach/* default */.A)(collection, function(value, index, collection) {
- if (predicate(value, index, collection)) {
- result.push(value);
- }
- });
- return result;
-}
-
-/* harmony default export */ const _baseFilter = (baseFilter);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_baseIteratee.js + 16 modules
-var _baseIteratee = __webpack_require__(49574);
-// EXTERNAL MODULE: ./node_modules/lodash-es/isArray.js
-var isArray = __webpack_require__(92049);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/filter.js
-
-
-
-
-
-/**
- * Iterates over elements of `collection`, returning an array of all elements
- * `predicate` returns truthy for. The predicate is invoked with three
- * arguments: (value, index|key, collection).
- *
- * **Note:** Unlike `_.remove`, this method returns a new array.
- *
- * @static
- * @memberOf _
- * @since 0.1.0
- * @category Collection
- * @param {Array|Object} collection The collection to iterate over.
- * @param {Function} [predicate=_.identity] The function invoked per iteration.
- * @returns {Array} Returns the new filtered array.
- * @see _.reject
- * @example
- *
- * var users = [
- * { 'user': 'barney', 'age': 36, 'active': true },
- * { 'user': 'fred', 'age': 40, 'active': false }
- * ];
- *
- * _.filter(users, function(o) { return !o.active; });
- * // => objects for ['fred']
- *
- * // The `_.matches` iteratee shorthand.
- * _.filter(users, { 'age': 36, 'active': true });
- * // => objects for ['barney']
- *
- * // The `_.matchesProperty` iteratee shorthand.
- * _.filter(users, ['active', false]);
- * // => objects for ['fred']
- *
- * // The `_.property` iteratee shorthand.
- * _.filter(users, 'active');
- * // => objects for ['barney']
- *
- * // Combining several predicates using `_.overEvery` or `_.overSome`.
- * _.filter(users, _.overSome([{ 'age': 36 }, ['age', 40]]));
- * // => objects for ['fred', 'barney']
- */
-function filter(collection, predicate) {
- var func = (0,isArray/* default */.A)(collection) ? _arrayFilter/* default */.A : _baseFilter;
- return func(collection, (0,_baseIteratee/* default */.A)(predicate, 3));
-}
-
-/* harmony default export */ const lodash_es_filter = (filter);
-
-
-/***/ }),
-
-/***/ 34098:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ A: () => (__WEBPACK_DEFAULT_EXPORT__)
-/* harmony export */ });
-/* harmony import */ var _baseFlatten_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(13588);
-
-
-/**
- * Flattens `array` a single level deep.
- *
- * @static
- * @memberOf _
- * @since 0.1.0
- * @category Array
- * @param {Array} array The array to flatten.
- * @returns {Array} Returns the new flattened array.
- * @example
- *
- * _.flatten([1, [2, [3, [4]], 5]]);
- * // => [1, 2, [3, [4]], 5]
- */
-function flatten(array) {
- var length = array == null ? 0 : array.length;
- return length ? (0,_baseFlatten_js__WEBPACK_IMPORTED_MODULE_0__/* ["default"] */ .A)(array, 1) : [];
-}
-
-/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (flatten);
-
-
-/***/ }),
-
-/***/ 8058:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ A: () => (__WEBPACK_DEFAULT_EXPORT__)
-/* harmony export */ });
-/* harmony import */ var _arrayEach_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(72641);
-/* harmony import */ var _baseEach_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(6240);
-/* harmony import */ var _castFunction_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(99922);
-/* harmony import */ var _isArray_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(92049);
-
-
-
-
-
-/**
- * Iterates over elements of `collection` and invokes `iteratee` for each element.
- * The iteratee is invoked with three arguments: (value, index|key, collection).
- * Iteratee functions may exit iteration early by explicitly returning `false`.
- *
- * **Note:** As with other "Collections" methods, objects with a "length"
- * property are iterated like arrays. To avoid this behavior use `_.forIn`
- * or `_.forOwn` for object iteration.
- *
- * @static
- * @memberOf _
- * @since 0.1.0
- * @alias each
- * @category Collection
- * @param {Array|Object} collection The collection to iterate over.
- * @param {Function} [iteratee=_.identity] The function invoked per iteration.
- * @returns {Array|Object} Returns `collection`.
- * @see _.forEachRight
- * @example
- *
- * _.forEach([1, 2], function(value) {
- * console.log(value);
- * });
- * // => Logs `1` then `2`.
- *
- * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {
- * console.log(key);
- * });
- * // => Logs 'a' then 'b' (iteration order is not guaranteed).
- */
-function forEach(collection, iteratee) {
- var func = (0,_isArray_js__WEBPACK_IMPORTED_MODULE_0__/* ["default"] */ .A)(collection) ? _arrayEach_js__WEBPACK_IMPORTED_MODULE_1__/* ["default"] */ .A : _baseEach_js__WEBPACK_IMPORTED_MODULE_2__/* ["default"] */ .A;
- return func(collection, (0,_castFunction_js__WEBPACK_IMPORTED_MODULE_3__/* ["default"] */ .A)(iteratee));
-}
-
-/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (forEach);
-
-
-/***/ }),
-
-/***/ 48585:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-
-// EXPORTS
-__webpack_require__.d(__webpack_exports__, {
- A: () => (/* binding */ lodash_es_has)
-});
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseHas.js
-/** Used for built-in method references. */
-var objectProto = Object.prototype;
-
-/** Used to check objects for own properties. */
-var _baseHas_hasOwnProperty = objectProto.hasOwnProperty;
-
-/**
- * The base implementation of `_.has` without support for deep paths.
- *
- * @private
- * @param {Object} [object] The object to query.
- * @param {Array|string} key The key to check.
- * @returns {boolean} Returns `true` if `key` exists, else `false`.
- */
-function baseHas(object, key) {
- return object != null && _baseHas_hasOwnProperty.call(object, key);
-}
-
-/* harmony default export */ const _baseHas = (baseHas);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_hasPath.js
-var _hasPath = __webpack_require__(85054);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/has.js
-
-
-
-/**
- * Checks if `path` is a direct property of `object`.
- *
- * @static
- * @since 0.1.0
- * @memberOf _
- * @category Object
- * @param {Object} object The object to query.
- * @param {Array|string} path The path to check.
- * @returns {boolean} Returns `true` if `path` exists, else `false`.
- * @example
- *
- * var object = { 'a': { 'b': 2 } };
- * var other = _.create({ 'a': _.create({ 'b': 2 }) });
- *
- * _.has(object, 'a');
- * // => true
- *
- * _.has(object, 'a.b');
- * // => true
- *
- * _.has(object, ['a', 'b']);
- * // => true
- *
- * _.has(other, 'a');
- * // => false
- */
-function has(object, path) {
- return object != null && (0,_hasPath/* default */.A)(object, path, _baseHas);
-}
-
-/* harmony default export */ const lodash_es_has = (has);
-
-
-/***/ }),
-
-/***/ 39188:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-
-// EXPORTS
-__webpack_require__.d(__webpack_exports__, {
- A: () => (/* binding */ lodash_es_hasIn)
-});
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseHasIn.js
-/**
- * The base implementation of `_.hasIn` without support for deep paths.
- *
- * @private
- * @param {Object} [object] The object to query.
- * @param {Array|string} key The key to check.
- * @returns {boolean} Returns `true` if `key` exists, else `false`.
- */
-function baseHasIn(object, key) {
- return object != null && key in Object(object);
-}
-
-/* harmony default export */ const _baseHasIn = (baseHasIn);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_hasPath.js
-var _hasPath = __webpack_require__(85054);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/hasIn.js
-
-
-
-/**
- * Checks if `path` is a direct or inherited property of `object`.
- *
- * @static
- * @memberOf _
- * @since 4.0.0
- * @category Object
- * @param {Object} object The object to query.
- * @param {Array|string} path The path to check.
- * @returns {boolean} Returns `true` if `path` exists, else `false`.
- * @example
- *
- * var object = _.create({ 'a': _.create({ 'b': 2 }) });
- *
- * _.hasIn(object, 'a');
- * // => true
- *
- * _.hasIn(object, 'a.b');
- * // => true
- *
- * _.hasIn(object, ['a', 'b']);
- * // => true
- *
- * _.hasIn(object, 'b');
- * // => false
- */
-function hasIn(object, path) {
- return object != null && (0,_hasPath/* default */.A)(object, path, _baseHasIn);
-}
-
-/* harmony default export */ const lodash_es_hasIn = (hasIn);
-
-
-/***/ }),
-
-/***/ 61882:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ A: () => (__WEBPACK_DEFAULT_EXPORT__)
-/* harmony export */ });
-/* harmony import */ var _baseGetTag_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(88496);
-/* harmony import */ var _isObjectLike_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(53098);
-
-
-
-/** `Object#toString` result references. */
-var symbolTag = '[object Symbol]';
-
-/**
- * Checks if `value` is classified as a `Symbol` primitive or object.
- *
- * @static
- * @memberOf _
- * @since 4.0.0
- * @category Lang
- * @param {*} value The value to check.
- * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.
- * @example
- *
- * _.isSymbol(Symbol.iterator);
- * // => true
- *
- * _.isSymbol('abc');
- * // => false
- */
-function isSymbol(value) {
- return typeof value == 'symbol' ||
- ((0,_isObjectLike_js__WEBPACK_IMPORTED_MODULE_0__/* ["default"] */ .A)(value) && (0,_baseGetTag_js__WEBPACK_IMPORTED_MODULE_1__/* ["default"] */ .A)(value) == symbolTag);
-}
-
-/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (isSymbol);
-
-
-/***/ }),
-
-/***/ 69592:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ A: () => (__WEBPACK_DEFAULT_EXPORT__)
-/* harmony export */ });
-/**
- * Checks if `value` is `undefined`.
- *
- * @static
- * @since 0.1.0
- * @memberOf _
- * @category Lang
- * @param {*} value The value to check.
- * @returns {boolean} Returns `true` if `value` is `undefined`, else `false`.
- * @example
- *
- * _.isUndefined(void 0);
- * // => true
- *
- * _.isUndefined(null);
- * // => false
- */
-function isUndefined(value) {
- return value === undefined;
-}
-
-/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (isUndefined);
-
-
-/***/ }),
-
-/***/ 27422:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ A: () => (__WEBPACK_DEFAULT_EXPORT__)
-/* harmony export */ });
-/* harmony import */ var _arrayLikeKeys_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(83607);
-/* harmony import */ var _baseKeys_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(69471);
-/* harmony import */ var _isArrayLike_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(38446);
-
-
-
-
-/**
- * Creates an array of the own enumerable property names of `object`.
- *
- * **Note:** Non-object values are coerced to objects. See the
- * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)
- * for more details.
- *
- * @static
- * @since 0.1.0
- * @memberOf _
- * @category Object
- * @param {Object} object The object to query.
- * @returns {Array} Returns the array of property names.
- * @example
- *
- * function Foo() {
- * this.a = 1;
- * this.b = 2;
- * }
- *
- * Foo.prototype.c = 3;
- *
- * _.keys(new Foo);
- * // => ['a', 'b'] (iteration order is not guaranteed)
- *
- * _.keys('hi');
- * // => ['0', '1']
- */
-function keys(object) {
- return (0,_isArrayLike_js__WEBPACK_IMPORTED_MODULE_0__/* ["default"] */ .A)(object) ? (0,_arrayLikeKeys_js__WEBPACK_IMPORTED_MODULE_1__/* ["default"] */ .A)(object) : (0,_baseKeys_js__WEBPACK_IMPORTED_MODULE_2__/* ["default"] */ .A)(object);
-}
-
-/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (keys);
-
-
-/***/ }),
-
-/***/ 74722:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ A: () => (__WEBPACK_DEFAULT_EXPORT__)
-/* harmony export */ });
-/* harmony import */ var _arrayMap_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(45572);
-/* harmony import */ var _baseIteratee_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(49574);
-/* harmony import */ var _baseMap_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(52568);
-/* harmony import */ var _isArray_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(92049);
-
-
-
-
-
-/**
- * Creates an array of values by running each element in `collection` thru
- * `iteratee`. The iteratee is invoked with three arguments:
- * (value, index|key, collection).
- *
- * Many lodash methods are guarded to work as iteratees for methods like
- * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.
- *
- * The guarded methods are:
- * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,
- * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,
- * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,
- * `template`, `trim`, `trimEnd`, `trimStart`, and `words`
- *
- * @static
- * @memberOf _
- * @since 0.1.0
- * @category Collection
- * @param {Array|Object} collection The collection to iterate over.
- * @param {Function} [iteratee=_.identity] The function invoked per iteration.
- * @returns {Array} Returns the new mapped array.
- * @example
- *
- * function square(n) {
- * return n * n;
- * }
- *
- * _.map([4, 8], square);
- * // => [16, 64]
- *
- * _.map({ 'a': 4, 'b': 8 }, square);
- * // => [16, 64] (iteration order is not guaranteed)
- *
- * var users = [
- * { 'user': 'barney' },
- * { 'user': 'fred' }
- * ];
- *
- * // The `_.property` iteratee shorthand.
- * _.map(users, 'user');
- * // => ['barney', 'fred']
- */
-function map(collection, iteratee) {
- var func = (0,_isArray_js__WEBPACK_IMPORTED_MODULE_0__/* ["default"] */ .A)(collection) ? _arrayMap_js__WEBPACK_IMPORTED_MODULE_1__/* ["default"] */ .A : _baseMap_js__WEBPACK_IMPORTED_MODULE_2__/* ["default"] */ .A;
- return func(collection, (0,_baseIteratee_js__WEBPACK_IMPORTED_MODULE_3__/* ["default"] */ .A)(iteratee, 3));
-}
-
-/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (map);
-
-
-/***/ }),
-
-/***/ 81942:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-
-// EXPORTS
-__webpack_require__.d(__webpack_exports__, {
- A: () => (/* binding */ lodash_es_pick)
-});
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_baseGet.js
-var _baseGet = __webpack_require__(66318);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_assignValue.js
-var _assignValue = __webpack_require__(52851);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_castPath.js + 2 modules
-var _castPath = __webpack_require__(7819);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_isIndex.js
-var _isIndex = __webpack_require__(25353);
-// EXTERNAL MODULE: ./node_modules/lodash-es/isObject.js
-var isObject = __webpack_require__(23149);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_toKey.js
-var _toKey = __webpack_require__(30901);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseSet.js
-
-
-
-
-
-
-/**
- * The base implementation of `_.set`.
- *
- * @private
- * @param {Object} object The object to modify.
- * @param {Array|string} path The path of the property to set.
- * @param {*} value The value to set.
- * @param {Function} [customizer] The function to customize path creation.
- * @returns {Object} Returns `object`.
- */
-function baseSet(object, path, value, customizer) {
- if (!(0,isObject/* default */.A)(object)) {
- return object;
- }
- path = (0,_castPath/* default */.A)(path, object);
-
- var index = -1,
- length = path.length,
- lastIndex = length - 1,
- nested = object;
-
- while (nested != null && ++index < length) {
- var key = (0,_toKey/* default */.A)(path[index]),
- newValue = value;
-
- if (key === '__proto__' || key === 'constructor' || key === 'prototype') {
- return object;
- }
-
- if (index != lastIndex) {
- var objValue = nested[key];
- newValue = customizer ? customizer(objValue, key, nested) : undefined;
- if (newValue === undefined) {
- newValue = (0,isObject/* default */.A)(objValue)
- ? objValue
- : ((0,_isIndex/* default */.A)(path[index + 1]) ? [] : {});
- }
- }
- (0,_assignValue/* default */.A)(nested, key, newValue);
- nested = nested[key];
- }
- return object;
-}
-
-/* harmony default export */ const _baseSet = (baseSet);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_basePickBy.js
-
-
-
-
-/**
- * The base implementation of `_.pickBy` without support for iteratee shorthands.
- *
- * @private
- * @param {Object} object The source object.
- * @param {string[]} paths The property paths to pick.
- * @param {Function} predicate The function invoked per property.
- * @returns {Object} Returns the new object.
- */
-function basePickBy(object, paths, predicate) {
- var index = -1,
- length = paths.length,
- result = {};
-
- while (++index < length) {
- var path = paths[index],
- value = (0,_baseGet/* default */.A)(object, path);
-
- if (predicate(value, path)) {
- _baseSet(result, (0,_castPath/* default */.A)(path, object), value);
- }
- }
- return result;
-}
-
-/* harmony default export */ const _basePickBy = (basePickBy);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/hasIn.js + 1 modules
-var hasIn = __webpack_require__(39188);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_basePick.js
-
-
-
-/**
- * The base implementation of `_.pick` without support for individual
- * property identifiers.
- *
- * @private
- * @param {Object} object The source object.
- * @param {string[]} paths The property paths to pick.
- * @returns {Object} Returns the new object.
- */
-function basePick(object, paths) {
- return _basePickBy(object, paths, function(value, path) {
- return (0,hasIn/* default */.A)(object, path);
- });
-}
-
-/* harmony default export */ const _basePick = (basePick);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/flatten.js
-var flatten = __webpack_require__(34098);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_overRest.js + 1 modules
-var _overRest = __webpack_require__(76875);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_setToString.js + 2 modules
-var _setToString = __webpack_require__(67525);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_flatRest.js
-
-
-
-
-/**
- * A specialized version of `baseRest` which flattens the rest array.
- *
- * @private
- * @param {Function} func The function to apply a rest parameter to.
- * @returns {Function} Returns the new function.
- */
-function flatRest(func) {
- return (0,_setToString/* default */.A)((0,_overRest/* default */.A)(func, undefined, flatten/* default */.A), func + '');
-}
-
-/* harmony default export */ const _flatRest = (flatRest);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/pick.js
-
-
-
-/**
- * Creates an object composed of the picked `object` properties.
- *
- * @static
- * @since 0.1.0
- * @memberOf _
- * @category Object
- * @param {Object} object The source object.
- * @param {...(string|string[])} [paths] The property paths to pick.
- * @returns {Object} Returns the new object.
- * @example
- *
- * var object = { 'a': 1, 'b': '2', 'c': 3 };
- *
- * _.pick(object, ['a', 'c']);
- * // => { 'a': 1, 'c': 3 }
- */
-var pick = _flatRest(function(object, paths) {
- return object == null ? {} : _basePick(object, paths);
-});
-
-/* harmony default export */ const lodash_es_pick = (pick);
-
-
-/***/ }),
-
-/***/ 91395:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-
-// EXPORTS
-__webpack_require__.d(__webpack_exports__, {
- A: () => (/* binding */ lodash_es_range)
-});
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseRange.js
-/* Built-in method references for those with the same name as other `lodash` methods. */
-var nativeCeil = Math.ceil,
- nativeMax = Math.max;
-
-/**
- * The base implementation of `_.range` and `_.rangeRight` which doesn't
- * coerce arguments.
- *
- * @private
- * @param {number} start The start of the range.
- * @param {number} end The end of the range.
- * @param {number} step The value to increment or decrement by.
- * @param {boolean} [fromRight] Specify iterating from right to left.
- * @returns {Array} Returns the range of numbers.
- */
-function baseRange(start, end, step, fromRight) {
- var index = -1,
- length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),
- result = Array(length);
-
- while (length--) {
- result[fromRight ? length : ++index] = start;
- start += step;
- }
- return result;
-}
-
-/* harmony default export */ const _baseRange = (baseRange);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_isIterateeCall.js
-var _isIterateeCall = __webpack_require__(6832);
-// EXTERNAL MODULE: ./node_modules/lodash-es/toFinite.js + 3 modules
-var toFinite = __webpack_require__(74342);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_createRange.js
-
-
-
-
-/**
- * Creates a `_.range` or `_.rangeRight` function.
- *
- * @private
- * @param {boolean} [fromRight] Specify iterating from right to left.
- * @returns {Function} Returns the new range function.
- */
-function createRange(fromRight) {
- return function(start, end, step) {
- if (step && typeof step != 'number' && (0,_isIterateeCall/* default */.A)(start, end, step)) {
- end = step = undefined;
- }
- // Ensure the sign of `-0` is preserved.
- start = (0,toFinite/* default */.A)(start);
- if (end === undefined) {
- end = start;
- start = 0;
- } else {
- end = (0,toFinite/* default */.A)(end);
- }
- step = step === undefined ? (start < end ? 1 : -1) : (0,toFinite/* default */.A)(step);
- return _baseRange(start, end, step, fromRight);
- };
-}
-
-/* harmony default export */ const _createRange = (createRange);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/range.js
-
-
-/**
- * Creates an array of numbers (positive and/or negative) progressing from
- * `start` up to, but not including, `end`. A step of `-1` is used if a negative
- * `start` is specified without an `end` or `step`. If `end` is not specified,
- * it's set to `start` with `start` then set to `0`.
- *
- * **Note:** JavaScript follows the IEEE-754 standard for resolving
- * floating-point values which can produce unexpected results.
- *
- * @static
- * @since 0.1.0
- * @memberOf _
- * @category Util
- * @param {number} [start=0] The start of the range.
- * @param {number} end The end of the range.
- * @param {number} [step=1] The value to increment or decrement by.
- * @returns {Array} Returns the range of numbers.
- * @see _.inRange, _.rangeRight
- * @example
- *
- * _.range(4);
- * // => [0, 1, 2, 3]
- *
- * _.range(-4);
- * // => [0, -1, -2, -3]
- *
- * _.range(1, 5);
- * // => [1, 2, 3, 4]
- *
- * _.range(0, 20, 5);
- * // => [0, 5, 10, 15]
- *
- * _.range(0, -4, -1);
- * // => [0, -1, -2, -3]
- *
- * _.range(1, 4, 0);
- * // => [1, 1, 1]
- *
- * _.range(0);
- * // => []
- */
-var range = _createRange();
-
-/* harmony default export */ const lodash_es_range = (range);
-
-
-/***/ }),
-
-/***/ 89463:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-
-// EXPORTS
-__webpack_require__.d(__webpack_exports__, {
- A: () => (/* binding */ lodash_es_reduce)
-});
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_arrayReduce.js
-/**
- * A specialized version of `_.reduce` for arrays without support for
- * iteratee shorthands.
- *
- * @private
- * @param {Array} [array] The array to iterate over.
- * @param {Function} iteratee The function invoked per iteration.
- * @param {*} [accumulator] The initial value.
- * @param {boolean} [initAccum] Specify using the first element of `array` as
- * the initial value.
- * @returns {*} Returns the accumulated value.
- */
-function arrayReduce(array, iteratee, accumulator, initAccum) {
- var index = -1,
- length = array == null ? 0 : array.length;
-
- if (initAccum && length) {
- accumulator = array[++index];
- }
- while (++index < length) {
- accumulator = iteratee(accumulator, array[index], index, array);
- }
- return accumulator;
-}
-
-/* harmony default export */ const _arrayReduce = (arrayReduce);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_baseEach.js + 1 modules
-var _baseEach = __webpack_require__(6240);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_baseIteratee.js + 16 modules
-var _baseIteratee = __webpack_require__(49574);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseReduce.js
-/**
- * The base implementation of `_.reduce` and `_.reduceRight`, without support
- * for iteratee shorthands, which iterates over `collection` using `eachFunc`.
- *
- * @private
- * @param {Array|Object} collection The collection to iterate over.
- * @param {Function} iteratee The function invoked per iteration.
- * @param {*} accumulator The initial value.
- * @param {boolean} initAccum Specify using the first or last element of
- * `collection` as the initial value.
- * @param {Function} eachFunc The function to iterate over `collection`.
- * @returns {*} Returns the accumulated value.
- */
-function baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {
- eachFunc(collection, function(value, index, collection) {
- accumulator = initAccum
- ? (initAccum = false, value)
- : iteratee(accumulator, value, index, collection);
- });
- return accumulator;
-}
-
-/* harmony default export */ const _baseReduce = (baseReduce);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/isArray.js
-var isArray = __webpack_require__(92049);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/reduce.js
-
-
-
-
-
-
-/**
- * Reduces `collection` to a value which is the accumulated result of running
- * each element in `collection` thru `iteratee`, where each successive
- * invocation is supplied the return value of the previous. If `accumulator`
- * is not given, the first element of `collection` is used as the initial
- * value. The iteratee is invoked with four arguments:
- * (accumulator, value, index|key, collection).
- *
- * Many lodash methods are guarded to work as iteratees for methods like
- * `_.reduce`, `_.reduceRight`, and `_.transform`.
- *
- * The guarded methods are:
- * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,
- * and `sortBy`
- *
- * @static
- * @memberOf _
- * @since 0.1.0
- * @category Collection
- * @param {Array|Object} collection The collection to iterate over.
- * @param {Function} [iteratee=_.identity] The function invoked per iteration.
- * @param {*} [accumulator] The initial value.
- * @returns {*} Returns the accumulated value.
- * @see _.reduceRight
- * @example
- *
- * _.reduce([1, 2], function(sum, n) {
- * return sum + n;
- * }, 0);
- * // => 3
- *
- * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {
- * (result[value] || (result[value] = [])).push(key);
- * return result;
- * }, {});
- * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)
- */
-function reduce(collection, iteratee, accumulator) {
- var func = (0,isArray/* default */.A)(collection) ? _arrayReduce : _baseReduce,
- initAccum = arguments.length < 3;
-
- return func(collection, (0,_baseIteratee/* default */.A)(iteratee, 4), accumulator, initAccum, _baseEach/* default */.A);
-}
-
-/* harmony default export */ const lodash_es_reduce = (reduce);
-
-
-/***/ }),
-
-/***/ 13153:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ A: () => (__WEBPACK_DEFAULT_EXPORT__)
-/* harmony export */ });
-/**
- * This method returns a new empty array.
- *
- * @static
- * @memberOf _
- * @since 4.13.0
- * @category Util
- * @returns {Array} Returns the new empty array.
- * @example
- *
- * var arrays = _.times(2, _.stubArray);
- *
- * console.log(arrays);
- * // => [[], []]
- *
- * console.log(arrays[0] === arrays[1]);
- * // => false
- */
-function stubArray() {
- return [];
-}
-
-/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (stubArray);
-
-
-/***/ }),
-
-/***/ 74342:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-
-// EXPORTS
-__webpack_require__.d(__webpack_exports__, {
- A: () => (/* binding */ lodash_es_toFinite)
-});
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_trimmedEndIndex.js
-/** Used to match a single whitespace character. */
-var reWhitespace = /\s/;
-
-/**
- * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace
- * character of `string`.
- *
- * @private
- * @param {string} string The string to inspect.
- * @returns {number} Returns the index of the last non-whitespace character.
- */
-function trimmedEndIndex(string) {
- var index = string.length;
-
- while (index-- && reWhitespace.test(string.charAt(index))) {}
- return index;
-}
-
-/* harmony default export */ const _trimmedEndIndex = (trimmedEndIndex);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseTrim.js
-
-
-/** Used to match leading whitespace. */
-var reTrimStart = /^\s+/;
-
-/**
- * The base implementation of `_.trim`.
- *
- * @private
- * @param {string} string The string to trim.
- * @returns {string} Returns the trimmed string.
- */
-function baseTrim(string) {
- return string
- ? string.slice(0, _trimmedEndIndex(string) + 1).replace(reTrimStart, '')
- : string;
-}
-
-/* harmony default export */ const _baseTrim = (baseTrim);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/isObject.js
-var isObject = __webpack_require__(23149);
-// EXTERNAL MODULE: ./node_modules/lodash-es/isSymbol.js
-var isSymbol = __webpack_require__(61882);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/toNumber.js
-
-
-
-
-/** Used as references for various `Number` constants. */
-var NAN = 0 / 0;
-
-/** Used to detect bad signed hexadecimal string values. */
-var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;
-
-/** Used to detect binary string values. */
-var reIsBinary = /^0b[01]+$/i;
-
-/** Used to detect octal string values. */
-var reIsOctal = /^0o[0-7]+$/i;
-
-/** Built-in method references without a dependency on `root`. */
-var freeParseInt = parseInt;
-
-/**
- * Converts `value` to a number.
- *
- * @static
- * @memberOf _
- * @since 4.0.0
- * @category Lang
- * @param {*} value The value to process.
- * @returns {number} Returns the number.
- * @example
- *
- * _.toNumber(3.2);
- * // => 3.2
- *
- * _.toNumber(Number.MIN_VALUE);
- * // => 5e-324
- *
- * _.toNumber(Infinity);
- * // => Infinity
- *
- * _.toNumber('3.2');
- * // => 3.2
- */
-function toNumber(value) {
- if (typeof value == 'number') {
- return value;
- }
- if ((0,isSymbol/* default */.A)(value)) {
- return NAN;
- }
- if ((0,isObject/* default */.A)(value)) {
- var other = typeof value.valueOf == 'function' ? value.valueOf() : value;
- value = (0,isObject/* default */.A)(other) ? (other + '') : other;
- }
- if (typeof value != 'string') {
- return value === 0 ? value : +value;
- }
- value = _baseTrim(value);
- var isBinary = reIsBinary.test(value);
- return (isBinary || reIsOctal.test(value))
- ? freeParseInt(value.slice(2), isBinary ? 2 : 8)
- : (reIsBadHex.test(value) ? NAN : +value);
-}
-
-/* harmony default export */ const lodash_es_toNumber = (toNumber);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/toFinite.js
-
-
-/** Used as references for various `Number` constants. */
-var INFINITY = 1 / 0,
- MAX_INTEGER = 1.7976931348623157e+308;
-
-/**
- * Converts `value` to a finite number.
- *
- * @static
- * @memberOf _
- * @since 4.12.0
- * @category Lang
- * @param {*} value The value to convert.
- * @returns {number} Returns the converted number.
- * @example
- *
- * _.toFinite(3.2);
- * // => 3.2
- *
- * _.toFinite(Number.MIN_VALUE);
- * // => 5e-324
- *
- * _.toFinite(Infinity);
- * // => 1.7976931348623157e+308
- *
- * _.toFinite('3.2');
- * // => 3.2
- */
-function toFinite(value) {
- if (!value) {
- return value === 0 ? value : 0;
- }
- value = lodash_es_toNumber(value);
- if (value === INFINITY || value === -INFINITY) {
- var sign = (value < 0 ? -1 : 1);
- return sign * MAX_INTEGER;
- }
- return value === value ? value : 0;
-}
-
-/* harmony default export */ const lodash_es_toFinite = (toFinite);
-
-
-/***/ }),
-
-/***/ 28894:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-
-// EXPORTS
-__webpack_require__.d(__webpack_exports__, {
- A: () => (/* binding */ lodash_es_toString)
-});
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_Symbol.js
-var _Symbol = __webpack_require__(241);
-// EXTERNAL MODULE: ./node_modules/lodash-es/_arrayMap.js
-var _arrayMap = __webpack_require__(45572);
-// EXTERNAL MODULE: ./node_modules/lodash-es/isArray.js
-var isArray = __webpack_require__(92049);
-// EXTERNAL MODULE: ./node_modules/lodash-es/isSymbol.js
-var isSymbol = __webpack_require__(61882);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseToString.js
-
-
-
-
-
-/** Used as references for various `Number` constants. */
-var INFINITY = 1 / 0;
-
-/** Used to convert symbols to primitives and strings. */
-var symbolProto = _Symbol/* default */.A ? _Symbol/* default */.A.prototype : undefined,
- symbolToString = symbolProto ? symbolProto.toString : undefined;
-
-/**
- * The base implementation of `_.toString` which doesn't convert nullish
- * values to empty strings.
- *
- * @private
- * @param {*} value The value to process.
- * @returns {string} Returns the string.
- */
-function baseToString(value) {
- // Exit early for strings to avoid a performance hit in some environments.
- if (typeof value == 'string') {
- return value;
- }
- if ((0,isArray/* default */.A)(value)) {
- // Recursively convert values (susceptible to call stack limits).
- return (0,_arrayMap/* default */.A)(value, baseToString) + '';
- }
- if ((0,isSymbol/* default */.A)(value)) {
- return symbolToString ? symbolToString.call(value) : '';
- }
- var result = (value + '');
- return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;
-}
-
-/* harmony default export */ const _baseToString = (baseToString);
-
-;// CONCATENATED MODULE: ./node_modules/lodash-es/toString.js
-
-
-/**
- * Converts `value` to a string. An empty string is returned for `null`
- * and `undefined` values. The sign of `-0` is preserved.
- *
- * @static
- * @memberOf _
- * @since 4.0.0
- * @category Lang
- * @param {*} value The value to convert.
- * @returns {string} Returns the converted string.
- * @example
- *
- * _.toString(null);
- * // => ''
- *
- * _.toString(-0);
- * // => '-0'
- *
- * _.toString([1, 2, 3]);
- * // => '1,2,3'
- */
-function toString_toString(value) {
- return value == null ? '' : _baseToString(value);
-}
-
-/* harmony default export */ const lodash_es_toString = (toString_toString);
-
-
-/***/ }),
-
-/***/ 5664:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ A: () => (__WEBPACK_DEFAULT_EXPORT__)
-/* harmony export */ });
-/* harmony import */ var _toString_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(28894);
-
-
-/** Used to generate unique IDs. */
-var idCounter = 0;
-
-/**
- * Generates a unique ID. If `prefix` is given, the ID is appended to it.
- *
- * @static
- * @since 0.1.0
- * @memberOf _
- * @category Util
- * @param {string} [prefix=''] The value to prefix the ID with.
- * @returns {string} Returns the unique ID.
- * @example
- *
- * _.uniqueId('contact_');
- * // => 'contact_104'
- *
- * _.uniqueId();
- * // => '105'
- */
-function uniqueId(prefix) {
- var id = ++idCounter;
- return (0,_toString_js__WEBPACK_IMPORTED_MODULE_0__/* ["default"] */ .A)(prefix) + id;
-}
-
-/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (uniqueId);
-
-
-/***/ }),
-
-/***/ 38207:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-
-// EXPORTS
-__webpack_require__.d(__webpack_exports__, {
- A: () => (/* binding */ lodash_es_values)
-});
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/_arrayMap.js
-var _arrayMap = __webpack_require__(45572);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/_baseValues.js
-
-
-/**
- * The base implementation of `_.values` and `_.valuesIn` which creates an
- * array of `object` property values corresponding to the property names
- * of `props`.
- *
- * @private
- * @param {Object} object The object to query.
- * @param {Array} props The property names to get values for.
- * @returns {Object} Returns the array of property values.
- */
-function baseValues(object, props) {
- return (0,_arrayMap/* default */.A)(props, function(key) {
- return object[key];
- });
-}
-
-/* harmony default export */ const _baseValues = (baseValues);
-
-// EXTERNAL MODULE: ./node_modules/lodash-es/keys.js
-var keys = __webpack_require__(27422);
-;// CONCATENATED MODULE: ./node_modules/lodash-es/values.js
-
-
-
-/**
- * Creates an array of the own enumerable string keyed property values of `object`.
- *
- * **Note:** Non-object values are coerced to objects.
- *
- * @static
- * @since 0.1.0
- * @memberOf _
- * @category Object
- * @param {Object} object The object to query.
- * @returns {Array} Returns the array of property values.
- * @example
- *
- * function Foo() {
- * this.a = 1;
- * this.b = 2;
- * }
- *
- * Foo.prototype.c = 3;
- *
- * _.values(new Foo);
- * // => [1, 2] (iteration order is not guaranteed)
- *
- * _.values('hi');
- * // => ['h', 'i']
- */
-function values(object) {
- return object == null ? [] : _baseValues(object, (0,keys/* default */.A)(object));
-}
-
-/* harmony default export */ const lodash_es_values = (values);
-
-
-/***/ }),
-
-/***/ 18635:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ diagram: () => (/* binding */ diagram)
-/* harmony export */ });
-/* harmony import */ var _styles_b83b31c9_js__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(63626);
-/* harmony import */ var d3__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(26312);
-/* harmony import */ var dagre_d3_es_src_graphlib_index_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(697);
-/* harmony import */ var _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(99702);
-/* harmony import */ var _index_01f381cb_js__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(35364);
-/* harmony import */ var dayjs__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(74353);
-/* harmony import */ var _braintree_sanitize_url__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(16750);
-/* harmony import */ var dompurify__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(99418);
-/* harmony import */ var dagre_d3_es_src_dagre_index_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(21176);
-/* harmony import */ var dagre_d3_es_src_graphlib_json_js__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(14075);
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-const sanitizeText = (txt) => _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.e.sanitizeText(txt, (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.c)());
-let conf = {
- dividerMargin: 10,
- padding: 5,
- textHeight: 10,
- curve: void 0
-};
-const addNamespaces = function(namespaces, g, _id, diagObj) {
- const keys = Object.keys(namespaces);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.l.info("keys:", keys);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.l.info(namespaces);
- keys.forEach(function(id) {
- var _a, _b;
- const vertex = namespaces[id];
- const shape = "rect";
- const node = {
- shape,
- id: vertex.id,
- domId: vertex.domId,
- labelText: sanitizeText(vertex.id),
- labelStyle: "",
- style: "fill: none; stroke: black",
- // TODO V10: Flowchart ? Keeping flowchart for backwards compatibility. Remove in next major release
- padding: ((_a = (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.c)().flowchart) == null ? void 0 : _a.padding) ?? ((_b = (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.c)().class) == null ? void 0 : _b.padding)
- };
- g.setNode(vertex.id, node);
- addClasses(vertex.classes, g, _id, diagObj, vertex.id);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.l.info("setNode", node);
- });
-};
-const addClasses = function(classes, g, _id, diagObj, parent) {
- const keys = Object.keys(classes);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.l.info("keys:", keys);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.l.info(classes);
- keys.filter((id) => classes[id].parent == parent).forEach(function(id) {
- var _a, _b;
- const vertex = classes[id];
- const cssClassStr = vertex.cssClasses.join(" ");
- const styles2 = (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.k)(vertex.styles);
- const vertexText = vertex.label ?? vertex.id;
- const radius = 0;
- const shape = "class_box";
- const node = {
- labelStyle: styles2.labelStyle,
- shape,
- labelText: sanitizeText(vertexText),
- classData: vertex,
- rx: radius,
- ry: radius,
- class: cssClassStr,
- style: styles2.style,
- id: vertex.id,
- domId: vertex.domId,
- tooltip: diagObj.db.getTooltip(vertex.id, parent) || "",
- haveCallback: vertex.haveCallback,
- link: vertex.link,
- width: vertex.type === "group" ? 500 : void 0,
- type: vertex.type,
- // TODO V10: Flowchart ? Keeping flowchart for backwards compatibility. Remove in next major release
- padding: ((_a = (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.c)().flowchart) == null ? void 0 : _a.padding) ?? ((_b = (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.c)().class) == null ? void 0 : _b.padding)
- };
- g.setNode(vertex.id, node);
- if (parent) {
- g.setParent(vertex.id, parent);
- }
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.l.info("setNode", node);
- });
-};
-const addNotes = function(notes, g, startEdgeId, classes) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.l.info(notes);
- notes.forEach(function(note, i) {
- var _a, _b;
- const vertex = note;
- const cssNoteStr = "";
- const styles2 = { labelStyle: "", style: "" };
- const vertexText = vertex.text;
- const radius = 0;
- const shape = "note";
- const node = {
- labelStyle: styles2.labelStyle,
- shape,
- labelText: sanitizeText(vertexText),
- noteData: vertex,
- rx: radius,
- ry: radius,
- class: cssNoteStr,
- style: styles2.style,
- id: vertex.id,
- domId: vertex.id,
- tooltip: "",
- type: "note",
- // TODO V10: Flowchart ? Keeping flowchart for backwards compatibility. Remove in next major release
- padding: ((_a = (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.c)().flowchart) == null ? void 0 : _a.padding) ?? ((_b = (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.c)().class) == null ? void 0 : _b.padding)
- };
- g.setNode(vertex.id, node);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.l.info("setNode", node);
- if (!vertex.class || !(vertex.class in classes)) {
- return;
- }
- const edgeId = startEdgeId + i;
- const edgeData = {
- id: `edgeNote${edgeId}`,
- //Set relationship style and line type
- classes: "relation",
- pattern: "dotted",
- // Set link type for rendering
- arrowhead: "none",
- //Set edge extra labels
- startLabelRight: "",
- endLabelLeft: "",
- //Set relation arrow types
- arrowTypeStart: "none",
- arrowTypeEnd: "none",
- style: "fill:none",
- labelStyle: "",
- curve: (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.n)(conf.curve, d3__WEBPACK_IMPORTED_MODULE_0__/* .curveLinear */ .lUB)
- };
- g.setEdge(vertex.id, vertex.class, edgeData, edgeId);
- });
-};
-const addRelations = function(relations, g) {
- const conf2 = (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.c)().flowchart;
- let cnt = 0;
- relations.forEach(function(edge) {
- var _a;
- cnt++;
- const edgeData = {
- //Set relationship style and line type
- classes: "relation",
- pattern: edge.relation.lineType == 1 ? "dashed" : "solid",
- id: `id_${edge.id1}_${edge.id2}_${cnt}`,
- // Set link type for rendering
- arrowhead: edge.type === "arrow_open" ? "none" : "normal",
- //Set edge extra labels
- startLabelRight: edge.relationTitle1 === "none" ? "" : edge.relationTitle1,
- endLabelLeft: edge.relationTitle2 === "none" ? "" : edge.relationTitle2,
- //Set relation arrow types
- arrowTypeStart: getArrowMarker(edge.relation.type1),
- arrowTypeEnd: getArrowMarker(edge.relation.type2),
- style: "fill:none",
- labelStyle: "",
- curve: (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.n)(conf2 == null ? void 0 : conf2.curve, d3__WEBPACK_IMPORTED_MODULE_0__/* .curveLinear */ .lUB)
- };
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.l.info(edgeData, edge);
- if (edge.style !== void 0) {
- const styles2 = (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.k)(edge.style);
- edgeData.style = styles2.style;
- edgeData.labelStyle = styles2.labelStyle;
- }
- edge.text = edge.title;
- if (edge.text === void 0) {
- if (edge.style !== void 0) {
- edgeData.arrowheadStyle = "fill: #333";
- }
- } else {
- edgeData.arrowheadStyle = "fill: #333";
- edgeData.labelpos = "c";
- if (((_a = (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.c)().flowchart) == null ? void 0 : _a.htmlLabels) ?? (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.c)().htmlLabels) {
- edgeData.labelType = "html";
- edgeData.label = '<span class="edgeLabel">' + edge.text + "</span>";
- } else {
- edgeData.labelType = "text";
- edgeData.label = edge.text.replace(_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.e.lineBreakRegex, "\n");
- if (edge.style === void 0) {
- edgeData.style = edgeData.style || "stroke: #333; stroke-width: 1.5px;fill:none";
- }
- edgeData.labelStyle = edgeData.labelStyle.replace("color:", "fill:");
- }
- }
- g.setEdge(edge.id1, edge.id2, edgeData, cnt);
- });
-};
-const setConf = function(cnf) {
- conf = {
- ...conf,
- ...cnf
- };
-};
-const draw = async function(text, id, _version, diagObj) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.l.info("Drawing class - ", id);
- const conf2 = (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.c)().flowchart ?? (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.c)().class;
- const securityLevel = (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.c)().securityLevel;
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.l.info("config:", conf2);
- const nodeSpacing = (conf2 == null ? void 0 : conf2.nodeSpacing) ?? 50;
- const rankSpacing = (conf2 == null ? void 0 : conf2.rankSpacing) ?? 50;
- const g = new dagre_d3_es_src_graphlib_index_js__WEBPACK_IMPORTED_MODULE_1__/* .Graph */ .T({
- multigraph: true,
- compound: true
- }).setGraph({
- rankdir: diagObj.db.getDirection(),
- nodesep: nodeSpacing,
- ranksep: rankSpacing,
- marginx: 8,
- marginy: 8
- }).setDefaultEdgeLabel(function() {
- return {};
- });
- const namespaces = diagObj.db.getNamespaces();
- const classes = diagObj.db.getClasses();
- const relations = diagObj.db.getRelations();
- const notes = diagObj.db.getNotes();
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.l.info(relations);
- addNamespaces(namespaces, g, id, diagObj);
- addClasses(classes, g, id, diagObj);
- addRelations(relations, g);
- addNotes(notes, g, relations.length + 1, classes);
- let sandboxElement;
- if (securityLevel === "sandbox") {
- sandboxElement = (0,d3__WEBPACK_IMPORTED_MODULE_0__/* .select */ .Ltv)("#i" + id);
- }
- const root = securityLevel === "sandbox" ? (0,d3__WEBPACK_IMPORTED_MODULE_0__/* .select */ .Ltv)(sandboxElement.nodes()[0].contentDocument.body) : (0,d3__WEBPACK_IMPORTED_MODULE_0__/* .select */ .Ltv)("body");
- const svg = root.select(`[id="${id}"]`);
- const element = root.select("#" + id + " g");
- await (0,_index_01f381cb_js__WEBPACK_IMPORTED_MODULE_8__.r)(
- element,
- g,
- ["aggregation", "extension", "composition", "dependency", "lollipop"],
- "classDiagram",
- id
- );
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.u.insertTitle(svg, "classTitleText", (conf2 == null ? void 0 : conf2.titleTopMargin) ?? 5, diagObj.db.getDiagramTitle());
- (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_7__.o)(g, svg, conf2 == null ? void 0 : conf2.diagramPadding, conf2 == null ? void 0 : conf2.useMaxWidth);
- if (!(conf2 == null ? void 0 : conf2.htmlLabels)) {
- const doc = securityLevel === "sandbox" ? sandboxElement.nodes()[0].contentDocument : document;
- const labels = doc.querySelectorAll('[id="' + id + '"] .edgeLabel .label');
- for (const label of labels) {
- const dim = label.getBBox();
- const rect = doc.createElementNS("http://www.w3.org/2000/svg", "rect");
- rect.setAttribute("rx", 0);
- rect.setAttribute("ry", 0);
- rect.setAttribute("width", dim.width);
- rect.setAttribute("height", dim.height);
- label.insertBefore(rect, label.firstChild);
- }
- }
-};
-function getArrowMarker(type) {
- let marker;
- switch (type) {
- case 0:
- marker = "aggregation";
- break;
- case 1:
- marker = "extension";
- break;
- case 2:
- marker = "composition";
- break;
- case 3:
- marker = "dependency";
- break;
- case 4:
- marker = "lollipop";
- break;
- default:
- marker = "none";
- }
- return marker;
-}
-const renderer = {
- setConf,
- draw
-};
-const diagram = {
- parser: _styles_b83b31c9_js__WEBPACK_IMPORTED_MODULE_9__.p,
- db: _styles_b83b31c9_js__WEBPACK_IMPORTED_MODULE_9__.d,
- renderer,
- styles: _styles_b83b31c9_js__WEBPACK_IMPORTED_MODULE_9__.s,
- init: (cnf) => {
- if (!cnf.class) {
- cnf.class = {};
- }
- cnf.class.arrowMarkerAbsolute = cnf.arrowMarkerAbsolute;
- _styles_b83b31c9_js__WEBPACK_IMPORTED_MODULE_9__.d.clear();
- }
-};
-
-
-
-/***/ }),
-
-/***/ 18897:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-
-// EXPORTS
-__webpack_require__.d(__webpack_exports__, {
- a: () => (/* binding */ createText),
- c: () => (/* binding */ computeDimensionOfText)
-});
-
-// NAMESPACE OBJECT: ./node_modules/mermaid/node_modules/micromark/lib/constructs.js
-var constructs_namespaceObject = {};
-__webpack_require__.r(constructs_namespaceObject);
-__webpack_require__.d(constructs_namespaceObject, {
- attentionMarkers: () => (attentionMarkers),
- contentInitial: () => (contentInitial),
- disable: () => (disable),
- document: () => (constructs_document),
- flow: () => (constructs_flow),
- flowInitial: () => (flowInitial),
- insideSpan: () => (insideSpan),
- string: () => (constructs_string),
- text: () => (constructs_text)
-});
-
-// EXTERNAL MODULE: ./node_modules/mermaid/dist/mermaid-6dc72991.js + 8 modules
-var mermaid_6dc72991 = __webpack_require__(99702);
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/mdast-util-to-string/lib/index.js
-/**
- * @typedef {import('mdast').Root|import('mdast').Content} Node
- *
- * @typedef Options
- * Configuration (optional).
- * @property {boolean | null | undefined} [includeImageAlt=true]
- * Whether to use `alt` for `image`s.
- * @property {boolean | null | undefined} [includeHtml=true]
- * Whether to use `value` of HTML.
- */
-
-/** @type {Options} */
-const emptyOptions = {}
-
-/**
- * Get the text content of a node or list of nodes.
- *
- * Prefers the node’s plain-text fields, otherwise serializes its children,
- * and if the given value is an array, serialize the nodes in it.
- *
- * @param {unknown} value
- * Thing to serialize, typically `Node`.
- * @param {Options | null | undefined} [options]
- * Configuration (optional).
- * @returns {string}
- * Serialized `value`.
- */
-function lib_toString(value, options) {
- const settings = options || emptyOptions
- const includeImageAlt =
- typeof settings.includeImageAlt === 'boolean'
- ? settings.includeImageAlt
- : true
- const includeHtml =
- typeof settings.includeHtml === 'boolean' ? settings.includeHtml : true
-
- return one(value, includeImageAlt, includeHtml)
-}
-
-/**
- * One node or several nodes.
- *
- * @param {unknown} value
- * Thing to serialize.
- * @param {boolean} includeImageAlt
- * Include image `alt`s.
- * @param {boolean} includeHtml
- * Include HTML.
- * @returns {string}
- * Serialized node.
- */
-function one(value, includeImageAlt, includeHtml) {
- if (node(value)) {
- if ('value' in value) {
- return value.type === 'html' && !includeHtml ? '' : value.value
- }
-
- if (includeImageAlt && 'alt' in value && value.alt) {
- return value.alt
- }
-
- if ('children' in value) {
- return lib_all(value.children, includeImageAlt, includeHtml)
- }
- }
-
- if (Array.isArray(value)) {
- return lib_all(value, includeImageAlt, includeHtml)
- }
-
- return ''
-}
-
-/**
- * Serialize a list of nodes.
- *
- * @param {Array<unknown>} values
- * Thing to serialize.
- * @param {boolean} includeImageAlt
- * Include image `alt`s.
- * @param {boolean} includeHtml
- * Include HTML.
- * @returns {string}
- * Serialized nodes.
- */
-function lib_all(values, includeImageAlt, includeHtml) {
- /** @type {Array<string>} */
- const result = []
- let index = -1
-
- while (++index < values.length) {
- result[index] = one(values[index], includeImageAlt, includeHtml)
- }
-
- return result.join('')
-}
-
-/**
- * Check if `value` looks like a node.
- *
- * @param {unknown} value
- * Thing.
- * @returns {value is Node}
- * Whether `value` is a node.
- */
-function node(value) {
- return Boolean(value && typeof value === 'object')
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-util-chunked/index.js
-/**
- * Like `Array#splice`, but smarter for giant arrays.
- *
- * `Array#splice` takes all items to be inserted as individual argument which
- * causes a stack overflow in V8 when trying to insert 100k items for instance.
- *
- * Otherwise, this does not return the removed items, and takes `items` as an
- * array instead of rest parameters.
- *
- * @template {unknown} T
- * Item type.
- * @param {Array<T>} list
- * List to operate on.
- * @param {number} start
- * Index to remove/insert at (can be negative).
- * @param {number} remove
- * Number of items to remove.
- * @param {Array<T>} items
- * Items to inject into `list`.
- * @returns {void}
- * Nothing.
- */
-function splice(list, start, remove, items) {
- const end = list.length
- let chunkStart = 0
- /** @type {Array<unknown>} */
- let parameters
-
- // Make start between zero and `end` (included).
- if (start < 0) {
- start = -start > end ? 0 : end + start
- } else {
- start = start > end ? end : start
- }
- remove = remove > 0 ? remove : 0
-
- // No need to chunk the items if there’s only a couple (10k) items.
- if (items.length < 10000) {
- parameters = Array.from(items)
- parameters.unshift(start, remove)
- // @ts-expect-error Hush, it’s fine.
- list.splice(...parameters)
- } else {
- // Delete `remove` items starting from `start`
- if (remove) list.splice(start, remove)
-
- // Insert the items in chunks to not cause stack overflows.
- while (chunkStart < items.length) {
- parameters = items.slice(chunkStart, chunkStart + 10000)
- parameters.unshift(start, 0)
- // @ts-expect-error Hush, it’s fine.
- list.splice(...parameters)
- chunkStart += 10000
- start += 10000
- }
- }
-}
-
-/**
- * Append `items` (an array) at the end of `list` (another array).
- * When `list` was empty, returns `items` instead.
- *
- * This prevents a potentially expensive operation when `list` is empty,
- * and adds items in batches to prevent V8 from hanging.
- *
- * @template {unknown} T
- * Item type.
- * @param {Array<T>} list
- * List to operate on.
- * @param {Array<T>} items
- * Items to add to `list`.
- * @returns {Array<T>}
- * Either `list` or `items`.
- */
-function push(list, items) {
- if (list.length > 0) {
- splice(list, list.length, 0, items)
- return list
- }
- return items
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-util-combine-extensions/index.js
-/**
- * @typedef {import('micromark-util-types').Extension} Extension
- * @typedef {import('micromark-util-types').Handles} Handles
- * @typedef {import('micromark-util-types').HtmlExtension} HtmlExtension
- * @typedef {import('micromark-util-types').NormalizedExtension} NormalizedExtension
- */
-
-
-
-const micromark_util_combine_extensions_hasOwnProperty = {}.hasOwnProperty
-
-/**
- * Combine multiple syntax extensions into one.
- *
- * @param {Array<Extension>} extensions
- * List of syntax extensions.
- * @returns {NormalizedExtension}
- * A single combined extension.
- */
-function combineExtensions(extensions) {
- /** @type {NormalizedExtension} */
- const all = {}
- let index = -1
-
- while (++index < extensions.length) {
- syntaxExtension(all, extensions[index])
- }
-
- return all
-}
-
-/**
- * Merge `extension` into `all`.
- *
- * @param {NormalizedExtension} all
- * Extension to merge into.
- * @param {Extension} extension
- * Extension to merge.
- * @returns {void}
- */
-function syntaxExtension(all, extension) {
- /** @type {keyof Extension} */
- let hook
-
- for (hook in extension) {
- const maybe = micromark_util_combine_extensions_hasOwnProperty.call(all, hook) ? all[hook] : undefined
- /** @type {Record<string, unknown>} */
- const left = maybe || (all[hook] = {})
- /** @type {Record<string, unknown> | undefined} */
- const right = extension[hook]
- /** @type {string} */
- let code
-
- if (right) {
- for (code in right) {
- if (!micromark_util_combine_extensions_hasOwnProperty.call(left, code)) left[code] = []
- const value = right[code]
- constructs(
- // @ts-expect-error Looks like a list.
- left[code],
- Array.isArray(value) ? value : value ? [value] : []
- )
- }
- }
- }
-}
-
-/**
- * Merge `list` into `existing` (both lists of constructs).
- * Mutates `existing`.
- *
- * @param {Array<unknown>} existing
- * @param {Array<unknown>} list
- * @returns {void}
- */
-function constructs(existing, list) {
- let index = -1
- /** @type {Array<unknown>} */
- const before = []
-
- while (++index < list.length) {
- // @ts-expect-error Looks like an object.
- ;(list[index].add === 'after' ? existing : before).push(list[index])
- }
-
- splice(existing, 0, 0, before)
-}
-
-/**
- * Combine multiple HTML extensions into one.
- *
- * @param {Array<HtmlExtension>} htmlExtensions
- * List of HTML extensions.
- * @returns {HtmlExtension}
- * A single combined HTML extension.
- */
-function combineHtmlExtensions(htmlExtensions) {
- /** @type {HtmlExtension} */
- const handlers = {}
- let index = -1
-
- while (++index < htmlExtensions.length) {
- htmlExtension(handlers, htmlExtensions[index])
- }
-
- return handlers
-}
-
-/**
- * Merge `extension` into `all`.
- *
- * @param {HtmlExtension} all
- * Extension to merge into.
- * @param {HtmlExtension} extension
- * Extension to merge.
- * @returns {void}
- */
-function htmlExtension(all, extension) {
- /** @type {keyof HtmlExtension} */
- let hook
-
- for (hook in extension) {
- const maybe = micromark_util_combine_extensions_hasOwnProperty.call(all, hook) ? all[hook] : undefined
- const left = maybe || (all[hook] = {})
- const right = extension[hook]
- /** @type {keyof Handles} */
- let type
-
- if (right) {
- for (type in right) {
- // @ts-expect-error assume document vs regular handler are managed correctly.
- left[type] = right[type]
- }
- }
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/micromark-util-character/lib/unicode-punctuation-regex.js
-// This module is generated by `script/`.
-//
-// CommonMark handles attention (emphasis, strong) markers based on what comes
-// before or after them.
-// One such difference is if those characters are Unicode punctuation.
-// This script is generated from the Unicode data.
-
-/**
- * Regular expression that matches a unicode punctuation character.
- */
-const unicodePunctuationRegex =
- /[!-\/:-@\[-`\{-~\xA1\xA7\xAB\xB6\xB7\xBB\xBF\u037E\u0387\u055A-\u055F\u0589\u058A\u05BE\u05C0\u05C3\u05C6\u05F3\u05F4\u0609\u060A\u060C\u060D\u061B\u061D-\u061F\u066A-\u066D\u06D4\u0700-\u070D\u07F7-\u07F9\u0830-\u083E\u085E\u0964\u0965\u0970\u09FD\u0A76\u0AF0\u0C77\u0C84\u0DF4\u0E4F\u0E5A\u0E5B\u0F04-\u0F12\u0F14\u0F3A-\u0F3D\u0F85\u0FD0-\u0FD4\u0FD9\u0FDA\u104A-\u104F\u10FB\u1360-\u1368\u1400\u166E\u169B\u169C\u16EB-\u16ED\u1735\u1736\u17D4-\u17D6\u17D8-\u17DA\u1800-\u180A\u1944\u1945\u1A1E\u1A1F\u1AA0-\u1AA6\u1AA8-\u1AAD\u1B5A-\u1B60\u1B7D\u1B7E\u1BFC-\u1BFF\u1C3B-\u1C3F\u1C7E\u1C7F\u1CC0-\u1CC7\u1CD3\u2010-\u2027\u2030-\u2043\u2045-\u2051\u2053-\u205E\u207D\u207E\u208D\u208E\u2308-\u230B\u2329\u232A\u2768-\u2775\u27C5\u27C6\u27E6-\u27EF\u2983-\u2998\u29D8-\u29DB\u29FC\u29FD\u2CF9-\u2CFC\u2CFE\u2CFF\u2D70\u2E00-\u2E2E\u2E30-\u2E4F\u2E52-\u2E5D\u3001-\u3003\u3008-\u3011\u3014-\u301F\u3030\u303D\u30A0\u30FB\uA4FE\uA4FF\uA60D-\uA60F\uA673\uA67E\uA6F2-\uA6F7\uA874-\uA877\uA8CE\uA8CF\uA8F8-\uA8FA\uA8FC\uA92E\uA92F\uA95F\uA9C1-\uA9CD\uA9DE\uA9DF\uAA5C-\uAA5F\uAADE\uAADF\uAAF0\uAAF1\uABEB\uFD3E\uFD3F\uFE10-\uFE19\uFE30-\uFE52\uFE54-\uFE61\uFE63\uFE68\uFE6A\uFE6B\uFF01-\uFF03\uFF05-\uFF0A\uFF0C-\uFF0F\uFF1A\uFF1B\uFF1F\uFF20\uFF3B-\uFF3D\uFF3F\uFF5B\uFF5D\uFF5F-\uFF65]/
-
-;// CONCATENATED MODULE: ./node_modules/micromark-util-character/index.js
-/**
- * @typedef {import('micromark-util-types').Code} Code
- */
-
-
-
-/**
- * Check whether the character code represents an ASCII alpha (`a` through `z`,
- * case insensitive).
- *
- * An **ASCII alpha** is an ASCII upper alpha or ASCII lower alpha.
- *
- * An **ASCII upper alpha** is a character in the inclusive range U+0041 (`A`)
- * to U+005A (`Z`).
- *
- * An **ASCII lower alpha** is a character in the inclusive range U+0061 (`a`)
- * to U+007A (`z`).
- *
- * @param code
- * Code.
- * @returns
- * Whether it matches.
- */
-const asciiAlpha = regexCheck(/[A-Za-z]/)
-
-/**
- * Check whether the character code represents an ASCII alphanumeric (`a`
- * through `z`, case insensitive, or `0` through `9`).
- *
- * An **ASCII alphanumeric** is an ASCII digit (see `asciiDigit`) or ASCII alpha
- * (see `asciiAlpha`).
- *
- * @param code
- * Code.
- * @returns
- * Whether it matches.
- */
-const asciiAlphanumeric = regexCheck(/[\dA-Za-z]/)
-
-/**
- * Check whether the character code represents an ASCII atext.
- *
- * atext is an ASCII alphanumeric (see `asciiAlphanumeric`), or a character in
- * the inclusive ranges U+0023 NUMBER SIGN (`#`) to U+0027 APOSTROPHE (`'`),
- * U+002A ASTERISK (`*`), U+002B PLUS SIGN (`+`), U+002D DASH (`-`), U+002F
- * SLASH (`/`), U+003D EQUALS TO (`=`), U+003F QUESTION MARK (`?`), U+005E
- * CARET (`^`) to U+0060 GRAVE ACCENT (`` ` ``), or U+007B LEFT CURLY BRACE
- * (`{`) to U+007E TILDE (`~`).
- *
- * See:
- * **\[RFC5322]**:
- * [Internet Message Format](https://tools.ietf.org/html/rfc5322).
- * P. Resnick.
- * IETF.
- *
- * @param code
- * Code.
- * @returns
- * Whether it matches.
- */
-const asciiAtext = regexCheck(/[#-'*+\--9=?A-Z^-~]/)
-
-/**
- * Check whether a character code is an ASCII control character.
- *
- * An **ASCII control** is a character in the inclusive range U+0000 NULL (NUL)
- * to U+001F (US), or U+007F (DEL).
- *
- * @param {Code} code
- * Code.
- * @returns {boolean}
- * Whether it matches.
- */
-function asciiControl(code) {
- return (
- // Special whitespace codes (which have negative values), C0 and Control
- // character DEL
- code !== null && (code < 32 || code === 127)
- )
-}
-
-/**
- * Check whether the character code represents an ASCII digit (`0` through `9`).
- *
- * An **ASCII digit** is a character in the inclusive range U+0030 (`0`) to
- * U+0039 (`9`).
- *
- * @param code
- * Code.
- * @returns
- * Whether it matches.
- */
-const asciiDigit = regexCheck(/\d/)
-
-/**
- * Check whether the character code represents an ASCII hex digit (`a` through
- * `f`, case insensitive, or `0` through `9`).
- *
- * An **ASCII hex digit** is an ASCII digit (see `asciiDigit`), ASCII upper hex
- * digit, or an ASCII lower hex digit.
- *
- * An **ASCII upper hex digit** is a character in the inclusive range U+0041
- * (`A`) to U+0046 (`F`).
- *
- * An **ASCII lower hex digit** is a character in the inclusive range U+0061
- * (`a`) to U+0066 (`f`).
- *
- * @param code
- * Code.
- * @returns
- * Whether it matches.
- */
-const asciiHexDigit = regexCheck(/[\dA-Fa-f]/)
-
-/**
- * Check whether the character code represents ASCII punctuation.
- *
- * An **ASCII punctuation** is a character in the inclusive ranges U+0021
- * EXCLAMATION MARK (`!`) to U+002F SLASH (`/`), U+003A COLON (`:`) to U+0040 AT
- * SIGN (`@`), U+005B LEFT SQUARE BRACKET (`[`) to U+0060 GRAVE ACCENT
- * (`` ` ``), or U+007B LEFT CURLY BRACE (`{`) to U+007E TILDE (`~`).
- *
- * @param code
- * Code.
- * @returns
- * Whether it matches.
- */
-const asciiPunctuation = regexCheck(/[!-/:-@[-`{-~]/)
-
-/**
- * Check whether a character code is a markdown line ending.
- *
- * A **markdown line ending** is the virtual characters M-0003 CARRIAGE RETURN
- * LINE FEED (CRLF), M-0004 LINE FEED (LF) and M-0005 CARRIAGE RETURN (CR).
- *
- * In micromark, the actual character U+000A LINE FEED (LF) and U+000D CARRIAGE
- * RETURN (CR) are replaced by these virtual characters depending on whether
- * they occurred together.
- *
- * @param {Code} code
- * Code.
- * @returns {boolean}
- * Whether it matches.
- */
-function markdownLineEnding(code) {
- return code !== null && code < -2
-}
-
-/**
- * Check whether a character code is a markdown line ending (see
- * `markdownLineEnding`) or markdown space (see `markdownSpace`).
- *
- * @param {Code} code
- * Code.
- * @returns {boolean}
- * Whether it matches.
- */
-function markdownLineEndingOrSpace(code) {
- return code !== null && (code < 0 || code === 32)
-}
-
-/**
- * Check whether a character code is a markdown space.
- *
- * A **markdown space** is the concrete character U+0020 SPACE (SP) and the
- * virtual characters M-0001 VIRTUAL SPACE (VS) and M-0002 HORIZONTAL TAB (HT).
- *
- * In micromark, the actual character U+0009 CHARACTER TABULATION (HT) is
- * replaced by one M-0002 HORIZONTAL TAB (HT) and between 0 and 3 M-0001 VIRTUAL
- * SPACE (VS) characters, depending on the column at which the tab occurred.
- *
- * @param {Code} code
- * Code.
- * @returns {boolean}
- * Whether it matches.
- */
-function markdownSpace(code) {
- return code === -2 || code === -1 || code === 32
-}
-
-// Size note: removing ASCII from the regex and using `asciiPunctuation` here
-// In fact adds to the bundle size.
-/**
- * Check whether the character code represents Unicode punctuation.
- *
- * A **Unicode punctuation** is a character in the Unicode `Pc` (Punctuation,
- * Connector), `Pd` (Punctuation, Dash), `Pe` (Punctuation, Close), `Pf`
- * (Punctuation, Final quote), `Pi` (Punctuation, Initial quote), `Po`
- * (Punctuation, Other), or `Ps` (Punctuation, Open) categories, or an ASCII
- * punctuation (see `asciiPunctuation`).
- *
- * See:
- * **\[UNICODE]**:
- * [The Unicode Standard](https://www.unicode.org/versions/).
- * Unicode Consortium.
- *
- * @param code
- * Code.
- * @returns
- * Whether it matches.
- */
-const unicodePunctuation = regexCheck(unicodePunctuationRegex)
-
-/**
- * Check whether the character code represents Unicode whitespace.
- *
- * Note that this does handle micromark specific markdown whitespace characters.
- * See `markdownLineEndingOrSpace` to check that.
- *
- * A **Unicode whitespace** is a character in the Unicode `Zs` (Separator,
- * Space) category, or U+0009 CHARACTER TABULATION (HT), U+000A LINE FEED (LF),
- * U+000C (FF), or U+000D CARRIAGE RETURN (CR) (**\[UNICODE]**).
- *
- * See:
- * **\[UNICODE]**:
- * [The Unicode Standard](https://www.unicode.org/versions/).
- * Unicode Consortium.
- *
- * @param code
- * Code.
- * @returns
- * Whether it matches.
- */
-const unicodeWhitespace = regexCheck(/\s/)
-
-/**
- * Create a code check from a regex.
- *
- * @param {RegExp} regex
- * @returns {(code: Code) => boolean}
- */
-function regexCheck(regex) {
- return check
-
- /**
- * Check whether a code matches the bound regex.
- *
- * @param {Code} code
- * Character code.
- * @returns {boolean}
- * Whether the character code matches the bound regex.
- */
- function check(code) {
- return code !== null && regex.test(String.fromCharCode(code))
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/micromark-factory-space/index.js
-/**
- * @typedef {import('micromark-util-types').Effects} Effects
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').TokenType} TokenType
- */
-
-
-
-// To do: implement `spaceOrTab`, `spaceOrTabMinMax`, `spaceOrTabWithOptions`.
-
-/**
- * Parse spaces and tabs.
- *
- * There is no `nok` parameter:
- *
- * * spaces in markdown are often optional, in which case this factory can be
- * used and `ok` will be switched to whether spaces were found or not
- * * one line ending or space can be detected with `markdownSpace(code)` right
- * before using `factorySpace`
- *
- * ###### Examples
- *
- * Where `␉` represents a tab (plus how much it expands) and `␠` represents a
- * single space.
- *
- * ```markdown
- * ␉
- * ␠␠␠␠
- * ␉␠
- * ```
- *
- * @param {Effects} effects
- * Context.
- * @param {State} ok
- * State switched to when successful.
- * @param {TokenType} type
- * Type (`' \t'`).
- * @param {number | undefined} [max=Infinity]
- * Max (exclusive).
- * @returns
- * Start state.
- */
-function factorySpace(effects, ok, type, max) {
- const limit = max ? max - 1 : Number.POSITIVE_INFINITY
- let size = 0
- return start
-
- /** @type {State} */
- function start(code) {
- if (markdownSpace(code)) {
- effects.enter(type)
- return prefix(code)
- }
- return ok(code)
- }
-
- /** @type {State} */
- function prefix(code) {
- if (markdownSpace(code) && size++ < limit) {
- effects.consume(code)
- return prefix
- }
- effects.exit(type)
- return ok(code)
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark/lib/initialize/content.js
-/**
- * @typedef {import('micromark-util-types').InitialConstruct} InitialConstruct
- * @typedef {import('micromark-util-types').Initializer} Initializer
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').Token} Token
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- */
-
-
-
-/** @type {InitialConstruct} */
-const content = {
- tokenize: initializeContent
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Initializer}
- */
-function initializeContent(effects) {
- const contentStart = effects.attempt(
- this.parser.constructs.contentInitial,
- afterContentStartConstruct,
- paragraphInitial
- )
- /** @type {Token} */
- let previous
- return contentStart
-
- /** @type {State} */
- function afterContentStartConstruct(code) {
- if (code === null) {
- effects.consume(code)
- return
- }
- effects.enter('lineEnding')
- effects.consume(code)
- effects.exit('lineEnding')
- return factorySpace(effects, contentStart, 'linePrefix')
- }
-
- /** @type {State} */
- function paragraphInitial(code) {
- effects.enter('paragraph')
- return lineStart(code)
- }
-
- /** @type {State} */
- function lineStart(code) {
- const token = effects.enter('chunkText', {
- contentType: 'text',
- previous
- })
- if (previous) {
- previous.next = token
- }
- previous = token
- return data(code)
- }
-
- /** @type {State} */
- function data(code) {
- if (code === null) {
- effects.exit('chunkText')
- effects.exit('paragraph')
- effects.consume(code)
- return
- }
- if (markdownLineEnding(code)) {
- effects.consume(code)
- effects.exit('chunkText')
- return lineStart
- }
-
- // Data.
- effects.consume(code)
- return data
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark/lib/initialize/document.js
-/**
- * @typedef {import('micromark-util-types').Construct} Construct
- * @typedef {import('micromark-util-types').ContainerState} ContainerState
- * @typedef {import('micromark-util-types').InitialConstruct} InitialConstruct
- * @typedef {import('micromark-util-types').Initializer} Initializer
- * @typedef {import('micromark-util-types').Point} Point
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').Token} Token
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- * @typedef {import('micromark-util-types').Tokenizer} Tokenizer
- */
-
-/**
- * @typedef {[Construct, ContainerState]} StackItem
- */
-
-
-
-
-/** @type {InitialConstruct} */
-const document_document = {
- tokenize: initializeDocument
-}
-
-/** @type {Construct} */
-const containerConstruct = {
- tokenize: tokenizeContainer
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Initializer}
- */
-function initializeDocument(effects) {
- const self = this
- /** @type {Array<StackItem>} */
- const stack = []
- let continued = 0
- /** @type {TokenizeContext | undefined} */
- let childFlow
- /** @type {Token | undefined} */
- let childToken
- /** @type {number} */
- let lineStartOffset
- return start
-
- /** @type {State} */
- function start(code) {
- // First we iterate through the open blocks, starting with the root
- // document, and descending through last children down to the last open
- // block.
- // Each block imposes a condition that the line must satisfy if the block is
- // to remain open.
- // For example, a block quote requires a `>` character.
- // A paragraph requires a non-blank line.
- // In this phase we may match all or just some of the open blocks.
- // But we cannot close unmatched blocks yet, because we may have a lazy
- // continuation line.
- if (continued < stack.length) {
- const item = stack[continued]
- self.containerState = item[1]
- return effects.attempt(
- item[0].continuation,
- documentContinue,
- checkNewContainers
- )(code)
- }
-
- // Done.
- return checkNewContainers(code)
- }
-
- /** @type {State} */
- function documentContinue(code) {
- continued++
-
- // Note: this field is called `_closeFlow` but it also closes containers.
- // Perhaps a good idea to rename it but it’s already used in the wild by
- // extensions.
- if (self.containerState._closeFlow) {
- self.containerState._closeFlow = undefined
- if (childFlow) {
- closeFlow()
- }
-
- // Note: this algorithm for moving events around is similar to the
- // algorithm when dealing with lazy lines in `writeToChild`.
- const indexBeforeExits = self.events.length
- let indexBeforeFlow = indexBeforeExits
- /** @type {Point | undefined} */
- let point
-
- // Find the flow chunk.
- while (indexBeforeFlow--) {
- if (
- self.events[indexBeforeFlow][0] === 'exit' &&
- self.events[indexBeforeFlow][1].type === 'chunkFlow'
- ) {
- point = self.events[indexBeforeFlow][1].end
- break
- }
- }
- exitContainers(continued)
-
- // Fix positions.
- let index = indexBeforeExits
- while (index < self.events.length) {
- self.events[index][1].end = Object.assign({}, point)
- index++
- }
-
- // Inject the exits earlier (they’re still also at the end).
- splice(
- self.events,
- indexBeforeFlow + 1,
- 0,
- self.events.slice(indexBeforeExits)
- )
-
- // Discard the duplicate exits.
- self.events.length = index
- return checkNewContainers(code)
- }
- return start(code)
- }
-
- /** @type {State} */
- function checkNewContainers(code) {
- // Next, after consuming the continuation markers for existing blocks, we
- // look for new block starts (e.g. `>` for a block quote).
- // If we encounter a new block start, we close any blocks unmatched in
- // step 1 before creating the new block as a child of the last matched
- // block.
- if (continued === stack.length) {
- // No need to `check` whether there’s a container, of `exitContainers`
- // would be moot.
- // We can instead immediately `attempt` to parse one.
- if (!childFlow) {
- return documentContinued(code)
- }
-
- // If we have concrete content, such as block HTML or fenced code,
- // we can’t have containers “pierce” into them, so we can immediately
- // start.
- if (childFlow.currentConstruct && childFlow.currentConstruct.concrete) {
- return flowStart(code)
- }
-
- // If we do have flow, it could still be a blank line,
- // but we’d be interrupting it w/ a new container if there’s a current
- // construct.
- // To do: next major: remove `_gfmTableDynamicInterruptHack` (no longer
- // needed in micromark-extension-gfm-table@1.0.6).
- self.interrupt = Boolean(
- childFlow.currentConstruct && !childFlow._gfmTableDynamicInterruptHack
- )
- }
-
- // Check if there is a new container.
- self.containerState = {}
- return effects.check(
- containerConstruct,
- thereIsANewContainer,
- thereIsNoNewContainer
- )(code)
- }
-
- /** @type {State} */
- function thereIsANewContainer(code) {
- if (childFlow) closeFlow()
- exitContainers(continued)
- return documentContinued(code)
- }
-
- /** @type {State} */
- function thereIsNoNewContainer(code) {
- self.parser.lazy[self.now().line] = continued !== stack.length
- lineStartOffset = self.now().offset
- return flowStart(code)
- }
-
- /** @type {State} */
- function documentContinued(code) {
- // Try new containers.
- self.containerState = {}
- return effects.attempt(
- containerConstruct,
- containerContinue,
- flowStart
- )(code)
- }
-
- /** @type {State} */
- function containerContinue(code) {
- continued++
- stack.push([self.currentConstruct, self.containerState])
- // Try another.
- return documentContinued(code)
- }
-
- /** @type {State} */
- function flowStart(code) {
- if (code === null) {
- if (childFlow) closeFlow()
- exitContainers(0)
- effects.consume(code)
- return
- }
- childFlow = childFlow || self.parser.flow(self.now())
- effects.enter('chunkFlow', {
- contentType: 'flow',
- previous: childToken,
- _tokenizer: childFlow
- })
- return flowContinue(code)
- }
-
- /** @type {State} */
- function flowContinue(code) {
- if (code === null) {
- writeToChild(effects.exit('chunkFlow'), true)
- exitContainers(0)
- effects.consume(code)
- return
- }
- if (markdownLineEnding(code)) {
- effects.consume(code)
- writeToChild(effects.exit('chunkFlow'))
- // Get ready for the next line.
- continued = 0
- self.interrupt = undefined
- return start
- }
- effects.consume(code)
- return flowContinue
- }
-
- /**
- * @param {Token} token
- * @param {boolean | undefined} [eof]
- * @returns {void}
- */
- function writeToChild(token, eof) {
- const stream = self.sliceStream(token)
- if (eof) stream.push(null)
- token.previous = childToken
- if (childToken) childToken.next = token
- childToken = token
- childFlow.defineSkip(token.start)
- childFlow.write(stream)
-
- // Alright, so we just added a lazy line:
- //
- // ```markdown
- // > a
- // b.
- //
- // Or:
- //
- // > ~~~c
- // d
- //
- // Or:
- //
- // > | e |
- // f
- // ```
- //
- // The construct in the second example (fenced code) does not accept lazy
- // lines, so it marked itself as done at the end of its first line, and
- // then the content construct parses `d`.
- // Most constructs in markdown match on the first line: if the first line
- // forms a construct, a non-lazy line can’t “unmake” it.
- //
- // The construct in the third example is potentially a GFM table, and
- // those are *weird*.
- // It *could* be a table, from the first line, if the following line
- // matches a condition.
- // In this case, that second line is lazy, which “unmakes” the first line
- // and turns the whole into one content block.
- //
- // We’ve now parsed the non-lazy and the lazy line, and can figure out
- // whether the lazy line started a new flow block.
- // If it did, we exit the current containers between the two flow blocks.
- if (self.parser.lazy[token.start.line]) {
- let index = childFlow.events.length
- while (index--) {
- if (
- // The token starts before the line ending…
- childFlow.events[index][1].start.offset < lineStartOffset &&
- // …and either is not ended yet…
- (!childFlow.events[index][1].end ||
- // …or ends after it.
- childFlow.events[index][1].end.offset > lineStartOffset)
- ) {
- // Exit: there’s still something open, which means it’s a lazy line
- // part of something.
- return
- }
- }
-
- // Note: this algorithm for moving events around is similar to the
- // algorithm when closing flow in `documentContinue`.
- const indexBeforeExits = self.events.length
- let indexBeforeFlow = indexBeforeExits
- /** @type {boolean | undefined} */
- let seen
- /** @type {Point | undefined} */
- let point
-
- // Find the previous chunk (the one before the lazy line).
- while (indexBeforeFlow--) {
- if (
- self.events[indexBeforeFlow][0] === 'exit' &&
- self.events[indexBeforeFlow][1].type === 'chunkFlow'
- ) {
- if (seen) {
- point = self.events[indexBeforeFlow][1].end
- break
- }
- seen = true
- }
- }
- exitContainers(continued)
-
- // Fix positions.
- index = indexBeforeExits
- while (index < self.events.length) {
- self.events[index][1].end = Object.assign({}, point)
- index++
- }
-
- // Inject the exits earlier (they’re still also at the end).
- splice(
- self.events,
- indexBeforeFlow + 1,
- 0,
- self.events.slice(indexBeforeExits)
- )
-
- // Discard the duplicate exits.
- self.events.length = index
- }
- }
-
- /**
- * @param {number} size
- * @returns {void}
- */
- function exitContainers(size) {
- let index = stack.length
-
- // Exit open containers.
- while (index-- > size) {
- const entry = stack[index]
- self.containerState = entry[1]
- entry[0].exit.call(self, effects)
- }
- stack.length = size
- }
- function closeFlow() {
- childFlow.write([null])
- childToken = undefined
- childFlow = undefined
- self.containerState._closeFlow = undefined
- }
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeContainer(effects, ok, nok) {
- // Always populated by defaults.
-
- return factorySpace(
- effects,
- effects.attempt(this.parser.constructs.document, ok, nok),
- 'linePrefix',
- this.parser.constructs.disable.null.includes('codeIndented') ? undefined : 4
- )
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-core-commonmark/lib/blank-line.js
-/**
- * @typedef {import('micromark-util-types').Construct} Construct
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- * @typedef {import('micromark-util-types').Tokenizer} Tokenizer
- */
-
-
-
-/** @type {Construct} */
-const blankLine = {
- tokenize: tokenizeBlankLine,
- partial: true
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeBlankLine(effects, ok, nok) {
- return start
-
- /**
- * Start of blank line.
- *
- * > 👉 **Note**: `␠` represents a space character.
- *
- * ```markdown
- * > | ␠␠␊
- * ^
- * > | ␊
- * ^
- * ```
- *
- * @type {State}
- */
- function start(code) {
- return markdownSpace(code)
- ? factorySpace(effects, after, 'linePrefix')(code)
- : after(code)
- }
-
- /**
- * At eof/eol, after optional whitespace.
- *
- * > 👉 **Note**: `␠` represents a space character.
- *
- * ```markdown
- * > | ␠␠␊
- * ^
- * > | ␊
- * ^
- * ```
- *
- * @type {State}
- */
- function after(code) {
- return code === null || markdownLineEnding(code) ? ok(code) : nok(code)
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-util-subtokenize/index.js
-/**
- * @typedef {import('micromark-util-types').Chunk} Chunk
- * @typedef {import('micromark-util-types').Event} Event
- * @typedef {import('micromark-util-types').Token} Token
- */
-
-
-/**
- * Tokenize subcontent.
- *
- * @param {Array<Event>} events
- * List of events.
- * @returns {boolean}
- * Whether subtokens were found.
- */
-function subtokenize(events) {
- /** @type {Record<string, number>} */
- const jumps = {}
- let index = -1
- /** @type {Event} */
- let event
- /** @type {number | undefined} */
- let lineIndex
- /** @type {number} */
- let otherIndex
- /** @type {Event} */
- let otherEvent
- /** @type {Array<Event>} */
- let parameters
- /** @type {Array<Event>} */
- let subevents
- /** @type {boolean | undefined} */
- let more
- while (++index < events.length) {
- while (index in jumps) {
- index = jumps[index]
- }
- event = events[index]
-
- // Add a hook for the GFM tasklist extension, which needs to know if text
- // is in the first content of a list item.
- if (
- index &&
- event[1].type === 'chunkFlow' &&
- events[index - 1][1].type === 'listItemPrefix'
- ) {
- subevents = event[1]._tokenizer.events
- otherIndex = 0
- if (
- otherIndex < subevents.length &&
- subevents[otherIndex][1].type === 'lineEndingBlank'
- ) {
- otherIndex += 2
- }
- if (
- otherIndex < subevents.length &&
- subevents[otherIndex][1].type === 'content'
- ) {
- while (++otherIndex < subevents.length) {
- if (subevents[otherIndex][1].type === 'content') {
- break
- }
- if (subevents[otherIndex][1].type === 'chunkText') {
- subevents[otherIndex][1]._isInFirstContentOfListItem = true
- otherIndex++
- }
- }
- }
- }
-
- // Enter.
- if (event[0] === 'enter') {
- if (event[1].contentType) {
- Object.assign(jumps, subcontent(events, index))
- index = jumps[index]
- more = true
- }
- }
- // Exit.
- else if (event[1]._container) {
- otherIndex = index
- lineIndex = undefined
- while (otherIndex--) {
- otherEvent = events[otherIndex]
- if (
- otherEvent[1].type === 'lineEnding' ||
- otherEvent[1].type === 'lineEndingBlank'
- ) {
- if (otherEvent[0] === 'enter') {
- if (lineIndex) {
- events[lineIndex][1].type = 'lineEndingBlank'
- }
- otherEvent[1].type = 'lineEnding'
- lineIndex = otherIndex
- }
- } else {
- break
- }
- }
- if (lineIndex) {
- // Fix position.
- event[1].end = Object.assign({}, events[lineIndex][1].start)
-
- // Switch container exit w/ line endings.
- parameters = events.slice(lineIndex, index)
- parameters.unshift(event)
- splice(events, lineIndex, index - lineIndex + 1, parameters)
- }
- }
- }
- return !more
-}
-
-/**
- * Tokenize embedded tokens.
- *
- * @param {Array<Event>} events
- * @param {number} eventIndex
- * @returns {Record<string, number>}
- */
-function subcontent(events, eventIndex) {
- const token = events[eventIndex][1]
- const context = events[eventIndex][2]
- let startPosition = eventIndex - 1
- /** @type {Array<number>} */
- const startPositions = []
- const tokenizer =
- token._tokenizer || context.parser[token.contentType](token.start)
- const childEvents = tokenizer.events
- /** @type {Array<[number, number]>} */
- const jumps = []
- /** @type {Record<string, number>} */
- const gaps = {}
- /** @type {Array<Chunk>} */
- let stream
- /** @type {Token | undefined} */
- let previous
- let index = -1
- /** @type {Token | undefined} */
- let current = token
- let adjust = 0
- let start = 0
- const breaks = [start]
-
- // Loop forward through the linked tokens to pass them in order to the
- // subtokenizer.
- while (current) {
- // Find the position of the event for this token.
- while (events[++startPosition][1] !== current) {
- // Empty.
- }
- startPositions.push(startPosition)
- if (!current._tokenizer) {
- stream = context.sliceStream(current)
- if (!current.next) {
- stream.push(null)
- }
- if (previous) {
- tokenizer.defineSkip(current.start)
- }
- if (current._isInFirstContentOfListItem) {
- tokenizer._gfmTasklistFirstContentOfListItem = true
- }
- tokenizer.write(stream)
- if (current._isInFirstContentOfListItem) {
- tokenizer._gfmTasklistFirstContentOfListItem = undefined
- }
- }
-
- // Unravel the next token.
- previous = current
- current = current.next
- }
-
- // Now, loop back through all events (and linked tokens), to figure out which
- // parts belong where.
- current = token
- while (++index < childEvents.length) {
- if (
- // Find a void token that includes a break.
- childEvents[index][0] === 'exit' &&
- childEvents[index - 1][0] === 'enter' &&
- childEvents[index][1].type === childEvents[index - 1][1].type &&
- childEvents[index][1].start.line !== childEvents[index][1].end.line
- ) {
- start = index + 1
- breaks.push(start)
- // Help GC.
- current._tokenizer = undefined
- current.previous = undefined
- current = current.next
- }
- }
-
- // Help GC.
- tokenizer.events = []
-
- // If there’s one more token (which is the cases for lines that end in an
- // EOF), that’s perfect: the last point we found starts it.
- // If there isn’t then make sure any remaining content is added to it.
- if (current) {
- // Help GC.
- current._tokenizer = undefined
- current.previous = undefined
- } else {
- breaks.pop()
- }
-
- // Now splice the events from the subtokenizer into the current events,
- // moving back to front so that splice indices aren’t affected.
- index = breaks.length
- while (index--) {
- const slice = childEvents.slice(breaks[index], breaks[index + 1])
- const start = startPositions.pop()
- jumps.unshift([start, start + slice.length - 1])
- splice(events, start, 2, slice)
- }
- index = -1
- while (++index < jumps.length) {
- gaps[adjust + jumps[index][0]] = adjust + jumps[index][1]
- adjust += jumps[index][1] - jumps[index][0] - 1
- }
- return gaps
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-core-commonmark/lib/content.js
-/**
- * @typedef {import('micromark-util-types').Construct} Construct
- * @typedef {import('micromark-util-types').Resolver} Resolver
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').Token} Token
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- * @typedef {import('micromark-util-types').Tokenizer} Tokenizer
- */
-
-
-
-
-/**
- * No name because it must not be turned off.
- * @type {Construct}
- */
-const content_content = {
- tokenize: tokenizeContent,
- resolve: resolveContent
-}
-
-/** @type {Construct} */
-const continuationConstruct = {
- tokenize: tokenizeContinuation,
- partial: true
-}
-
-/**
- * Content is transparent: it’s parsed right now. That way, definitions are also
- * parsed right now: before text in paragraphs (specifically, media) are parsed.
- *
- * @type {Resolver}
- */
-function resolveContent(events) {
- subtokenize(events)
- return events
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeContent(effects, ok) {
- /** @type {Token | undefined} */
- let previous
- return chunkStart
-
- /**
- * Before a content chunk.
- *
- * ```markdown
- * > | abc
- * ^
- * ```
- *
- * @type {State}
- */
- function chunkStart(code) {
- effects.enter('content')
- previous = effects.enter('chunkContent', {
- contentType: 'content'
- })
- return chunkInside(code)
- }
-
- /**
- * In a content chunk.
- *
- * ```markdown
- * > | abc
- * ^^^
- * ```
- *
- * @type {State}
- */
- function chunkInside(code) {
- if (code === null) {
- return contentEnd(code)
- }
-
- // To do: in `markdown-rs`, each line is parsed on its own, and everything
- // is stitched together resolving.
- if (markdownLineEnding(code)) {
- return effects.check(
- continuationConstruct,
- contentContinue,
- contentEnd
- )(code)
- }
-
- // Data.
- effects.consume(code)
- return chunkInside
- }
-
- /**
- *
- *
- * @type {State}
- */
- function contentEnd(code) {
- effects.exit('chunkContent')
- effects.exit('content')
- return ok(code)
- }
-
- /**
- *
- *
- * @type {State}
- */
- function contentContinue(code) {
- effects.consume(code)
- effects.exit('chunkContent')
- previous.next = effects.enter('chunkContent', {
- contentType: 'content',
- previous
- })
- previous = previous.next
- return chunkInside
- }
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeContinuation(effects, ok, nok) {
- const self = this
- return startLookahead
-
- /**
- *
- *
- * @type {State}
- */
- function startLookahead(code) {
- effects.exit('chunkContent')
- effects.enter('lineEnding')
- effects.consume(code)
- effects.exit('lineEnding')
- return factorySpace(effects, prefixed, 'linePrefix')
- }
-
- /**
- *
- *
- * @type {State}
- */
- function prefixed(code) {
- if (code === null || markdownLineEnding(code)) {
- return nok(code)
- }
-
- // Always populated by defaults.
-
- const tail = self.events[self.events.length - 1]
- if (
- !self.parser.constructs.disable.null.includes('codeIndented') &&
- tail &&
- tail[1].type === 'linePrefix' &&
- tail[2].sliceSerialize(tail[1], true).length >= 4
- ) {
- return ok(code)
- }
- return effects.interrupt(self.parser.constructs.flow, nok, ok)(code)
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark/lib/initialize/flow.js
-/**
- * @typedef {import('micromark-util-types').InitialConstruct} InitialConstruct
- * @typedef {import('micromark-util-types').Initializer} Initializer
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- */
-
-
-
-
-/** @type {InitialConstruct} */
-const flow = {
- tokenize: initializeFlow
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Initializer}
- */
-function initializeFlow(effects) {
- const self = this
- const initial = effects.attempt(
- // Try to parse a blank line.
- blankLine,
- atBlankEnding,
- // Try to parse initial flow (essentially, only code).
- effects.attempt(
- this.parser.constructs.flowInitial,
- afterConstruct,
- factorySpace(
- effects,
- effects.attempt(
- this.parser.constructs.flow,
- afterConstruct,
- effects.attempt(content_content, afterConstruct)
- ),
- 'linePrefix'
- )
- )
- )
- return initial
-
- /** @type {State} */
- function atBlankEnding(code) {
- if (code === null) {
- effects.consume(code)
- return
- }
- effects.enter('lineEndingBlank')
- effects.consume(code)
- effects.exit('lineEndingBlank')
- self.currentConstruct = undefined
- return initial
- }
-
- /** @type {State} */
- function afterConstruct(code) {
- if (code === null) {
- effects.consume(code)
- return
- }
- effects.enter('lineEnding')
- effects.consume(code)
- effects.exit('lineEnding')
- self.currentConstruct = undefined
- return initial
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark/lib/initialize/text.js
-/**
- * @typedef {import('micromark-util-types').Code} Code
- * @typedef {import('micromark-util-types').InitialConstruct} InitialConstruct
- * @typedef {import('micromark-util-types').Initializer} Initializer
- * @typedef {import('micromark-util-types').Resolver} Resolver
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- */
-
-const resolver = {
- resolveAll: createResolver()
-}
-const string = initializeFactory('string')
-const text_text = initializeFactory('text')
-
-/**
- * @param {'string' | 'text'} field
- * @returns {InitialConstruct}
- */
-function initializeFactory(field) {
- return {
- tokenize: initializeText,
- resolveAll: createResolver(
- field === 'text' ? resolveAllLineSuffixes : undefined
- )
- }
-
- /**
- * @this {TokenizeContext}
- * @type {Initializer}
- */
- function initializeText(effects) {
- const self = this
- const constructs = this.parser.constructs[field]
- const text = effects.attempt(constructs, start, notText)
- return start
-
- /** @type {State} */
- function start(code) {
- return atBreak(code) ? text(code) : notText(code)
- }
-
- /** @type {State} */
- function notText(code) {
- if (code === null) {
- effects.consume(code)
- return
- }
- effects.enter('data')
- effects.consume(code)
- return data
- }
-
- /** @type {State} */
- function data(code) {
- if (atBreak(code)) {
- effects.exit('data')
- return text(code)
- }
-
- // Data.
- effects.consume(code)
- return data
- }
-
- /**
- * @param {Code} code
- * @returns {boolean}
- */
- function atBreak(code) {
- if (code === null) {
- return true
- }
- const list = constructs[code]
- let index = -1
- if (list) {
- // Always populated by defaults.
-
- while (++index < list.length) {
- const item = list[index]
- if (!item.previous || item.previous.call(self, self.previous)) {
- return true
- }
- }
- }
- return false
- }
- }
-}
-
-/**
- * @param {Resolver | undefined} [extraResolver]
- * @returns {Resolver}
- */
-function createResolver(extraResolver) {
- return resolveAllText
-
- /** @type {Resolver} */
- function resolveAllText(events, context) {
- let index = -1
- /** @type {number | undefined} */
- let enter
-
- // A rather boring computation (to merge adjacent `data` events) which
- // improves mm performance by 29%.
- while (++index <= events.length) {
- if (enter === undefined) {
- if (events[index] && events[index][1].type === 'data') {
- enter = index
- index++
- }
- } else if (!events[index] || events[index][1].type !== 'data') {
- // Don’t do anything if there is one data token.
- if (index !== enter + 2) {
- events[enter][1].end = events[index - 1][1].end
- events.splice(enter + 2, index - enter - 2)
- index = enter + 2
- }
- enter = undefined
- }
- }
- return extraResolver ? extraResolver(events, context) : events
- }
-}
-
-/**
- * A rather ugly set of instructions which again looks at chunks in the input
- * stream.
- * The reason to do this here is that it is *much* faster to parse in reverse.
- * And that we can’t hook into `null` to split the line suffix before an EOF.
- * To do: figure out if we can make this into a clean utility, or even in core.
- * As it will be useful for GFMs literal autolink extension (and maybe even
- * tables?)
- *
- * @type {Resolver}
- */
-function resolveAllLineSuffixes(events, context) {
- let eventIndex = 0 // Skip first.
-
- while (++eventIndex <= events.length) {
- if (
- (eventIndex === events.length ||
- events[eventIndex][1].type === 'lineEnding') &&
- events[eventIndex - 1][1].type === 'data'
- ) {
- const data = events[eventIndex - 1][1]
- const chunks = context.sliceStream(data)
- let index = chunks.length
- let bufferIndex = -1
- let size = 0
- /** @type {boolean | undefined} */
- let tabs
- while (index--) {
- const chunk = chunks[index]
- if (typeof chunk === 'string') {
- bufferIndex = chunk.length
- while (chunk.charCodeAt(bufferIndex - 1) === 32) {
- size++
- bufferIndex--
- }
- if (bufferIndex) break
- bufferIndex = -1
- }
- // Number
- else if (chunk === -2) {
- tabs = true
- size++
- } else if (chunk === -1) {
- // Empty
- } else {
- // Replacement character, exit.
- index++
- break
- }
- }
- if (size) {
- const token = {
- type:
- eventIndex === events.length || tabs || size < 2
- ? 'lineSuffix'
- : 'hardBreakTrailing',
- start: {
- line: data.end.line,
- column: data.end.column - size,
- offset: data.end.offset - size,
- _index: data.start._index + index,
- _bufferIndex: index
- ? bufferIndex
- : data.start._bufferIndex + bufferIndex
- },
- end: Object.assign({}, data.end)
- }
- data.end = Object.assign({}, token.start)
- if (data.start.offset === data.end.offset) {
- Object.assign(data, token)
- } else {
- events.splice(
- eventIndex,
- 0,
- ['enter', token, context],
- ['exit', token, context]
- )
- eventIndex += 2
- }
- }
- eventIndex++
- }
- }
- return events
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-util-resolve-all/index.js
-/**
- * @typedef {import('micromark-util-types').Event} Event
- * @typedef {import('micromark-util-types').Resolver} Resolver
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- */
-
-/**
- * Call all `resolveAll`s.
- *
- * @param {Array<{resolveAll?: Resolver | undefined}>} constructs
- * List of constructs, optionally with `resolveAll`s.
- * @param {Array<Event>} events
- * List of events.
- * @param {TokenizeContext} context
- * Context used by `tokenize`.
- * @returns {Array<Event>}
- * Changed events.
- */
-function resolveAll(constructs, events, context) {
- /** @type {Array<Resolver>} */
- const called = []
- let index = -1
-
- while (++index < constructs.length) {
- const resolve = constructs[index].resolveAll
-
- if (resolve && !called.includes(resolve)) {
- events = resolve(events, context)
- called.push(resolve)
- }
- }
-
- return events
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark/lib/create-tokenizer.js
-/**
- * @typedef {import('micromark-util-types').Chunk} Chunk
- * @typedef {import('micromark-util-types').Code} Code
- * @typedef {import('micromark-util-types').Construct} Construct
- * @typedef {import('micromark-util-types').ConstructRecord} ConstructRecord
- * @typedef {import('micromark-util-types').Effects} Effects
- * @typedef {import('micromark-util-types').InitialConstruct} InitialConstruct
- * @typedef {import('micromark-util-types').ParseContext} ParseContext
- * @typedef {import('micromark-util-types').Point} Point
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').Token} Token
- * @typedef {import('micromark-util-types').TokenType} TokenType
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- */
-
-/**
- * @callback Restore
- * @returns {void}
- *
- * @typedef Info
- * @property {Restore} restore
- * @property {number} from
- *
- * @callback ReturnHandle
- * Handle a successful run.
- * @param {Construct} construct
- * @param {Info} info
- * @returns {void}
- */
-
-
-
-
-/**
- * Create a tokenizer.
- * Tokenizers deal with one type of data (e.g., containers, flow, text).
- * The parser is the object dealing with it all.
- * `initialize` works like other constructs, except that only its `tokenize`
- * function is used, in which case it doesn’t receive an `ok` or `nok`.
- * `from` can be given to set the point before the first character, although
- * when further lines are indented, they must be set with `defineSkip`.
- *
- * @param {ParseContext} parser
- * @param {InitialConstruct} initialize
- * @param {Omit<Point, '_bufferIndex' | '_index'> | undefined} [from]
- * @returns {TokenizeContext}
- */
-function createTokenizer(parser, initialize, from) {
- /** @type {Point} */
- let point = Object.assign(
- from
- ? Object.assign({}, from)
- : {
- line: 1,
- column: 1,
- offset: 0
- },
- {
- _index: 0,
- _bufferIndex: -1
- }
- )
- /** @type {Record<string, number>} */
- const columnStart = {}
- /** @type {Array<Construct>} */
- const resolveAllConstructs = []
- /** @type {Array<Chunk>} */
- let chunks = []
- /** @type {Array<Token>} */
- let stack = []
- /** @type {boolean | undefined} */
- let consumed = true
-
- /**
- * Tools used for tokenizing.
- *
- * @type {Effects}
- */
- const effects = {
- consume,
- enter,
- exit,
- attempt: constructFactory(onsuccessfulconstruct),
- check: constructFactory(onsuccessfulcheck),
- interrupt: constructFactory(onsuccessfulcheck, {
- interrupt: true
- })
- }
-
- /**
- * State and tools for resolving and serializing.
- *
- * @type {TokenizeContext}
- */
- const context = {
- previous: null,
- code: null,
- containerState: {},
- events: [],
- parser,
- sliceStream,
- sliceSerialize,
- now,
- defineSkip,
- write
- }
-
- /**
- * The state function.
- *
- * @type {State | void}
- */
- let state = initialize.tokenize.call(context, effects)
-
- /**
- * Track which character we expect to be consumed, to catch bugs.
- *
- * @type {Code}
- */
- let expectedCode
- if (initialize.resolveAll) {
- resolveAllConstructs.push(initialize)
- }
- return context
-
- /** @type {TokenizeContext['write']} */
- function write(slice) {
- chunks = push(chunks, slice)
- main()
-
- // Exit if we’re not done, resolve might change stuff.
- if (chunks[chunks.length - 1] !== null) {
- return []
- }
- addResult(initialize, 0)
-
- // Otherwise, resolve, and exit.
- context.events = resolveAll(resolveAllConstructs, context.events, context)
- return context.events
- }
-
- //
- // Tools.
- //
-
- /** @type {TokenizeContext['sliceSerialize']} */
- function sliceSerialize(token, expandTabs) {
- return serializeChunks(sliceStream(token), expandTabs)
- }
-
- /** @type {TokenizeContext['sliceStream']} */
- function sliceStream(token) {
- return sliceChunks(chunks, token)
- }
-
- /** @type {TokenizeContext['now']} */
- function now() {
- // This is a hot path, so we clone manually instead of `Object.assign({}, point)`
- const {line, column, offset, _index, _bufferIndex} = point
- return {
- line,
- column,
- offset,
- _index,
- _bufferIndex
- }
- }
-
- /** @type {TokenizeContext['defineSkip']} */
- function defineSkip(value) {
- columnStart[value.line] = value.column
- accountForPotentialSkip()
- }
-
- //
- // State management.
- //
-
- /**
- * Main loop (note that `_index` and `_bufferIndex` in `point` are modified by
- * `consume`).
- * Here is where we walk through the chunks, which either include strings of
- * several characters, or numerical character codes.
- * The reason to do this in a loop instead of a call is so the stack can
- * drain.
- *
- * @returns {void}
- */
- function main() {
- /** @type {number} */
- let chunkIndex
- while (point._index < chunks.length) {
- const chunk = chunks[point._index]
-
- // If we’re in a buffer chunk, loop through it.
- if (typeof chunk === 'string') {
- chunkIndex = point._index
- if (point._bufferIndex < 0) {
- point._bufferIndex = 0
- }
- while (
- point._index === chunkIndex &&
- point._bufferIndex < chunk.length
- ) {
- go(chunk.charCodeAt(point._bufferIndex))
- }
- } else {
- go(chunk)
- }
- }
- }
-
- /**
- * Deal with one code.
- *
- * @param {Code} code
- * @returns {void}
- */
- function go(code) {
- consumed = undefined
- expectedCode = code
- state = state(code)
- }
-
- /** @type {Effects['consume']} */
- function consume(code) {
- if (markdownLineEnding(code)) {
- point.line++
- point.column = 1
- point.offset += code === -3 ? 2 : 1
- accountForPotentialSkip()
- } else if (code !== -1) {
- point.column++
- point.offset++
- }
-
- // Not in a string chunk.
- if (point._bufferIndex < 0) {
- point._index++
- } else {
- point._bufferIndex++
-
- // At end of string chunk.
- // @ts-expect-error Points w/ non-negative `_bufferIndex` reference
- // strings.
- if (point._bufferIndex === chunks[point._index].length) {
- point._bufferIndex = -1
- point._index++
- }
- }
-
- // Expose the previous character.
- context.previous = code
-
- // Mark as consumed.
- consumed = true
- }
-
- /** @type {Effects['enter']} */
- function enter(type, fields) {
- /** @type {Token} */
- // @ts-expect-error Patch instead of assign required fields to help GC.
- const token = fields || {}
- token.type = type
- token.start = now()
- context.events.push(['enter', token, context])
- stack.push(token)
- return token
- }
-
- /** @type {Effects['exit']} */
- function exit(type) {
- const token = stack.pop()
- token.end = now()
- context.events.push(['exit', token, context])
- return token
- }
-
- /**
- * Use results.
- *
- * @type {ReturnHandle}
- */
- function onsuccessfulconstruct(construct, info) {
- addResult(construct, info.from)
- }
-
- /**
- * Discard results.
- *
- * @type {ReturnHandle}
- */
- function onsuccessfulcheck(_, info) {
- info.restore()
- }
-
- /**
- * Factory to attempt/check/interrupt.
- *
- * @param {ReturnHandle} onreturn
- * @param {{interrupt?: boolean | undefined} | undefined} [fields]
- */
- function constructFactory(onreturn, fields) {
- return hook
-
- /**
- * Handle either an object mapping codes to constructs, a list of
- * constructs, or a single construct.
- *
- * @param {Array<Construct> | Construct | ConstructRecord} constructs
- * @param {State} returnState
- * @param {State | undefined} [bogusState]
- * @returns {State}
- */
- function hook(constructs, returnState, bogusState) {
- /** @type {Array<Construct>} */
- let listOfConstructs
- /** @type {number} */
- let constructIndex
- /** @type {Construct} */
- let currentConstruct
- /** @type {Info} */
- let info
- return Array.isArray(constructs) /* c8 ignore next 1 */
- ? handleListOfConstructs(constructs)
- : 'tokenize' in constructs
- ? // @ts-expect-error Looks like a construct.
- handleListOfConstructs([constructs])
- : handleMapOfConstructs(constructs)
-
- /**
- * Handle a list of construct.
- *
- * @param {ConstructRecord} map
- * @returns {State}
- */
- function handleMapOfConstructs(map) {
- return start
-
- /** @type {State} */
- function start(code) {
- const def = code !== null && map[code]
- const all = code !== null && map.null
- const list = [
- // To do: add more extension tests.
- /* c8 ignore next 2 */
- ...(Array.isArray(def) ? def : def ? [def] : []),
- ...(Array.isArray(all) ? all : all ? [all] : [])
- ]
- return handleListOfConstructs(list)(code)
- }
- }
-
- /**
- * Handle a list of construct.
- *
- * @param {Array<Construct>} list
- * @returns {State}
- */
- function handleListOfConstructs(list) {
- listOfConstructs = list
- constructIndex = 0
- if (list.length === 0) {
- return bogusState
- }
- return handleConstruct(list[constructIndex])
- }
-
- /**
- * Handle a single construct.
- *
- * @param {Construct} construct
- * @returns {State}
- */
- function handleConstruct(construct) {
- return start
-
- /** @type {State} */
- function start(code) {
- // To do: not needed to store if there is no bogus state, probably?
- // Currently doesn’t work because `inspect` in document does a check
- // w/o a bogus, which doesn’t make sense. But it does seem to help perf
- // by not storing.
- info = store()
- currentConstruct = construct
- if (!construct.partial) {
- context.currentConstruct = construct
- }
-
- // Always populated by defaults.
-
- if (
- construct.name &&
- context.parser.constructs.disable.null.includes(construct.name)
- ) {
- return nok(code)
- }
- return construct.tokenize.call(
- // If we do have fields, create an object w/ `context` as its
- // prototype.
- // This allows a “live binding”, which is needed for `interrupt`.
- fields ? Object.assign(Object.create(context), fields) : context,
- effects,
- ok,
- nok
- )(code)
- }
- }
-
- /** @type {State} */
- function ok(code) {
- consumed = true
- onreturn(currentConstruct, info)
- return returnState
- }
-
- /** @type {State} */
- function nok(code) {
- consumed = true
- info.restore()
- if (++constructIndex < listOfConstructs.length) {
- return handleConstruct(listOfConstructs[constructIndex])
- }
- return bogusState
- }
- }
- }
-
- /**
- * @param {Construct} construct
- * @param {number} from
- * @returns {void}
- */
- function addResult(construct, from) {
- if (construct.resolveAll && !resolveAllConstructs.includes(construct)) {
- resolveAllConstructs.push(construct)
- }
- if (construct.resolve) {
- splice(
- context.events,
- from,
- context.events.length - from,
- construct.resolve(context.events.slice(from), context)
- )
- }
- if (construct.resolveTo) {
- context.events = construct.resolveTo(context.events, context)
- }
- }
-
- /**
- * Store state.
- *
- * @returns {Info}
- */
- function store() {
- const startPoint = now()
- const startPrevious = context.previous
- const startCurrentConstruct = context.currentConstruct
- const startEventsIndex = context.events.length
- const startStack = Array.from(stack)
- return {
- restore,
- from: startEventsIndex
- }
-
- /**
- * Restore state.
- *
- * @returns {void}
- */
- function restore() {
- point = startPoint
- context.previous = startPrevious
- context.currentConstruct = startCurrentConstruct
- context.events.length = startEventsIndex
- stack = startStack
- accountForPotentialSkip()
- }
- }
-
- /**
- * Move the current point a bit forward in the line when it’s on a column
- * skip.
- *
- * @returns {void}
- */
- function accountForPotentialSkip() {
- if (point.line in columnStart && point.column < 2) {
- point.column = columnStart[point.line]
- point.offset += columnStart[point.line] - 1
- }
- }
-}
-
-/**
- * Get the chunks from a slice of chunks in the range of a token.
- *
- * @param {Array<Chunk>} chunks
- * @param {Pick<Token, 'end' | 'start'>} token
- * @returns {Array<Chunk>}
- */
-function sliceChunks(chunks, token) {
- const startIndex = token.start._index
- const startBufferIndex = token.start._bufferIndex
- const endIndex = token.end._index
- const endBufferIndex = token.end._bufferIndex
- /** @type {Array<Chunk>} */
- let view
- if (startIndex === endIndex) {
- // @ts-expect-error `_bufferIndex` is used on string chunks.
- view = [chunks[startIndex].slice(startBufferIndex, endBufferIndex)]
- } else {
- view = chunks.slice(startIndex, endIndex)
- if (startBufferIndex > -1) {
- const head = view[0]
- if (typeof head === 'string') {
- view[0] = head.slice(startBufferIndex)
- } else {
- view.shift()
- }
- }
- if (endBufferIndex > 0) {
- // @ts-expect-error `_bufferIndex` is used on string chunks.
- view.push(chunks[endIndex].slice(0, endBufferIndex))
- }
- }
- return view
-}
-
-/**
- * Get the string value of a slice of chunks.
- *
- * @param {Array<Chunk>} chunks
- * @param {boolean | undefined} [expandTabs=false]
- * @returns {string}
- */
-function serializeChunks(chunks, expandTabs) {
- let index = -1
- /** @type {Array<string>} */
- const result = []
- /** @type {boolean | undefined} */
- let atTab
- while (++index < chunks.length) {
- const chunk = chunks[index]
- /** @type {string} */
- let value
- if (typeof chunk === 'string') {
- value = chunk
- } else
- switch (chunk) {
- case -5: {
- value = '\r'
- break
- }
- case -4: {
- value = '\n'
- break
- }
- case -3: {
- value = '\r' + '\n'
- break
- }
- case -2: {
- value = expandTabs ? ' ' : '\t'
- break
- }
- case -1: {
- if (!expandTabs && atTab) continue
- value = ' '
- break
- }
- default: {
- // Currently only replacement character.
- value = String.fromCharCode(chunk)
- }
- }
- atTab = chunk === -2
- result.push(value)
- }
- return result.join('')
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-core-commonmark/lib/thematic-break.js
-/**
- * @typedef {import('micromark-util-types').Code} Code
- * @typedef {import('micromark-util-types').Construct} Construct
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- * @typedef {import('micromark-util-types').Tokenizer} Tokenizer
- */
-
-
-
-/** @type {Construct} */
-const thematicBreak = {
- name: 'thematicBreak',
- tokenize: tokenizeThematicBreak
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeThematicBreak(effects, ok, nok) {
- let size = 0
- /** @type {NonNullable<Code>} */
- let marker
- return start
-
- /**
- * Start of thematic break.
- *
- * ```markdown
- * > | ***
- * ^
- * ```
- *
- * @type {State}
- */
- function start(code) {
- effects.enter('thematicBreak')
- // To do: parse indent like `markdown-rs`.
- return before(code)
- }
-
- /**
- * After optional whitespace, at marker.
- *
- * ```markdown
- * > | ***
- * ^
- * ```
- *
- * @type {State}
- */
- function before(code) {
- marker = code
- return atBreak(code)
- }
-
- /**
- * After something, before something else.
- *
- * ```markdown
- * > | ***
- * ^
- * ```
- *
- * @type {State}
- */
- function atBreak(code) {
- if (code === marker) {
- effects.enter('thematicBreakSequence')
- return sequence(code)
- }
- if (size >= 3 && (code === null || markdownLineEnding(code))) {
- effects.exit('thematicBreak')
- return ok(code)
- }
- return nok(code)
- }
-
- /**
- * In sequence.
- *
- * ```markdown
- * > | ***
- * ^
- * ```
- *
- * @type {State}
- */
- function sequence(code) {
- if (code === marker) {
- effects.consume(code)
- size++
- return sequence
- }
- effects.exit('thematicBreakSequence')
- return markdownSpace(code)
- ? factorySpace(effects, atBreak, 'whitespace')(code)
- : atBreak(code)
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-core-commonmark/lib/list.js
-/**
- * @typedef {import('micromark-util-types').Code} Code
- * @typedef {import('micromark-util-types').Construct} Construct
- * @typedef {import('micromark-util-types').ContainerState} ContainerState
- * @typedef {import('micromark-util-types').Exiter} Exiter
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- * @typedef {import('micromark-util-types').Tokenizer} Tokenizer
- */
-
-
-
-
-
-
-/** @type {Construct} */
-const list = {
- name: 'list',
- tokenize: tokenizeListStart,
- continuation: {
- tokenize: tokenizeListContinuation
- },
- exit: tokenizeListEnd
-}
-
-/** @type {Construct} */
-const listItemPrefixWhitespaceConstruct = {
- tokenize: tokenizeListItemPrefixWhitespace,
- partial: true
-}
-
-/** @type {Construct} */
-const indentConstruct = {
- tokenize: tokenizeIndent,
- partial: true
-}
-
-// To do: `markdown-rs` parses list items on their own and later stitches them
-// together.
-
-/**
- * @type {Tokenizer}
- * @this {TokenizeContext}
- */
-function tokenizeListStart(effects, ok, nok) {
- const self = this
- const tail = self.events[self.events.length - 1]
- let initialSize =
- tail && tail[1].type === 'linePrefix'
- ? tail[2].sliceSerialize(tail[1], true).length
- : 0
- let size = 0
- return start
-
- /** @type {State} */
- function start(code) {
- const kind =
- self.containerState.type ||
- (code === 42 || code === 43 || code === 45
- ? 'listUnordered'
- : 'listOrdered')
- if (
- kind === 'listUnordered'
- ? !self.containerState.marker || code === self.containerState.marker
- : asciiDigit(code)
- ) {
- if (!self.containerState.type) {
- self.containerState.type = kind
- effects.enter(kind, {
- _container: true
- })
- }
- if (kind === 'listUnordered') {
- effects.enter('listItemPrefix')
- return code === 42 || code === 45
- ? effects.check(thematicBreak, nok, atMarker)(code)
- : atMarker(code)
- }
- if (!self.interrupt || code === 49) {
- effects.enter('listItemPrefix')
- effects.enter('listItemValue')
- return inside(code)
- }
- }
- return nok(code)
- }
-
- /** @type {State} */
- function inside(code) {
- if (asciiDigit(code) && ++size < 10) {
- effects.consume(code)
- return inside
- }
- if (
- (!self.interrupt || size < 2) &&
- (self.containerState.marker
- ? code === self.containerState.marker
- : code === 41 || code === 46)
- ) {
- effects.exit('listItemValue')
- return atMarker(code)
- }
- return nok(code)
- }
-
- /**
- * @type {State}
- **/
- function atMarker(code) {
- effects.enter('listItemMarker')
- effects.consume(code)
- effects.exit('listItemMarker')
- self.containerState.marker = self.containerState.marker || code
- return effects.check(
- blankLine,
- // Can’t be empty when interrupting.
- self.interrupt ? nok : onBlank,
- effects.attempt(
- listItemPrefixWhitespaceConstruct,
- endOfPrefix,
- otherPrefix
- )
- )
- }
-
- /** @type {State} */
- function onBlank(code) {
- self.containerState.initialBlankLine = true
- initialSize++
- return endOfPrefix(code)
- }
-
- /** @type {State} */
- function otherPrefix(code) {
- if (markdownSpace(code)) {
- effects.enter('listItemPrefixWhitespace')
- effects.consume(code)
- effects.exit('listItemPrefixWhitespace')
- return endOfPrefix
- }
- return nok(code)
- }
-
- /** @type {State} */
- function endOfPrefix(code) {
- self.containerState.size =
- initialSize +
- self.sliceSerialize(effects.exit('listItemPrefix'), true).length
- return ok(code)
- }
-}
-
-/**
- * @type {Tokenizer}
- * @this {TokenizeContext}
- */
-function tokenizeListContinuation(effects, ok, nok) {
- const self = this
- self.containerState._closeFlow = undefined
- return effects.check(blankLine, onBlank, notBlank)
-
- /** @type {State} */
- function onBlank(code) {
- self.containerState.furtherBlankLines =
- self.containerState.furtherBlankLines ||
- self.containerState.initialBlankLine
-
- // We have a blank line.
- // Still, try to consume at most the items size.
- return factorySpace(
- effects,
- ok,
- 'listItemIndent',
- self.containerState.size + 1
- )(code)
- }
-
- /** @type {State} */
- function notBlank(code) {
- if (self.containerState.furtherBlankLines || !markdownSpace(code)) {
- self.containerState.furtherBlankLines = undefined
- self.containerState.initialBlankLine = undefined
- return notInCurrentItem(code)
- }
- self.containerState.furtherBlankLines = undefined
- self.containerState.initialBlankLine = undefined
- return effects.attempt(indentConstruct, ok, notInCurrentItem)(code)
- }
-
- /** @type {State} */
- function notInCurrentItem(code) {
- // While we do continue, we signal that the flow should be closed.
- self.containerState._closeFlow = true
- // As we’re closing flow, we’re no longer interrupting.
- self.interrupt = undefined
- // Always populated by defaults.
-
- return factorySpace(
- effects,
- effects.attempt(list, ok, nok),
- 'linePrefix',
- self.parser.constructs.disable.null.includes('codeIndented')
- ? undefined
- : 4
- )(code)
- }
-}
-
-/**
- * @type {Tokenizer}
- * @this {TokenizeContext}
- */
-function tokenizeIndent(effects, ok, nok) {
- const self = this
- return factorySpace(
- effects,
- afterPrefix,
- 'listItemIndent',
- self.containerState.size + 1
- )
-
- /** @type {State} */
- function afterPrefix(code) {
- const tail = self.events[self.events.length - 1]
- return tail &&
- tail[1].type === 'listItemIndent' &&
- tail[2].sliceSerialize(tail[1], true).length === self.containerState.size
- ? ok(code)
- : nok(code)
- }
-}
-
-/**
- * @type {Exiter}
- * @this {TokenizeContext}
- */
-function tokenizeListEnd(effects) {
- effects.exit(this.containerState.type)
-}
-
-/**
- * @type {Tokenizer}
- * @this {TokenizeContext}
- */
-function tokenizeListItemPrefixWhitespace(effects, ok, nok) {
- const self = this
-
- // Always populated by defaults.
-
- return factorySpace(
- effects,
- afterPrefix,
- 'listItemPrefixWhitespace',
- self.parser.constructs.disable.null.includes('codeIndented')
- ? undefined
- : 4 + 1
- )
-
- /** @type {State} */
- function afterPrefix(code) {
- const tail = self.events[self.events.length - 1]
- return !markdownSpace(code) &&
- tail &&
- tail[1].type === 'listItemPrefixWhitespace'
- ? ok(code)
- : nok(code)
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-core-commonmark/lib/block-quote.js
-/**
- * @typedef {import('micromark-util-types').Construct} Construct
- * @typedef {import('micromark-util-types').Exiter} Exiter
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- * @typedef {import('micromark-util-types').Tokenizer} Tokenizer
- */
-
-
-
-/** @type {Construct} */
-const blockQuote = {
- name: 'blockQuote',
- tokenize: tokenizeBlockQuoteStart,
- continuation: {
- tokenize: tokenizeBlockQuoteContinuation
- },
- exit
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeBlockQuoteStart(effects, ok, nok) {
- const self = this
- return start
-
- /**
- * Start of block quote.
- *
- * ```markdown
- * > | > a
- * ^
- * ```
- *
- * @type {State}
- */
- function start(code) {
- if (code === 62) {
- const state = self.containerState
- if (!state.open) {
- effects.enter('blockQuote', {
- _container: true
- })
- state.open = true
- }
- effects.enter('blockQuotePrefix')
- effects.enter('blockQuoteMarker')
- effects.consume(code)
- effects.exit('blockQuoteMarker')
- return after
- }
- return nok(code)
- }
-
- /**
- * After `>`, before optional whitespace.
- *
- * ```markdown
- * > | > a
- * ^
- * ```
- *
- * @type {State}
- */
- function after(code) {
- if (markdownSpace(code)) {
- effects.enter('blockQuotePrefixWhitespace')
- effects.consume(code)
- effects.exit('blockQuotePrefixWhitespace')
- effects.exit('blockQuotePrefix')
- return ok
- }
- effects.exit('blockQuotePrefix')
- return ok(code)
- }
-}
-
-/**
- * Start of block quote continuation.
- *
- * ```markdown
- * | > a
- * > | > b
- * ^
- * ```
- *
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeBlockQuoteContinuation(effects, ok, nok) {
- const self = this
- return contStart
-
- /**
- * Start of block quote continuation.
- *
- * Also used to parse the first block quote opening.
- *
- * ```markdown
- * | > a
- * > | > b
- * ^
- * ```
- *
- * @type {State}
- */
- function contStart(code) {
- if (markdownSpace(code)) {
- // Always populated by defaults.
-
- return factorySpace(
- effects,
- contBefore,
- 'linePrefix',
- self.parser.constructs.disable.null.includes('codeIndented')
- ? undefined
- : 4
- )(code)
- }
- return contBefore(code)
- }
-
- /**
- * At `>`, after optional whitespace.
- *
- * Also used to parse the first block quote opening.
- *
- * ```markdown
- * | > a
- * > | > b
- * ^
- * ```
- *
- * @type {State}
- */
- function contBefore(code) {
- return effects.attempt(blockQuote, ok, nok)(code)
- }
-}
-
-/** @type {Exiter} */
-function exit(effects) {
- effects.exit('blockQuote')
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-factory-destination/index.js
-/**
- * @typedef {import('micromark-util-types').Effects} Effects
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').TokenType} TokenType
- */
-
-
-/**
- * Parse destinations.
- *
- * ###### Examples
- *
- * ```markdown
- * <a>
- * <a\>b>
- * <a b>
- * <a)>
- * a
- * a\)b
- * a(b)c
- * a(b)
- * ```
- *
- * @param {Effects} effects
- * Context.
- * @param {State} ok
- * State switched to when successful.
- * @param {State} nok
- * State switched to when unsuccessful.
- * @param {TokenType} type
- * Type for whole (`<a>` or `b`).
- * @param {TokenType} literalType
- * Type when enclosed (`<a>`).
- * @param {TokenType} literalMarkerType
- * Type for enclosing (`<` and `>`).
- * @param {TokenType} rawType
- * Type when not enclosed (`b`).
- * @param {TokenType} stringType
- * Type for the value (`a` or `b`).
- * @param {number | undefined} [max=Infinity]
- * Depth of nested parens (inclusive).
- * @returns {State}
- * Start state.
- */ // eslint-disable-next-line max-params
-function factoryDestination(
- effects,
- ok,
- nok,
- type,
- literalType,
- literalMarkerType,
- rawType,
- stringType,
- max
-) {
- const limit = max || Number.POSITIVE_INFINITY
- let balance = 0
- return start
-
- /**
- * Start of destination.
- *
- * ```markdown
- * > | <aa>
- * ^
- * > | aa
- * ^
- * ```
- *
- * @type {State}
- */
- function start(code) {
- if (code === 60) {
- effects.enter(type)
- effects.enter(literalType)
- effects.enter(literalMarkerType)
- effects.consume(code)
- effects.exit(literalMarkerType)
- return enclosedBefore
- }
-
- // ASCII control, space, closing paren.
- if (code === null || code === 32 || code === 41 || asciiControl(code)) {
- return nok(code)
- }
- effects.enter(type)
- effects.enter(rawType)
- effects.enter(stringType)
- effects.enter('chunkString', {
- contentType: 'string'
- })
- return raw(code)
- }
-
- /**
- * After `<`, at an enclosed destination.
- *
- * ```markdown
- * > | <aa>
- * ^
- * ```
- *
- * @type {State}
- */
- function enclosedBefore(code) {
- if (code === 62) {
- effects.enter(literalMarkerType)
- effects.consume(code)
- effects.exit(literalMarkerType)
- effects.exit(literalType)
- effects.exit(type)
- return ok
- }
- effects.enter(stringType)
- effects.enter('chunkString', {
- contentType: 'string'
- })
- return enclosed(code)
- }
-
- /**
- * In enclosed destination.
- *
- * ```markdown
- * > | <aa>
- * ^
- * ```
- *
- * @type {State}
- */
- function enclosed(code) {
- if (code === 62) {
- effects.exit('chunkString')
- effects.exit(stringType)
- return enclosedBefore(code)
- }
- if (code === null || code === 60 || markdownLineEnding(code)) {
- return nok(code)
- }
- effects.consume(code)
- return code === 92 ? enclosedEscape : enclosed
- }
-
- /**
- * After `\`, at a special character.
- *
- * ```markdown
- * > | <a\*a>
- * ^
- * ```
- *
- * @type {State}
- */
- function enclosedEscape(code) {
- if (code === 60 || code === 62 || code === 92) {
- effects.consume(code)
- return enclosed
- }
- return enclosed(code)
- }
-
- /**
- * In raw destination.
- *
- * ```markdown
- * > | aa
- * ^
- * ```
- *
- * @type {State}
- */
- function raw(code) {
- if (
- !balance &&
- (code === null || code === 41 || markdownLineEndingOrSpace(code))
- ) {
- effects.exit('chunkString')
- effects.exit(stringType)
- effects.exit(rawType)
- effects.exit(type)
- return ok(code)
- }
- if (balance < limit && code === 40) {
- effects.consume(code)
- balance++
- return raw
- }
- if (code === 41) {
- effects.consume(code)
- balance--
- return raw
- }
-
- // ASCII control (but *not* `\0`) and space and `(`.
- // Note: in `markdown-rs`, `\0` exists in codes, in `micromark-js` it
- // doesn’t.
- if (code === null || code === 32 || code === 40 || asciiControl(code)) {
- return nok(code)
- }
- effects.consume(code)
- return code === 92 ? rawEscape : raw
- }
-
- /**
- * After `\`, at special character.
- *
- * ```markdown
- * > | a\*a
- * ^
- * ```
- *
- * @type {State}
- */
- function rawEscape(code) {
- if (code === 40 || code === 41 || code === 92) {
- effects.consume(code)
- return raw
- }
- return raw(code)
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-factory-label/index.js
-/**
- * @typedef {import('micromark-util-types').Effects} Effects
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- * @typedef {import('micromark-util-types').TokenType} TokenType
- */
-
-
-/**
- * Parse labels.
- *
- * > 👉 **Note**: labels in markdown are capped at 999 characters in the string.
- *
- * ###### Examples
- *
- * ```markdown
- * [a]
- * [a
- * b]
- * [a\]b]
- * ```
- *
- * @this {TokenizeContext}
- * Tokenize context.
- * @param {Effects} effects
- * Context.
- * @param {State} ok
- * State switched to when successful.
- * @param {State} nok
- * State switched to when unsuccessful.
- * @param {TokenType} type
- * Type of the whole label (`[a]`).
- * @param {TokenType} markerType
- * Type for the markers (`[` and `]`).
- * @param {TokenType} stringType
- * Type for the identifier (`a`).
- * @returns {State}
- * Start state.
- */ // eslint-disable-next-line max-params
-function factoryLabel(effects, ok, nok, type, markerType, stringType) {
- const self = this
- let size = 0
- /** @type {boolean} */
- let seen
- return start
-
- /**
- * Start of label.
- *
- * ```markdown
- * > | [a]
- * ^
- * ```
- *
- * @type {State}
- */
- function start(code) {
- effects.enter(type)
- effects.enter(markerType)
- effects.consume(code)
- effects.exit(markerType)
- effects.enter(stringType)
- return atBreak
- }
-
- /**
- * In label, at something, before something else.
- *
- * ```markdown
- * > | [a]
- * ^
- * ```
- *
- * @type {State}
- */
- function atBreak(code) {
- if (
- size > 999 ||
- code === null ||
- code === 91 ||
- (code === 93 && !seen) ||
- // To do: remove in the future once we’ve switched from
- // `micromark-extension-footnote` to `micromark-extension-gfm-footnote`,
- // which doesn’t need this.
- // Hidden footnotes hook.
- /* c8 ignore next 3 */
- (code === 94 &&
- !size &&
- '_hiddenFootnoteSupport' in self.parser.constructs)
- ) {
- return nok(code)
- }
- if (code === 93) {
- effects.exit(stringType)
- effects.enter(markerType)
- effects.consume(code)
- effects.exit(markerType)
- effects.exit(type)
- return ok
- }
-
- // To do: indent? Link chunks and EOLs together?
- if (markdownLineEnding(code)) {
- effects.enter('lineEnding')
- effects.consume(code)
- effects.exit('lineEnding')
- return atBreak
- }
- effects.enter('chunkString', {
- contentType: 'string'
- })
- return labelInside(code)
- }
-
- /**
- * In label, in text.
- *
- * ```markdown
- * > | [a]
- * ^
- * ```
- *
- * @type {State}
- */
- function labelInside(code) {
- if (
- code === null ||
- code === 91 ||
- code === 93 ||
- markdownLineEnding(code) ||
- size++ > 999
- ) {
- effects.exit('chunkString')
- return atBreak(code)
- }
- effects.consume(code)
- if (!seen) seen = !markdownSpace(code)
- return code === 92 ? labelEscape : labelInside
- }
-
- /**
- * After `\`, at a special character.
- *
- * ```markdown
- * > | [a\*a]
- * ^
- * ```
- *
- * @type {State}
- */
- function labelEscape(code) {
- if (code === 91 || code === 92 || code === 93) {
- effects.consume(code)
- size++
- return labelInside
- }
- return labelInside(code)
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-factory-title/index.js
-/**
- * @typedef {import('micromark-util-types').Code} Code
- * @typedef {import('micromark-util-types').Effects} Effects
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').TokenType} TokenType
- */
-
-
-
-/**
- * Parse titles.
- *
- * ###### Examples
- *
- * ```markdown
- * "a"
- * 'b'
- * (c)
- * "a
- * b"
- * 'a
- * b'
- * (a\)b)
- * ```
- *
- * @param {Effects} effects
- * Context.
- * @param {State} ok
- * State switched to when successful.
- * @param {State} nok
- * State switched to when unsuccessful.
- * @param {TokenType} type
- * Type of the whole title (`"a"`, `'b'`, `(c)`).
- * @param {TokenType} markerType
- * Type for the markers (`"`, `'`, `(`, and `)`).
- * @param {TokenType} stringType
- * Type for the value (`a`).
- * @returns {State}
- * Start state.
- */ // eslint-disable-next-line max-params
-function factoryTitle(effects, ok, nok, type, markerType, stringType) {
- /** @type {NonNullable<Code>} */
- let marker
- return start
-
- /**
- * Start of title.
- *
- * ```markdown
- * > | "a"
- * ^
- * ```
- *
- * @type {State}
- */
- function start(code) {
- if (code === 34 || code === 39 || code === 40) {
- effects.enter(type)
- effects.enter(markerType)
- effects.consume(code)
- effects.exit(markerType)
- marker = code === 40 ? 41 : code
- return begin
- }
- return nok(code)
- }
-
- /**
- * After opening marker.
- *
- * This is also used at the closing marker.
- *
- * ```markdown
- * > | "a"
- * ^
- * ```
- *
- * @type {State}
- */
- function begin(code) {
- if (code === marker) {
- effects.enter(markerType)
- effects.consume(code)
- effects.exit(markerType)
- effects.exit(type)
- return ok
- }
- effects.enter(stringType)
- return atBreak(code)
- }
-
- /**
- * At something, before something else.
- *
- * ```markdown
- * > | "a"
- * ^
- * ```
- *
- * @type {State}
- */
- function atBreak(code) {
- if (code === marker) {
- effects.exit(stringType)
- return begin(marker)
- }
- if (code === null) {
- return nok(code)
- }
-
- // Note: blank lines can’t exist in content.
- if (markdownLineEnding(code)) {
- // To do: use `space_or_tab_eol_with_options`, connect.
- effects.enter('lineEnding')
- effects.consume(code)
- effects.exit('lineEnding')
- return factorySpace(effects, atBreak, 'linePrefix')
- }
- effects.enter('chunkString', {
- contentType: 'string'
- })
- return inside(code)
- }
-
- /**
- *
- *
- * @type {State}
- */
- function inside(code) {
- if (code === marker || code === null || markdownLineEnding(code)) {
- effects.exit('chunkString')
- return atBreak(code)
- }
- effects.consume(code)
- return code === 92 ? escape : inside
- }
-
- /**
- * After `\`, at a special character.
- *
- * ```markdown
- * > | "a\*b"
- * ^
- * ```
- *
- * @type {State}
- */
- function escape(code) {
- if (code === marker || code === 92) {
- effects.consume(code)
- return inside
- }
- return inside(code)
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-factory-whitespace/index.js
-/**
- * @typedef {import('micromark-util-types').Effects} Effects
- * @typedef {import('micromark-util-types').State} State
- */
-
-
-
-/**
- * Parse spaces and tabs.
- *
- * There is no `nok` parameter:
- *
- * * line endings or spaces in markdown are often optional, in which case this
- * factory can be used and `ok` will be switched to whether spaces were found
- * or not
- * * one line ending or space can be detected with
- * `markdownLineEndingOrSpace(code)` right before using `factoryWhitespace`
- *
- * @param {Effects} effects
- * Context.
- * @param {State} ok
- * State switched to when successful.
- * @returns
- * Start state.
- */
-function factoryWhitespace(effects, ok) {
- /** @type {boolean} */
- let seen
- return start
-
- /** @type {State} */
- function start(code) {
- if (markdownLineEnding(code)) {
- effects.enter('lineEnding')
- effects.consume(code)
- effects.exit('lineEnding')
- seen = true
- return start
- }
- if (markdownSpace(code)) {
- return factorySpace(
- effects,
- start,
- seen ? 'linePrefix' : 'lineSuffix'
- )(code)
- }
- return ok(code)
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-util-normalize-identifier/index.js
-/**
- * Normalize an identifier (as found in references, definitions).
- *
- * Collapses markdown whitespace, trim, and then lower- and uppercase.
- *
- * Some characters are considered “uppercase”, such as U+03F4 (`ϴ`), but if their
- * lowercase counterpart (U+03B8 (`θ`)) is uppercased will result in a different
- * uppercase character (U+0398 (`Θ`)).
- * So, to get a canonical form, we perform both lower- and uppercase.
- *
- * Using uppercase last makes sure keys will never interact with default
- * prototypal values (such as `constructor`): nothing in the prototype of
- * `Object` is uppercase.
- *
- * @param {string} value
- * Identifier to normalize.
- * @returns {string}
- * Normalized identifier.
- */
-function normalizeIdentifier(value) {
- return (
- value
- // Collapse markdown whitespace.
- .replace(/[\t\n\r ]+/g, ' ')
- // Trim.
- .replace(/^ | $/g, '')
- // Some characters are considered “uppercase”, but if their lowercase
- // counterpart is uppercased will result in a different uppercase
- // character.
- // Hence, to get that form, we perform both lower- and uppercase.
- // Upper case makes sure keys will not interact with default prototypal
- // methods: no method is uppercase.
- .toLowerCase()
- .toUpperCase()
- )
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-core-commonmark/lib/definition.js
-/**
- * @typedef {import('micromark-util-types').Construct} Construct
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- * @typedef {import('micromark-util-types').Tokenizer} Tokenizer
- */
-
-
-
-
-
-
-
-
-/** @type {Construct} */
-const definition = {
- name: 'definition',
- tokenize: tokenizeDefinition
-}
-
-/** @type {Construct} */
-const titleBefore = {
- tokenize: tokenizeTitleBefore,
- partial: true
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeDefinition(effects, ok, nok) {
- const self = this
- /** @type {string} */
- let identifier
- return start
-
- /**
- * At start of a definition.
- *
- * ```markdown
- * > | [a]: b "c"
- * ^
- * ```
- *
- * @type {State}
- */
- function start(code) {
- // Do not interrupt paragraphs (but do follow definitions).
- // To do: do `interrupt` the way `markdown-rs` does.
- // To do: parse whitespace the way `markdown-rs` does.
- effects.enter('definition')
- return before(code)
- }
-
- /**
- * After optional whitespace, at `[`.
- *
- * ```markdown
- * > | [a]: b "c"
- * ^
- * ```
- *
- * @type {State}
- */
- function before(code) {
- // To do: parse whitespace the way `markdown-rs` does.
-
- return factoryLabel.call(
- self,
- effects,
- labelAfter,
- // Note: we don’t need to reset the way `markdown-rs` does.
- nok,
- 'definitionLabel',
- 'definitionLabelMarker',
- 'definitionLabelString'
- )(code)
- }
-
- /**
- * After label.
- *
- * ```markdown
- * > | [a]: b "c"
- * ^
- * ```
- *
- * @type {State}
- */
- function labelAfter(code) {
- identifier = normalizeIdentifier(
- self.sliceSerialize(self.events[self.events.length - 1][1]).slice(1, -1)
- )
- if (code === 58) {
- effects.enter('definitionMarker')
- effects.consume(code)
- effects.exit('definitionMarker')
- return markerAfter
- }
- return nok(code)
- }
-
- /**
- * After marker.
- *
- * ```markdown
- * > | [a]: b "c"
- * ^
- * ```
- *
- * @type {State}
- */
- function markerAfter(code) {
- // Note: whitespace is optional.
- return markdownLineEndingOrSpace(code)
- ? factoryWhitespace(effects, destinationBefore)(code)
- : destinationBefore(code)
- }
-
- /**
- * Before destination.
- *
- * ```markdown
- * > | [a]: b "c"
- * ^
- * ```
- *
- * @type {State}
- */
- function destinationBefore(code) {
- return factoryDestination(
- effects,
- destinationAfter,
- // Note: we don’t need to reset the way `markdown-rs` does.
- nok,
- 'definitionDestination',
- 'definitionDestinationLiteral',
- 'definitionDestinationLiteralMarker',
- 'definitionDestinationRaw',
- 'definitionDestinationString'
- )(code)
- }
-
- /**
- * After destination.
- *
- * ```markdown
- * > | [a]: b "c"
- * ^
- * ```
- *
- * @type {State}
- */
- function destinationAfter(code) {
- return effects.attempt(titleBefore, after, after)(code)
- }
-
- /**
- * After definition.
- *
- * ```markdown
- * > | [a]: b
- * ^
- * > | [a]: b "c"
- * ^
- * ```
- *
- * @type {State}
- */
- function after(code) {
- return markdownSpace(code)
- ? factorySpace(effects, afterWhitespace, 'whitespace')(code)
- : afterWhitespace(code)
- }
-
- /**
- * After definition, after optional whitespace.
- *
- * ```markdown
- * > | [a]: b
- * ^
- * > | [a]: b "c"
- * ^
- * ```
- *
- * @type {State}
- */
- function afterWhitespace(code) {
- if (code === null || markdownLineEnding(code)) {
- effects.exit('definition')
-
- // Note: we don’t care about uniqueness.
- // It’s likely that that doesn’t happen very frequently.
- // It is more likely that it wastes precious time.
- self.parser.defined.push(identifier)
-
- // To do: `markdown-rs` interrupt.
- // // You’d be interrupting.
- // tokenizer.interrupt = true
- return ok(code)
- }
- return nok(code)
- }
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeTitleBefore(effects, ok, nok) {
- return titleBefore
-
- /**
- * After destination, at whitespace.
- *
- * ```markdown
- * > | [a]: b
- * ^
- * > | [a]: b "c"
- * ^
- * ```
- *
- * @type {State}
- */
- function titleBefore(code) {
- return markdownLineEndingOrSpace(code)
- ? factoryWhitespace(effects, beforeMarker)(code)
- : nok(code)
- }
-
- /**
- * At title.
- *
- * ```markdown
- * | [a]: b
- * > | "c"
- * ^
- * ```
- *
- * @type {State}
- */
- function beforeMarker(code) {
- return factoryTitle(
- effects,
- titleAfter,
- nok,
- 'definitionTitle',
- 'definitionTitleMarker',
- 'definitionTitleString'
- )(code)
- }
-
- /**
- * After title.
- *
- * ```markdown
- * > | [a]: b "c"
- * ^
- * ```
- *
- * @type {State}
- */
- function titleAfter(code) {
- return markdownSpace(code)
- ? factorySpace(effects, titleAfterOptionalWhitespace, 'whitespace')(code)
- : titleAfterOptionalWhitespace(code)
- }
-
- /**
- * After title, after optional whitespace.
- *
- * ```markdown
- * > | [a]: b "c"
- * ^
- * ```
- *
- * @type {State}
- */
- function titleAfterOptionalWhitespace(code) {
- return code === null || markdownLineEnding(code) ? ok(code) : nok(code)
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-core-commonmark/lib/code-indented.js
-/**
- * @typedef {import('micromark-util-types').Construct} Construct
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- * @typedef {import('micromark-util-types').Tokenizer} Tokenizer
- */
-
-
-
-/** @type {Construct} */
-const codeIndented = {
- name: 'codeIndented',
- tokenize: tokenizeCodeIndented
-}
-
-/** @type {Construct} */
-const furtherStart = {
- tokenize: tokenizeFurtherStart,
- partial: true
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeCodeIndented(effects, ok, nok) {
- const self = this
- return start
-
- /**
- * Start of code (indented).
- *
- * > **Parsing note**: it is not needed to check if this first line is a
- * > filled line (that it has a non-whitespace character), because blank lines
- * > are parsed already, so we never run into that.
- *
- * ```markdown
- * > | aaa
- * ^
- * ```
- *
- * @type {State}
- */
- function start(code) {
- // To do: manually check if interrupting like `markdown-rs`.
-
- effects.enter('codeIndented')
- // To do: use an improved `space_or_tab` function like `markdown-rs`,
- // so that we can drop the next state.
- return factorySpace(effects, afterPrefix, 'linePrefix', 4 + 1)(code)
- }
-
- /**
- * At start, after 1 or 4 spaces.
- *
- * ```markdown
- * > | aaa
- * ^
- * ```
- *
- * @type {State}
- */
- function afterPrefix(code) {
- const tail = self.events[self.events.length - 1]
- return tail &&
- tail[1].type === 'linePrefix' &&
- tail[2].sliceSerialize(tail[1], true).length >= 4
- ? atBreak(code)
- : nok(code)
- }
-
- /**
- * At a break.
- *
- * ```markdown
- * > | aaa
- * ^ ^
- * ```
- *
- * @type {State}
- */
- function atBreak(code) {
- if (code === null) {
- return after(code)
- }
- if (markdownLineEnding(code)) {
- return effects.attempt(furtherStart, atBreak, after)(code)
- }
- effects.enter('codeFlowValue')
- return inside(code)
- }
-
- /**
- * In code content.
- *
- * ```markdown
- * > | aaa
- * ^^^^
- * ```
- *
- * @type {State}
- */
- function inside(code) {
- if (code === null || markdownLineEnding(code)) {
- effects.exit('codeFlowValue')
- return atBreak(code)
- }
- effects.consume(code)
- return inside
- }
-
- /** @type {State} */
- function after(code) {
- effects.exit('codeIndented')
- // To do: allow interrupting like `markdown-rs`.
- // Feel free to interrupt.
- // tokenizer.interrupt = false
- return ok(code)
- }
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeFurtherStart(effects, ok, nok) {
- const self = this
- return furtherStart
-
- /**
- * At eol, trying to parse another indent.
- *
- * ```markdown
- * > | aaa
- * ^
- * | bbb
- * ```
- *
- * @type {State}
- */
- function furtherStart(code) {
- // To do: improve `lazy` / `pierce` handling.
- // If this is a lazy line, it can’t be code.
- if (self.parser.lazy[self.now().line]) {
- return nok(code)
- }
- if (markdownLineEnding(code)) {
- effects.enter('lineEnding')
- effects.consume(code)
- effects.exit('lineEnding')
- return furtherStart
- }
-
- // To do: the code here in `micromark-js` is a bit different from
- // `markdown-rs` because there it can attempt spaces.
- // We can’t yet.
- //
- // To do: use an improved `space_or_tab` function like `markdown-rs`,
- // so that we can drop the next state.
- return factorySpace(effects, afterPrefix, 'linePrefix', 4 + 1)(code)
- }
-
- /**
- * At start, after 1 or 4 spaces.
- *
- * ```markdown
- * > | aaa
- * ^
- * ```
- *
- * @type {State}
- */
- function afterPrefix(code) {
- const tail = self.events[self.events.length - 1]
- return tail &&
- tail[1].type === 'linePrefix' &&
- tail[2].sliceSerialize(tail[1], true).length >= 4
- ? ok(code)
- : markdownLineEnding(code)
- ? furtherStart(code)
- : nok(code)
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-core-commonmark/lib/heading-atx.js
-/**
- * @typedef {import('micromark-util-types').Construct} Construct
- * @typedef {import('micromark-util-types').Resolver} Resolver
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').Token} Token
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- * @typedef {import('micromark-util-types').Tokenizer} Tokenizer
- */
-
-
-
-
-/** @type {Construct} */
-const headingAtx = {
- name: 'headingAtx',
- tokenize: tokenizeHeadingAtx,
- resolve: resolveHeadingAtx
-}
-
-/** @type {Resolver} */
-function resolveHeadingAtx(events, context) {
- let contentEnd = events.length - 2
- let contentStart = 3
- /** @type {Token} */
- let content
- /** @type {Token} */
- let text
-
- // Prefix whitespace, part of the opening.
- if (events[contentStart][1].type === 'whitespace') {
- contentStart += 2
- }
-
- // Suffix whitespace, part of the closing.
- if (
- contentEnd - 2 > contentStart &&
- events[contentEnd][1].type === 'whitespace'
- ) {
- contentEnd -= 2
- }
- if (
- events[contentEnd][1].type === 'atxHeadingSequence' &&
- (contentStart === contentEnd - 1 ||
- (contentEnd - 4 > contentStart &&
- events[contentEnd - 2][1].type === 'whitespace'))
- ) {
- contentEnd -= contentStart + 1 === contentEnd ? 2 : 4
- }
- if (contentEnd > contentStart) {
- content = {
- type: 'atxHeadingText',
- start: events[contentStart][1].start,
- end: events[contentEnd][1].end
- }
- text = {
- type: 'chunkText',
- start: events[contentStart][1].start,
- end: events[contentEnd][1].end,
- contentType: 'text'
- }
- splice(events, contentStart, contentEnd - contentStart + 1, [
- ['enter', content, context],
- ['enter', text, context],
- ['exit', text, context],
- ['exit', content, context]
- ])
- }
- return events
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeHeadingAtx(effects, ok, nok) {
- let size = 0
- return start
-
- /**
- * Start of a heading (atx).
- *
- * ```markdown
- * > | ## aa
- * ^
- * ```
- *
- * @type {State}
- */
- function start(code) {
- // To do: parse indent like `markdown-rs`.
- effects.enter('atxHeading')
- return before(code)
- }
-
- /**
- * After optional whitespace, at `#`.
- *
- * ```markdown
- * > | ## aa
- * ^
- * ```
- *
- * @type {State}
- */
- function before(code) {
- effects.enter('atxHeadingSequence')
- return sequenceOpen(code)
- }
-
- /**
- * In opening sequence.
- *
- * ```markdown
- * > | ## aa
- * ^
- * ```
- *
- * @type {State}
- */
- function sequenceOpen(code) {
- if (code === 35 && size++ < 6) {
- effects.consume(code)
- return sequenceOpen
- }
-
- // Always at least one `#`.
- if (code === null || markdownLineEndingOrSpace(code)) {
- effects.exit('atxHeadingSequence')
- return atBreak(code)
- }
- return nok(code)
- }
-
- /**
- * After something, before something else.
- *
- * ```markdown
- * > | ## aa
- * ^
- * ```
- *
- * @type {State}
- */
- function atBreak(code) {
- if (code === 35) {
- effects.enter('atxHeadingSequence')
- return sequenceFurther(code)
- }
- if (code === null || markdownLineEnding(code)) {
- effects.exit('atxHeading')
- // To do: interrupt like `markdown-rs`.
- // // Feel free to interrupt.
- // tokenizer.interrupt = false
- return ok(code)
- }
- if (markdownSpace(code)) {
- return factorySpace(effects, atBreak, 'whitespace')(code)
- }
-
- // To do: generate `data` tokens, add the `text` token later.
- // Needs edit map, see: `markdown.rs`.
- effects.enter('atxHeadingText')
- return data(code)
- }
-
- /**
- * In further sequence (after whitespace).
- *
- * Could be normal “visible” hashes in the heading or a final sequence.
- *
- * ```markdown
- * > | ## aa ##
- * ^
- * ```
- *
- * @type {State}
- */
- function sequenceFurther(code) {
- if (code === 35) {
- effects.consume(code)
- return sequenceFurther
- }
- effects.exit('atxHeadingSequence')
- return atBreak(code)
- }
-
- /**
- * In text.
- *
- * ```markdown
- * > | ## aa
- * ^
- * ```
- *
- * @type {State}
- */
- function data(code) {
- if (code === null || code === 35 || markdownLineEndingOrSpace(code)) {
- effects.exit('atxHeadingText')
- return atBreak(code)
- }
- effects.consume(code)
- return data
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-core-commonmark/lib/setext-underline.js
-/**
- * @typedef {import('micromark-util-types').Code} Code
- * @typedef {import('micromark-util-types').Construct} Construct
- * @typedef {import('micromark-util-types').Resolver} Resolver
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- * @typedef {import('micromark-util-types').Tokenizer} Tokenizer
- */
-
-
-
-/** @type {Construct} */
-const setextUnderline = {
- name: 'setextUnderline',
- tokenize: tokenizeSetextUnderline,
- resolveTo: resolveToSetextUnderline
-}
-
-/** @type {Resolver} */
-function resolveToSetextUnderline(events, context) {
- // To do: resolve like `markdown-rs`.
- let index = events.length
- /** @type {number | undefined} */
- let content
- /** @type {number | undefined} */
- let text
- /** @type {number | undefined} */
- let definition
-
- // Find the opening of the content.
- // It’ll always exist: we don’t tokenize if it isn’t there.
- while (index--) {
- if (events[index][0] === 'enter') {
- if (events[index][1].type === 'content') {
- content = index
- break
- }
- if (events[index][1].type === 'paragraph') {
- text = index
- }
- }
- // Exit
- else {
- if (events[index][1].type === 'content') {
- // Remove the content end (if needed we’ll add it later)
- events.splice(index, 1)
- }
- if (!definition && events[index][1].type === 'definition') {
- definition = index
- }
- }
- }
- const heading = {
- type: 'setextHeading',
- start: Object.assign({}, events[text][1].start),
- end: Object.assign({}, events[events.length - 1][1].end)
- }
-
- // Change the paragraph to setext heading text.
- events[text][1].type = 'setextHeadingText'
-
- // If we have definitions in the content, we’ll keep on having content,
- // but we need move it.
- if (definition) {
- events.splice(text, 0, ['enter', heading, context])
- events.splice(definition + 1, 0, ['exit', events[content][1], context])
- events[content][1].end = Object.assign({}, events[definition][1].end)
- } else {
- events[content][1] = heading
- }
-
- // Add the heading exit at the end.
- events.push(['exit', heading, context])
- return events
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeSetextUnderline(effects, ok, nok) {
- const self = this
- /** @type {NonNullable<Code>} */
- let marker
- return start
-
- /**
- * At start of heading (setext) underline.
- *
- * ```markdown
- * | aa
- * > | ==
- * ^
- * ```
- *
- * @type {State}
- */
- function start(code) {
- let index = self.events.length
- /** @type {boolean | undefined} */
- let paragraph
- // Find an opening.
- while (index--) {
- // Skip enter/exit of line ending, line prefix, and content.
- // We can now either have a definition or a paragraph.
- if (
- self.events[index][1].type !== 'lineEnding' &&
- self.events[index][1].type !== 'linePrefix' &&
- self.events[index][1].type !== 'content'
- ) {
- paragraph = self.events[index][1].type === 'paragraph'
- break
- }
- }
-
- // To do: handle lazy/pierce like `markdown-rs`.
- // To do: parse indent like `markdown-rs`.
- if (!self.parser.lazy[self.now().line] && (self.interrupt || paragraph)) {
- effects.enter('setextHeadingLine')
- marker = code
- return before(code)
- }
- return nok(code)
- }
-
- /**
- * After optional whitespace, at `-` or `=`.
- *
- * ```markdown
- * | aa
- * > | ==
- * ^
- * ```
- *
- * @type {State}
- */
- function before(code) {
- effects.enter('setextHeadingLineSequence')
- return inside(code)
- }
-
- /**
- * In sequence.
- *
- * ```markdown
- * | aa
- * > | ==
- * ^
- * ```
- *
- * @type {State}
- */
- function inside(code) {
- if (code === marker) {
- effects.consume(code)
- return inside
- }
- effects.exit('setextHeadingLineSequence')
- return markdownSpace(code)
- ? factorySpace(effects, after, 'lineSuffix')(code)
- : after(code)
- }
-
- /**
- * After sequence, after optional whitespace.
- *
- * ```markdown
- * | aa
- * > | ==
- * ^
- * ```
- *
- * @type {State}
- */
- function after(code) {
- if (code === null || markdownLineEnding(code)) {
- effects.exit('setextHeadingLine')
- return ok(code)
- }
- return nok(code)
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-util-html-tag-name/index.js
-/**
- * List of lowercase HTML “block” tag names.
- *
- * The list, when parsing HTML (flow), results in more relaxed rules (condition
- * 6).
- * Because they are known blocks, the HTML-like syntax doesn’t have to be
- * strictly parsed.
- * For tag names not in this list, a more strict algorithm (condition 7) is used
- * to detect whether the HTML-like syntax is seen as HTML (flow) or not.
- *
- * This is copied from:
- * <https://spec.commonmark.org/0.30/#html-blocks>.
- *
- * > 👉 **Note**: `search` was added in `CommonMark@0.31`.
- */
-const htmlBlockNames = [
- 'address',
- 'article',
- 'aside',
- 'base',
- 'basefont',
- 'blockquote',
- 'body',
- 'caption',
- 'center',
- 'col',
- 'colgroup',
- 'dd',
- 'details',
- 'dialog',
- 'dir',
- 'div',
- 'dl',
- 'dt',
- 'fieldset',
- 'figcaption',
- 'figure',
- 'footer',
- 'form',
- 'frame',
- 'frameset',
- 'h1',
- 'h2',
- 'h3',
- 'h4',
- 'h5',
- 'h6',
- 'head',
- 'header',
- 'hr',
- 'html',
- 'iframe',
- 'legend',
- 'li',
- 'link',
- 'main',
- 'menu',
- 'menuitem',
- 'nav',
- 'noframes',
- 'ol',
- 'optgroup',
- 'option',
- 'p',
- 'param',
- 'search',
- 'section',
- 'summary',
- 'table',
- 'tbody',
- 'td',
- 'tfoot',
- 'th',
- 'thead',
- 'title',
- 'tr',
- 'track',
- 'ul'
-]
-
-/**
- * List of lowercase HTML “raw” tag names.
- *
- * The list, when parsing HTML (flow), results in HTML that can include lines
- * without exiting, until a closing tag also in this list is found (condition
- * 1).
- *
- * This module is copied from:
- * <https://spec.commonmark.org/0.30/#html-blocks>.
- *
- * > 👉 **Note**: `textarea` was added in `CommonMark@0.30`.
- */
-const htmlRawNames = ['pre', 'script', 'style', 'textarea']
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-core-commonmark/lib/html-flow.js
-/**
- * @typedef {import('micromark-util-types').Code} Code
- * @typedef {import('micromark-util-types').Construct} Construct
- * @typedef {import('micromark-util-types').Resolver} Resolver
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- * @typedef {import('micromark-util-types').Tokenizer} Tokenizer
- */
-
-
-
-
-
-/** @type {Construct} */
-const htmlFlow = {
- name: 'htmlFlow',
- tokenize: tokenizeHtmlFlow,
- resolveTo: resolveToHtmlFlow,
- concrete: true
-}
-
-/** @type {Construct} */
-const blankLineBefore = {
- tokenize: tokenizeBlankLineBefore,
- partial: true
-}
-const nonLazyContinuationStart = {
- tokenize: tokenizeNonLazyContinuationStart,
- partial: true
-}
-
-/** @type {Resolver} */
-function resolveToHtmlFlow(events) {
- let index = events.length
- while (index--) {
- if (events[index][0] === 'enter' && events[index][1].type === 'htmlFlow') {
- break
- }
- }
- if (index > 1 && events[index - 2][1].type === 'linePrefix') {
- // Add the prefix start to the HTML token.
- events[index][1].start = events[index - 2][1].start
- // Add the prefix start to the HTML line token.
- events[index + 1][1].start = events[index - 2][1].start
- // Remove the line prefix.
- events.splice(index - 2, 2)
- }
- return events
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeHtmlFlow(effects, ok, nok) {
- const self = this
- /** @type {number} */
- let marker
- /** @type {boolean} */
- let closingTag
- /** @type {string} */
- let buffer
- /** @type {number} */
- let index
- /** @type {Code} */
- let markerB
- return start
-
- /**
- * Start of HTML (flow).
- *
- * ```markdown
- * > | <x />
- * ^
- * ```
- *
- * @type {State}
- */
- function start(code) {
- // To do: parse indent like `markdown-rs`.
- return before(code)
- }
-
- /**
- * At `<`, after optional whitespace.
- *
- * ```markdown
- * > | <x />
- * ^
- * ```
- *
- * @type {State}
- */
- function before(code) {
- effects.enter('htmlFlow')
- effects.enter('htmlFlowData')
- effects.consume(code)
- return open
- }
-
- /**
- * After `<`, at tag name or other stuff.
- *
- * ```markdown
- * > | <x />
- * ^
- * > | <!doctype>
- * ^
- * > | <!--xxx-->
- * ^
- * ```
- *
- * @type {State}
- */
- function open(code) {
- if (code === 33) {
- effects.consume(code)
- return declarationOpen
- }
- if (code === 47) {
- effects.consume(code)
- closingTag = true
- return tagCloseStart
- }
- if (code === 63) {
- effects.consume(code)
- marker = 3
- // To do:
- // tokenizer.concrete = true
- // To do: use `markdown-rs` style interrupt.
- // While we’re in an instruction instead of a declaration, we’re on a `?`
- // right now, so we do need to search for `>`, similar to declarations.
- return self.interrupt ? ok : continuationDeclarationInside
- }
-
- // ASCII alphabetical.
- if (asciiAlpha(code)) {
- effects.consume(code)
- // @ts-expect-error: not null.
- buffer = String.fromCharCode(code)
- return tagName
- }
- return nok(code)
- }
-
- /**
- * After `<!`, at declaration, comment, or CDATA.
- *
- * ```markdown
- * > | <!doctype>
- * ^
- * > | <!--xxx-->
- * ^
- * > | <![CDATA[>&<]]>
- * ^
- * ```
- *
- * @type {State}
- */
- function declarationOpen(code) {
- if (code === 45) {
- effects.consume(code)
- marker = 2
- return commentOpenInside
- }
- if (code === 91) {
- effects.consume(code)
- marker = 5
- index = 0
- return cdataOpenInside
- }
-
- // ASCII alphabetical.
- if (asciiAlpha(code)) {
- effects.consume(code)
- marker = 4
- // // Do not form containers.
- // tokenizer.concrete = true
- return self.interrupt ? ok : continuationDeclarationInside
- }
- return nok(code)
- }
-
- /**
- * After `<!-`, inside a comment, at another `-`.
- *
- * ```markdown
- * > | <!--xxx-->
- * ^
- * ```
- *
- * @type {State}
- */
- function commentOpenInside(code) {
- if (code === 45) {
- effects.consume(code)
- // // Do not form containers.
- // tokenizer.concrete = true
- return self.interrupt ? ok : continuationDeclarationInside
- }
- return nok(code)
- }
-
- /**
- * After `<![`, inside CDATA, expecting `CDATA[`.
- *
- * ```markdown
- * > | <![CDATA[>&<]]>
- * ^^^^^^
- * ```
- *
- * @type {State}
- */
- function cdataOpenInside(code) {
- const value = 'CDATA['
- if (code === value.charCodeAt(index++)) {
- effects.consume(code)
- if (index === value.length) {
- // // Do not form containers.
- // tokenizer.concrete = true
- return self.interrupt ? ok : continuation
- }
- return cdataOpenInside
- }
- return nok(code)
- }
-
- /**
- * After `</`, in closing tag, at tag name.
- *
- * ```markdown
- * > | </x>
- * ^
- * ```
- *
- * @type {State}
- */
- function tagCloseStart(code) {
- if (asciiAlpha(code)) {
- effects.consume(code)
- // @ts-expect-error: not null.
- buffer = String.fromCharCode(code)
- return tagName
- }
- return nok(code)
- }
-
- /**
- * In tag name.
- *
- * ```markdown
- * > | <ab>
- * ^^
- * > | </ab>
- * ^^
- * ```
- *
- * @type {State}
- */
- function tagName(code) {
- if (
- code === null ||
- code === 47 ||
- code === 62 ||
- markdownLineEndingOrSpace(code)
- ) {
- const slash = code === 47
- const name = buffer.toLowerCase()
- if (!slash && !closingTag && htmlRawNames.includes(name)) {
- marker = 1
- // // Do not form containers.
- // tokenizer.concrete = true
- return self.interrupt ? ok(code) : continuation(code)
- }
- if (htmlBlockNames.includes(buffer.toLowerCase())) {
- marker = 6
- if (slash) {
- effects.consume(code)
- return basicSelfClosing
- }
-
- // // Do not form containers.
- // tokenizer.concrete = true
- return self.interrupt ? ok(code) : continuation(code)
- }
- marker = 7
- // Do not support complete HTML when interrupting.
- return self.interrupt && !self.parser.lazy[self.now().line]
- ? nok(code)
- : closingTag
- ? completeClosingTagAfter(code)
- : completeAttributeNameBefore(code)
- }
-
- // ASCII alphanumerical and `-`.
- if (code === 45 || asciiAlphanumeric(code)) {
- effects.consume(code)
- buffer += String.fromCharCode(code)
- return tagName
- }
- return nok(code)
- }
-
- /**
- * After closing slash of a basic tag name.
- *
- * ```markdown
- * > | <div/>
- * ^
- * ```
- *
- * @type {State}
- */
- function basicSelfClosing(code) {
- if (code === 62) {
- effects.consume(code)
- // // Do not form containers.
- // tokenizer.concrete = true
- return self.interrupt ? ok : continuation
- }
- return nok(code)
- }
-
- /**
- * After closing slash of a complete tag name.
- *
- * ```markdown
- * > | <x/>
- * ^
- * ```
- *
- * @type {State}
- */
- function completeClosingTagAfter(code) {
- if (markdownSpace(code)) {
- effects.consume(code)
- return completeClosingTagAfter
- }
- return completeEnd(code)
- }
-
- /**
- * At an attribute name.
- *
- * At first, this state is used after a complete tag name, after whitespace,
- * where it expects optional attributes or the end of the tag.
- * It is also reused after attributes, when expecting more optional
- * attributes.
- *
- * ```markdown
- * > | <a />
- * ^
- * > | <a :b>
- * ^
- * > | <a _b>
- * ^
- * > | <a b>
- * ^
- * > | <a >
- * ^
- * ```
- *
- * @type {State}
- */
- function completeAttributeNameBefore(code) {
- if (code === 47) {
- effects.consume(code)
- return completeEnd
- }
-
- // ASCII alphanumerical and `:` and `_`.
- if (code === 58 || code === 95 || asciiAlpha(code)) {
- effects.consume(code)
- return completeAttributeName
- }
- if (markdownSpace(code)) {
- effects.consume(code)
- return completeAttributeNameBefore
- }
- return completeEnd(code)
- }
-
- /**
- * In attribute name.
- *
- * ```markdown
- * > | <a :b>
- * ^
- * > | <a _b>
- * ^
- * > | <a b>
- * ^
- * ```
- *
- * @type {State}
- */
- function completeAttributeName(code) {
- // ASCII alphanumerical and `-`, `.`, `:`, and `_`.
- if (
- code === 45 ||
- code === 46 ||
- code === 58 ||
- code === 95 ||
- asciiAlphanumeric(code)
- ) {
- effects.consume(code)
- return completeAttributeName
- }
- return completeAttributeNameAfter(code)
- }
-
- /**
- * After attribute name, at an optional initializer, the end of the tag, or
- * whitespace.
- *
- * ```markdown
- * > | <a b>
- * ^
- * > | <a b=c>
- * ^
- * ```
- *
- * @type {State}
- */
- function completeAttributeNameAfter(code) {
- if (code === 61) {
- effects.consume(code)
- return completeAttributeValueBefore
- }
- if (markdownSpace(code)) {
- effects.consume(code)
- return completeAttributeNameAfter
- }
- return completeAttributeNameBefore(code)
- }
-
- /**
- * Before unquoted, double quoted, or single quoted attribute value, allowing
- * whitespace.
- *
- * ```markdown
- * > | <a b=c>
- * ^
- * > | <a b="c">
- * ^
- * ```
- *
- * @type {State}
- */
- function completeAttributeValueBefore(code) {
- if (
- code === null ||
- code === 60 ||
- code === 61 ||
- code === 62 ||
- code === 96
- ) {
- return nok(code)
- }
- if (code === 34 || code === 39) {
- effects.consume(code)
- markerB = code
- return completeAttributeValueQuoted
- }
- if (markdownSpace(code)) {
- effects.consume(code)
- return completeAttributeValueBefore
- }
- return completeAttributeValueUnquoted(code)
- }
-
- /**
- * In double or single quoted attribute value.
- *
- * ```markdown
- * > | <a b="c">
- * ^
- * > | <a b='c'>
- * ^
- * ```
- *
- * @type {State}
- */
- function completeAttributeValueQuoted(code) {
- if (code === markerB) {
- effects.consume(code)
- markerB = null
- return completeAttributeValueQuotedAfter
- }
- if (code === null || markdownLineEnding(code)) {
- return nok(code)
- }
- effects.consume(code)
- return completeAttributeValueQuoted
- }
-
- /**
- * In unquoted attribute value.
- *
- * ```markdown
- * > | <a b=c>
- * ^
- * ```
- *
- * @type {State}
- */
- function completeAttributeValueUnquoted(code) {
- if (
- code === null ||
- code === 34 ||
- code === 39 ||
- code === 47 ||
- code === 60 ||
- code === 61 ||
- code === 62 ||
- code === 96 ||
- markdownLineEndingOrSpace(code)
- ) {
- return completeAttributeNameAfter(code)
- }
- effects.consume(code)
- return completeAttributeValueUnquoted
- }
-
- /**
- * After double or single quoted attribute value, before whitespace or the
- * end of the tag.
- *
- * ```markdown
- * > | <a b="c">
- * ^
- * ```
- *
- * @type {State}
- */
- function completeAttributeValueQuotedAfter(code) {
- if (code === 47 || code === 62 || markdownSpace(code)) {
- return completeAttributeNameBefore(code)
- }
- return nok(code)
- }
-
- /**
- * In certain circumstances of a complete tag where only an `>` is allowed.
- *
- * ```markdown
- * > | <a b="c">
- * ^
- * ```
- *
- * @type {State}
- */
- function completeEnd(code) {
- if (code === 62) {
- effects.consume(code)
- return completeAfter
- }
- return nok(code)
- }
-
- /**
- * After `>` in a complete tag.
- *
- * ```markdown
- * > | <x>
- * ^
- * ```
- *
- * @type {State}
- */
- function completeAfter(code) {
- if (code === null || markdownLineEnding(code)) {
- // // Do not form containers.
- // tokenizer.concrete = true
- return continuation(code)
- }
- if (markdownSpace(code)) {
- effects.consume(code)
- return completeAfter
- }
- return nok(code)
- }
-
- /**
- * In continuation of any HTML kind.
- *
- * ```markdown
- * > | <!--xxx-->
- * ^
- * ```
- *
- * @type {State}
- */
- function continuation(code) {
- if (code === 45 && marker === 2) {
- effects.consume(code)
- return continuationCommentInside
- }
- if (code === 60 && marker === 1) {
- effects.consume(code)
- return continuationRawTagOpen
- }
- if (code === 62 && marker === 4) {
- effects.consume(code)
- return continuationClose
- }
- if (code === 63 && marker === 3) {
- effects.consume(code)
- return continuationDeclarationInside
- }
- if (code === 93 && marker === 5) {
- effects.consume(code)
- return continuationCdataInside
- }
- if (markdownLineEnding(code) && (marker === 6 || marker === 7)) {
- effects.exit('htmlFlowData')
- return effects.check(
- blankLineBefore,
- continuationAfter,
- continuationStart
- )(code)
- }
- if (code === null || markdownLineEnding(code)) {
- effects.exit('htmlFlowData')
- return continuationStart(code)
- }
- effects.consume(code)
- return continuation
- }
-
- /**
- * In continuation, at eol.
- *
- * ```markdown
- * > | <x>
- * ^
- * | asd
- * ```
- *
- * @type {State}
- */
- function continuationStart(code) {
- return effects.check(
- nonLazyContinuationStart,
- continuationStartNonLazy,
- continuationAfter
- )(code)
- }
-
- /**
- * In continuation, at eol, before non-lazy content.
- *
- * ```markdown
- * > | <x>
- * ^
- * | asd
- * ```
- *
- * @type {State}
- */
- function continuationStartNonLazy(code) {
- effects.enter('lineEnding')
- effects.consume(code)
- effects.exit('lineEnding')
- return continuationBefore
- }
-
- /**
- * In continuation, before non-lazy content.
- *
- * ```markdown
- * | <x>
- * > | asd
- * ^
- * ```
- *
- * @type {State}
- */
- function continuationBefore(code) {
- if (code === null || markdownLineEnding(code)) {
- return continuationStart(code)
- }
- effects.enter('htmlFlowData')
- return continuation(code)
- }
-
- /**
- * In comment continuation, after one `-`, expecting another.
- *
- * ```markdown
- * > | <!--xxx-->
- * ^
- * ```
- *
- * @type {State}
- */
- function continuationCommentInside(code) {
- if (code === 45) {
- effects.consume(code)
- return continuationDeclarationInside
- }
- return continuation(code)
- }
-
- /**
- * In raw continuation, after `<`, at `/`.
- *
- * ```markdown
- * > | <script>console.log(1)</script>
- * ^
- * ```
- *
- * @type {State}
- */
- function continuationRawTagOpen(code) {
- if (code === 47) {
- effects.consume(code)
- buffer = ''
- return continuationRawEndTag
- }
- return continuation(code)
- }
-
- /**
- * In raw continuation, after `</`, in a raw tag name.
- *
- * ```markdown
- * > | <script>console.log(1)</script>
- * ^^^^^^
- * ```
- *
- * @type {State}
- */
- function continuationRawEndTag(code) {
- if (code === 62) {
- const name = buffer.toLowerCase()
- if (htmlRawNames.includes(name)) {
- effects.consume(code)
- return continuationClose
- }
- return continuation(code)
- }
- if (asciiAlpha(code) && buffer.length < 8) {
- effects.consume(code)
- // @ts-expect-error: not null.
- buffer += String.fromCharCode(code)
- return continuationRawEndTag
- }
- return continuation(code)
- }
-
- /**
- * In cdata continuation, after `]`, expecting `]>`.
- *
- * ```markdown
- * > | <![CDATA[>&<]]>
- * ^
- * ```
- *
- * @type {State}
- */
- function continuationCdataInside(code) {
- if (code === 93) {
- effects.consume(code)
- return continuationDeclarationInside
- }
- return continuation(code)
- }
-
- /**
- * In declaration or instruction continuation, at `>`.
- *
- * ```markdown
- * > | <!-->
- * ^
- * > | <?>
- * ^
- * > | <!q>
- * ^
- * > | <!--ab-->
- * ^
- * > | <![CDATA[>&<]]>
- * ^
- * ```
- *
- * @type {State}
- */
- function continuationDeclarationInside(code) {
- if (code === 62) {
- effects.consume(code)
- return continuationClose
- }
-
- // More dashes.
- if (code === 45 && marker === 2) {
- effects.consume(code)
- return continuationDeclarationInside
- }
- return continuation(code)
- }
-
- /**
- * In closed continuation: everything we get until the eol/eof is part of it.
- *
- * ```markdown
- * > | <!doctype>
- * ^
- * ```
- *
- * @type {State}
- */
- function continuationClose(code) {
- if (code === null || markdownLineEnding(code)) {
- effects.exit('htmlFlowData')
- return continuationAfter(code)
- }
- effects.consume(code)
- return continuationClose
- }
-
- /**
- * Done.
- *
- * ```markdown
- * > | <!doctype>
- * ^
- * ```
- *
- * @type {State}
- */
- function continuationAfter(code) {
- effects.exit('htmlFlow')
- // // Feel free to interrupt.
- // tokenizer.interrupt = false
- // // No longer concrete.
- // tokenizer.concrete = false
- return ok(code)
- }
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeNonLazyContinuationStart(effects, ok, nok) {
- const self = this
- return start
-
- /**
- * At eol, before continuation.
- *
- * ```markdown
- * > | * ```js
- * ^
- * | b
- * ```
- *
- * @type {State}
- */
- function start(code) {
- if (markdownLineEnding(code)) {
- effects.enter('lineEnding')
- effects.consume(code)
- effects.exit('lineEnding')
- return after
- }
- return nok(code)
- }
-
- /**
- * A continuation.
- *
- * ```markdown
- * | * ```js
- * > | b
- * ^
- * ```
- *
- * @type {State}
- */
- function after(code) {
- return self.parser.lazy[self.now().line] ? nok(code) : ok(code)
- }
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeBlankLineBefore(effects, ok, nok) {
- return start
-
- /**
- * Before eol, expecting blank line.
- *
- * ```markdown
- * > | <div>
- * ^
- * |
- * ```
- *
- * @type {State}
- */
- function start(code) {
- effects.enter('lineEnding')
- effects.consume(code)
- effects.exit('lineEnding')
- return effects.attempt(blankLine, ok, nok)
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-core-commonmark/lib/code-fenced.js
-/**
- * @typedef {import('micromark-util-types').Code} Code
- * @typedef {import('micromark-util-types').Construct} Construct
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- * @typedef {import('micromark-util-types').Tokenizer} Tokenizer
- */
-
-
-
-/** @type {Construct} */
-const nonLazyContinuation = {
- tokenize: tokenizeNonLazyContinuation,
- partial: true
-}
-
-/** @type {Construct} */
-const codeFenced = {
- name: 'codeFenced',
- tokenize: tokenizeCodeFenced,
- concrete: true
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeCodeFenced(effects, ok, nok) {
- const self = this
- /** @type {Construct} */
- const closeStart = {
- tokenize: tokenizeCloseStart,
- partial: true
- }
- let initialPrefix = 0
- let sizeOpen = 0
- /** @type {NonNullable<Code>} */
- let marker
- return start
-
- /**
- * Start of code.
- *
- * ```markdown
- * > | ~~~js
- * ^
- * | alert(1)
- * | ~~~
- * ```
- *
- * @type {State}
- */
- function start(code) {
- // To do: parse whitespace like `markdown-rs`.
- return beforeSequenceOpen(code)
- }
-
- /**
- * In opening fence, after prefix, at sequence.
- *
- * ```markdown
- * > | ~~~js
- * ^
- * | alert(1)
- * | ~~~
- * ```
- *
- * @type {State}
- */
- function beforeSequenceOpen(code) {
- const tail = self.events[self.events.length - 1]
- initialPrefix =
- tail && tail[1].type === 'linePrefix'
- ? tail[2].sliceSerialize(tail[1], true).length
- : 0
- marker = code
- effects.enter('codeFenced')
- effects.enter('codeFencedFence')
- effects.enter('codeFencedFenceSequence')
- return sequenceOpen(code)
- }
-
- /**
- * In opening fence sequence.
- *
- * ```markdown
- * > | ~~~js
- * ^
- * | alert(1)
- * | ~~~
- * ```
- *
- * @type {State}
- */
- function sequenceOpen(code) {
- if (code === marker) {
- sizeOpen++
- effects.consume(code)
- return sequenceOpen
- }
- if (sizeOpen < 3) {
- return nok(code)
- }
- effects.exit('codeFencedFenceSequence')
- return markdownSpace(code)
- ? factorySpace(effects, infoBefore, 'whitespace')(code)
- : infoBefore(code)
- }
-
- /**
- * In opening fence, after the sequence (and optional whitespace), before info.
- *
- * ```markdown
- * > | ~~~js
- * ^
- * | alert(1)
- * | ~~~
- * ```
- *
- * @type {State}
- */
- function infoBefore(code) {
- if (code === null || markdownLineEnding(code)) {
- effects.exit('codeFencedFence')
- return self.interrupt
- ? ok(code)
- : effects.check(nonLazyContinuation, atNonLazyBreak, after)(code)
- }
- effects.enter('codeFencedFenceInfo')
- effects.enter('chunkString', {
- contentType: 'string'
- })
- return info(code)
- }
-
- /**
- * In info.
- *
- * ```markdown
- * > | ~~~js
- * ^
- * | alert(1)
- * | ~~~
- * ```
- *
- * @type {State}
- */
- function info(code) {
- if (code === null || markdownLineEnding(code)) {
- effects.exit('chunkString')
- effects.exit('codeFencedFenceInfo')
- return infoBefore(code)
- }
- if (markdownSpace(code)) {
- effects.exit('chunkString')
- effects.exit('codeFencedFenceInfo')
- return factorySpace(effects, metaBefore, 'whitespace')(code)
- }
- if (code === 96 && code === marker) {
- return nok(code)
- }
- effects.consume(code)
- return info
- }
-
- /**
- * In opening fence, after info and whitespace, before meta.
- *
- * ```markdown
- * > | ~~~js eval
- * ^
- * | alert(1)
- * | ~~~
- * ```
- *
- * @type {State}
- */
- function metaBefore(code) {
- if (code === null || markdownLineEnding(code)) {
- return infoBefore(code)
- }
- effects.enter('codeFencedFenceMeta')
- effects.enter('chunkString', {
- contentType: 'string'
- })
- return meta(code)
- }
-
- /**
- * In meta.
- *
- * ```markdown
- * > | ~~~js eval
- * ^
- * | alert(1)
- * | ~~~
- * ```
- *
- * @type {State}
- */
- function meta(code) {
- if (code === null || markdownLineEnding(code)) {
- effects.exit('chunkString')
- effects.exit('codeFencedFenceMeta')
- return infoBefore(code)
- }
- if (code === 96 && code === marker) {
- return nok(code)
- }
- effects.consume(code)
- return meta
- }
-
- /**
- * At eol/eof in code, before a non-lazy closing fence or content.
- *
- * ```markdown
- * > | ~~~js
- * ^
- * > | alert(1)
- * ^
- * | ~~~
- * ```
- *
- * @type {State}
- */
- function atNonLazyBreak(code) {
- return effects.attempt(closeStart, after, contentBefore)(code)
- }
-
- /**
- * Before code content, not a closing fence, at eol.
- *
- * ```markdown
- * | ~~~js
- * > | alert(1)
- * ^
- * | ~~~
- * ```
- *
- * @type {State}
- */
- function contentBefore(code) {
- effects.enter('lineEnding')
- effects.consume(code)
- effects.exit('lineEnding')
- return contentStart
- }
-
- /**
- * Before code content, not a closing fence.
- *
- * ```markdown
- * | ~~~js
- * > | alert(1)
- * ^
- * | ~~~
- * ```
- *
- * @type {State}
- */
- function contentStart(code) {
- return initialPrefix > 0 && markdownSpace(code)
- ? factorySpace(
- effects,
- beforeContentChunk,
- 'linePrefix',
- initialPrefix + 1
- )(code)
- : beforeContentChunk(code)
- }
-
- /**
- * Before code content, after optional prefix.
- *
- * ```markdown
- * | ~~~js
- * > | alert(1)
- * ^
- * | ~~~
- * ```
- *
- * @type {State}
- */
- function beforeContentChunk(code) {
- if (code === null || markdownLineEnding(code)) {
- return effects.check(nonLazyContinuation, atNonLazyBreak, after)(code)
- }
- effects.enter('codeFlowValue')
- return contentChunk(code)
- }
-
- /**
- * In code content.
- *
- * ```markdown
- * | ~~~js
- * > | alert(1)
- * ^^^^^^^^
- * | ~~~
- * ```
- *
- * @type {State}
- */
- function contentChunk(code) {
- if (code === null || markdownLineEnding(code)) {
- effects.exit('codeFlowValue')
- return beforeContentChunk(code)
- }
- effects.consume(code)
- return contentChunk
- }
-
- /**
- * After code.
- *
- * ```markdown
- * | ~~~js
- * | alert(1)
- * > | ~~~
- * ^
- * ```
- *
- * @type {State}
- */
- function after(code) {
- effects.exit('codeFenced')
- return ok(code)
- }
-
- /**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
- function tokenizeCloseStart(effects, ok, nok) {
- let size = 0
- return startBefore
-
- /**
- *
- *
- * @type {State}
- */
- function startBefore(code) {
- effects.enter('lineEnding')
- effects.consume(code)
- effects.exit('lineEnding')
- return start
- }
-
- /**
- * Before closing fence, at optional whitespace.
- *
- * ```markdown
- * | ~~~js
- * | alert(1)
- * > | ~~~
- * ^
- * ```
- *
- * @type {State}
- */
- function start(code) {
- // Always populated by defaults.
-
- // To do: `enter` here or in next state?
- effects.enter('codeFencedFence')
- return markdownSpace(code)
- ? factorySpace(
- effects,
- beforeSequenceClose,
- 'linePrefix',
- self.parser.constructs.disable.null.includes('codeIndented')
- ? undefined
- : 4
- )(code)
- : beforeSequenceClose(code)
- }
-
- /**
- * In closing fence, after optional whitespace, at sequence.
- *
- * ```markdown
- * | ~~~js
- * | alert(1)
- * > | ~~~
- * ^
- * ```
- *
- * @type {State}
- */
- function beforeSequenceClose(code) {
- if (code === marker) {
- effects.enter('codeFencedFenceSequence')
- return sequenceClose(code)
- }
- return nok(code)
- }
-
- /**
- * In closing fence sequence.
- *
- * ```markdown
- * | ~~~js
- * | alert(1)
- * > | ~~~
- * ^
- * ```
- *
- * @type {State}
- */
- function sequenceClose(code) {
- if (code === marker) {
- size++
- effects.consume(code)
- return sequenceClose
- }
- if (size >= sizeOpen) {
- effects.exit('codeFencedFenceSequence')
- return markdownSpace(code)
- ? factorySpace(effects, sequenceCloseAfter, 'whitespace')(code)
- : sequenceCloseAfter(code)
- }
- return nok(code)
- }
-
- /**
- * After closing fence sequence, after optional whitespace.
- *
- * ```markdown
- * | ~~~js
- * | alert(1)
- * > | ~~~
- * ^
- * ```
- *
- * @type {State}
- */
- function sequenceCloseAfter(code) {
- if (code === null || markdownLineEnding(code)) {
- effects.exit('codeFencedFence')
- return ok(code)
- }
- return nok(code)
- }
- }
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeNonLazyContinuation(effects, ok, nok) {
- const self = this
- return start
-
- /**
- *
- *
- * @type {State}
- */
- function start(code) {
- if (code === null) {
- return nok(code)
- }
- effects.enter('lineEnding')
- effects.consume(code)
- effects.exit('lineEnding')
- return lineStart
- }
-
- /**
- *
- *
- * @type {State}
- */
- function lineStart(code) {
- return self.parser.lazy[self.now().line] ? nok(code) : ok(code)
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/character-entities/index.js
-/**
- * Map of named character references.
- *
- * @type {Record<string, string>}
- */
-const characterEntities = {
- AElig: 'Æ',
- AMP: '&',
- Aacute: 'Á',
- Abreve: 'Ă',
- Acirc: 'Â',
- Acy: 'А',
- Afr: '𝔄',
- Agrave: 'À',
- Alpha: 'Α',
- Amacr: 'Ā',
- And: '⩓',
- Aogon: 'Ą',
- Aopf: '𝔸',
- ApplyFunction: '⁡',
- Aring: 'Å',
- Ascr: '𝒜',
- Assign: '≔',
- Atilde: 'Ã',
- Auml: 'Ä',
- Backslash: '∖',
- Barv: '⫧',
- Barwed: '⌆',
- Bcy: 'Б',
- Because: '∵',
- Bernoullis: 'ℬ',
- Beta: 'Β',
- Bfr: '𝔅',
- Bopf: '𝔹',
- Breve: '˘',
- Bscr: 'ℬ',
- Bumpeq: '≎',
- CHcy: 'Ч',
- COPY: '©',
- Cacute: 'Ć',
- Cap: '⋒',
- CapitalDifferentialD: 'ⅅ',
- Cayleys: 'ℭ',
- Ccaron: 'Č',
- Ccedil: 'Ç',
- Ccirc: 'Ĉ',
- Cconint: '∰',
- Cdot: 'Ċ',
- Cedilla: '¸',
- CenterDot: '·',
- Cfr: 'ℭ',
- Chi: 'Χ',
- CircleDot: '⊙',
- CircleMinus: '⊖',
- CirclePlus: '⊕',
- CircleTimes: '⊗',
- ClockwiseContourIntegral: '∲',
- CloseCurlyDoubleQuote: '”',
- CloseCurlyQuote: '’',
- Colon: '∷',
- Colone: '⩴',
- Congruent: '≡',
- Conint: '∯',
- ContourIntegral: '∮',
- Copf: 'ℂ',
- Coproduct: '∐',
- CounterClockwiseContourIntegral: '∳',
- Cross: '⨯',
- Cscr: '𝒞',
- Cup: '⋓',
- CupCap: '≍',
- DD: 'ⅅ',
- DDotrahd: '⤑',
- DJcy: 'Ђ',
- DScy: 'Ѕ',
- DZcy: 'Џ',
- Dagger: '‡',
- Darr: '↡',
- Dashv: '⫤',
- Dcaron: 'Ď',
- Dcy: 'Д',
- Del: '∇',
- Delta: 'Δ',
- Dfr: '𝔇',
- DiacriticalAcute: '´',
- DiacriticalDot: '˙',
- DiacriticalDoubleAcute: '˝',
- DiacriticalGrave: '`',
- DiacriticalTilde: '˜',
- Diamond: '⋄',
- DifferentialD: 'ⅆ',
- Dopf: '𝔻',
- Dot: '¨',
- DotDot: '⃜',
- DotEqual: '≐',
- DoubleContourIntegral: '∯',
- DoubleDot: '¨',
- DoubleDownArrow: '⇓',
- DoubleLeftArrow: '⇐',
- DoubleLeftRightArrow: '⇔',
- DoubleLeftTee: '⫤',
- DoubleLongLeftArrow: '⟸',
- DoubleLongLeftRightArrow: '⟺',
- DoubleLongRightArrow: '⟹',
- DoubleRightArrow: '⇒',
- DoubleRightTee: '⊨',
- DoubleUpArrow: '⇑',
- DoubleUpDownArrow: '⇕',
- DoubleVerticalBar: '∥',
- DownArrow: '↓',
- DownArrowBar: '⤓',
- DownArrowUpArrow: '⇵',
- DownBreve: '̑',
- DownLeftRightVector: '⥐',
- DownLeftTeeVector: '⥞',
- DownLeftVector: '↽',
- DownLeftVectorBar: '⥖',
- DownRightTeeVector: '⥟',
- DownRightVector: '⇁',
- DownRightVectorBar: '⥗',
- DownTee: '⊤',
- DownTeeArrow: '↧',
- Downarrow: '⇓',
- Dscr: '𝒟',
- Dstrok: 'Đ',
- ENG: 'Ŋ',
- ETH: 'Ð',
- Eacute: 'É',
- Ecaron: 'Ě',
- Ecirc: 'Ê',
- Ecy: 'Э',
- Edot: 'Ė',
- Efr: '𝔈',
- Egrave: 'È',
- Element: '∈',
- Emacr: 'Ē',
- EmptySmallSquare: '◻',
- EmptyVerySmallSquare: '▫',
- Eogon: 'Ę',
- Eopf: '𝔼',
- Epsilon: 'Ε',
- Equal: '⩵',
- EqualTilde: '≂',
- Equilibrium: '⇌',
- Escr: 'ℰ',
- Esim: '⩳',
- Eta: 'Η',
- Euml: 'Ë',
- Exists: '∃',
- ExponentialE: 'ⅇ',
- Fcy: 'Ф',
- Ffr: '𝔉',
- FilledSmallSquare: '◼',
- FilledVerySmallSquare: '▪',
- Fopf: '𝔽',
- ForAll: '∀',
- Fouriertrf: 'ℱ',
- Fscr: 'ℱ',
- GJcy: 'Ѓ',
- GT: '>',
- Gamma: 'Γ',
- Gammad: 'Ϝ',
- Gbreve: 'Ğ',
- Gcedil: 'Ģ',
- Gcirc: 'Ĝ',
- Gcy: 'Г',
- Gdot: 'Ġ',
- Gfr: '𝔊',
- Gg: '⋙',
- Gopf: '𝔾',
- GreaterEqual: '≥',
- GreaterEqualLess: '⋛',
- GreaterFullEqual: '≧',
- GreaterGreater: '⪢',
- GreaterLess: '≷',
- GreaterSlantEqual: '⩾',
- GreaterTilde: '≳',
- Gscr: '𝒢',
- Gt: '≫',
- HARDcy: 'Ъ',
- Hacek: 'ˇ',
- Hat: '^',
- Hcirc: 'Ĥ',
- Hfr: 'ℌ',
- HilbertSpace: 'ℋ',
- Hopf: 'ℍ',
- HorizontalLine: '─',
- Hscr: 'ℋ',
- Hstrok: 'Ħ',
- HumpDownHump: '≎',
- HumpEqual: '≏',
- IEcy: 'Е',
- IJlig: 'IJ',
- IOcy: 'Ё',
- Iacute: 'Í',
- Icirc: 'Î',
- Icy: 'И',
- Idot: 'İ',
- Ifr: 'ℑ',
- Igrave: 'Ì',
- Im: 'ℑ',
- Imacr: 'Ī',
- ImaginaryI: 'ⅈ',
- Implies: '⇒',
- Int: '∬',
- Integral: '∫',
- Intersection: '⋂',
- InvisibleComma: '⁣',
- InvisibleTimes: '⁢',
- Iogon: 'Į',
- Iopf: '𝕀',
- Iota: 'Ι',
- Iscr: 'ℐ',
- Itilde: 'Ĩ',
- Iukcy: 'І',
- Iuml: 'Ï',
- Jcirc: 'Ĵ',
- Jcy: 'Й',
- Jfr: '𝔍',
- Jopf: '𝕁',
- Jscr: '𝒥',
- Jsercy: 'Ј',
- Jukcy: 'Є',
- KHcy: 'Х',
- KJcy: 'Ќ',
- Kappa: 'Κ',
- Kcedil: 'Ķ',
- Kcy: 'К',
- Kfr: '𝔎',
- Kopf: '𝕂',
- Kscr: '𝒦',
- LJcy: 'Љ',
- LT: '<',
- Lacute: 'Ĺ',
- Lambda: 'Λ',
- Lang: '⟪',
- Laplacetrf: 'ℒ',
- Larr: '↞',
- Lcaron: 'Ľ',
- Lcedil: 'Ļ',
- Lcy: 'Л',
- LeftAngleBracket: '⟨',
- LeftArrow: '←',
- LeftArrowBar: '⇤',
- LeftArrowRightArrow: '⇆',
- LeftCeiling: '⌈',
- LeftDoubleBracket: '⟦',
- LeftDownTeeVector: '⥡',
- LeftDownVector: '⇃',
- LeftDownVectorBar: '⥙',
- LeftFloor: '⌊',
- LeftRightArrow: '↔',
- LeftRightVector: '⥎',
- LeftTee: '⊣',
- LeftTeeArrow: '↤',
- LeftTeeVector: '⥚',
- LeftTriangle: '⊲',
- LeftTriangleBar: '⧏',
- LeftTriangleEqual: '⊴',
- LeftUpDownVector: '⥑',
- LeftUpTeeVector: '⥠',
- LeftUpVector: '↿',
- LeftUpVectorBar: '⥘',
- LeftVector: '↼',
- LeftVectorBar: '⥒',
- Leftarrow: '⇐',
- Leftrightarrow: '⇔',
- LessEqualGreater: '⋚',
- LessFullEqual: '≦',
- LessGreater: '≶',
- LessLess: '⪡',
- LessSlantEqual: '⩽',
- LessTilde: '≲',
- Lfr: '𝔏',
- Ll: '⋘',
- Lleftarrow: '⇚',
- Lmidot: 'Ŀ',
- LongLeftArrow: '⟵',
- LongLeftRightArrow: '⟷',
- LongRightArrow: '⟶',
- Longleftarrow: '⟸',
- Longleftrightarrow: '⟺',
- Longrightarrow: '⟹',
- Lopf: '𝕃',
- LowerLeftArrow: '↙',
- LowerRightArrow: '↘',
- Lscr: 'ℒ',
- Lsh: '↰',
- Lstrok: 'Ł',
- Lt: '≪',
- Map: '⤅',
- Mcy: 'М',
- MediumSpace: ' ',
- Mellintrf: 'ℳ',
- Mfr: '𝔐',
- MinusPlus: '∓',
- Mopf: '𝕄',
- Mscr: 'ℳ',
- Mu: 'Μ',
- NJcy: 'Њ',
- Nacute: 'Ń',
- Ncaron: 'Ň',
- Ncedil: 'Ņ',
- Ncy: 'Н',
- NegativeMediumSpace: '​',
- NegativeThickSpace: '​',
- NegativeThinSpace: '​',
- NegativeVeryThinSpace: '​',
- NestedGreaterGreater: '≫',
- NestedLessLess: '≪',
- NewLine: '\n',
- Nfr: '𝔑',
- NoBreak: '⁠',
- NonBreakingSpace: ' ',
- Nopf: 'ℕ',
- Not: '⫬',
- NotCongruent: '≢',
- NotCupCap: '≭',
- NotDoubleVerticalBar: '∦',
- NotElement: '∉',
- NotEqual: '≠',
- NotEqualTilde: '≂̸',
- NotExists: '∄',
- NotGreater: '≯',
- NotGreaterEqual: '≱',
- NotGreaterFullEqual: '≧̸',
- NotGreaterGreater: '≫̸',
- NotGreaterLess: '≹',
- NotGreaterSlantEqual: '⩾̸',
- NotGreaterTilde: '≵',
- NotHumpDownHump: '≎̸',
- NotHumpEqual: '≏̸',
- NotLeftTriangle: '⋪',
- NotLeftTriangleBar: '⧏̸',
- NotLeftTriangleEqual: '⋬',
- NotLess: '≮',
- NotLessEqual: '≰',
- NotLessGreater: '≸',
- NotLessLess: '≪̸',
- NotLessSlantEqual: '⩽̸',
- NotLessTilde: '≴',
- NotNestedGreaterGreater: '⪢̸',
- NotNestedLessLess: '⪡̸',
- NotPrecedes: '⊀',
- NotPrecedesEqual: '⪯̸',
- NotPrecedesSlantEqual: '⋠',
- NotReverseElement: '∌',
- NotRightTriangle: '⋫',
- NotRightTriangleBar: '⧐̸',
- NotRightTriangleEqual: '⋭',
- NotSquareSubset: '⊏̸',
- NotSquareSubsetEqual: '⋢',
- NotSquareSuperset: '⊐̸',
- NotSquareSupersetEqual: '⋣',
- NotSubset: '⊂⃒',
- NotSubsetEqual: '⊈',
- NotSucceeds: '⊁',
- NotSucceedsEqual: '⪰̸',
- NotSucceedsSlantEqual: '⋡',
- NotSucceedsTilde: '≿̸',
- NotSuperset: '⊃⃒',
- NotSupersetEqual: '⊉',
- NotTilde: '≁',
- NotTildeEqual: '≄',
- NotTildeFullEqual: '≇',
- NotTildeTilde: '≉',
- NotVerticalBar: '∤',
- Nscr: '𝒩',
- Ntilde: 'Ñ',
- Nu: 'Ν',
- OElig: 'Œ',
- Oacute: 'Ó',
- Ocirc: 'Ô',
- Ocy: 'О',
- Odblac: 'Ő',
- Ofr: '𝔒',
- Ograve: 'Ò',
- Omacr: 'Ō',
- Omega: 'Ω',
- Omicron: 'Ο',
- Oopf: '𝕆',
- OpenCurlyDoubleQuote: '“',
- OpenCurlyQuote: '‘',
- Or: '⩔',
- Oscr: '𝒪',
- Oslash: 'Ø',
- Otilde: 'Õ',
- Otimes: '⨷',
- Ouml: 'Ö',
- OverBar: '‾',
- OverBrace: '⏞',
- OverBracket: '⎴',
- OverParenthesis: '⏜',
- PartialD: '∂',
- Pcy: 'П',
- Pfr: '𝔓',
- Phi: 'Φ',
- Pi: 'Π',
- PlusMinus: '±',
- Poincareplane: 'ℌ',
- Popf: 'ℙ',
- Pr: '⪻',
- Precedes: '≺',
- PrecedesEqual: '⪯',
- PrecedesSlantEqual: '≼',
- PrecedesTilde: '≾',
- Prime: '″',
- Product: '∏',
- Proportion: '∷',
- Proportional: '∝',
- Pscr: '𝒫',
- Psi: 'Ψ',
- QUOT: '"',
- Qfr: '𝔔',
- Qopf: 'ℚ',
- Qscr: '𝒬',
- RBarr: '⤐',
- REG: '®',
- Racute: 'Ŕ',
- Rang: '⟫',
- Rarr: '↠',
- Rarrtl: '⤖',
- Rcaron: 'Ř',
- Rcedil: 'Ŗ',
- Rcy: 'Р',
- Re: 'ℜ',
- ReverseElement: '∋',
- ReverseEquilibrium: '⇋',
- ReverseUpEquilibrium: '⥯',
- Rfr: 'ℜ',
- Rho: 'Ρ',
- RightAngleBracket: '⟩',
- RightArrow: '→',
- RightArrowBar: '⇥',
- RightArrowLeftArrow: '⇄',
- RightCeiling: '⌉',
- RightDoubleBracket: '⟧',
- RightDownTeeVector: '⥝',
- RightDownVector: '⇂',
- RightDownVectorBar: '⥕',
- RightFloor: '⌋',
- RightTee: '⊢',
- RightTeeArrow: '↦',
- RightTeeVector: '⥛',
- RightTriangle: '⊳',
- RightTriangleBar: '⧐',
- RightTriangleEqual: '⊵',
- RightUpDownVector: '⥏',
- RightUpTeeVector: '⥜',
- RightUpVector: '↾',
- RightUpVectorBar: '⥔',
- RightVector: '⇀',
- RightVectorBar: '⥓',
- Rightarrow: '⇒',
- Ropf: 'ℝ',
- RoundImplies: '⥰',
- Rrightarrow: '⇛',
- Rscr: 'ℛ',
- Rsh: '↱',
- RuleDelayed: '⧴',
- SHCHcy: 'Щ',
- SHcy: 'Ш',
- SOFTcy: 'Ь',
- Sacute: 'Ś',
- Sc: '⪼',
- Scaron: 'Š',
- Scedil: 'Ş',
- Scirc: 'Ŝ',
- Scy: 'С',
- Sfr: '𝔖',
- ShortDownArrow: '↓',
- ShortLeftArrow: '←',
- ShortRightArrow: '→',
- ShortUpArrow: '↑',
- Sigma: 'Σ',
- SmallCircle: '∘',
- Sopf: '𝕊',
- Sqrt: '√',
- Square: '□',
- SquareIntersection: '⊓',
- SquareSubset: '⊏',
- SquareSubsetEqual: '⊑',
- SquareSuperset: '⊐',
- SquareSupersetEqual: '⊒',
- SquareUnion: '⊔',
- Sscr: '𝒮',
- Star: '⋆',
- Sub: '⋐',
- Subset: '⋐',
- SubsetEqual: '⊆',
- Succeeds: '≻',
- SucceedsEqual: '⪰',
- SucceedsSlantEqual: '≽',
- SucceedsTilde: '≿',
- SuchThat: '∋',
- Sum: '∑',
- Sup: '⋑',
- Superset: '⊃',
- SupersetEqual: '⊇',
- Supset: '⋑',
- THORN: 'Þ',
- TRADE: '™',
- TSHcy: 'Ћ',
- TScy: 'Ц',
- Tab: '\t',
- Tau: 'Τ',
- Tcaron: 'Ť',
- Tcedil: 'Ţ',
- Tcy: 'Т',
- Tfr: '𝔗',
- Therefore: '∴',
- Theta: 'Θ',
- ThickSpace: '  ',
- ThinSpace: ' ',
- Tilde: '∼',
- TildeEqual: '≃',
- TildeFullEqual: '≅',
- TildeTilde: '≈',
- Topf: '𝕋',
- TripleDot: '⃛',
- Tscr: '𝒯',
- Tstrok: 'Ŧ',
- Uacute: 'Ú',
- Uarr: '↟',
- Uarrocir: '⥉',
- Ubrcy: 'Ў',
- Ubreve: 'Ŭ',
- Ucirc: 'Û',
- Ucy: 'У',
- Udblac: 'Ű',
- Ufr: '𝔘',
- Ugrave: 'Ù',
- Umacr: 'Ū',
- UnderBar: '_',
- UnderBrace: '⏟',
- UnderBracket: '⎵',
- UnderParenthesis: '⏝',
- Union: '⋃',
- UnionPlus: '⊎',
- Uogon: 'Ų',
- Uopf: '𝕌',
- UpArrow: '↑',
- UpArrowBar: '⤒',
- UpArrowDownArrow: '⇅',
- UpDownArrow: '↕',
- UpEquilibrium: '⥮',
- UpTee: '⊥',
- UpTeeArrow: '↥',
- Uparrow: '⇑',
- Updownarrow: '⇕',
- UpperLeftArrow: '↖',
- UpperRightArrow: '↗',
- Upsi: 'ϒ',
- Upsilon: 'Υ',
- Uring: 'Ů',
- Uscr: '𝒰',
- Utilde: 'Ũ',
- Uuml: 'Ü',
- VDash: '⊫',
- Vbar: '⫫',
- Vcy: 'В',
- Vdash: '⊩',
- Vdashl: '⫦',
- Vee: '⋁',
- Verbar: '‖',
- Vert: '‖',
- VerticalBar: '∣',
- VerticalLine: '|',
- VerticalSeparator: '❘',
- VerticalTilde: '≀',
- VeryThinSpace: ' ',
- Vfr: '𝔙',
- Vopf: '𝕍',
- Vscr: '𝒱',
- Vvdash: '⊪',
- Wcirc: 'Ŵ',
- Wedge: '⋀',
- Wfr: '𝔚',
- Wopf: '𝕎',
- Wscr: '𝒲',
- Xfr: '𝔛',
- Xi: 'Ξ',
- Xopf: '𝕏',
- Xscr: '𝒳',
- YAcy: 'Я',
- YIcy: 'Ї',
- YUcy: 'Ю',
- Yacute: 'Ý',
- Ycirc: 'Ŷ',
- Ycy: 'Ы',
- Yfr: '𝔜',
- Yopf: '𝕐',
- Yscr: '𝒴',
- Yuml: 'Ÿ',
- ZHcy: 'Ж',
- Zacute: 'Ź',
- Zcaron: 'Ž',
- Zcy: 'З',
- Zdot: 'Ż',
- ZeroWidthSpace: '​',
- Zeta: 'Ζ',
- Zfr: 'ℨ',
- Zopf: 'ℤ',
- Zscr: '𝒵',
- aacute: 'á',
- abreve: 'ă',
- ac: '∾',
- acE: '∾̳',
- acd: '∿',
- acirc: 'â',
- acute: '´',
- acy: 'а',
- aelig: 'æ',
- af: '⁡',
- afr: '𝔞',
- agrave: 'à',
- alefsym: 'ℵ',
- aleph: 'ℵ',
- alpha: 'α',
- amacr: 'ā',
- amalg: '⨿',
- amp: '&',
- and: '∧',
- andand: '⩕',
- andd: '⩜',
- andslope: '⩘',
- andv: '⩚',
- ang: '∠',
- ange: '⦤',
- angle: '∠',
- angmsd: '∡',
- angmsdaa: '⦨',
- angmsdab: '⦩',
- angmsdac: '⦪',
- angmsdad: '⦫',
- angmsdae: '⦬',
- angmsdaf: '⦭',
- angmsdag: '⦮',
- angmsdah: '⦯',
- angrt: '∟',
- angrtvb: '⊾',
- angrtvbd: '⦝',
- angsph: '∢',
- angst: 'Å',
- angzarr: '⍼',
- aogon: 'ą',
- aopf: '𝕒',
- ap: '≈',
- apE: '⩰',
- apacir: '⩯',
- ape: '≊',
- apid: '≋',
- apos: "'",
- approx: '≈',
- approxeq: '≊',
- aring: 'å',
- ascr: '𝒶',
- ast: '*',
- asymp: '≈',
- asympeq: '≍',
- atilde: 'ã',
- auml: 'ä',
- awconint: '∳',
- awint: '⨑',
- bNot: '⫭',
- backcong: '≌',
- backepsilon: '϶',
- backprime: '‵',
- backsim: '∽',
- backsimeq: '⋍',
- barvee: '⊽',
- barwed: '⌅',
- barwedge: '⌅',
- bbrk: '⎵',
- bbrktbrk: '⎶',
- bcong: '≌',
- bcy: 'б',
- bdquo: '„',
- becaus: '∵',
- because: '∵',
- bemptyv: '⦰',
- bepsi: '϶',
- bernou: 'ℬ',
- beta: 'β',
- beth: 'ℶ',
- between: '≬',
- bfr: '𝔟',
- bigcap: '⋂',
- bigcirc: '◯',
- bigcup: '⋃',
- bigodot: '⨀',
- bigoplus: '⨁',
- bigotimes: '⨂',
- bigsqcup: '⨆',
- bigstar: '★',
- bigtriangledown: '▽',
- bigtriangleup: '△',
- biguplus: '⨄',
- bigvee: '⋁',
- bigwedge: '⋀',
- bkarow: '⤍',
- blacklozenge: '⧫',
- blacksquare: '▪',
- blacktriangle: '▴',
- blacktriangledown: '▾',
- blacktriangleleft: '◂',
- blacktriangleright: '▸',
- blank: '␣',
- blk12: '▒',
- blk14: '░',
- blk34: '▓',
- block: '█',
- bne: '=⃥',
- bnequiv: '≡⃥',
- bnot: '⌐',
- bopf: '𝕓',
- bot: '⊥',
- bottom: '⊥',
- bowtie: '⋈',
- boxDL: '╗',
- boxDR: '╔',
- boxDl: '╖',
- boxDr: '╓',
- boxH: '═',
- boxHD: '╦',
- boxHU: '╩',
- boxHd: '╤',
- boxHu: '╧',
- boxUL: '╝',
- boxUR: '╚',
- boxUl: '╜',
- boxUr: '╙',
- boxV: '║',
- boxVH: '╬',
- boxVL: '╣',
- boxVR: '╠',
- boxVh: '╫',
- boxVl: '╢',
- boxVr: '╟',
- boxbox: '⧉',
- boxdL: '╕',
- boxdR: '╒',
- boxdl: '┐',
- boxdr: '┌',
- boxh: '─',
- boxhD: '╥',
- boxhU: '╨',
- boxhd: '┬',
- boxhu: '┴',
- boxminus: '⊟',
- boxplus: '⊞',
- boxtimes: '⊠',
- boxuL: '╛',
- boxuR: '╘',
- boxul: '┘',
- boxur: '└',
- boxv: '│',
- boxvH: '╪',
- boxvL: '╡',
- boxvR: '╞',
- boxvh: '┼',
- boxvl: '┤',
- boxvr: '├',
- bprime: '‵',
- breve: '˘',
- brvbar: '¦',
- bscr: '𝒷',
- bsemi: '⁏',
- bsim: '∽',
- bsime: '⋍',
- bsol: '\\',
- bsolb: '⧅',
- bsolhsub: '⟈',
- bull: '•',
- bullet: '•',
- bump: '≎',
- bumpE: '⪮',
- bumpe: '≏',
- bumpeq: '≏',
- cacute: 'ć',
- cap: '∩',
- capand: '⩄',
- capbrcup: '⩉',
- capcap: '⩋',
- capcup: '⩇',
- capdot: '⩀',
- caps: '∩︀',
- caret: '⁁',
- caron: 'ˇ',
- ccaps: '⩍',
- ccaron: 'č',
- ccedil: 'ç',
- ccirc: 'ĉ',
- ccups: '⩌',
- ccupssm: '⩐',
- cdot: 'ċ',
- cedil: '¸',
- cemptyv: '⦲',
- cent: '¢',
- centerdot: '·',
- cfr: '𝔠',
- chcy: 'ч',
- check: '✓',
- checkmark: '✓',
- chi: 'χ',
- cir: '○',
- cirE: '⧃',
- circ: 'ˆ',
- circeq: '≗',
- circlearrowleft: '↺',
- circlearrowright: '↻',
- circledR: '®',
- circledS: 'Ⓢ',
- circledast: '⊛',
- circledcirc: '⊚',
- circleddash: '⊝',
- cire: '≗',
- cirfnint: '⨐',
- cirmid: '⫯',
- cirscir: '⧂',
- clubs: '♣',
- clubsuit: '♣',
- colon: ':',
- colone: '≔',
- coloneq: '≔',
- comma: ',',
- commat: '@',
- comp: '∁',
- compfn: '∘',
- complement: '∁',
- complexes: 'ℂ',
- cong: '≅',
- congdot: '⩭',
- conint: '∮',
- copf: '𝕔',
- coprod: '∐',
- copy: '©',
- copysr: '℗',
- crarr: '↵',
- cross: '✗',
- cscr: '𝒸',
- csub: '⫏',
- csube: '⫑',
- csup: '⫐',
- csupe: '⫒',
- ctdot: '⋯',
- cudarrl: '⤸',
- cudarrr: '⤵',
- cuepr: '⋞',
- cuesc: '⋟',
- cularr: '↶',
- cularrp: '⤽',
- cup: '∪',
- cupbrcap: '⩈',
- cupcap: '⩆',
- cupcup: '⩊',
- cupdot: '⊍',
- cupor: '⩅',
- cups: '∪︀',
- curarr: '↷',
- curarrm: '⤼',
- curlyeqprec: '⋞',
- curlyeqsucc: '⋟',
- curlyvee: '⋎',
- curlywedge: '⋏',
- curren: '¤',
- curvearrowleft: '↶',
- curvearrowright: '↷',
- cuvee: '⋎',
- cuwed: '⋏',
- cwconint: '∲',
- cwint: '∱',
- cylcty: '⌭',
- dArr: '⇓',
- dHar: '⥥',
- dagger: '†',
- daleth: 'ℸ',
- darr: '↓',
- dash: '‐',
- dashv: '⊣',
- dbkarow: '⤏',
- dblac: '˝',
- dcaron: 'ď',
- dcy: 'д',
- dd: 'ⅆ',
- ddagger: '‡',
- ddarr: '⇊',
- ddotseq: '⩷',
- deg: '°',
- delta: 'δ',
- demptyv: '⦱',
- dfisht: '⥿',
- dfr: '𝔡',
- dharl: '⇃',
- dharr: '⇂',
- diam: '⋄',
- diamond: '⋄',
- diamondsuit: '♦',
- diams: '♦',
- die: '¨',
- digamma: 'ϝ',
- disin: '⋲',
- div: '÷',
- divide: '÷',
- divideontimes: '⋇',
- divonx: '⋇',
- djcy: 'ђ',
- dlcorn: '⌞',
- dlcrop: '⌍',
- dollar: '$',
- dopf: '𝕕',
- dot: '˙',
- doteq: '≐',
- doteqdot: '≑',
- dotminus: '∸',
- dotplus: '∔',
- dotsquare: '⊡',
- doublebarwedge: '⌆',
- downarrow: '↓',
- downdownarrows: '⇊',
- downharpoonleft: '⇃',
- downharpoonright: '⇂',
- drbkarow: '⤐',
- drcorn: '⌟',
- drcrop: '⌌',
- dscr: '𝒹',
- dscy: 'ѕ',
- dsol: '⧶',
- dstrok: 'đ',
- dtdot: '⋱',
- dtri: '▿',
- dtrif: '▾',
- duarr: '⇵',
- duhar: '⥯',
- dwangle: '⦦',
- dzcy: 'џ',
- dzigrarr: '⟿',
- eDDot: '⩷',
- eDot: '≑',
- eacute: 'é',
- easter: '⩮',
- ecaron: 'ě',
- ecir: '≖',
- ecirc: 'ê',
- ecolon: '≕',
- ecy: 'э',
- edot: 'ė',
- ee: 'ⅇ',
- efDot: '≒',
- efr: '𝔢',
- eg: '⪚',
- egrave: 'è',
- egs: '⪖',
- egsdot: '⪘',
- el: '⪙',
- elinters: '⏧',
- ell: 'ℓ',
- els: '⪕',
- elsdot: '⪗',
- emacr: 'ē',
- empty: '∅',
- emptyset: '∅',
- emptyv: '∅',
- emsp13: ' ',
- emsp14: ' ',
- emsp: ' ',
- eng: 'ŋ',
- ensp: ' ',
- eogon: 'ę',
- eopf: '𝕖',
- epar: '⋕',
- eparsl: '⧣',
- eplus: '⩱',
- epsi: 'ε',
- epsilon: 'ε',
- epsiv: 'ϵ',
- eqcirc: '≖',
- eqcolon: '≕',
- eqsim: '≂',
- eqslantgtr: '⪖',
- eqslantless: '⪕',
- equals: '=',
- equest: '≟',
- equiv: '≡',
- equivDD: '⩸',
- eqvparsl: '⧥',
- erDot: '≓',
- erarr: '⥱',
- escr: 'ℯ',
- esdot: '≐',
- esim: '≂',
- eta: 'η',
- eth: 'ð',
- euml: 'ë',
- euro: '€',
- excl: '!',
- exist: '∃',
- expectation: 'ℰ',
- exponentiale: 'ⅇ',
- fallingdotseq: '≒',
- fcy: 'ф',
- female: '♀',
- ffilig: 'ffi',
- fflig: 'ff',
- ffllig: 'ffl',
- ffr: '𝔣',
- filig: 'fi',
- fjlig: 'fj',
- flat: '♭',
- fllig: 'fl',
- fltns: '▱',
- fnof: 'ƒ',
- fopf: '𝕗',
- forall: '∀',
- fork: '⋔',
- forkv: '⫙',
- fpartint: '⨍',
- frac12: '½',
- frac13: '⅓',
- frac14: '¼',
- frac15: '⅕',
- frac16: '⅙',
- frac18: '⅛',
- frac23: '⅔',
- frac25: '⅖',
- frac34: '¾',
- frac35: '⅗',
- frac38: '⅜',
- frac45: '⅘',
- frac56: '⅚',
- frac58: '⅝',
- frac78: '⅞',
- frasl: '⁄',
- frown: '⌢',
- fscr: '𝒻',
- gE: '≧',
- gEl: '⪌',
- gacute: 'ǵ',
- gamma: 'γ',
- gammad: 'ϝ',
- gap: '⪆',
- gbreve: 'ğ',
- gcirc: 'ĝ',
- gcy: 'г',
- gdot: 'ġ',
- ge: '≥',
- gel: '⋛',
- geq: '≥',
- geqq: '≧',
- geqslant: '⩾',
- ges: '⩾',
- gescc: '⪩',
- gesdot: '⪀',
- gesdoto: '⪂',
- gesdotol: '⪄',
- gesl: '⋛︀',
- gesles: '⪔',
- gfr: '𝔤',
- gg: '≫',
- ggg: '⋙',
- gimel: 'ℷ',
- gjcy: 'ѓ',
- gl: '≷',
- glE: '⪒',
- gla: '⪥',
- glj: '⪤',
- gnE: '≩',
- gnap: '⪊',
- gnapprox: '⪊',
- gne: '⪈',
- gneq: '⪈',
- gneqq: '≩',
- gnsim: '⋧',
- gopf: '𝕘',
- grave: '`',
- gscr: 'ℊ',
- gsim: '≳',
- gsime: '⪎',
- gsiml: '⪐',
- gt: '>',
- gtcc: '⪧',
- gtcir: '⩺',
- gtdot: '⋗',
- gtlPar: '⦕',
- gtquest: '⩼',
- gtrapprox: '⪆',
- gtrarr: '⥸',
- gtrdot: '⋗',
- gtreqless: '⋛',
- gtreqqless: '⪌',
- gtrless: '≷',
- gtrsim: '≳',
- gvertneqq: '≩︀',
- gvnE: '≩︀',
- hArr: '⇔',
- hairsp: ' ',
- half: '½',
- hamilt: 'ℋ',
- hardcy: 'ъ',
- harr: '↔',
- harrcir: '⥈',
- harrw: '↭',
- hbar: 'ℏ',
- hcirc: 'ĥ',
- hearts: '♥',
- heartsuit: '♥',
- hellip: '…',
- hercon: '⊹',
- hfr: '𝔥',
- hksearow: '⤥',
- hkswarow: '⤦',
- hoarr: '⇿',
- homtht: '∻',
- hookleftarrow: '↩',
- hookrightarrow: '↪',
- hopf: '𝕙',
- horbar: '―',
- hscr: '𝒽',
- hslash: 'ℏ',
- hstrok: 'ħ',
- hybull: '⁃',
- hyphen: '‐',
- iacute: 'í',
- ic: '⁣',
- icirc: 'î',
- icy: 'и',
- iecy: 'е',
- iexcl: '¡',
- iff: '⇔',
- ifr: '𝔦',
- igrave: 'ì',
- ii: 'ⅈ',
- iiiint: '⨌',
- iiint: '∭',
- iinfin: '⧜',
- iiota: '℩',
- ijlig: 'ij',
- imacr: 'ī',
- image: 'ℑ',
- imagline: 'ℐ',
- imagpart: 'ℑ',
- imath: 'ı',
- imof: '⊷',
- imped: 'Ƶ',
- in: '∈',
- incare: '℅',
- infin: '∞',
- infintie: '⧝',
- inodot: 'ı',
- int: '∫',
- intcal: '⊺',
- integers: 'ℤ',
- intercal: '⊺',
- intlarhk: '⨗',
- intprod: '⨼',
- iocy: 'ё',
- iogon: 'į',
- iopf: '𝕚',
- iota: 'ι',
- iprod: '⨼',
- iquest: '¿',
- iscr: '𝒾',
- isin: '∈',
- isinE: '⋹',
- isindot: '⋵',
- isins: '⋴',
- isinsv: '⋳',
- isinv: '∈',
- it: '⁢',
- itilde: 'ĩ',
- iukcy: 'і',
- iuml: 'ï',
- jcirc: 'ĵ',
- jcy: 'й',
- jfr: '𝔧',
- jmath: 'ȷ',
- jopf: '𝕛',
- jscr: '𝒿',
- jsercy: 'ј',
- jukcy: 'є',
- kappa: 'κ',
- kappav: 'ϰ',
- kcedil: 'ķ',
- kcy: 'к',
- kfr: '𝔨',
- kgreen: 'ĸ',
- khcy: 'х',
- kjcy: 'ќ',
- kopf: '𝕜',
- kscr: '𝓀',
- lAarr: '⇚',
- lArr: '⇐',
- lAtail: '⤛',
- lBarr: '⤎',
- lE: '≦',
- lEg: '⪋',
- lHar: '⥢',
- lacute: 'ĺ',
- laemptyv: '⦴',
- lagran: 'ℒ',
- lambda: 'λ',
- lang: '⟨',
- langd: '⦑',
- langle: '⟨',
- lap: '⪅',
- laquo: '«',
- larr: '←',
- larrb: '⇤',
- larrbfs: '⤟',
- larrfs: '⤝',
- larrhk: '↩',
- larrlp: '↫',
- larrpl: '⤹',
- larrsim: '⥳',
- larrtl: '↢',
- lat: '⪫',
- latail: '⤙',
- late: '⪭',
- lates: '⪭︀',
- lbarr: '⤌',
- lbbrk: '❲',
- lbrace: '{',
- lbrack: '[',
- lbrke: '⦋',
- lbrksld: '⦏',
- lbrkslu: '⦍',
- lcaron: 'ľ',
- lcedil: 'ļ',
- lceil: '⌈',
- lcub: '{',
- lcy: 'л',
- ldca: '⤶',
- ldquo: '“',
- ldquor: '„',
- ldrdhar: '⥧',
- ldrushar: '⥋',
- ldsh: '↲',
- le: '≤',
- leftarrow: '←',
- leftarrowtail: '↢',
- leftharpoondown: '↽',
- leftharpoonup: '↼',
- leftleftarrows: '⇇',
- leftrightarrow: '↔',
- leftrightarrows: '⇆',
- leftrightharpoons: '⇋',
- leftrightsquigarrow: '↭',
- leftthreetimes: '⋋',
- leg: '⋚',
- leq: '≤',
- leqq: '≦',
- leqslant: '⩽',
- les: '⩽',
- lescc: '⪨',
- lesdot: '⩿',
- lesdoto: '⪁',
- lesdotor: '⪃',
- lesg: '⋚︀',
- lesges: '⪓',
- lessapprox: '⪅',
- lessdot: '⋖',
- lesseqgtr: '⋚',
- lesseqqgtr: '⪋',
- lessgtr: '≶',
- lesssim: '≲',
- lfisht: '⥼',
- lfloor: '⌊',
- lfr: '𝔩',
- lg: '≶',
- lgE: '⪑',
- lhard: '↽',
- lharu: '↼',
- lharul: '⥪',
- lhblk: '▄',
- ljcy: 'љ',
- ll: '≪',
- llarr: '⇇',
- llcorner: '⌞',
- llhard: '⥫',
- lltri: '◺',
- lmidot: 'ŀ',
- lmoust: '⎰',
- lmoustache: '⎰',
- lnE: '≨',
- lnap: '⪉',
- lnapprox: '⪉',
- lne: '⪇',
- lneq: '⪇',
- lneqq: '≨',
- lnsim: '⋦',
- loang: '⟬',
- loarr: '⇽',
- lobrk: '⟦',
- longleftarrow: '⟵',
- longleftrightarrow: '⟷',
- longmapsto: '⟼',
- longrightarrow: '⟶',
- looparrowleft: '↫',
- looparrowright: '↬',
- lopar: '⦅',
- lopf: '𝕝',
- loplus: '⨭',
- lotimes: '⨴',
- lowast: '∗',
- lowbar: '_',
- loz: '◊',
- lozenge: '◊',
- lozf: '⧫',
- lpar: '(',
- lparlt: '⦓',
- lrarr: '⇆',
- lrcorner: '⌟',
- lrhar: '⇋',
- lrhard: '⥭',
- lrm: '‎',
- lrtri: '⊿',
- lsaquo: '‹',
- lscr: '𝓁',
- lsh: '↰',
- lsim: '≲',
- lsime: '⪍',
- lsimg: '⪏',
- lsqb: '[',
- lsquo: '‘',
- lsquor: '‚',
- lstrok: 'ł',
- lt: '<',
- ltcc: '⪦',
- ltcir: '⩹',
- ltdot: '⋖',
- lthree: '⋋',
- ltimes: '⋉',
- ltlarr: '⥶',
- ltquest: '⩻',
- ltrPar: '⦖',
- ltri: '◃',
- ltrie: '⊴',
- ltrif: '◂',
- lurdshar: '⥊',
- luruhar: '⥦',
- lvertneqq: '≨︀',
- lvnE: '≨︀',
- mDDot: '∺',
- macr: '¯',
- male: '♂',
- malt: '✠',
- maltese: '✠',
- map: '↦',
- mapsto: '↦',
- mapstodown: '↧',
- mapstoleft: '↤',
- mapstoup: '↥',
- marker: '▮',
- mcomma: '⨩',
- mcy: 'м',
- mdash: '—',
- measuredangle: '∡',
- mfr: '𝔪',
- mho: '℧',
- micro: 'µ',
- mid: '∣',
- midast: '*',
- midcir: '⫰',
- middot: '·',
- minus: '−',
- minusb: '⊟',
- minusd: '∸',
- minusdu: '⨪',
- mlcp: '⫛',
- mldr: '…',
- mnplus: '∓',
- models: '⊧',
- mopf: '𝕞',
- mp: '∓',
- mscr: '𝓂',
- mstpos: '∾',
- mu: 'μ',
- multimap: '⊸',
- mumap: '⊸',
- nGg: '⋙̸',
- nGt: '≫⃒',
- nGtv: '≫̸',
- nLeftarrow: '⇍',
- nLeftrightarrow: '⇎',
- nLl: '⋘̸',
- nLt: '≪⃒',
- nLtv: '≪̸',
- nRightarrow: '⇏',
- nVDash: '⊯',
- nVdash: '⊮',
- nabla: '∇',
- nacute: 'ń',
- nang: '∠⃒',
- nap: '≉',
- napE: '⩰̸',
- napid: '≋̸',
- napos: 'ʼn',
- napprox: '≉',
- natur: '♮',
- natural: '♮',
- naturals: 'ℕ',
- nbsp: ' ',
- nbump: '≎̸',
- nbumpe: '≏̸',
- ncap: '⩃',
- ncaron: 'ň',
- ncedil: 'ņ',
- ncong: '≇',
- ncongdot: '⩭̸',
- ncup: '⩂',
- ncy: 'н',
- ndash: '–',
- ne: '≠',
- neArr: '⇗',
- nearhk: '⤤',
- nearr: '↗',
- nearrow: '↗',
- nedot: '≐̸',
- nequiv: '≢',
- nesear: '⤨',
- nesim: '≂̸',
- nexist: '∄',
- nexists: '∄',
- nfr: '𝔫',
- ngE: '≧̸',
- nge: '≱',
- ngeq: '≱',
- ngeqq: '≧̸',
- ngeqslant: '⩾̸',
- nges: '⩾̸',
- ngsim: '≵',
- ngt: '≯',
- ngtr: '≯',
- nhArr: '⇎',
- nharr: '↮',
- nhpar: '⫲',
- ni: '∋',
- nis: '⋼',
- nisd: '⋺',
- niv: '∋',
- njcy: 'њ',
- nlArr: '⇍',
- nlE: '≦̸',
- nlarr: '↚',
- nldr: '‥',
- nle: '≰',
- nleftarrow: '↚',
- nleftrightarrow: '↮',
- nleq: '≰',
- nleqq: '≦̸',
- nleqslant: '⩽̸',
- nles: '⩽̸',
- nless: '≮',
- nlsim: '≴',
- nlt: '≮',
- nltri: '⋪',
- nltrie: '⋬',
- nmid: '∤',
- nopf: '𝕟',
- not: '¬',
- notin: '∉',
- notinE: '⋹̸',
- notindot: '⋵̸',
- notinva: '∉',
- notinvb: '⋷',
- notinvc: '⋶',
- notni: '∌',
- notniva: '∌',
- notnivb: '⋾',
- notnivc: '⋽',
- npar: '∦',
- nparallel: '∦',
- nparsl: '⫽⃥',
- npart: '∂̸',
- npolint: '⨔',
- npr: '⊀',
- nprcue: '⋠',
- npre: '⪯̸',
- nprec: '⊀',
- npreceq: '⪯̸',
- nrArr: '⇏',
- nrarr: '↛',
- nrarrc: '⤳̸',
- nrarrw: '↝̸',
- nrightarrow: '↛',
- nrtri: '⋫',
- nrtrie: '⋭',
- nsc: '⊁',
- nsccue: '⋡',
- nsce: '⪰̸',
- nscr: '𝓃',
- nshortmid: '∤',
- nshortparallel: '∦',
- nsim: '≁',
- nsime: '≄',
- nsimeq: '≄',
- nsmid: '∤',
- nspar: '∦',
- nsqsube: '⋢',
- nsqsupe: '⋣',
- nsub: '⊄',
- nsubE: '⫅̸',
- nsube: '⊈',
- nsubset: '⊂⃒',
- nsubseteq: '⊈',
- nsubseteqq: '⫅̸',
- nsucc: '⊁',
- nsucceq: '⪰̸',
- nsup: '⊅',
- nsupE: '⫆̸',
- nsupe: '⊉',
- nsupset: '⊃⃒',
- nsupseteq: '⊉',
- nsupseteqq: '⫆̸',
- ntgl: '≹',
- ntilde: 'ñ',
- ntlg: '≸',
- ntriangleleft: '⋪',
- ntrianglelefteq: '⋬',
- ntriangleright: '⋫',
- ntrianglerighteq: '⋭',
- nu: 'ν',
- num: '#',
- numero: '№',
- numsp: ' ',
- nvDash: '⊭',
- nvHarr: '⤄',
- nvap: '≍⃒',
- nvdash: '⊬',
- nvge: '≥⃒',
- nvgt: '>⃒',
- nvinfin: '⧞',
- nvlArr: '⤂',
- nvle: '≤⃒',
- nvlt: '<⃒',
- nvltrie: '⊴⃒',
- nvrArr: '⤃',
- nvrtrie: '⊵⃒',
- nvsim: '∼⃒',
- nwArr: '⇖',
- nwarhk: '⤣',
- nwarr: '↖',
- nwarrow: '↖',
- nwnear: '⤧',
- oS: 'Ⓢ',
- oacute: 'ó',
- oast: '⊛',
- ocir: '⊚',
- ocirc: 'ô',
- ocy: 'о',
- odash: '⊝',
- odblac: 'ő',
- odiv: '⨸',
- odot: '⊙',
- odsold: '⦼',
- oelig: 'œ',
- ofcir: '⦿',
- ofr: '𝔬',
- ogon: '˛',
- ograve: 'ò',
- ogt: '⧁',
- ohbar: '⦵',
- ohm: 'Ω',
- oint: '∮',
- olarr: '↺',
- olcir: '⦾',
- olcross: '⦻',
- oline: '‾',
- olt: '⧀',
- omacr: 'ō',
- omega: 'ω',
- omicron: 'ο',
- omid: '⦶',
- ominus: '⊖',
- oopf: '𝕠',
- opar: '⦷',
- operp: '⦹',
- oplus: '⊕',
- or: '∨',
- orarr: '↻',
- ord: '⩝',
- order: 'ℴ',
- orderof: 'ℴ',
- ordf: 'ª',
- ordm: 'º',
- origof: '⊶',
- oror: '⩖',
- orslope: '⩗',
- orv: '⩛',
- oscr: 'ℴ',
- oslash: 'ø',
- osol: '⊘',
- otilde: 'õ',
- otimes: '⊗',
- otimesas: '⨶',
- ouml: 'ö',
- ovbar: '⌽',
- par: '∥',
- para: '¶',
- parallel: '∥',
- parsim: '⫳',
- parsl: '⫽',
- part: '∂',
- pcy: 'п',
- percnt: '%',
- period: '.',
- permil: '‰',
- perp: '⊥',
- pertenk: '‱',
- pfr: '𝔭',
- phi: 'φ',
- phiv: 'ϕ',
- phmmat: 'ℳ',
- phone: '☎',
- pi: 'π',
- pitchfork: '⋔',
- piv: 'ϖ',
- planck: 'ℏ',
- planckh: 'ℎ',
- plankv: 'ℏ',
- plus: '+',
- plusacir: '⨣',
- plusb: '⊞',
- pluscir: '⨢',
- plusdo: '∔',
- plusdu: '⨥',
- pluse: '⩲',
- plusmn: '±',
- plussim: '⨦',
- plustwo: '⨧',
- pm: '±',
- pointint: '⨕',
- popf: '𝕡',
- pound: '£',
- pr: '≺',
- prE: '⪳',
- prap: '⪷',
- prcue: '≼',
- pre: '⪯',
- prec: '≺',
- precapprox: '⪷',
- preccurlyeq: '≼',
- preceq: '⪯',
- precnapprox: '⪹',
- precneqq: '⪵',
- precnsim: '⋨',
- precsim: '≾',
- prime: '′',
- primes: 'ℙ',
- prnE: '⪵',
- prnap: '⪹',
- prnsim: '⋨',
- prod: '∏',
- profalar: '⌮',
- profline: '⌒',
- profsurf: '⌓',
- prop: '∝',
- propto: '∝',
- prsim: '≾',
- prurel: '⊰',
- pscr: '𝓅',
- psi: 'ψ',
- puncsp: ' ',
- qfr: '𝔮',
- qint: '⨌',
- qopf: '𝕢',
- qprime: '⁗',
- qscr: '𝓆',
- quaternions: 'ℍ',
- quatint: '⨖',
- quest: '?',
- questeq: '≟',
- quot: '"',
- rAarr: '⇛',
- rArr: '⇒',
- rAtail: '⤜',
- rBarr: '⤏',
- rHar: '⥤',
- race: '∽̱',
- racute: 'ŕ',
- radic: '√',
- raemptyv: '⦳',
- rang: '⟩',
- rangd: '⦒',
- range: '⦥',
- rangle: '⟩',
- raquo: '»',
- rarr: '→',
- rarrap: '⥵',
- rarrb: '⇥',
- rarrbfs: '⤠',
- rarrc: '⤳',
- rarrfs: '⤞',
- rarrhk: '↪',
- rarrlp: '↬',
- rarrpl: '⥅',
- rarrsim: '⥴',
- rarrtl: '↣',
- rarrw: '↝',
- ratail: '⤚',
- ratio: '∶',
- rationals: 'ℚ',
- rbarr: '⤍',
- rbbrk: '❳',
- rbrace: '}',
- rbrack: ']',
- rbrke: '⦌',
- rbrksld: '⦎',
- rbrkslu: '⦐',
- rcaron: 'ř',
- rcedil: 'ŗ',
- rceil: '⌉',
- rcub: '}',
- rcy: 'р',
- rdca: '⤷',
- rdldhar: '⥩',
- rdquo: '”',
- rdquor: '”',
- rdsh: '↳',
- real: 'ℜ',
- realine: 'ℛ',
- realpart: 'ℜ',
- reals: 'ℝ',
- rect: '▭',
- reg: '®',
- rfisht: '⥽',
- rfloor: '⌋',
- rfr: '𝔯',
- rhard: '⇁',
- rharu: '⇀',
- rharul: '⥬',
- rho: 'ρ',
- rhov: 'ϱ',
- rightarrow: '→',
- rightarrowtail: '↣',
- rightharpoondown: '⇁',
- rightharpoonup: '⇀',
- rightleftarrows: '⇄',
- rightleftharpoons: '⇌',
- rightrightarrows: '⇉',
- rightsquigarrow: '↝',
- rightthreetimes: '⋌',
- ring: '˚',
- risingdotseq: '≓',
- rlarr: '⇄',
- rlhar: '⇌',
- rlm: '‏',
- rmoust: '⎱',
- rmoustache: '⎱',
- rnmid: '⫮',
- roang: '⟭',
- roarr: '⇾',
- robrk: '⟧',
- ropar: '⦆',
- ropf: '𝕣',
- roplus: '⨮',
- rotimes: '⨵',
- rpar: ')',
- rpargt: '⦔',
- rppolint: '⨒',
- rrarr: '⇉',
- rsaquo: '›',
- rscr: '𝓇',
- rsh: '↱',
- rsqb: ']',
- rsquo: '’',
- rsquor: '’',
- rthree: '⋌',
- rtimes: '⋊',
- rtri: '▹',
- rtrie: '⊵',
- rtrif: '▸',
- rtriltri: '⧎',
- ruluhar: '⥨',
- rx: '℞',
- sacute: 'ś',
- sbquo: '‚',
- sc: '≻',
- scE: '⪴',
- scap: '⪸',
- scaron: 'š',
- sccue: '≽',
- sce: '⪰',
- scedil: 'ş',
- scirc: 'ŝ',
- scnE: '⪶',
- scnap: '⪺',
- scnsim: '⋩',
- scpolint: '⨓',
- scsim: '≿',
- scy: 'с',
- sdot: '⋅',
- sdotb: '⊡',
- sdote: '⩦',
- seArr: '⇘',
- searhk: '⤥',
- searr: '↘',
- searrow: '↘',
- sect: '§',
- semi: ';',
- seswar: '⤩',
- setminus: '∖',
- setmn: '∖',
- sext: '✶',
- sfr: '𝔰',
- sfrown: '⌢',
- sharp: '♯',
- shchcy: 'щ',
- shcy: 'ш',
- shortmid: '∣',
- shortparallel: '∥',
- shy: '­',
- sigma: 'σ',
- sigmaf: 'ς',
- sigmav: 'ς',
- sim: '∼',
- simdot: '⩪',
- sime: '≃',
- simeq: '≃',
- simg: '⪞',
- simgE: '⪠',
- siml: '⪝',
- simlE: '⪟',
- simne: '≆',
- simplus: '⨤',
- simrarr: '⥲',
- slarr: '←',
- smallsetminus: '∖',
- smashp: '⨳',
- smeparsl: '⧤',
- smid: '∣',
- smile: '⌣',
- smt: '⪪',
- smte: '⪬',
- smtes: '⪬︀',
- softcy: 'ь',
- sol: '/',
- solb: '⧄',
- solbar: '⌿',
- sopf: '𝕤',
- spades: '♠',
- spadesuit: '♠',
- spar: '∥',
- sqcap: '⊓',
- sqcaps: '⊓︀',
- sqcup: '⊔',
- sqcups: '⊔︀',
- sqsub: '⊏',
- sqsube: '⊑',
- sqsubset: '⊏',
- sqsubseteq: '⊑',
- sqsup: '⊐',
- sqsupe: '⊒',
- sqsupset: '⊐',
- sqsupseteq: '⊒',
- squ: '□',
- square: '□',
- squarf: '▪',
- squf: '▪',
- srarr: '→',
- sscr: '𝓈',
- ssetmn: '∖',
- ssmile: '⌣',
- sstarf: '⋆',
- star: '☆',
- starf: '★',
- straightepsilon: 'ϵ',
- straightphi: 'ϕ',
- strns: '¯',
- sub: '⊂',
- subE: '⫅',
- subdot: '⪽',
- sube: '⊆',
- subedot: '⫃',
- submult: '⫁',
- subnE: '⫋',
- subne: '⊊',
- subplus: '⪿',
- subrarr: '⥹',
- subset: '⊂',
- subseteq: '⊆',
- subseteqq: '⫅',
- subsetneq: '⊊',
- subsetneqq: '⫋',
- subsim: '⫇',
- subsub: '⫕',
- subsup: '⫓',
- succ: '≻',
- succapprox: '⪸',
- succcurlyeq: '≽',
- succeq: '⪰',
- succnapprox: '⪺',
- succneqq: '⪶',
- succnsim: '⋩',
- succsim: '≿',
- sum: '∑',
- sung: '♪',
- sup1: '¹',
- sup2: '²',
- sup3: '³',
- sup: '⊃',
- supE: '⫆',
- supdot: '⪾',
- supdsub: '⫘',
- supe: '⊇',
- supedot: '⫄',
- suphsol: '⟉',
- suphsub: '⫗',
- suplarr: '⥻',
- supmult: '⫂',
- supnE: '⫌',
- supne: '⊋',
- supplus: '⫀',
- supset: '⊃',
- supseteq: '⊇',
- supseteqq: '⫆',
- supsetneq: '⊋',
- supsetneqq: '⫌',
- supsim: '⫈',
- supsub: '⫔',
- supsup: '⫖',
- swArr: '⇙',
- swarhk: '⤦',
- swarr: '↙',
- swarrow: '↙',
- swnwar: '⤪',
- szlig: 'ß',
- target: '⌖',
- tau: 'τ',
- tbrk: '⎴',
- tcaron: 'ť',
- tcedil: 'ţ',
- tcy: 'т',
- tdot: '⃛',
- telrec: '⌕',
- tfr: '𝔱',
- there4: '∴',
- therefore: '∴',
- theta: 'θ',
- thetasym: 'ϑ',
- thetav: 'ϑ',
- thickapprox: '≈',
- thicksim: '∼',
- thinsp: ' ',
- thkap: '≈',
- thksim: '∼',
- thorn: 'þ',
- tilde: '˜',
- times: '×',
- timesb: '⊠',
- timesbar: '⨱',
- timesd: '⨰',
- tint: '∭',
- toea: '⤨',
- top: '⊤',
- topbot: '⌶',
- topcir: '⫱',
- topf: '𝕥',
- topfork: '⫚',
- tosa: '⤩',
- tprime: '‴',
- trade: '™',
- triangle: '▵',
- triangledown: '▿',
- triangleleft: '◃',
- trianglelefteq: '⊴',
- triangleq: '≜',
- triangleright: '▹',
- trianglerighteq: '⊵',
- tridot: '◬',
- trie: '≜',
- triminus: '⨺',
- triplus: '⨹',
- trisb: '⧍',
- tritime: '⨻',
- trpezium: '⏢',
- tscr: '𝓉',
- tscy: 'ц',
- tshcy: 'ћ',
- tstrok: 'ŧ',
- twixt: '≬',
- twoheadleftarrow: '↞',
- twoheadrightarrow: '↠',
- uArr: '⇑',
- uHar: '⥣',
- uacute: 'ú',
- uarr: '↑',
- ubrcy: 'ў',
- ubreve: 'ŭ',
- ucirc: 'û',
- ucy: 'у',
- udarr: '⇅',
- udblac: 'ű',
- udhar: '⥮',
- ufisht: '⥾',
- ufr: '𝔲',
- ugrave: 'ù',
- uharl: '↿',
- uharr: '↾',
- uhblk: '▀',
- ulcorn: '⌜',
- ulcorner: '⌜',
- ulcrop: '⌏',
- ultri: '◸',
- umacr: 'ū',
- uml: '¨',
- uogon: 'ų',
- uopf: '𝕦',
- uparrow: '↑',
- updownarrow: '↕',
- upharpoonleft: '↿',
- upharpoonright: '↾',
- uplus: '⊎',
- upsi: 'υ',
- upsih: 'ϒ',
- upsilon: 'υ',
- upuparrows: '⇈',
- urcorn: '⌝',
- urcorner: '⌝',
- urcrop: '⌎',
- uring: 'ů',
- urtri: '◹',
- uscr: '𝓊',
- utdot: '⋰',
- utilde: 'ũ',
- utri: '▵',
- utrif: '▴',
- uuarr: '⇈',
- uuml: 'ü',
- uwangle: '⦧',
- vArr: '⇕',
- vBar: '⫨',
- vBarv: '⫩',
- vDash: '⊨',
- vangrt: '⦜',
- varepsilon: 'ϵ',
- varkappa: 'ϰ',
- varnothing: '∅',
- varphi: 'ϕ',
- varpi: 'ϖ',
- varpropto: '∝',
- varr: '↕',
- varrho: 'ϱ',
- varsigma: 'ς',
- varsubsetneq: '⊊︀',
- varsubsetneqq: '⫋︀',
- varsupsetneq: '⊋︀',
- varsupsetneqq: '⫌︀',
- vartheta: 'ϑ',
- vartriangleleft: '⊲',
- vartriangleright: '⊳',
- vcy: 'в',
- vdash: '⊢',
- vee: '∨',
- veebar: '⊻',
- veeeq: '≚',
- vellip: '⋮',
- verbar: '|',
- vert: '|',
- vfr: '𝔳',
- vltri: '⊲',
- vnsub: '⊂⃒',
- vnsup: '⊃⃒',
- vopf: '𝕧',
- vprop: '∝',
- vrtri: '⊳',
- vscr: '𝓋',
- vsubnE: '⫋︀',
- vsubne: '⊊︀',
- vsupnE: '⫌︀',
- vsupne: '⊋︀',
- vzigzag: '⦚',
- wcirc: 'ŵ',
- wedbar: '⩟',
- wedge: '∧',
- wedgeq: '≙',
- weierp: '℘',
- wfr: '𝔴',
- wopf: '𝕨',
- wp: '℘',
- wr: '≀',
- wreath: '≀',
- wscr: '𝓌',
- xcap: '⋂',
- xcirc: '◯',
- xcup: '⋃',
- xdtri: '▽',
- xfr: '𝔵',
- xhArr: '⟺',
- xharr: '⟷',
- xi: 'ξ',
- xlArr: '⟸',
- xlarr: '⟵',
- xmap: '⟼',
- xnis: '⋻',
- xodot: '⨀',
- xopf: '𝕩',
- xoplus: '⨁',
- xotime: '⨂',
- xrArr: '⟹',
- xrarr: '⟶',
- xscr: '𝓍',
- xsqcup: '⨆',
- xuplus: '⨄',
- xutri: '△',
- xvee: '⋁',
- xwedge: '⋀',
- yacute: 'ý',
- yacy: 'я',
- ycirc: 'ŷ',
- ycy: 'ы',
- yen: '¥',
- yfr: '𝔶',
- yicy: 'ї',
- yopf: '𝕪',
- yscr: '𝓎',
- yucy: 'ю',
- yuml: 'ÿ',
- zacute: 'ź',
- zcaron: 'ž',
- zcy: 'з',
- zdot: 'ż',
- zeetrf: 'ℨ',
- zeta: 'ζ',
- zfr: '𝔷',
- zhcy: 'ж',
- zigrarr: '⇝',
- zopf: '𝕫',
- zscr: '𝓏',
- zwj: '‍',
- zwnj: '‌'
-}
-
-;// CONCATENATED MODULE: ./node_modules/decode-named-character-reference/index.js
-
-
-const own = {}.hasOwnProperty
-
-/**
- * Decode a single character reference (without the `&` or `;`).
- * You probably only need this when you’re building parsers yourself that follow
- * different rules compared to HTML.
- * This is optimized to be tiny in browsers.
- *
- * @param {string} value
- * `notin` (named), `#123` (deci), `#x123` (hexa).
- * @returns {string|false}
- * Decoded reference.
- */
-function decodeNamedCharacterReference(value) {
- return own.call(characterEntities, value) ? characterEntities[value] : false
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-core-commonmark/lib/character-reference.js
-/**
- * @typedef {import('micromark-util-types').Code} Code
- * @typedef {import('micromark-util-types').Construct} Construct
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- * @typedef {import('micromark-util-types').Tokenizer} Tokenizer
- */
-
-
-
-/** @type {Construct} */
-const characterReference = {
- name: 'characterReference',
- tokenize: tokenizeCharacterReference
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeCharacterReference(effects, ok, nok) {
- const self = this
- let size = 0
- /** @type {number} */
- let max
- /** @type {(code: Code) => boolean} */
- let test
- return start
-
- /**
- * Start of character reference.
- *
- * ```markdown
- * > | a&amp;b
- * ^
- * > | a&#123;b
- * ^
- * > | a&#x9;b
- * ^
- * ```
- *
- * @type {State}
- */
- function start(code) {
- effects.enter('characterReference')
- effects.enter('characterReferenceMarker')
- effects.consume(code)
- effects.exit('characterReferenceMarker')
- return open
- }
-
- /**
- * After `&`, at `#` for numeric references or alphanumeric for named
- * references.
- *
- * ```markdown
- * > | a&amp;b
- * ^
- * > | a&#123;b
- * ^
- * > | a&#x9;b
- * ^
- * ```
- *
- * @type {State}
- */
- function open(code) {
- if (code === 35) {
- effects.enter('characterReferenceMarkerNumeric')
- effects.consume(code)
- effects.exit('characterReferenceMarkerNumeric')
- return numeric
- }
- effects.enter('characterReferenceValue')
- max = 31
- test = asciiAlphanumeric
- return value(code)
- }
-
- /**
- * After `#`, at `x` for hexadecimals or digit for decimals.
- *
- * ```markdown
- * > | a&#123;b
- * ^
- * > | a&#x9;b
- * ^
- * ```
- *
- * @type {State}
- */
- function numeric(code) {
- if (code === 88 || code === 120) {
- effects.enter('characterReferenceMarkerHexadecimal')
- effects.consume(code)
- effects.exit('characterReferenceMarkerHexadecimal')
- effects.enter('characterReferenceValue')
- max = 6
- test = asciiHexDigit
- return value
- }
- effects.enter('characterReferenceValue')
- max = 7
- test = asciiDigit
- return value(code)
- }
-
- /**
- * After markers (`&#x`, `&#`, or `&`), in value, before `;`.
- *
- * The character reference kind defines what and how many characters are
- * allowed.
- *
- * ```markdown
- * > | a&amp;b
- * ^^^
- * > | a&#123;b
- * ^^^
- * > | a&#x9;b
- * ^
- * ```
- *
- * @type {State}
- */
- function value(code) {
- if (code === 59 && size) {
- const token = effects.exit('characterReferenceValue')
- if (
- test === asciiAlphanumeric &&
- !decodeNamedCharacterReference(self.sliceSerialize(token))
- ) {
- return nok(code)
- }
-
- // To do: `markdown-rs` uses a different name:
- // `CharacterReferenceMarkerSemi`.
- effects.enter('characterReferenceMarker')
- effects.consume(code)
- effects.exit('characterReferenceMarker')
- effects.exit('characterReference')
- return ok
- }
- if (test(code) && size++ < max) {
- effects.consume(code)
- return value
- }
- return nok(code)
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-core-commonmark/lib/character-escape.js
-/**
- * @typedef {import('micromark-util-types').Construct} Construct
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- * @typedef {import('micromark-util-types').Tokenizer} Tokenizer
- */
-
-
-/** @type {Construct} */
-const characterEscape = {
- name: 'characterEscape',
- tokenize: tokenizeCharacterEscape
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeCharacterEscape(effects, ok, nok) {
- return start
-
- /**
- * Start of character escape.
- *
- * ```markdown
- * > | a\*b
- * ^
- * ```
- *
- * @type {State}
- */
- function start(code) {
- effects.enter('characterEscape')
- effects.enter('escapeMarker')
- effects.consume(code)
- effects.exit('escapeMarker')
- return inside
- }
-
- /**
- * After `\`, at punctuation.
- *
- * ```markdown
- * > | a\*b
- * ^
- * ```
- *
- * @type {State}
- */
- function inside(code) {
- // ASCII punctuation.
- if (asciiPunctuation(code)) {
- effects.enter('characterEscapeValue')
- effects.consume(code)
- effects.exit('characterEscapeValue')
- effects.exit('characterEscape')
- return ok
- }
- return nok(code)
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-core-commonmark/lib/line-ending.js
-/**
- * @typedef {import('micromark-util-types').Construct} Construct
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- * @typedef {import('micromark-util-types').Tokenizer} Tokenizer
- */
-
-
-
-/** @type {Construct} */
-const lineEnding = {
- name: 'lineEnding',
- tokenize: tokenizeLineEnding
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeLineEnding(effects, ok) {
- return start
-
- /** @type {State} */
- function start(code) {
- effects.enter('lineEnding')
- effects.consume(code)
- effects.exit('lineEnding')
- return factorySpace(effects, ok, 'linePrefix')
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-core-commonmark/lib/label-end.js
-/**
- * @typedef {import('micromark-util-types').Construct} Construct
- * @typedef {import('micromark-util-types').Event} Event
- * @typedef {import('micromark-util-types').Resolver} Resolver
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').Token} Token
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- * @typedef {import('micromark-util-types').Tokenizer} Tokenizer
- */
-
-
-
-
-
-
-
-
-
-/** @type {Construct} */
-const labelEnd = {
- name: 'labelEnd',
- tokenize: tokenizeLabelEnd,
- resolveTo: resolveToLabelEnd,
- resolveAll: resolveAllLabelEnd
-}
-
-/** @type {Construct} */
-const resourceConstruct = {
- tokenize: tokenizeResource
-}
-/** @type {Construct} */
-const referenceFullConstruct = {
- tokenize: tokenizeReferenceFull
-}
-/** @type {Construct} */
-const referenceCollapsedConstruct = {
- tokenize: tokenizeReferenceCollapsed
-}
-
-/** @type {Resolver} */
-function resolveAllLabelEnd(events) {
- let index = -1
- while (++index < events.length) {
- const token = events[index][1]
- if (
- token.type === 'labelImage' ||
- token.type === 'labelLink' ||
- token.type === 'labelEnd'
- ) {
- // Remove the marker.
- events.splice(index + 1, token.type === 'labelImage' ? 4 : 2)
- token.type = 'data'
- index++
- }
- }
- return events
-}
-
-/** @type {Resolver} */
-function resolveToLabelEnd(events, context) {
- let index = events.length
- let offset = 0
- /** @type {Token} */
- let token
- /** @type {number | undefined} */
- let open
- /** @type {number | undefined} */
- let close
- /** @type {Array<Event>} */
- let media
-
- // Find an opening.
- while (index--) {
- token = events[index][1]
- if (open) {
- // If we see another link, or inactive link label, we’ve been here before.
- if (
- token.type === 'link' ||
- (token.type === 'labelLink' && token._inactive)
- ) {
- break
- }
-
- // Mark other link openings as inactive, as we can’t have links in
- // links.
- if (events[index][0] === 'enter' && token.type === 'labelLink') {
- token._inactive = true
- }
- } else if (close) {
- if (
- events[index][0] === 'enter' &&
- (token.type === 'labelImage' || token.type === 'labelLink') &&
- !token._balanced
- ) {
- open = index
- if (token.type !== 'labelLink') {
- offset = 2
- break
- }
- }
- } else if (token.type === 'labelEnd') {
- close = index
- }
- }
- const group = {
- type: events[open][1].type === 'labelLink' ? 'link' : 'image',
- start: Object.assign({}, events[open][1].start),
- end: Object.assign({}, events[events.length - 1][1].end)
- }
- const label = {
- type: 'label',
- start: Object.assign({}, events[open][1].start),
- end: Object.assign({}, events[close][1].end)
- }
- const text = {
- type: 'labelText',
- start: Object.assign({}, events[open + offset + 2][1].end),
- end: Object.assign({}, events[close - 2][1].start)
- }
- media = [
- ['enter', group, context],
- ['enter', label, context]
- ]
-
- // Opening marker.
- media = push(media, events.slice(open + 1, open + offset + 3))
-
- // Text open.
- media = push(media, [['enter', text, context]])
-
- // Always populated by defaults.
-
- // Between.
- media = push(
- media,
- resolveAll(
- context.parser.constructs.insideSpan.null,
- events.slice(open + offset + 4, close - 3),
- context
- )
- )
-
- // Text close, marker close, label close.
- media = push(media, [
- ['exit', text, context],
- events[close - 2],
- events[close - 1],
- ['exit', label, context]
- ])
-
- // Reference, resource, or so.
- media = push(media, events.slice(close + 1))
-
- // Media close.
- media = push(media, [['exit', group, context]])
- splice(events, open, events.length, media)
- return events
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeLabelEnd(effects, ok, nok) {
- const self = this
- let index = self.events.length
- /** @type {Token} */
- let labelStart
- /** @type {boolean} */
- let defined
-
- // Find an opening.
- while (index--) {
- if (
- (self.events[index][1].type === 'labelImage' ||
- self.events[index][1].type === 'labelLink') &&
- !self.events[index][1]._balanced
- ) {
- labelStart = self.events[index][1]
- break
- }
- }
- return start
-
- /**
- * Start of label end.
- *
- * ```markdown
- * > | [a](b) c
- * ^
- * > | [a][b] c
- * ^
- * > | [a][] b
- * ^
- * > | [a] b
- * ```
- *
- * @type {State}
- */
- function start(code) {
- // If there is not an okay opening.
- if (!labelStart) {
- return nok(code)
- }
-
- // If the corresponding label (link) start is marked as inactive,
- // it means we’d be wrapping a link, like this:
- //
- // ```markdown
- // > | a [b [c](d) e](f) g.
- // ^
- // ```
- //
- // We can’t have that, so it’s just balanced brackets.
- if (labelStart._inactive) {
- return labelEndNok(code)
- }
- defined = self.parser.defined.includes(
- normalizeIdentifier(
- self.sliceSerialize({
- start: labelStart.end,
- end: self.now()
- })
- )
- )
- effects.enter('labelEnd')
- effects.enter('labelMarker')
- effects.consume(code)
- effects.exit('labelMarker')
- effects.exit('labelEnd')
- return after
- }
-
- /**
- * After `]`.
- *
- * ```markdown
- * > | [a](b) c
- * ^
- * > | [a][b] c
- * ^
- * > | [a][] b
- * ^
- * > | [a] b
- * ^
- * ```
- *
- * @type {State}
- */
- function after(code) {
- // Note: `markdown-rs` also parses GFM footnotes here, which for us is in
- // an extension.
-
- // Resource (`[asd](fgh)`)?
- if (code === 40) {
- return effects.attempt(
- resourceConstruct,
- labelEndOk,
- defined ? labelEndOk : labelEndNok
- )(code)
- }
-
- // Full (`[asd][fgh]`) or collapsed (`[asd][]`) reference?
- if (code === 91) {
- return effects.attempt(
- referenceFullConstruct,
- labelEndOk,
- defined ? referenceNotFull : labelEndNok
- )(code)
- }
-
- // Shortcut (`[asd]`) reference?
- return defined ? labelEndOk(code) : labelEndNok(code)
- }
-
- /**
- * After `]`, at `[`, but not at a full reference.
- *
- * > 👉 **Note**: we only get here if the label is defined.
- *
- * ```markdown
- * > | [a][] b
- * ^
- * > | [a] b
- * ^
- * ```
- *
- * @type {State}
- */
- function referenceNotFull(code) {
- return effects.attempt(
- referenceCollapsedConstruct,
- labelEndOk,
- labelEndNok
- )(code)
- }
-
- /**
- * Done, we found something.
- *
- * ```markdown
- * > | [a](b) c
- * ^
- * > | [a][b] c
- * ^
- * > | [a][] b
- * ^
- * > | [a] b
- * ^
- * ```
- *
- * @type {State}
- */
- function labelEndOk(code) {
- // Note: `markdown-rs` does a bunch of stuff here.
- return ok(code)
- }
-
- /**
- * Done, it’s nothing.
- *
- * There was an okay opening, but we didn’t match anything.
- *
- * ```markdown
- * > | [a](b c
- * ^
- * > | [a][b c
- * ^
- * > | [a] b
- * ^
- * ```
- *
- * @type {State}
- */
- function labelEndNok(code) {
- labelStart._balanced = true
- return nok(code)
- }
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeResource(effects, ok, nok) {
- return resourceStart
-
- /**
- * At a resource.
- *
- * ```markdown
- * > | [a](b) c
- * ^
- * ```
- *
- * @type {State}
- */
- function resourceStart(code) {
- effects.enter('resource')
- effects.enter('resourceMarker')
- effects.consume(code)
- effects.exit('resourceMarker')
- return resourceBefore
- }
-
- /**
- * In resource, after `(`, at optional whitespace.
- *
- * ```markdown
- * > | [a](b) c
- * ^
- * ```
- *
- * @type {State}
- */
- function resourceBefore(code) {
- return markdownLineEndingOrSpace(code)
- ? factoryWhitespace(effects, resourceOpen)(code)
- : resourceOpen(code)
- }
-
- /**
- * In resource, after optional whitespace, at `)` or a destination.
- *
- * ```markdown
- * > | [a](b) c
- * ^
- * ```
- *
- * @type {State}
- */
- function resourceOpen(code) {
- if (code === 41) {
- return resourceEnd(code)
- }
- return factoryDestination(
- effects,
- resourceDestinationAfter,
- resourceDestinationMissing,
- 'resourceDestination',
- 'resourceDestinationLiteral',
- 'resourceDestinationLiteralMarker',
- 'resourceDestinationRaw',
- 'resourceDestinationString',
- 32
- )(code)
- }
-
- /**
- * In resource, after destination, at optional whitespace.
- *
- * ```markdown
- * > | [a](b) c
- * ^
- * ```
- *
- * @type {State}
- */
- function resourceDestinationAfter(code) {
- return markdownLineEndingOrSpace(code)
- ? factoryWhitespace(effects, resourceBetween)(code)
- : resourceEnd(code)
- }
-
- /**
- * At invalid destination.
- *
- * ```markdown
- * > | [a](<<) b
- * ^
- * ```
- *
- * @type {State}
- */
- function resourceDestinationMissing(code) {
- return nok(code)
- }
-
- /**
- * In resource, after destination and whitespace, at `(` or title.
- *
- * ```markdown
- * > | [a](b ) c
- * ^
- * ```
- *
- * @type {State}
- */
- function resourceBetween(code) {
- if (code === 34 || code === 39 || code === 40) {
- return factoryTitle(
- effects,
- resourceTitleAfter,
- nok,
- 'resourceTitle',
- 'resourceTitleMarker',
- 'resourceTitleString'
- )(code)
- }
- return resourceEnd(code)
- }
-
- /**
- * In resource, after title, at optional whitespace.
- *
- * ```markdown
- * > | [a](b "c") d
- * ^
- * ```
- *
- * @type {State}
- */
- function resourceTitleAfter(code) {
- return markdownLineEndingOrSpace(code)
- ? factoryWhitespace(effects, resourceEnd)(code)
- : resourceEnd(code)
- }
-
- /**
- * In resource, at `)`.
- *
- * ```markdown
- * > | [a](b) d
- * ^
- * ```
- *
- * @type {State}
- */
- function resourceEnd(code) {
- if (code === 41) {
- effects.enter('resourceMarker')
- effects.consume(code)
- effects.exit('resourceMarker')
- effects.exit('resource')
- return ok
- }
- return nok(code)
- }
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeReferenceFull(effects, ok, nok) {
- const self = this
- return referenceFull
-
- /**
- * In a reference (full), at the `[`.
- *
- * ```markdown
- * > | [a][b] d
- * ^
- * ```
- *
- * @type {State}
- */
- function referenceFull(code) {
- return factoryLabel.call(
- self,
- effects,
- referenceFullAfter,
- referenceFullMissing,
- 'reference',
- 'referenceMarker',
- 'referenceString'
- )(code)
- }
-
- /**
- * In a reference (full), after `]`.
- *
- * ```markdown
- * > | [a][b] d
- * ^
- * ```
- *
- * @type {State}
- */
- function referenceFullAfter(code) {
- return self.parser.defined.includes(
- normalizeIdentifier(
- self.sliceSerialize(self.events[self.events.length - 1][1]).slice(1, -1)
- )
- )
- ? ok(code)
- : nok(code)
- }
-
- /**
- * In reference (full) that was missing.
- *
- * ```markdown
- * > | [a][b d
- * ^
- * ```
- *
- * @type {State}
- */
- function referenceFullMissing(code) {
- return nok(code)
- }
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeReferenceCollapsed(effects, ok, nok) {
- return referenceCollapsedStart
-
- /**
- * In reference (collapsed), at `[`.
- *
- * > 👉 **Note**: we only get here if the label is defined.
- *
- * ```markdown
- * > | [a][] d
- * ^
- * ```
- *
- * @type {State}
- */
- function referenceCollapsedStart(code) {
- // We only attempt a collapsed label if there’s a `[`.
-
- effects.enter('reference')
- effects.enter('referenceMarker')
- effects.consume(code)
- effects.exit('referenceMarker')
- return referenceCollapsedOpen
- }
-
- /**
- * In reference (collapsed), at `]`.
- *
- * > 👉 **Note**: we only get here if the label is defined.
- *
- * ```markdown
- * > | [a][] d
- * ^
- * ```
- *
- * @type {State}
- */
- function referenceCollapsedOpen(code) {
- if (code === 93) {
- effects.enter('referenceMarker')
- effects.consume(code)
- effects.exit('referenceMarker')
- effects.exit('reference')
- return ok
- }
- return nok(code)
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-core-commonmark/lib/label-start-image.js
-/**
- * @typedef {import('micromark-util-types').Construct} Construct
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- * @typedef {import('micromark-util-types').Tokenizer} Tokenizer
- */
-
-
-
-/** @type {Construct} */
-const labelStartImage = {
- name: 'labelStartImage',
- tokenize: tokenizeLabelStartImage,
- resolveAll: labelEnd.resolveAll
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeLabelStartImage(effects, ok, nok) {
- const self = this
- return start
-
- /**
- * Start of label (image) start.
- *
- * ```markdown
- * > | a ![b] c
- * ^
- * ```
- *
- * @type {State}
- */
- function start(code) {
- effects.enter('labelImage')
- effects.enter('labelImageMarker')
- effects.consume(code)
- effects.exit('labelImageMarker')
- return open
- }
-
- /**
- * After `!`, at `[`.
- *
- * ```markdown
- * > | a ![b] c
- * ^
- * ```
- *
- * @type {State}
- */
- function open(code) {
- if (code === 91) {
- effects.enter('labelMarker')
- effects.consume(code)
- effects.exit('labelMarker')
- effects.exit('labelImage')
- return after
- }
- return nok(code)
- }
-
- /**
- * After `![`.
- *
- * ```markdown
- * > | a ![b] c
- * ^
- * ```
- *
- * This is needed in because, when GFM footnotes are enabled, images never
- * form when started with a `^`.
- * Instead, links form:
- *
- * ```markdown
- * ![^a](b)
- *
- * ![^a][b]
- *
- * [b]: c
- * ```
- *
- * ```html
- * <p>!<a href=\"b\">^a</a></p>
- * <p>!<a href=\"c\">^a</a></p>
- * ```
- *
- * @type {State}
- */
- function after(code) {
- // To do: use a new field to do this, this is still needed for
- // `micromark-extension-gfm-footnote`, but the `label-start-link`
- // behavior isn’t.
- // Hidden footnotes hook.
- /* c8 ignore next 3 */
- return code === 94 && '_hiddenFootnoteSupport' in self.parser.constructs
- ? nok(code)
- : ok(code)
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-util-classify-character/index.js
-/**
- * @typedef {import('micromark-util-types').Code} Code
- */
-
-
-/**
- * Classify whether a code represents whitespace, punctuation, or something
- * else.
- *
- * Used for attention (emphasis, strong), whose sequences can open or close
- * based on the class of surrounding characters.
- *
- * > 👉 **Note**: eof (`null`) is seen as whitespace.
- *
- * @param {Code} code
- * Code.
- * @returns {typeof constants.characterGroupWhitespace | typeof constants.characterGroupPunctuation | undefined}
- * Group.
- */
-function classifyCharacter(code) {
- if (
- code === null ||
- markdownLineEndingOrSpace(code) ||
- unicodeWhitespace(code)
- ) {
- return 1
- }
- if (unicodePunctuation(code)) {
- return 2
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-core-commonmark/lib/attention.js
-/**
- * @typedef {import('micromark-util-types').Code} Code
- * @typedef {import('micromark-util-types').Construct} Construct
- * @typedef {import('micromark-util-types').Event} Event
- * @typedef {import('micromark-util-types').Point} Point
- * @typedef {import('micromark-util-types').Resolver} Resolver
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').Token} Token
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- * @typedef {import('micromark-util-types').Tokenizer} Tokenizer
- */
-
-
-
-
-/** @type {Construct} */
-const attention = {
- name: 'attention',
- tokenize: tokenizeAttention,
- resolveAll: resolveAllAttention
-}
-
-/**
- * Take all events and resolve attention to emphasis or strong.
- *
- * @type {Resolver}
- */
-function resolveAllAttention(events, context) {
- let index = -1
- /** @type {number} */
- let open
- /** @type {Token} */
- let group
- /** @type {Token} */
- let text
- /** @type {Token} */
- let openingSequence
- /** @type {Token} */
- let closingSequence
- /** @type {number} */
- let use
- /** @type {Array<Event>} */
- let nextEvents
- /** @type {number} */
- let offset
-
- // Walk through all events.
- //
- // Note: performance of this is fine on an mb of normal markdown, but it’s
- // a bottleneck for malicious stuff.
- while (++index < events.length) {
- // Find a token that can close.
- if (
- events[index][0] === 'enter' &&
- events[index][1].type === 'attentionSequence' &&
- events[index][1]._close
- ) {
- open = index
-
- // Now walk back to find an opener.
- while (open--) {
- // Find a token that can open the closer.
- if (
- events[open][0] === 'exit' &&
- events[open][1].type === 'attentionSequence' &&
- events[open][1]._open &&
- // If the markers are the same:
- context.sliceSerialize(events[open][1]).charCodeAt(0) ===
- context.sliceSerialize(events[index][1]).charCodeAt(0)
- ) {
- // If the opening can close or the closing can open,
- // and the close size *is not* a multiple of three,
- // but the sum of the opening and closing size *is* multiple of three,
- // then don’t match.
- if (
- (events[open][1]._close || events[index][1]._open) &&
- (events[index][1].end.offset - events[index][1].start.offset) % 3 &&
- !(
- (events[open][1].end.offset -
- events[open][1].start.offset +
- events[index][1].end.offset -
- events[index][1].start.offset) %
- 3
- )
- ) {
- continue
- }
-
- // Number of markers to use from the sequence.
- use =
- events[open][1].end.offset - events[open][1].start.offset > 1 &&
- events[index][1].end.offset - events[index][1].start.offset > 1
- ? 2
- : 1
- const start = Object.assign({}, events[open][1].end)
- const end = Object.assign({}, events[index][1].start)
- movePoint(start, -use)
- movePoint(end, use)
- openingSequence = {
- type: use > 1 ? 'strongSequence' : 'emphasisSequence',
- start,
- end: Object.assign({}, events[open][1].end)
- }
- closingSequence = {
- type: use > 1 ? 'strongSequence' : 'emphasisSequence',
- start: Object.assign({}, events[index][1].start),
- end
- }
- text = {
- type: use > 1 ? 'strongText' : 'emphasisText',
- start: Object.assign({}, events[open][1].end),
- end: Object.assign({}, events[index][1].start)
- }
- group = {
- type: use > 1 ? 'strong' : 'emphasis',
- start: Object.assign({}, openingSequence.start),
- end: Object.assign({}, closingSequence.end)
- }
- events[open][1].end = Object.assign({}, openingSequence.start)
- events[index][1].start = Object.assign({}, closingSequence.end)
- nextEvents = []
-
- // If there are more markers in the opening, add them before.
- if (events[open][1].end.offset - events[open][1].start.offset) {
- nextEvents = push(nextEvents, [
- ['enter', events[open][1], context],
- ['exit', events[open][1], context]
- ])
- }
-
- // Opening.
- nextEvents = push(nextEvents, [
- ['enter', group, context],
- ['enter', openingSequence, context],
- ['exit', openingSequence, context],
- ['enter', text, context]
- ])
-
- // Always populated by defaults.
-
- // Between.
- nextEvents = push(
- nextEvents,
- resolveAll(
- context.parser.constructs.insideSpan.null,
- events.slice(open + 1, index),
- context
- )
- )
-
- // Closing.
- nextEvents = push(nextEvents, [
- ['exit', text, context],
- ['enter', closingSequence, context],
- ['exit', closingSequence, context],
- ['exit', group, context]
- ])
-
- // If there are more markers in the closing, add them after.
- if (events[index][1].end.offset - events[index][1].start.offset) {
- offset = 2
- nextEvents = push(nextEvents, [
- ['enter', events[index][1], context],
- ['exit', events[index][1], context]
- ])
- } else {
- offset = 0
- }
- splice(events, open - 1, index - open + 3, nextEvents)
- index = open + nextEvents.length - offset - 2
- break
- }
- }
- }
- }
-
- // Remove remaining sequences.
- index = -1
- while (++index < events.length) {
- if (events[index][1].type === 'attentionSequence') {
- events[index][1].type = 'data'
- }
- }
- return events
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeAttention(effects, ok) {
- const attentionMarkers = this.parser.constructs.attentionMarkers.null
- const previous = this.previous
- const before = classifyCharacter(previous)
-
- /** @type {NonNullable<Code>} */
- let marker
- return start
-
- /**
- * Before a sequence.
- *
- * ```markdown
- * > | **
- * ^
- * ```
- *
- * @type {State}
- */
- function start(code) {
- marker = code
- effects.enter('attentionSequence')
- return inside(code)
- }
-
- /**
- * In a sequence.
- *
- * ```markdown
- * > | **
- * ^^
- * ```
- *
- * @type {State}
- */
- function inside(code) {
- if (code === marker) {
- effects.consume(code)
- return inside
- }
- const token = effects.exit('attentionSequence')
-
- // To do: next major: move this to resolver, just like `markdown-rs`.
- const after = classifyCharacter(code)
-
- // Always populated by defaults.
-
- const open =
- !after || (after === 2 && before) || attentionMarkers.includes(code)
- const close =
- !before || (before === 2 && after) || attentionMarkers.includes(previous)
- token._open = Boolean(marker === 42 ? open : open && (before || !close))
- token._close = Boolean(marker === 42 ? close : close && (after || !open))
- return ok(code)
- }
-}
-
-/**
- * Move a point a bit.
- *
- * Note: `move` only works inside lines! It’s not possible to move past other
- * chunks (replacement characters, tabs, or line endings).
- *
- * @param {Point} point
- * @param {number} offset
- * @returns {void}
- */
-function movePoint(point, offset) {
- point.column += offset
- point.offset += offset
- point._bufferIndex += offset
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-core-commonmark/lib/autolink.js
-/**
- * @typedef {import('micromark-util-types').Construct} Construct
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- * @typedef {import('micromark-util-types').Tokenizer} Tokenizer
- */
-
-
-/** @type {Construct} */
-const autolink = {
- name: 'autolink',
- tokenize: tokenizeAutolink
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeAutolink(effects, ok, nok) {
- let size = 0
- return start
-
- /**
- * Start of an autolink.
- *
- * ```markdown
- * > | a<https://example.com>b
- * ^
- * > | a<user@example.com>b
- * ^
- * ```
- *
- * @type {State}
- */
- function start(code) {
- effects.enter('autolink')
- effects.enter('autolinkMarker')
- effects.consume(code)
- effects.exit('autolinkMarker')
- effects.enter('autolinkProtocol')
- return open
- }
-
- /**
- * After `<`, at protocol or atext.
- *
- * ```markdown
- * > | a<https://example.com>b
- * ^
- * > | a<user@example.com>b
- * ^
- * ```
- *
- * @type {State}
- */
- function open(code) {
- if (asciiAlpha(code)) {
- effects.consume(code)
- return schemeOrEmailAtext
- }
- return emailAtext(code)
- }
-
- /**
- * At second byte of protocol or atext.
- *
- * ```markdown
- * > | a<https://example.com>b
- * ^
- * > | a<user@example.com>b
- * ^
- * ```
- *
- * @type {State}
- */
- function schemeOrEmailAtext(code) {
- // ASCII alphanumeric and `+`, `-`, and `.`.
- if (code === 43 || code === 45 || code === 46 || asciiAlphanumeric(code)) {
- // Count the previous alphabetical from `open` too.
- size = 1
- return schemeInsideOrEmailAtext(code)
- }
- return emailAtext(code)
- }
-
- /**
- * In ambiguous protocol or atext.
- *
- * ```markdown
- * > | a<https://example.com>b
- * ^
- * > | a<user@example.com>b
- * ^
- * ```
- *
- * @type {State}
- */
- function schemeInsideOrEmailAtext(code) {
- if (code === 58) {
- effects.consume(code)
- size = 0
- return urlInside
- }
-
- // ASCII alphanumeric and `+`, `-`, and `.`.
- if (
- (code === 43 || code === 45 || code === 46 || asciiAlphanumeric(code)) &&
- size++ < 32
- ) {
- effects.consume(code)
- return schemeInsideOrEmailAtext
- }
- size = 0
- return emailAtext(code)
- }
-
- /**
- * After protocol, in URL.
- *
- * ```markdown
- * > | a<https://example.com>b
- * ^
- * ```
- *
- * @type {State}
- */
- function urlInside(code) {
- if (code === 62) {
- effects.exit('autolinkProtocol')
- effects.enter('autolinkMarker')
- effects.consume(code)
- effects.exit('autolinkMarker')
- effects.exit('autolink')
- return ok
- }
-
- // ASCII control, space, or `<`.
- if (code === null || code === 32 || code === 60 || asciiControl(code)) {
- return nok(code)
- }
- effects.consume(code)
- return urlInside
- }
-
- /**
- * In email atext.
- *
- * ```markdown
- * > | a<user.name@example.com>b
- * ^
- * ```
- *
- * @type {State}
- */
- function emailAtext(code) {
- if (code === 64) {
- effects.consume(code)
- return emailAtSignOrDot
- }
- if (asciiAtext(code)) {
- effects.consume(code)
- return emailAtext
- }
- return nok(code)
- }
-
- /**
- * In label, after at-sign or dot.
- *
- * ```markdown
- * > | a<user.name@example.com>b
- * ^ ^
- * ```
- *
- * @type {State}
- */
- function emailAtSignOrDot(code) {
- return asciiAlphanumeric(code) ? emailLabel(code) : nok(code)
- }
-
- /**
- * In label, where `.` and `>` are allowed.
- *
- * ```markdown
- * > | a<user.name@example.com>b
- * ^
- * ```
- *
- * @type {State}
- */
- function emailLabel(code) {
- if (code === 46) {
- effects.consume(code)
- size = 0
- return emailAtSignOrDot
- }
- if (code === 62) {
- // Exit, then change the token type.
- effects.exit('autolinkProtocol').type = 'autolinkEmail'
- effects.enter('autolinkMarker')
- effects.consume(code)
- effects.exit('autolinkMarker')
- effects.exit('autolink')
- return ok
- }
- return emailValue(code)
- }
-
- /**
- * In label, where `.` and `>` are *not* allowed.
- *
- * Though, this is also used in `emailLabel` to parse other values.
- *
- * ```markdown
- * > | a<user.name@ex-ample.com>b
- * ^
- * ```
- *
- * @type {State}
- */
- function emailValue(code) {
- // ASCII alphanumeric or `-`.
- if ((code === 45 || asciiAlphanumeric(code)) && size++ < 63) {
- const next = code === 45 ? emailValue : emailLabel
- effects.consume(code)
- return next
- }
- return nok(code)
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-core-commonmark/lib/html-text.js
-/**
- * @typedef {import('micromark-util-types').Code} Code
- * @typedef {import('micromark-util-types').Construct} Construct
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- * @typedef {import('micromark-util-types').Tokenizer} Tokenizer
- */
-
-
-
-/** @type {Construct} */
-const htmlText = {
- name: 'htmlText',
- tokenize: tokenizeHtmlText
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeHtmlText(effects, ok, nok) {
- const self = this
- /** @type {NonNullable<Code> | undefined} */
- let marker
- /** @type {number} */
- let index
- /** @type {State} */
- let returnState
- return start
-
- /**
- * Start of HTML (text).
- *
- * ```markdown
- * > | a <b> c
- * ^
- * ```
- *
- * @type {State}
- */
- function start(code) {
- effects.enter('htmlText')
- effects.enter('htmlTextData')
- effects.consume(code)
- return open
- }
-
- /**
- * After `<`, at tag name or other stuff.
- *
- * ```markdown
- * > | a <b> c
- * ^
- * > | a <!doctype> c
- * ^
- * > | a <!--b--> c
- * ^
- * ```
- *
- * @type {State}
- */
- function open(code) {
- if (code === 33) {
- effects.consume(code)
- return declarationOpen
- }
- if (code === 47) {
- effects.consume(code)
- return tagCloseStart
- }
- if (code === 63) {
- effects.consume(code)
- return instruction
- }
-
- // ASCII alphabetical.
- if (asciiAlpha(code)) {
- effects.consume(code)
- return tagOpen
- }
- return nok(code)
- }
-
- /**
- * After `<!`, at declaration, comment, or CDATA.
- *
- * ```markdown
- * > | a <!doctype> c
- * ^
- * > | a <!--b--> c
- * ^
- * > | a <![CDATA[>&<]]> c
- * ^
- * ```
- *
- * @type {State}
- */
- function declarationOpen(code) {
- if (code === 45) {
- effects.consume(code)
- return commentOpenInside
- }
- if (code === 91) {
- effects.consume(code)
- index = 0
- return cdataOpenInside
- }
- if (asciiAlpha(code)) {
- effects.consume(code)
- return declaration
- }
- return nok(code)
- }
-
- /**
- * In a comment, after `<!-`, at another `-`.
- *
- * ```markdown
- * > | a <!--b--> c
- * ^
- * ```
- *
- * @type {State}
- */
- function commentOpenInside(code) {
- if (code === 45) {
- effects.consume(code)
- return commentEnd
- }
- return nok(code)
- }
-
- /**
- * In comment.
- *
- * ```markdown
- * > | a <!--b--> c
- * ^
- * ```
- *
- * @type {State}
- */
- function comment(code) {
- if (code === null) {
- return nok(code)
- }
- if (code === 45) {
- effects.consume(code)
- return commentClose
- }
- if (markdownLineEnding(code)) {
- returnState = comment
- return lineEndingBefore(code)
- }
- effects.consume(code)
- return comment
- }
-
- /**
- * In comment, after `-`.
- *
- * ```markdown
- * > | a <!--b--> c
- * ^
- * ```
- *
- * @type {State}
- */
- function commentClose(code) {
- if (code === 45) {
- effects.consume(code)
- return commentEnd
- }
- return comment(code)
- }
-
- /**
- * In comment, after `--`.
- *
- * ```markdown
- * > | a <!--b--> c
- * ^
- * ```
- *
- * @type {State}
- */
- function commentEnd(code) {
- return code === 62
- ? end(code)
- : code === 45
- ? commentClose(code)
- : comment(code)
- }
-
- /**
- * After `<![`, in CDATA, expecting `CDATA[`.
- *
- * ```markdown
- * > | a <![CDATA[>&<]]> b
- * ^^^^^^
- * ```
- *
- * @type {State}
- */
- function cdataOpenInside(code) {
- const value = 'CDATA['
- if (code === value.charCodeAt(index++)) {
- effects.consume(code)
- return index === value.length ? cdata : cdataOpenInside
- }
- return nok(code)
- }
-
- /**
- * In CDATA.
- *
- * ```markdown
- * > | a <![CDATA[>&<]]> b
- * ^^^
- * ```
- *
- * @type {State}
- */
- function cdata(code) {
- if (code === null) {
- return nok(code)
- }
- if (code === 93) {
- effects.consume(code)
- return cdataClose
- }
- if (markdownLineEnding(code)) {
- returnState = cdata
- return lineEndingBefore(code)
- }
- effects.consume(code)
- return cdata
- }
-
- /**
- * In CDATA, after `]`, at another `]`.
- *
- * ```markdown
- * > | a <![CDATA[>&<]]> b
- * ^
- * ```
- *
- * @type {State}
- */
- function cdataClose(code) {
- if (code === 93) {
- effects.consume(code)
- return cdataEnd
- }
- return cdata(code)
- }
-
- /**
- * In CDATA, after `]]`, at `>`.
- *
- * ```markdown
- * > | a <![CDATA[>&<]]> b
- * ^
- * ```
- *
- * @type {State}
- */
- function cdataEnd(code) {
- if (code === 62) {
- return end(code)
- }
- if (code === 93) {
- effects.consume(code)
- return cdataEnd
- }
- return cdata(code)
- }
-
- /**
- * In declaration.
- *
- * ```markdown
- * > | a <!b> c
- * ^
- * ```
- *
- * @type {State}
- */
- function declaration(code) {
- if (code === null || code === 62) {
- return end(code)
- }
- if (markdownLineEnding(code)) {
- returnState = declaration
- return lineEndingBefore(code)
- }
- effects.consume(code)
- return declaration
- }
-
- /**
- * In instruction.
- *
- * ```markdown
- * > | a <?b?> c
- * ^
- * ```
- *
- * @type {State}
- */
- function instruction(code) {
- if (code === null) {
- return nok(code)
- }
- if (code === 63) {
- effects.consume(code)
- return instructionClose
- }
- if (markdownLineEnding(code)) {
- returnState = instruction
- return lineEndingBefore(code)
- }
- effects.consume(code)
- return instruction
- }
-
- /**
- * In instruction, after `?`, at `>`.
- *
- * ```markdown
- * > | a <?b?> c
- * ^
- * ```
- *
- * @type {State}
- */
- function instructionClose(code) {
- return code === 62 ? end(code) : instruction(code)
- }
-
- /**
- * After `</`, in closing tag, at tag name.
- *
- * ```markdown
- * > | a </b> c
- * ^
- * ```
- *
- * @type {State}
- */
- function tagCloseStart(code) {
- // ASCII alphabetical.
- if (asciiAlpha(code)) {
- effects.consume(code)
- return tagClose
- }
- return nok(code)
- }
-
- /**
- * After `</x`, in a tag name.
- *
- * ```markdown
- * > | a </b> c
- * ^
- * ```
- *
- * @type {State}
- */
- function tagClose(code) {
- // ASCII alphanumerical and `-`.
- if (code === 45 || asciiAlphanumeric(code)) {
- effects.consume(code)
- return tagClose
- }
- return tagCloseBetween(code)
- }
-
- /**
- * In closing tag, after tag name.
- *
- * ```markdown
- * > | a </b> c
- * ^
- * ```
- *
- * @type {State}
- */
- function tagCloseBetween(code) {
- if (markdownLineEnding(code)) {
- returnState = tagCloseBetween
- return lineEndingBefore(code)
- }
- if (markdownSpace(code)) {
- effects.consume(code)
- return tagCloseBetween
- }
- return end(code)
- }
-
- /**
- * After `<x`, in opening tag name.
- *
- * ```markdown
- * > | a <b> c
- * ^
- * ```
- *
- * @type {State}
- */
- function tagOpen(code) {
- // ASCII alphanumerical and `-`.
- if (code === 45 || asciiAlphanumeric(code)) {
- effects.consume(code)
- return tagOpen
- }
- if (code === 47 || code === 62 || markdownLineEndingOrSpace(code)) {
- return tagOpenBetween(code)
- }
- return nok(code)
- }
-
- /**
- * In opening tag, after tag name.
- *
- * ```markdown
- * > | a <b> c
- * ^
- * ```
- *
- * @type {State}
- */
- function tagOpenBetween(code) {
- if (code === 47) {
- effects.consume(code)
- return end
- }
-
- // ASCII alphabetical and `:` and `_`.
- if (code === 58 || code === 95 || asciiAlpha(code)) {
- effects.consume(code)
- return tagOpenAttributeName
- }
- if (markdownLineEnding(code)) {
- returnState = tagOpenBetween
- return lineEndingBefore(code)
- }
- if (markdownSpace(code)) {
- effects.consume(code)
- return tagOpenBetween
- }
- return end(code)
- }
-
- /**
- * In attribute name.
- *
- * ```markdown
- * > | a <b c> d
- * ^
- * ```
- *
- * @type {State}
- */
- function tagOpenAttributeName(code) {
- // ASCII alphabetical and `-`, `.`, `:`, and `_`.
- if (
- code === 45 ||
- code === 46 ||
- code === 58 ||
- code === 95 ||
- asciiAlphanumeric(code)
- ) {
- effects.consume(code)
- return tagOpenAttributeName
- }
- return tagOpenAttributeNameAfter(code)
- }
-
- /**
- * After attribute name, before initializer, the end of the tag, or
- * whitespace.
- *
- * ```markdown
- * > | a <b c> d
- * ^
- * ```
- *
- * @type {State}
- */
- function tagOpenAttributeNameAfter(code) {
- if (code === 61) {
- effects.consume(code)
- return tagOpenAttributeValueBefore
- }
- if (markdownLineEnding(code)) {
- returnState = tagOpenAttributeNameAfter
- return lineEndingBefore(code)
- }
- if (markdownSpace(code)) {
- effects.consume(code)
- return tagOpenAttributeNameAfter
- }
- return tagOpenBetween(code)
- }
-
- /**
- * Before unquoted, double quoted, or single quoted attribute value, allowing
- * whitespace.
- *
- * ```markdown
- * > | a <b c=d> e
- * ^
- * ```
- *
- * @type {State}
- */
- function tagOpenAttributeValueBefore(code) {
- if (
- code === null ||
- code === 60 ||
- code === 61 ||
- code === 62 ||
- code === 96
- ) {
- return nok(code)
- }
- if (code === 34 || code === 39) {
- effects.consume(code)
- marker = code
- return tagOpenAttributeValueQuoted
- }
- if (markdownLineEnding(code)) {
- returnState = tagOpenAttributeValueBefore
- return lineEndingBefore(code)
- }
- if (markdownSpace(code)) {
- effects.consume(code)
- return tagOpenAttributeValueBefore
- }
- effects.consume(code)
- return tagOpenAttributeValueUnquoted
- }
-
- /**
- * In double or single quoted attribute value.
- *
- * ```markdown
- * > | a <b c="d"> e
- * ^
- * ```
- *
- * @type {State}
- */
- function tagOpenAttributeValueQuoted(code) {
- if (code === marker) {
- effects.consume(code)
- marker = undefined
- return tagOpenAttributeValueQuotedAfter
- }
- if (code === null) {
- return nok(code)
- }
- if (markdownLineEnding(code)) {
- returnState = tagOpenAttributeValueQuoted
- return lineEndingBefore(code)
- }
- effects.consume(code)
- return tagOpenAttributeValueQuoted
- }
-
- /**
- * In unquoted attribute value.
- *
- * ```markdown
- * > | a <b c=d> e
- * ^
- * ```
- *
- * @type {State}
- */
- function tagOpenAttributeValueUnquoted(code) {
- if (
- code === null ||
- code === 34 ||
- code === 39 ||
- code === 60 ||
- code === 61 ||
- code === 96
- ) {
- return nok(code)
- }
- if (code === 47 || code === 62 || markdownLineEndingOrSpace(code)) {
- return tagOpenBetween(code)
- }
- effects.consume(code)
- return tagOpenAttributeValueUnquoted
- }
-
- /**
- * After double or single quoted attribute value, before whitespace or the end
- * of the tag.
- *
- * ```markdown
- * > | a <b c="d"> e
- * ^
- * ```
- *
- * @type {State}
- */
- function tagOpenAttributeValueQuotedAfter(code) {
- if (code === 47 || code === 62 || markdownLineEndingOrSpace(code)) {
- return tagOpenBetween(code)
- }
- return nok(code)
- }
-
- /**
- * In certain circumstances of a tag where only an `>` is allowed.
- *
- * ```markdown
- * > | a <b c="d"> e
- * ^
- * ```
- *
- * @type {State}
- */
- function end(code) {
- if (code === 62) {
- effects.consume(code)
- effects.exit('htmlTextData')
- effects.exit('htmlText')
- return ok
- }
- return nok(code)
- }
-
- /**
- * At eol.
- *
- * > 👉 **Note**: we can’t have blank lines in text, so no need to worry about
- * > empty tokens.
- *
- * ```markdown
- * > | a <!--a
- * ^
- * | b-->
- * ```
- *
- * @type {State}
- */
- function lineEndingBefore(code) {
- effects.exit('htmlTextData')
- effects.enter('lineEnding')
- effects.consume(code)
- effects.exit('lineEnding')
- return lineEndingAfter
- }
-
- /**
- * After eol, at optional whitespace.
- *
- * > 👉 **Note**: we can’t have blank lines in text, so no need to worry about
- * > empty tokens.
- *
- * ```markdown
- * | a <!--a
- * > | b-->
- * ^
- * ```
- *
- * @type {State}
- */
- function lineEndingAfter(code) {
- // Always populated by defaults.
-
- return markdownSpace(code)
- ? factorySpace(
- effects,
- lineEndingAfterPrefix,
- 'linePrefix',
- self.parser.constructs.disable.null.includes('codeIndented')
- ? undefined
- : 4
- )(code)
- : lineEndingAfterPrefix(code)
- }
-
- /**
- * After eol, after optional whitespace.
- *
- * > 👉 **Note**: we can’t have blank lines in text, so no need to worry about
- * > empty tokens.
- *
- * ```markdown
- * | a <!--a
- * > | b-->
- * ^
- * ```
- *
- * @type {State}
- */
- function lineEndingAfterPrefix(code) {
- effects.enter('htmlTextData')
- return returnState(code)
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-core-commonmark/lib/label-start-link.js
-/**
- * @typedef {import('micromark-util-types').Construct} Construct
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- * @typedef {import('micromark-util-types').Tokenizer} Tokenizer
- */
-
-
-
-/** @type {Construct} */
-const labelStartLink = {
- name: 'labelStartLink',
- tokenize: tokenizeLabelStartLink,
- resolveAll: labelEnd.resolveAll
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeLabelStartLink(effects, ok, nok) {
- const self = this
- return start
-
- /**
- * Start of label (link) start.
- *
- * ```markdown
- * > | a [b] c
- * ^
- * ```
- *
- * @type {State}
- */
- function start(code) {
- effects.enter('labelLink')
- effects.enter('labelMarker')
- effects.consume(code)
- effects.exit('labelMarker')
- effects.exit('labelLink')
- return after
- }
-
- /** @type {State} */
- function after(code) {
- // To do: this isn’t needed in `micromark-extension-gfm-footnote`,
- // remove.
- // Hidden footnotes hook.
- /* c8 ignore next 3 */
- return code === 94 && '_hiddenFootnoteSupport' in self.parser.constructs
- ? nok(code)
- : ok(code)
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-core-commonmark/lib/hard-break-escape.js
-/**
- * @typedef {import('micromark-util-types').Construct} Construct
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- * @typedef {import('micromark-util-types').Tokenizer} Tokenizer
- */
-
-
-/** @type {Construct} */
-const hardBreakEscape = {
- name: 'hardBreakEscape',
- tokenize: tokenizeHardBreakEscape
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeHardBreakEscape(effects, ok, nok) {
- return start
-
- /**
- * Start of a hard break (escape).
- *
- * ```markdown
- * > | a\
- * ^
- * | b
- * ```
- *
- * @type {State}
- */
- function start(code) {
- effects.enter('hardBreakEscape')
- effects.consume(code)
- return after
- }
-
- /**
- * After `\`, at eol.
- *
- * ```markdown
- * > | a\
- * ^
- * | b
- * ```
- *
- * @type {State}
- */
- function after(code) {
- if (markdownLineEnding(code)) {
- effects.exit('hardBreakEscape')
- return ok(code)
- }
- return nok(code)
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-core-commonmark/lib/code-text.js
-/**
- * @typedef {import('micromark-util-types').Construct} Construct
- * @typedef {import('micromark-util-types').Previous} Previous
- * @typedef {import('micromark-util-types').Resolver} Resolver
- * @typedef {import('micromark-util-types').State} State
- * @typedef {import('micromark-util-types').Token} Token
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- * @typedef {import('micromark-util-types').Tokenizer} Tokenizer
- */
-
-
-/** @type {Construct} */
-const codeText = {
- name: 'codeText',
- tokenize: tokenizeCodeText,
- resolve: resolveCodeText,
- previous
-}
-
-// To do: next major: don’t resolve, like `markdown-rs`.
-/** @type {Resolver} */
-function resolveCodeText(events) {
- let tailExitIndex = events.length - 4
- let headEnterIndex = 3
- /** @type {number} */
- let index
- /** @type {number | undefined} */
- let enter
-
- // If we start and end with an EOL or a space.
- if (
- (events[headEnterIndex][1].type === 'lineEnding' ||
- events[headEnterIndex][1].type === 'space') &&
- (events[tailExitIndex][1].type === 'lineEnding' ||
- events[tailExitIndex][1].type === 'space')
- ) {
- index = headEnterIndex
-
- // And we have data.
- while (++index < tailExitIndex) {
- if (events[index][1].type === 'codeTextData') {
- // Then we have padding.
- events[headEnterIndex][1].type = 'codeTextPadding'
- events[tailExitIndex][1].type = 'codeTextPadding'
- headEnterIndex += 2
- tailExitIndex -= 2
- break
- }
- }
- }
-
- // Merge adjacent spaces and data.
- index = headEnterIndex - 1
- tailExitIndex++
- while (++index <= tailExitIndex) {
- if (enter === undefined) {
- if (index !== tailExitIndex && events[index][1].type !== 'lineEnding') {
- enter = index
- }
- } else if (
- index === tailExitIndex ||
- events[index][1].type === 'lineEnding'
- ) {
- events[enter][1].type = 'codeTextData'
- if (index !== enter + 2) {
- events[enter][1].end = events[index - 1][1].end
- events.splice(enter + 2, index - enter - 2)
- tailExitIndex -= index - enter - 2
- index = enter + 2
- }
- enter = undefined
- }
- }
- return events
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Previous}
- */
-function previous(code) {
- // If there is a previous code, there will always be a tail.
- return (
- code !== 96 ||
- this.events[this.events.length - 1][1].type === 'characterEscape'
- )
-}
-
-/**
- * @this {TokenizeContext}
- * @type {Tokenizer}
- */
-function tokenizeCodeText(effects, ok, nok) {
- const self = this
- let sizeOpen = 0
- /** @type {number} */
- let size
- /** @type {Token} */
- let token
- return start
-
- /**
- * Start of code (text).
- *
- * ```markdown
- * > | `a`
- * ^
- * > | \`a`
- * ^
- * ```
- *
- * @type {State}
- */
- function start(code) {
- effects.enter('codeText')
- effects.enter('codeTextSequence')
- return sequenceOpen(code)
- }
-
- /**
- * In opening sequence.
- *
- * ```markdown
- * > | `a`
- * ^
- * ```
- *
- * @type {State}
- */
- function sequenceOpen(code) {
- if (code === 96) {
- effects.consume(code)
- sizeOpen++
- return sequenceOpen
- }
- effects.exit('codeTextSequence')
- return between(code)
- }
-
- /**
- * Between something and something else.
- *
- * ```markdown
- * > | `a`
- * ^^
- * ```
- *
- * @type {State}
- */
- function between(code) {
- // EOF.
- if (code === null) {
- return nok(code)
- }
-
- // To do: next major: don’t do spaces in resolve, but when compiling,
- // like `markdown-rs`.
- // Tabs don’t work, and virtual spaces don’t make sense.
- if (code === 32) {
- effects.enter('space')
- effects.consume(code)
- effects.exit('space')
- return between
- }
-
- // Closing fence? Could also be data.
- if (code === 96) {
- token = effects.enter('codeTextSequence')
- size = 0
- return sequenceClose(code)
- }
- if (markdownLineEnding(code)) {
- effects.enter('lineEnding')
- effects.consume(code)
- effects.exit('lineEnding')
- return between
- }
-
- // Data.
- effects.enter('codeTextData')
- return data(code)
- }
-
- /**
- * In data.
- *
- * ```markdown
- * > | `a`
- * ^
- * ```
- *
- * @type {State}
- */
- function data(code) {
- if (
- code === null ||
- code === 32 ||
- code === 96 ||
- markdownLineEnding(code)
- ) {
- effects.exit('codeTextData')
- return between(code)
- }
- effects.consume(code)
- return data
- }
-
- /**
- * In closing sequence.
- *
- * ```markdown
- * > | `a`
- * ^
- * ```
- *
- * @type {State}
- */
- function sequenceClose(code) {
- // More.
- if (code === 96) {
- effects.consume(code)
- size++
- return sequenceClose
- }
-
- // Done!
- if (size === sizeOpen) {
- effects.exit('codeTextSequence')
- effects.exit('codeText')
- return ok(code)
- }
-
- // More or less accents: mark as data.
- token.type = 'codeTextData'
- return data(code)
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark/lib/constructs.js
-/**
- * @typedef {import('micromark-util-types').Extension} Extension
- */
-
-
-
-
-/** @satisfies {Extension['document']} */
-const constructs_document = {
- [42]: list,
- [43]: list,
- [45]: list,
- [48]: list,
- [49]: list,
- [50]: list,
- [51]: list,
- [52]: list,
- [53]: list,
- [54]: list,
- [55]: list,
- [56]: list,
- [57]: list,
- [62]: blockQuote
-}
-
-/** @satisfies {Extension['contentInitial']} */
-const contentInitial = {
- [91]: definition
-}
-
-/** @satisfies {Extension['flowInitial']} */
-const flowInitial = {
- [-2]: codeIndented,
- [-1]: codeIndented,
- [32]: codeIndented
-}
-
-/** @satisfies {Extension['flow']} */
-const constructs_flow = {
- [35]: headingAtx,
- [42]: thematicBreak,
- [45]: [setextUnderline, thematicBreak],
- [60]: htmlFlow,
- [61]: setextUnderline,
- [95]: thematicBreak,
- [96]: codeFenced,
- [126]: codeFenced
-}
-
-/** @satisfies {Extension['string']} */
-const constructs_string = {
- [38]: characterReference,
- [92]: characterEscape
-}
-
-/** @satisfies {Extension['text']} */
-const constructs_text = {
- [-5]: lineEnding,
- [-4]: lineEnding,
- [-3]: lineEnding,
- [33]: labelStartImage,
- [38]: characterReference,
- [42]: attention,
- [60]: [autolink, htmlText],
- [91]: labelStartLink,
- [92]: [hardBreakEscape, characterEscape],
- [93]: labelEnd,
- [95]: attention,
- [96]: codeText
-}
-
-/** @satisfies {Extension['insideSpan']} */
-const insideSpan = {
- null: [attention, resolver]
-}
-
-/** @satisfies {Extension['attentionMarkers']} */
-const attentionMarkers = {
- null: [42, 95]
-}
-
-/** @satisfies {Extension['disable']} */
-const disable = {
- null: []
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark/lib/parse.js
-/**
- * @typedef {import('micromark-util-types').Create} Create
- * @typedef {import('micromark-util-types').FullNormalizedExtension} FullNormalizedExtension
- * @typedef {import('micromark-util-types').InitialConstruct} InitialConstruct
- * @typedef {import('micromark-util-types').ParseContext} ParseContext
- * @typedef {import('micromark-util-types').ParseOptions} ParseOptions
- */
-
-
-
-
-
-
-
-
-
-/**
- * @param {ParseOptions | null | undefined} [options]
- * @returns {ParseContext}
- */
-function parse(options) {
- const settings = options || {}
- const constructs =
- /** @type {FullNormalizedExtension} */
- combineExtensions([constructs_namespaceObject, ...(settings.extensions || [])])
-
- /** @type {ParseContext} */
- const parser = {
- defined: [],
- lazy: {},
- constructs,
- content: create(content),
- document: create(document_document),
- flow: create(flow),
- string: create(string),
- text: create(text_text)
- }
- return parser
-
- /**
- * @param {InitialConstruct} initial
- */
- function create(initial) {
- return creator
- /** @type {Create} */
- function creator(from) {
- return createTokenizer(parser, initial, from)
- }
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark/lib/preprocess.js
-/**
- * @typedef {import('micromark-util-types').Chunk} Chunk
- * @typedef {import('micromark-util-types').Code} Code
- * @typedef {import('micromark-util-types').Encoding} Encoding
- * @typedef {import('micromark-util-types').Value} Value
- */
-
-/**
- * @callback Preprocessor
- * @param {Value} value
- * @param {Encoding | null | undefined} [encoding]
- * @param {boolean | null | undefined} [end=false]
- * @returns {Array<Chunk>}
- */
-
-const search = /[\0\t\n\r]/g
-
-/**
- * @returns {Preprocessor}
- */
-function preprocess() {
- let column = 1
- let buffer = ''
- /** @type {boolean | undefined} */
- let start = true
- /** @type {boolean | undefined} */
- let atCarriageReturn
- return preprocessor
-
- /** @type {Preprocessor} */
- function preprocessor(value, encoding, end) {
- /** @type {Array<Chunk>} */
- const chunks = []
- /** @type {RegExpMatchArray | null} */
- let match
- /** @type {number} */
- let next
- /** @type {number} */
- let startPosition
- /** @type {number} */
- let endPosition
- /** @type {Code} */
- let code
-
- // @ts-expect-error `Buffer` does allow an encoding.
- value = buffer + value.toString(encoding)
- startPosition = 0
- buffer = ''
- if (start) {
- // To do: `markdown-rs` actually parses BOMs (byte order mark).
- if (value.charCodeAt(0) === 65279) {
- startPosition++
- }
- start = undefined
- }
- while (startPosition < value.length) {
- search.lastIndex = startPosition
- match = search.exec(value)
- endPosition =
- match && match.index !== undefined ? match.index : value.length
- code = value.charCodeAt(endPosition)
- if (!match) {
- buffer = value.slice(startPosition)
- break
- }
- if (code === 10 && startPosition === endPosition && atCarriageReturn) {
- chunks.push(-3)
- atCarriageReturn = undefined
- } else {
- if (atCarriageReturn) {
- chunks.push(-5)
- atCarriageReturn = undefined
- }
- if (startPosition < endPosition) {
- chunks.push(value.slice(startPosition, endPosition))
- column += endPosition - startPosition
- }
- switch (code) {
- case 0: {
- chunks.push(65533)
- column++
- break
- }
- case 9: {
- next = Math.ceil(column / 4) * 4
- chunks.push(-2)
- while (column++ < next) chunks.push(-1)
- break
- }
- case 10: {
- chunks.push(-4)
- column = 1
- break
- }
- default: {
- atCarriageReturn = true
- column = 1
- }
- }
- }
- startPosition = endPosition + 1
- }
- if (end) {
- if (atCarriageReturn) chunks.push(-5)
- if (buffer) chunks.push(buffer)
- chunks.push(null)
- }
- return chunks
- }
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark/lib/postprocess.js
-/**
- * @typedef {import('micromark-util-types').Event} Event
- */
-
-
-
-/**
- * @param {Array<Event>} events
- * @returns {Array<Event>}
- */
-function postprocess(events) {
- while (!subtokenize(events)) {
- // Empty
- }
- return events
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-util-decode-numeric-character-reference/index.js
-/**
- * Turn the number (in string form as either hexa- or plain decimal) coming from
- * a numeric character reference into a character.
- *
- * Sort of like `String.fromCharCode(Number.parseInt(value, base))`, but makes
- * non-characters and control characters safe.
- *
- * @param {string} value
- * Value to decode.
- * @param {number} base
- * Numeric base.
- * @returns {string}
- * Character.
- */
-function decodeNumericCharacterReference(value, base) {
- const code = Number.parseInt(value, base)
- if (
- // C0 except for HT, LF, FF, CR, space.
- code < 9 ||
- code === 11 ||
- (code > 13 && code < 32) ||
- // Control character (DEL) of C0, and C1 controls.
- (code > 126 && code < 160) ||
- // Lone high surrogates and low surrogates.
- (code > 55295 && code < 57344) ||
- // Noncharacters.
- (code > 64975 && code < 65008) /* eslint-disable no-bitwise */ ||
- (code & 65535) === 65535 ||
- (code & 65535) === 65534 /* eslint-enable no-bitwise */ ||
- // Out of range
- code > 1114111
- ) {
- return '\uFFFD'
- }
- return String.fromCharCode(code)
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/micromark-util-decode-string/index.js
-
-
-const characterEscapeOrReference =
- /\\([!-/:-@[-`{-~])|&(#(?:\d{1,7}|x[\da-f]{1,6})|[\da-z]{1,31});/gi
-
-/**
- * Decode markdown strings (which occur in places such as fenced code info
- * strings, destinations, labels, and titles).
- *
- * The “string” content type allows character escapes and -references.
- * This decodes those.
- *
- * @param {string} value
- * Value to decode.
- * @returns {string}
- * Decoded value.
- */
-function decodeString(value) {
- return value.replace(characterEscapeOrReference, decode)
-}
-
-/**
- * @param {string} $0
- * @param {string} $1
- * @param {string} $2
- * @returns {string}
- */
-function decode($0, $1, $2) {
- if ($1) {
- // Escape.
- return $1
- }
-
- // Reference.
- const head = $2.charCodeAt(0)
- if (head === 35) {
- const head = $2.charCodeAt(1)
- const hex = head === 120 || head === 88
- return decodeNumericCharacterReference($2.slice(hex ? 2 : 1), hex ? 16 : 10)
- }
- return decodeNamedCharacterReference($2) || $0
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/unist-util-stringify-position/lib/index.js
-/**
- * @typedef {import('unist').Node} Node
- * @typedef {import('unist').Point} Point
- * @typedef {import('unist').Position} Position
- */
-
-/**
- * @typedef NodeLike
- * @property {string} type
- * @property {PositionLike | null | undefined} [position]
- *
- * @typedef PositionLike
- * @property {PointLike | null | undefined} [start]
- * @property {PointLike | null | undefined} [end]
- *
- * @typedef PointLike
- * @property {number | null | undefined} [line]
- * @property {number | null | undefined} [column]
- * @property {number | null | undefined} [offset]
- */
-
-/**
- * Serialize the positional info of a point, position (start and end points),
- * or node.
- *
- * @param {Node | NodeLike | Position | PositionLike | Point | PointLike | null | undefined} [value]
- * Node, position, or point.
- * @returns {string}
- * Pretty printed positional info of a node (`string`).
- *
- * In the format of a range `ls:cs-le:ce` (when given `node` or `position`)
- * or a point `l:c` (when given `point`), where `l` stands for line, `c` for
- * column, `s` for `start`, and `e` for end.
- * An empty string (`''`) is returned if the given value is neither `node`,
- * `position`, nor `point`.
- */
-function stringifyPosition(value) {
- // Nothing.
- if (!value || typeof value !== 'object') {
- return ''
- }
-
- // Node.
- if ('position' in value || 'type' in value) {
- return position(value.position)
- }
-
- // Position.
- if ('start' in value || 'end' in value) {
- return position(value)
- }
-
- // Point.
- if ('line' in value || 'column' in value) {
- return point(value)
- }
-
- // ?
- return ''
-}
-
-/**
- * @param {Point | PointLike | null | undefined} point
- * @returns {string}
- */
-function point(point) {
- return index(point && point.line) + ':' + index(point && point.column)
-}
-
-/**
- * @param {Position | PositionLike | null | undefined} pos
- * @returns {string}
- */
-function position(pos) {
- return point(pos && pos.start) + '-' + point(pos && pos.end)
-}
-
-/**
- * @param {number | null | undefined} value
- * @returns {number}
- */
-function index(value) {
- return value && typeof value === 'number' ? value : 1
-}
-
-;// CONCATENATED MODULE: ./node_modules/mermaid/node_modules/mdast-util-from-markdown/lib/index.js
-/**
- * @typedef {import('micromark-util-types').Encoding} Encoding
- * @typedef {import('micromark-util-types').Event} Event
- * @typedef {import('micromark-util-types').ParseOptions} ParseOptions
- * @typedef {import('micromark-util-types').Token} Token
- * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext
- * @typedef {import('micromark-util-types').Value} Value
- *
- * @typedef {import('unist').Parent} UnistParent
- * @typedef {import('unist').Point} Point
- *
- * @typedef {import('mdast').PhrasingContent} PhrasingContent
- * @typedef {import('mdast').StaticPhrasingContent} StaticPhrasingContent
- * @typedef {import('mdast').Content} Content
- * @typedef {import('mdast').Break} Break
- * @typedef {import('mdast').Blockquote} Blockquote
- * @typedef {import('mdast').Code} Code
- * @typedef {import('mdast').Definition} Definition
- * @typedef {import('mdast').Emphasis} Emphasis
- * @typedef {import('mdast').Heading} Heading
- * @typedef {import('mdast').HTML} HTML
- * @typedef {import('mdast').Image} Image
- * @typedef {import('mdast').ImageReference} ImageReference
- * @typedef {import('mdast').InlineCode} InlineCode
- * @typedef {import('mdast').Link} Link
- * @typedef {import('mdast').LinkReference} LinkReference
- * @typedef {import('mdast').List} List
- * @typedef {import('mdast').ListItem} ListItem
- * @typedef {import('mdast').Paragraph} Paragraph
- * @typedef {import('mdast').Root} Root
- * @typedef {import('mdast').Strong} Strong
- * @typedef {import('mdast').Text} Text
- * @typedef {import('mdast').ThematicBreak} ThematicBreak
- * @typedef {import('mdast').ReferenceType} ReferenceType
- * @typedef {import('../index.js').CompileData} CompileData
- */
-
-/**
- * @typedef {Root | Content} Node
- * @typedef {Extract<Node, UnistParent>} Parent
- *
- * @typedef {Omit<UnistParent, 'type' | 'children'> & {type: 'fragment', children: Array<PhrasingContent>}} Fragment
- */
-
-/**
- * @callback Transform
- * Extra transform, to change the AST afterwards.
- * @param {Root} tree
- * Tree to transform.
- * @returns {Root | undefined | null | void}
- * New tree or nothing (in which case the current tree is used).
- *
- * @callback Handle
- * Handle a token.
- * @param {CompileContext} this
- * Context.
- * @param {Token} token
- * Current token.
- * @returns {void}
- * Nothing.
- *
- * @typedef {Record<string, Handle>} Handles
- * Token types mapping to handles
- *
- * @callback OnEnterError
- * Handle the case where the `right` token is open, but it is closed (by the
- * `left` token) or because we reached the end of the document.
- * @param {Omit<CompileContext, 'sliceSerialize'>} this
- * Context.
- * @param {Token | undefined} left
- * Left token.
- * @param {Token} right
- * Right token.
- * @returns {void}
- * Nothing.
- *
- * @callback OnExitError
- * Handle the case where the `right` token is open but it is closed by
- * exiting the `left` token.
- * @param {Omit<CompileContext, 'sliceSerialize'>} this
- * Context.
- * @param {Token} left
- * Left token.
- * @param {Token} right
- * Right token.
- * @returns {void}
- * Nothing.
- *
- * @typedef {[Token, OnEnterError | undefined]} TokenTuple
- * Open token on the stack, with an optional error handler for when
- * that token isn’t closed properly.
- */
-
-/**
- * @typedef Config
- * Configuration.
- *
- * We have our defaults, but extensions will add more.
- * @property {Array<string>} canContainEols
- * Token types where line endings are used.
- * @property {Handles} enter
- * Opening handles.
- * @property {Handles} exit
- * Closing handles.
- * @property {Array<Transform>} transforms
- * Tree transforms.
- *
- * @typedef {Partial<Config>} Extension
- * Change how markdown tokens from micromark are turned into mdast.
- *
- * @typedef CompileContext
- * mdast compiler context.
- * @property {Array<Node | Fragment>} stack
- * Stack of nodes.
- * @property {Array<TokenTuple>} tokenStack
- * Stack of tokens.
- * @property {<Key extends keyof CompileData>(key: Key) => CompileData[Key]} getData
- * Get data from the key/value store.
- * @property {<Key extends keyof CompileData>(key: Key, value?: CompileData[Key]) => void} setData
- * Set data into the key/value store.
- * @property {(this: CompileContext) => void} buffer
- * Capture some of the output data.
- * @property {(this: CompileContext) => string} resume
- * Stop capturing and access the output data.
- * @property {<Kind extends Node>(this: CompileContext, node: Kind, token: Token, onError?: OnEnterError) => Kind} enter
- * Enter a token.
- * @property {(this: CompileContext, token: Token, onError?: OnExitError) => Node} exit
- * Exit a token.
- * @property {TokenizeContext['sliceSerialize']} sliceSerialize
- * Get the string value of a token.
- * @property {Config} config
- * Configuration.
- *
- * @typedef FromMarkdownOptions
- * Configuration for how to build mdast.
- * @property {Array<Extension | Array<Extension>> | null | undefined} [mdastExtensions]
- * Extensions for this utility to change how tokens are turned into a tree.
- *
- * @typedef {ParseOptions & FromMarkdownOptions} Options
- * Configuration.
- */
-
-// To do: micromark: create a registry of tokens?
-// To do: next major: don’t return given `Node` from `enter`.
-// To do: next major: remove setter/getter.
-
-
-
-
-
-
-
-
-
-
-const lib_own = {}.hasOwnProperty
-
-/**
- * @param value
- * Markdown to parse.
- * @param encoding
- * Character encoding for when `value` is `Buffer`.
- * @param options
- * Configuration.
- * @returns
- * mdast tree.
- */
-const fromMarkdown =
- /**
- * @type {(
- * ((value: Value, encoding: Encoding, options?: Options | null | undefined) => Root) &
- * ((value: Value, options?: Options | null | undefined) => Root)
- * )}
- */
-
- /**
- * @param {Value} value
- * @param {Encoding | Options | null | undefined} [encoding]
- * @param {Options | null | undefined} [options]
- * @returns {Root}
- */
- function (value, encoding, options) {
- if (typeof encoding !== 'string') {
- options = encoding
- encoding = undefined
- }
- return compiler(options)(
- postprocess(
- parse(options).document().write(preprocess()(value, encoding, true))
- )
- )
- }
-
-/**
- * Note this compiler only understand complete buffering, not streaming.
- *
- * @param {Options | null | undefined} [options]
- */
-function compiler(options) {
- /** @type {Config} */
- const config = {
- transforms: [],
- canContainEols: ['emphasis', 'fragment', 'heading', 'paragraph', 'strong'],
- enter: {
- autolink: opener(link),
- autolinkProtocol: onenterdata,
- autolinkEmail: onenterdata,
- atxHeading: opener(heading),
- blockQuote: opener(blockQuote),
- characterEscape: onenterdata,
- characterReference: onenterdata,
- codeFenced: opener(codeFlow),
- codeFencedFenceInfo: buffer,
- codeFencedFenceMeta: buffer,
- codeIndented: opener(codeFlow, buffer),
- codeText: opener(codeText, buffer),
- codeTextData: onenterdata,
- data: onenterdata,
- codeFlowValue: onenterdata,
- definition: opener(definition),
- definitionDestinationString: buffer,
- definitionLabelString: buffer,
- definitionTitleString: buffer,
- emphasis: opener(emphasis),
- hardBreakEscape: opener(hardBreak),
- hardBreakTrailing: opener(hardBreak),
- htmlFlow: opener(html, buffer),
- htmlFlowData: onenterdata,
- htmlText: opener(html, buffer),
- htmlTextData: onenterdata,
- image: opener(image),
- label: buffer,
- link: opener(link),
- listItem: opener(listItem),
- listItemValue: onenterlistitemvalue,
- listOrdered: opener(list, onenterlistordered),
- listUnordered: opener(list),
- paragraph: opener(paragraph),
- reference: onenterreference,
- referenceString: buffer,
- resourceDestinationString: buffer,
- resourceTitleString: buffer,
- setextHeading: opener(heading),
- strong: opener(strong),
- thematicBreak: opener(thematicBreak)
- },
- exit: {
- atxHeading: closer(),
- atxHeadingSequence: onexitatxheadingsequence,
- autolink: closer(),
- autolinkEmail: onexitautolinkemail,
- autolinkProtocol: onexitautolinkprotocol,
- blockQuote: closer(),
- characterEscapeValue: onexitdata,
- characterReferenceMarkerHexadecimal: onexitcharacterreferencemarker,
- characterReferenceMarkerNumeric: onexitcharacterreferencemarker,
- characterReferenceValue: onexitcharacterreferencevalue,
- codeFenced: closer(onexitcodefenced),
- codeFencedFence: onexitcodefencedfence,
- codeFencedFenceInfo: onexitcodefencedfenceinfo,
- codeFencedFenceMeta: onexitcodefencedfencemeta,
- codeFlowValue: onexitdata,
- codeIndented: closer(onexitcodeindented),
- codeText: closer(onexitcodetext),
- codeTextData: onexitdata,
- data: onexitdata,
- definition: closer(),
- definitionDestinationString: onexitdefinitiondestinationstring,
- definitionLabelString: onexitdefinitionlabelstring,
- definitionTitleString: onexitdefinitiontitlestring,
- emphasis: closer(),
- hardBreakEscape: closer(onexithardbreak),
- hardBreakTrailing: closer(onexithardbreak),
- htmlFlow: closer(onexithtmlflow),
- htmlFlowData: onexitdata,
- htmlText: closer(onexithtmltext),
- htmlTextData: onexitdata,
- image: closer(onexitimage),
- label: onexitlabel,
- labelText: onexitlabeltext,
- lineEnding: onexitlineending,
- link: closer(onexitlink),
- listItem: closer(),
- listOrdered: closer(),
- listUnordered: closer(),
- paragraph: closer(),
- referenceString: onexitreferencestring,
- resourceDestinationString: onexitresourcedestinationstring,
- resourceTitleString: onexitresourcetitlestring,
- resource: onexitresource,
- setextHeading: closer(onexitsetextheading),
- setextHeadingLineSequence: onexitsetextheadinglinesequence,
- setextHeadingText: onexitsetextheadingtext,
- strong: closer(),
- thematicBreak: closer()
- }
- }
- configure(config, (options || {}).mdastExtensions || [])
-
- /** @type {CompileData} */
- const data = {}
- return compile
-
- /**
- * Turn micromark events into an mdast tree.
- *
- * @param {Array<Event>} events
- * Events.
- * @returns {Root}
- * mdast tree.
- */
- function compile(events) {
- /** @type {Root} */
- let tree = {
- type: 'root',
- children: []
- }
- /** @type {Omit<CompileContext, 'sliceSerialize'>} */
- const context = {
- stack: [tree],
- tokenStack: [],
- config,
- enter,
- exit,
- buffer,
- resume,
- setData,
- getData
- }
- /** @type {Array<number>} */
- const listStack = []
- let index = -1
- while (++index < events.length) {
- // We preprocess lists to add `listItem` tokens, and to infer whether
- // items the list itself are spread out.
- if (
- events[index][1].type === 'listOrdered' ||
- events[index][1].type === 'listUnordered'
- ) {
- if (events[index][0] === 'enter') {
- listStack.push(index)
- } else {
- const tail = listStack.pop()
- index = prepareList(events, tail, index)
- }
- }
- }
- index = -1
- while (++index < events.length) {
- const handler = config[events[index][0]]
- if (lib_own.call(handler, events[index][1].type)) {
- handler[events[index][1].type].call(
- Object.assign(
- {
- sliceSerialize: events[index][2].sliceSerialize
- },
- context
- ),
- events[index][1]
- )
- }
- }
-
- // Handle tokens still being open.
- if (context.tokenStack.length > 0) {
- const tail = context.tokenStack[context.tokenStack.length - 1]
- const handler = tail[1] || defaultOnError
- handler.call(context, undefined, tail[0])
- }
-
- // Figure out `root` position.
- tree.position = {
- start: lib_point(
- events.length > 0
- ? events[0][1].start
- : {
- line: 1,
- column: 1,
- offset: 0
- }
- ),
- end: lib_point(
- events.length > 0
- ? events[events.length - 2][1].end
- : {
- line: 1,
- column: 1,
- offset: 0
- }
- )
- }
-
- // Call transforms.
- index = -1
- while (++index < config.transforms.length) {
- tree = config.transforms[index](tree) || tree
- }
- return tree
- }
-
- /**
- * @param {Array<Event>} events
- * @param {number} start
- * @param {number} length
- * @returns {number}
- */
- function prepareList(events, start, length) {
- let index = start - 1
- let containerBalance = -1
- let listSpread = false
- /** @type {Token | undefined} */
- let listItem
- /** @type {number | undefined} */
- let lineIndex
- /** @type {number | undefined} */
- let firstBlankLineIndex
- /** @type {boolean | undefined} */
- let atMarker
- while (++index <= length) {
- const event = events[index]
- if (
- event[1].type === 'listUnordered' ||
- event[1].type === 'listOrdered' ||
- event[1].type === 'blockQuote'
- ) {
- if (event[0] === 'enter') {
- containerBalance++
- } else {
- containerBalance--
- }
- atMarker = undefined
- } else if (event[1].type === 'lineEndingBlank') {
- if (event[0] === 'enter') {
- if (
- listItem &&
- !atMarker &&
- !containerBalance &&
- !firstBlankLineIndex
- ) {
- firstBlankLineIndex = index
- }
- atMarker = undefined
- }
- } else if (
- event[1].type === 'linePrefix' ||
- event[1].type === 'listItemValue' ||
- event[1].type === 'listItemMarker' ||
- event[1].type === 'listItemPrefix' ||
- event[1].type === 'listItemPrefixWhitespace'
- ) {
- // Empty.
- } else {
- atMarker = undefined
- }
- if (
- (!containerBalance &&
- event[0] === 'enter' &&
- event[1].type === 'listItemPrefix') ||
- (containerBalance === -1 &&
- event[0] === 'exit' &&
- (event[1].type === 'listUnordered' ||
- event[1].type === 'listOrdered'))
- ) {
- if (listItem) {
- let tailIndex = index
- lineIndex = undefined
- while (tailIndex--) {
- const tailEvent = events[tailIndex]
- if (
- tailEvent[1].type === 'lineEnding' ||
- tailEvent[1].type === 'lineEndingBlank'
- ) {
- if (tailEvent[0] === 'exit') continue
- if (lineIndex) {
- events[lineIndex][1].type = 'lineEndingBlank'
- listSpread = true
- }
- tailEvent[1].type = 'lineEnding'
- lineIndex = tailIndex
- } else if (
- tailEvent[1].type === 'linePrefix' ||
- tailEvent[1].type === 'blockQuotePrefix' ||
- tailEvent[1].type === 'blockQuotePrefixWhitespace' ||
- tailEvent[1].type === 'blockQuoteMarker' ||
- tailEvent[1].type === 'listItemIndent'
- ) {
- // Empty
- } else {
- break
- }
- }
- if (
- firstBlankLineIndex &&
- (!lineIndex || firstBlankLineIndex < lineIndex)
- ) {
- listItem._spread = true
- }
-
- // Fix position.
- listItem.end = Object.assign(
- {},
- lineIndex ? events[lineIndex][1].start : event[1].end
- )
- events.splice(lineIndex || index, 0, ['exit', listItem, event[2]])
- index++
- length++
- }
-
- // Create a new list item.
- if (event[1].type === 'listItemPrefix') {
- listItem = {
- type: 'listItem',
- _spread: false,
- start: Object.assign({}, event[1].start),
- // @ts-expect-error: we’ll add `end` in a second.
- end: undefined
- }
- // @ts-expect-error: `listItem` is most definitely defined, TS...
- events.splice(index, 0, ['enter', listItem, event[2]])
- index++
- length++
- firstBlankLineIndex = undefined
- atMarker = true
- }
- }
- }
- events[start][1]._spread = listSpread
- return length
- }
-
- /**
- * Set data.
- *
- * @template {keyof CompileData} Key
- * Field type.
- * @param {Key} key
- * Key of field.
- * @param {CompileData[Key]} [value]
- * New value.
- * @returns {void}
- * Nothing.
- */
- function setData(key, value) {
- data[key] = value
- }
-
- /**
- * Get data.
- *
- * @template {keyof CompileData} Key
- * Field type.
- * @param {Key} key
- * Key of field.
- * @returns {CompileData[Key]}
- * Value.
- */
- function getData(key) {
- return data[key]
- }
-
- /**
- * Create an opener handle.
- *
- * @param {(token: Token) => Node} create
- * Create a node.
- * @param {Handle} [and]
- * Optional function to also run.
- * @returns {Handle}
- * Handle.
- */
- function opener(create, and) {
- return open
-
- /**
- * @this {CompileContext}
- * @param {Token} token
- * @returns {void}
- */
- function open(token) {
- enter.call(this, create(token), token)
- if (and) and.call(this, token)
- }
- }
-
- /**
- * @this {CompileContext}
- * @returns {void}
- */
- function buffer() {
- this.stack.push({
- type: 'fragment',
- children: []
- })
- }
-
- /**
- * @template {Node} Kind
- * Node type.
- * @this {CompileContext}
- * Context.
- * @param {Kind} node
- * Node to enter.
- * @param {Token} token
- * Corresponding token.
- * @param {OnEnterError | undefined} [errorHandler]
- * Handle the case where this token is open, but it is closed by something else.
- * @returns {Kind}
- * The given node.
- */
- function enter(node, token, errorHandler) {
- const parent = this.stack[this.stack.length - 1]
- // @ts-expect-error: Assume `Node` can exist as a child of `parent`.
- parent.children.push(node)
- this.stack.push(node)
- this.tokenStack.push([token, errorHandler])
- // @ts-expect-error: `end` will be patched later.
- node.position = {
- start: lib_point(token.start)
- }
- return node
- }
-
- /**
- * Create a closer handle.
- *
- * @param {Handle} [and]
- * Optional function to also run.
- * @returns {Handle}
- * Handle.
- */
- function closer(and) {
- return close
-
- /**
- * @this {CompileContext}
- * @param {Token} token
- * @returns {void}
- */
- function close(token) {
- if (and) and.call(this, token)
- exit.call(this, token)
- }
- }
-
- /**
- * @this {CompileContext}
- * Context.
- * @param {Token} token
- * Corresponding token.
- * @param {OnExitError | undefined} [onExitError]
- * Handle the case where another token is open.
- * @returns {Node}
- * The closed node.
- */
- function exit(token, onExitError) {
- const node = this.stack.pop()
- const open = this.tokenStack.pop()
- if (!open) {
- throw new Error(
- 'Cannot close `' +
- token.type +
- '` (' +
- stringifyPosition({
- start: token.start,
- end: token.end
- }) +
- '): it’s not open'
- )
- } else if (open[0].type !== token.type) {
- if (onExitError) {
- onExitError.call(this, token, open[0])
- } else {
- const handler = open[1] || defaultOnError
- handler.call(this, token, open[0])
- }
- }
- node.position.end = lib_point(token.end)
- return node
- }
-
- /**
- * @this {CompileContext}
- * @returns {string}
- */
- function resume() {
- return lib_toString(this.stack.pop())
- }
-
- //
- // Handlers.
- //
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
- function onenterlistordered() {
- setData('expectingFirstListItemValue', true)
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
- function onenterlistitemvalue(token) {
- if (getData('expectingFirstListItemValue')) {
- const ancestor = this.stack[this.stack.length - 2]
- ancestor.start = Number.parseInt(this.sliceSerialize(token), 10)
- setData('expectingFirstListItemValue')
- }
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
- function onexitcodefencedfenceinfo() {
- const data = this.resume()
- const node = this.stack[this.stack.length - 1]
- node.lang = data
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
- function onexitcodefencedfencemeta() {
- const data = this.resume()
- const node = this.stack[this.stack.length - 1]
- node.meta = data
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
- function onexitcodefencedfence() {
- // Exit if this is the closing fence.
- if (getData('flowCodeInside')) return
- this.buffer()
- setData('flowCodeInside', true)
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
- function onexitcodefenced() {
- const data = this.resume()
- const node = this.stack[this.stack.length - 1]
- node.value = data.replace(/^(\r?\n|\r)|(\r?\n|\r)$/g, '')
- setData('flowCodeInside')
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
- function onexitcodeindented() {
- const data = this.resume()
- const node = this.stack[this.stack.length - 1]
- node.value = data.replace(/(\r?\n|\r)$/g, '')
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
- function onexitdefinitionlabelstring(token) {
- const label = this.resume()
- const node = this.stack[this.stack.length - 1]
- node.label = label
- node.identifier = normalizeIdentifier(
- this.sliceSerialize(token)
- ).toLowerCase()
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
- function onexitdefinitiontitlestring() {
- const data = this.resume()
- const node = this.stack[this.stack.length - 1]
- node.title = data
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
- function onexitdefinitiondestinationstring() {
- const data = this.resume()
- const node = this.stack[this.stack.length - 1]
- node.url = data
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
- function onexitatxheadingsequence(token) {
- const node = this.stack[this.stack.length - 1]
- if (!node.depth) {
- const depth = this.sliceSerialize(token).length
- node.depth = depth
- }
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
- function onexitsetextheadingtext() {
- setData('setextHeadingSlurpLineEnding', true)
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
- function onexitsetextheadinglinesequence(token) {
- const node = this.stack[this.stack.length - 1]
- node.depth = this.sliceSerialize(token).charCodeAt(0) === 61 ? 1 : 2
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
- function onexitsetextheading() {
- setData('setextHeadingSlurpLineEnding')
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
-
- function onenterdata(token) {
- const node = this.stack[this.stack.length - 1]
- let tail = node.children[node.children.length - 1]
- if (!tail || tail.type !== 'text') {
- // Add a new text node.
- tail = text()
- // @ts-expect-error: we’ll add `end` later.
- tail.position = {
- start: lib_point(token.start)
- }
- // @ts-expect-error: Assume `parent` accepts `text`.
- node.children.push(tail)
- }
- this.stack.push(tail)
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
-
- function onexitdata(token) {
- const tail = this.stack.pop()
- tail.value += this.sliceSerialize(token)
- tail.position.end = lib_point(token.end)
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
-
- function onexitlineending(token) {
- const context = this.stack[this.stack.length - 1]
- // If we’re at a hard break, include the line ending in there.
- if (getData('atHardBreak')) {
- const tail = context.children[context.children.length - 1]
- tail.position.end = lib_point(token.end)
- setData('atHardBreak')
- return
- }
- if (
- !getData('setextHeadingSlurpLineEnding') &&
- config.canContainEols.includes(context.type)
- ) {
- onenterdata.call(this, token)
- onexitdata.call(this, token)
- }
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
-
- function onexithardbreak() {
- setData('atHardBreak', true)
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
-
- function onexithtmlflow() {
- const data = this.resume()
- const node = this.stack[this.stack.length - 1]
- node.value = data
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
-
- function onexithtmltext() {
- const data = this.resume()
- const node = this.stack[this.stack.length - 1]
- node.value = data
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
-
- function onexitcodetext() {
- const data = this.resume()
- const node = this.stack[this.stack.length - 1]
- node.value = data
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
-
- function onexitlink() {
- const node = this.stack[this.stack.length - 1]
- // Note: there are also `identifier` and `label` fields on this link node!
- // These are used / cleaned here.
- // To do: clean.
- if (getData('inReference')) {
- /** @type {ReferenceType} */
- const referenceType = getData('referenceType') || 'shortcut'
- node.type += 'Reference'
- // @ts-expect-error: mutate.
- node.referenceType = referenceType
- // @ts-expect-error: mutate.
- delete node.url
- delete node.title
- } else {
- // @ts-expect-error: mutate.
- delete node.identifier
- // @ts-expect-error: mutate.
- delete node.label
- }
- setData('referenceType')
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
-
- function onexitimage() {
- const node = this.stack[this.stack.length - 1]
- // Note: there are also `identifier` and `label` fields on this link node!
- // These are used / cleaned here.
- // To do: clean.
- if (getData('inReference')) {
- /** @type {ReferenceType} */
- const referenceType = getData('referenceType') || 'shortcut'
- node.type += 'Reference'
- // @ts-expect-error: mutate.
- node.referenceType = referenceType
- // @ts-expect-error: mutate.
- delete node.url
- delete node.title
- } else {
- // @ts-expect-error: mutate.
- delete node.identifier
- // @ts-expect-error: mutate.
- delete node.label
- }
- setData('referenceType')
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
-
- function onexitlabeltext(token) {
- const string = this.sliceSerialize(token)
- const ancestor = this.stack[this.stack.length - 2]
- // @ts-expect-error: stash this on the node, as it might become a reference
- // later.
- ancestor.label = decodeString(string)
- // @ts-expect-error: same as above.
- ancestor.identifier = normalizeIdentifier(string).toLowerCase()
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
-
- function onexitlabel() {
- const fragment = this.stack[this.stack.length - 1]
- const value = this.resume()
- const node = this.stack[this.stack.length - 1]
- // Assume a reference.
- setData('inReference', true)
- if (node.type === 'link') {
- /** @type {Array<StaticPhrasingContent>} */
- // @ts-expect-error: Assume static phrasing content.
- const children = fragment.children
- node.children = children
- } else {
- node.alt = value
- }
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
-
- function onexitresourcedestinationstring() {
- const data = this.resume()
- const node = this.stack[this.stack.length - 1]
- node.url = data
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
-
- function onexitresourcetitlestring() {
- const data = this.resume()
- const node = this.stack[this.stack.length - 1]
- node.title = data
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
-
- function onexitresource() {
- setData('inReference')
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
-
- function onenterreference() {
- setData('referenceType', 'collapsed')
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
-
- function onexitreferencestring(token) {
- const label = this.resume()
- const node = this.stack[this.stack.length - 1]
- // @ts-expect-error: stash this on the node, as it might become a reference
- // later.
- node.label = label
- // @ts-expect-error: same as above.
- node.identifier = normalizeIdentifier(
- this.sliceSerialize(token)
- ).toLowerCase()
- setData('referenceType', 'full')
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
-
- function onexitcharacterreferencemarker(token) {
- setData('characterReferenceType', token.type)
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
- function onexitcharacterreferencevalue(token) {
- const data = this.sliceSerialize(token)
- const type = getData('characterReferenceType')
- /** @type {string} */
- let value
- if (type) {
- value = decodeNumericCharacterReference(
- data,
- type === 'characterReferenceMarkerNumeric' ? 10 : 16
- )
- setData('characterReferenceType')
- } else {
- const result = decodeNamedCharacterReference(data)
- value = result
- }
- const tail = this.stack.pop()
- tail.value += value
- tail.position.end = lib_point(token.end)
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
- function onexitautolinkprotocol(token) {
- onexitdata.call(this, token)
- const node = this.stack[this.stack.length - 1]
- node.url = this.sliceSerialize(token)
- }
-
- /**
- * @this {CompileContext}
- * @type {Handle}
- */
- function onexitautolinkemail(token) {
- onexitdata.call(this, token)
- const node = this.stack[this.stack.length - 1]
- node.url = 'mailto:' + this.sliceSerialize(token)
- }
-
- //
- // Creaters.
- //
-
- /** @returns {Blockquote} */
- function blockQuote() {
- return {
- type: 'blockquote',
- children: []
- }
- }
-
- /** @returns {Code} */
- function codeFlow() {
- return {
- type: 'code',
- lang: null,
- meta: null,
- value: ''
- }
- }
-
- /** @returns {InlineCode} */
- function codeText() {
- return {
- type: 'inlineCode',
- value: ''
- }
- }
-
- /** @returns {Definition} */
- function definition() {
- return {
- type: 'definition',
- identifier: '',
- label: null,
- title: null,
- url: ''
- }
- }
-
- /** @returns {Emphasis} */
- function emphasis() {
- return {
- type: 'emphasis',
- children: []
- }
- }
-
- /** @returns {Heading} */
- function heading() {
- // @ts-expect-error `depth` will be set later.
- return {
- type: 'heading',
- depth: undefined,
- children: []
- }
- }
-
- /** @returns {Break} */
- function hardBreak() {
- return {
- type: 'break'
- }
- }
-
- /** @returns {HTML} */
- function html() {
- return {
- type: 'html',
- value: ''
- }
- }
-
- /** @returns {Image} */
- function image() {
- return {
- type: 'image',
- title: null,
- url: '',
- alt: null
- }
- }
-
- /** @returns {Link} */
- function link() {
- return {
- type: 'link',
- title: null,
- url: '',
- children: []
- }
- }
-
- /**
- * @param {Token} token
- * @returns {List}
- */
- function list(token) {
- return {
- type: 'list',
- ordered: token.type === 'listOrdered',
- start: null,
- spread: token._spread,
- children: []
- }
- }
-
- /**
- * @param {Token} token
- * @returns {ListItem}
- */
- function listItem(token) {
- return {
- type: 'listItem',
- spread: token._spread,
- checked: null,
- children: []
- }
- }
-
- /** @returns {Paragraph} */
- function paragraph() {
- return {
- type: 'paragraph',
- children: []
- }
- }
-
- /** @returns {Strong} */
- function strong() {
- return {
- type: 'strong',
- children: []
- }
- }
-
- /** @returns {Text} */
- function text() {
- return {
- type: 'text',
- value: ''
- }
- }
-
- /** @returns {ThematicBreak} */
- function thematicBreak() {
- return {
- type: 'thematicBreak'
- }
- }
-}
-
-/**
- * Copy a point-like value.
- *
- * @param {Point} d
- * Point-like value.
- * @returns {Point}
- * unist point.
- */
-function lib_point(d) {
- return {
- line: d.line,
- column: d.column,
- offset: d.offset
- }
-}
-
-/**
- * @param {Config} combined
- * @param {Array<Extension | Array<Extension>>} extensions
- * @returns {void}
- */
-function configure(combined, extensions) {
- let index = -1
- while (++index < extensions.length) {
- const value = extensions[index]
- if (Array.isArray(value)) {
- configure(combined, value)
- } else {
- extension(combined, value)
- }
- }
-}
-
-/**
- * @param {Config} combined
- * @param {Extension} extension
- * @returns {void}
- */
-function extension(combined, extension) {
- /** @type {keyof Extension} */
- let key
- for (key in extension) {
- if (lib_own.call(extension, key)) {
- if (key === 'canContainEols') {
- const right = extension[key]
- if (right) {
- combined[key].push(...right)
- }
- } else if (key === 'transforms') {
- const right = extension[key]
- if (right) {
- combined[key].push(...right)
- }
- } else if (key === 'enter' || key === 'exit') {
- const right = extension[key]
- if (right) {
- Object.assign(combined[key], right)
- }
- }
- }
- }
-}
-
-/** @type {OnEnterError} */
-function defaultOnError(left, right) {
- if (left) {
- throw new Error(
- 'Cannot close `' +
- left.type +
- '` (' +
- stringifyPosition({
- start: left.start,
- end: left.end
- }) +
- '): a different token (`' +
- right.type +
- '`, ' +
- stringifyPosition({
- start: right.start,
- end: right.end
- }) +
- ') is open'
- )
- } else {
- throw new Error(
- 'Cannot close document, a token (`' +
- right.type +
- '`, ' +
- stringifyPosition({
- start: right.start,
- end: right.end
- }) +
- ') is still open'
- )
- }
-}
-
-// EXTERNAL MODULE: ./node_modules/ts-dedent/esm/index.js
-var esm = __webpack_require__(60513);
-;// CONCATENATED MODULE: ./node_modules/mermaid/dist/createText-ca0c5216.js
-
-
-
-function preprocessMarkdown(markdown) {
- const withoutMultipleNewlines = markdown.replace(/\n{2,}/g, "\n");
- const withoutExtraSpaces = (0,esm/* dedent */.T)(withoutMultipleNewlines);
- return withoutExtraSpaces;
-}
-function markdownToLines(markdown) {
- const preprocessedMarkdown = preprocessMarkdown(markdown);
- const { children } = fromMarkdown(preprocessedMarkdown);
- const lines = [[]];
- let currentLine = 0;
- function processNode(node, parentType = "normal") {
- if (node.type === "text") {
- const textLines = node.value.split("\n");
- textLines.forEach((textLine, index) => {
- if (index !== 0) {
- currentLine++;
- lines.push([]);
- }
- textLine.split(" ").forEach((word) => {
- if (word) {
- lines[currentLine].push({ content: word, type: parentType });
- }
- });
- });
- } else if (node.type === "strong" || node.type === "emphasis") {
- node.children.forEach((contentNode) => {
- processNode(contentNode, node.type);
- });
- }
- }
- children.forEach((treeNode) => {
- if (treeNode.type === "paragraph") {
- treeNode.children.forEach((contentNode) => {
- processNode(contentNode);
- });
- }
- });
- return lines;
-}
-function markdownToHTML(markdown) {
- const { children } = fromMarkdown(markdown);
- function output(node) {
- if (node.type === "text") {
- return node.value.replace(/\n/g, "<br/>");
- } else if (node.type === "strong") {
- return `<strong>${node.children.map(output).join("")}</strong>`;
- } else if (node.type === "emphasis") {
- return `<em>${node.children.map(output).join("")}</em>`;
- } else if (node.type === "paragraph") {
- return `<p>${node.children.map(output).join("")}</p>`;
- }
- return `Unsupported markdown: ${node.type}`;
- }
- return children.map(output).join("");
-}
-function splitTextToChars(text) {
- if (Intl.Segmenter) {
- return [...new Intl.Segmenter().segment(text)].map((s) => s.segment);
- }
- return [...text];
-}
-function splitWordToFitWidth(checkFit, word) {
- const characters = splitTextToChars(word.content);
- return splitWordToFitWidthRecursion(checkFit, [], characters, word.type);
-}
-function splitWordToFitWidthRecursion(checkFit, usedChars, remainingChars, type) {
- if (remainingChars.length === 0) {
- return [
- { content: usedChars.join(""), type },
- { content: "", type }
- ];
- }
- const [nextChar, ...rest] = remainingChars;
- const newWord = [...usedChars, nextChar];
- if (checkFit([{ content: newWord.join(""), type }])) {
- return splitWordToFitWidthRecursion(checkFit, newWord, rest, type);
- }
- if (usedChars.length === 0 && nextChar) {
- usedChars.push(nextChar);
- remainingChars.shift();
- }
- return [
- { content: usedChars.join(""), type },
- { content: remainingChars.join(""), type }
- ];
-}
-function splitLineToFitWidth(line, checkFit) {
- if (line.some(({ content }) => content.includes("\n"))) {
- throw new Error("splitLineToFitWidth does not support newlines in the line");
- }
- return splitLineToFitWidthRecursion(line, checkFit);
-}
-function splitLineToFitWidthRecursion(words, checkFit, lines = [], newLine = []) {
- if (words.length === 0) {
- if (newLine.length > 0) {
- lines.push(newLine);
- }
- return lines.length > 0 ? lines : [];
- }
- let joiner = "";
- if (words[0].content === " ") {
- joiner = " ";
- words.shift();
- }
- const nextWord = words.shift() ?? { content: " ", type: "normal" };
- const lineWithNextWord = [...newLine];
- if (joiner !== "") {
- lineWithNextWord.push({ content: joiner, type: "normal" });
- }
- lineWithNextWord.push(nextWord);
- if (checkFit(lineWithNextWord)) {
- return splitLineToFitWidthRecursion(words, checkFit, lines, lineWithNextWord);
- }
- if (newLine.length > 0) {
- lines.push(newLine);
- words.unshift(nextWord);
- } else if (nextWord.content) {
- const [line, rest] = splitWordToFitWidth(checkFit, nextWord);
- lines.push([line]);
- if (rest.content) {
- words.unshift(rest);
- }
- }
- return splitLineToFitWidthRecursion(words, checkFit, lines);
-}
-function applyStyle(dom, styleFn) {
- if (styleFn) {
- dom.attr("style", styleFn);
- }
-}
-function addHtmlSpan(element, node, width, classes, addBackground = false) {
- const fo = element.append("foreignObject");
- const div = fo.append("xhtml:div");
- const label = node.label;
- const labelClass = node.isNode ? "nodeLabel" : "edgeLabel";
- div.html(
- `
- <span class="${labelClass} ${classes}" ` + (node.labelStyle ? 'style="' + node.labelStyle + '"' : "") + ">" + label + "</span>"
- );
- applyStyle(div, node.labelStyle);
- div.style("display", "table-cell");
- div.style("white-space", "nowrap");
- div.style("max-width", width + "px");
- div.attr("xmlns", "http://www.w3.org/1999/xhtml");
- if (addBackground) {
- div.attr("class", "labelBkg");
- }
- let bbox = div.node().getBoundingClientRect();
- if (bbox.width === width) {
- div.style("display", "table");
- div.style("white-space", "break-spaces");
- div.style("width", width + "px");
- bbox = div.node().getBoundingClientRect();
- }
- fo.style("width", bbox.width);
- fo.style("height", bbox.height);
- return fo.node();
-}
-function createTspan(textElement, lineIndex, lineHeight) {
- return textElement.append("tspan").attr("class", "text-outer-tspan").attr("x", 0).attr("y", lineIndex * lineHeight - 0.1 + "em").attr("dy", lineHeight + "em");
-}
-function computeWidthOfText(parentNode, lineHeight, line) {
- const testElement = parentNode.append("text");
- const testSpan = createTspan(testElement, 1, lineHeight);
- updateTextContentAndStyles(testSpan, line);
- const textLength = testSpan.node().getComputedTextLength();
- testElement.remove();
- return textLength;
-}
-function computeDimensionOfText(parentNode, lineHeight, text) {
- var _a;
- const testElement = parentNode.append("text");
- const testSpan = createTspan(testElement, 1, lineHeight);
- updateTextContentAndStyles(testSpan, [{ content: text, type: "normal" }]);
- const textDimension = (_a = testSpan.node()) == null ? void 0 : _a.getBoundingClientRect();
- if (textDimension) {
- testElement.remove();
- }
- return textDimension;
-}
-function createFormattedText(width, g, structuredText, addBackground = false) {
- const lineHeight = 1.1;
- const labelGroup = g.append("g");
- const bkg = labelGroup.insert("rect").attr("class", "background");
- const textElement = labelGroup.append("text").attr("y", "-10.1");
- let lineIndex = 0;
- for (const line of structuredText) {
- const checkWidth = (line2) => computeWidthOfText(labelGroup, lineHeight, line2) <= width;
- const linesUnderWidth = checkWidth(line) ? [line] : splitLineToFitWidth(line, checkWidth);
- for (const preparedLine of linesUnderWidth) {
- const tspan = createTspan(textElement, lineIndex, lineHeight);
- updateTextContentAndStyles(tspan, preparedLine);
- lineIndex++;
- }
- }
- if (addBackground) {
- const bbox = textElement.node().getBBox();
- const padding = 2;
- bkg.attr("x", -padding).attr("y", -padding).attr("width", bbox.width + 2 * padding).attr("height", bbox.height + 2 * padding);
- return labelGroup.node();
- } else {
- return textElement.node();
- }
-}
-function updateTextContentAndStyles(tspan, wrappedLine) {
- tspan.text("");
- wrappedLine.forEach((word, index) => {
- const innerTspan = tspan.append("tspan").attr("font-style", word.type === "emphasis" ? "italic" : "normal").attr("class", "text-inner-tspan").attr("font-weight", word.type === "strong" ? "bold" : "normal");
- if (index === 0) {
- innerTspan.text(word.content);
- } else {
- innerTspan.text(" " + word.content);
- }
- });
-}
-const createText = (el, text = "", {
- style = "",
- isTitle = false,
- classes = "",
- useHtmlLabels = true,
- isNode = true,
- width = 200,
- addSvgBackground = false
-} = {}) => {
- mermaid_6dc72991.l.info("createText", text, style, isTitle, classes, useHtmlLabels, isNode, addSvgBackground);
- if (useHtmlLabels) {
- const htmlText = markdownToHTML(text);
- const node = {
- isNode,
- label: (0,mermaid_6dc72991.M)(htmlText).replace(
- /fa[blrs]?:fa-[\w-]+/g,
- // cspell: disable-line
- (s) => `<i class='${s.replace(":", " ")}'></i>`
- ),
- labelStyle: style.replace("fill:", "color:")
- };
- const vertexNode = addHtmlSpan(el, node, width, classes, addSvgBackground);
- return vertexNode;
- } else {
- const structuredText = markdownToLines(text);
- const svgLabel = createFormattedText(width, el, structuredText, addSvgBackground);
- return svgLabel;
- }
-};
-
-
-
-/***/ }),
-
-/***/ 98055:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ a: () => (/* binding */ insertMarkers$1),
-/* harmony export */ b: () => (/* binding */ clear$1),
-/* harmony export */ c: () => (/* binding */ createLabel$1),
-/* harmony export */ d: () => (/* binding */ clear),
-/* harmony export */ e: () => (/* binding */ insertNode),
-/* harmony export */ f: () => (/* binding */ insertEdgeLabel),
-/* harmony export */ g: () => (/* binding */ getSubGraphTitleMargins),
-/* harmony export */ h: () => (/* binding */ insertEdge),
-/* harmony export */ i: () => (/* binding */ intersectRect$1),
-/* harmony export */ j: () => (/* binding */ positionEdgeLabel),
-/* harmony export */ k: () => (/* binding */ getLineFunctionsWithOffset),
-/* harmony export */ l: () => (/* binding */ labelHelper),
-/* harmony export */ m: () => (/* binding */ addEdgeMarkers),
-/* harmony export */ p: () => (/* binding */ positionNode),
-/* harmony export */ s: () => (/* binding */ setNodeElem),
-/* harmony export */ u: () => (/* binding */ updateNodeBounds)
-/* harmony export */ });
-/* harmony import */ var _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(99702);
-/* harmony import */ var d3__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(26312);
-/* harmony import */ var _createText_ca0c5216_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(18897);
-
-
-
-const insertMarkers = (elem, markerArray, type, id) => {
- markerArray.forEach((markerName) => {
- markers[markerName](elem, type, id);
- });
-};
-const extension = (elem, type, id) => {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.trace("Making markers for ", id);
- elem.append("defs").append("marker").attr("id", id + "_" + type + "-extensionStart").attr("class", "marker extension " + type).attr("refX", 18).attr("refY", 7).attr("markerWidth", 190).attr("markerHeight", 240).attr("orient", "auto").append("path").attr("d", "M 1,7 L18,13 V 1 Z");
- elem.append("defs").append("marker").attr("id", id + "_" + type + "-extensionEnd").attr("class", "marker extension " + type).attr("refX", 1).attr("refY", 7).attr("markerWidth", 20).attr("markerHeight", 28).attr("orient", "auto").append("path").attr("d", "M 1,1 V 13 L18,7 Z");
-};
-const composition = (elem, type, id) => {
- elem.append("defs").append("marker").attr("id", id + "_" + type + "-compositionStart").attr("class", "marker composition " + type).attr("refX", 18).attr("refY", 7).attr("markerWidth", 190).attr("markerHeight", 240).attr("orient", "auto").append("path").attr("d", "M 18,7 L9,13 L1,7 L9,1 Z");
- elem.append("defs").append("marker").attr("id", id + "_" + type + "-compositionEnd").attr("class", "marker composition " + type).attr("refX", 1).attr("refY", 7).attr("markerWidth", 20).attr("markerHeight", 28).attr("orient", "auto").append("path").attr("d", "M 18,7 L9,13 L1,7 L9,1 Z");
-};
-const aggregation = (elem, type, id) => {
- elem.append("defs").append("marker").attr("id", id + "_" + type + "-aggregationStart").attr("class", "marker aggregation " + type).attr("refX", 18).attr("refY", 7).attr("markerWidth", 190).attr("markerHeight", 240).attr("orient", "auto").append("path").attr("d", "M 18,7 L9,13 L1,7 L9,1 Z");
- elem.append("defs").append("marker").attr("id", id + "_" + type + "-aggregationEnd").attr("class", "marker aggregation " + type).attr("refX", 1).attr("refY", 7).attr("markerWidth", 20).attr("markerHeight", 28).attr("orient", "auto").append("path").attr("d", "M 18,7 L9,13 L1,7 L9,1 Z");
-};
-const dependency = (elem, type, id) => {
- elem.append("defs").append("marker").attr("id", id + "_" + type + "-dependencyStart").attr("class", "marker dependency " + type).attr("refX", 6).attr("refY", 7).attr("markerWidth", 190).attr("markerHeight", 240).attr("orient", "auto").append("path").attr("d", "M 5,7 L9,13 L1,7 L9,1 Z");
- elem.append("defs").append("marker").attr("id", id + "_" + type + "-dependencyEnd").attr("class", "marker dependency " + type).attr("refX", 13).attr("refY", 7).attr("markerWidth", 20).attr("markerHeight", 28).attr("orient", "auto").append("path").attr("d", "M 18,7 L9,13 L14,7 L9,1 Z");
-};
-const lollipop = (elem, type, id) => {
- elem.append("defs").append("marker").attr("id", id + "_" + type + "-lollipopStart").attr("class", "marker lollipop " + type).attr("refX", 13).attr("refY", 7).attr("markerWidth", 190).attr("markerHeight", 240).attr("orient", "auto").append("circle").attr("stroke", "black").attr("fill", "transparent").attr("cx", 7).attr("cy", 7).attr("r", 6);
- elem.append("defs").append("marker").attr("id", id + "_" + type + "-lollipopEnd").attr("class", "marker lollipop " + type).attr("refX", 1).attr("refY", 7).attr("markerWidth", 190).attr("markerHeight", 240).attr("orient", "auto").append("circle").attr("stroke", "black").attr("fill", "transparent").attr("cx", 7).attr("cy", 7).attr("r", 6);
-};
-const point = (elem, type, id) => {
- elem.append("marker").attr("id", id + "_" + type + "-pointEnd").attr("class", "marker " + type).attr("viewBox", "0 0 10 10").attr("refX", 6).attr("refY", 5).attr("markerUnits", "userSpaceOnUse").attr("markerWidth", 12).attr("markerHeight", 12).attr("orient", "auto").append("path").attr("d", "M 0 0 L 10 5 L 0 10 z").attr("class", "arrowMarkerPath").style("stroke-width", 1).style("stroke-dasharray", "1,0");
- elem.append("marker").attr("id", id + "_" + type + "-pointStart").attr("class", "marker " + type).attr("viewBox", "0 0 10 10").attr("refX", 4.5).attr("refY", 5).attr("markerUnits", "userSpaceOnUse").attr("markerWidth", 12).attr("markerHeight", 12).attr("orient", "auto").append("path").attr("d", "M 0 5 L 10 10 L 10 0 z").attr("class", "arrowMarkerPath").style("stroke-width", 1).style("stroke-dasharray", "1,0");
-};
-const circle$1 = (elem, type, id) => {
- elem.append("marker").attr("id", id + "_" + type + "-circleEnd").attr("class", "marker " + type).attr("viewBox", "0 0 10 10").attr("refX", 11).attr("refY", 5).attr("markerUnits", "userSpaceOnUse").attr("markerWidth", 11).attr("markerHeight", 11).attr("orient", "auto").append("circle").attr("cx", "5").attr("cy", "5").attr("r", "5").attr("class", "arrowMarkerPath").style("stroke-width", 1).style("stroke-dasharray", "1,0");
- elem.append("marker").attr("id", id + "_" + type + "-circleStart").attr("class", "marker " + type).attr("viewBox", "0 0 10 10").attr("refX", -1).attr("refY", 5).attr("markerUnits", "userSpaceOnUse").attr("markerWidth", 11).attr("markerHeight", 11).attr("orient", "auto").append("circle").attr("cx", "5").attr("cy", "5").attr("r", "5").attr("class", "arrowMarkerPath").style("stroke-width", 1).style("stroke-dasharray", "1,0");
-};
-const cross = (elem, type, id) => {
- elem.append("marker").attr("id", id + "_" + type + "-crossEnd").attr("class", "marker cross " + type).attr("viewBox", "0 0 11 11").attr("refX", 12).attr("refY", 5.2).attr("markerUnits", "userSpaceOnUse").attr("markerWidth", 11).attr("markerHeight", 11).attr("orient", "auto").append("path").attr("d", "M 1,1 l 9,9 M 10,1 l -9,9").attr("class", "arrowMarkerPath").style("stroke-width", 2).style("stroke-dasharray", "1,0");
- elem.append("marker").attr("id", id + "_" + type + "-crossStart").attr("class", "marker cross " + type).attr("viewBox", "0 0 11 11").attr("refX", -1).attr("refY", 5.2).attr("markerUnits", "userSpaceOnUse").attr("markerWidth", 11).attr("markerHeight", 11).attr("orient", "auto").append("path").attr("d", "M 1,1 l 9,9 M 10,1 l -9,9").attr("class", "arrowMarkerPath").style("stroke-width", 2).style("stroke-dasharray", "1,0");
-};
-const barb = (elem, type, id) => {
- elem.append("defs").append("marker").attr("id", id + "_" + type + "-barbEnd").attr("refX", 19).attr("refY", 7).attr("markerWidth", 20).attr("markerHeight", 14).attr("markerUnits", "strokeWidth").attr("orient", "auto").append("path").attr("d", "M 19,7 L9,13 L14,7 L9,1 Z");
-};
-const markers = {
- extension,
- composition,
- aggregation,
- dependency,
- lollipop,
- point,
- circle: circle$1,
- cross,
- barb
-};
-const insertMarkers$1 = insertMarkers;
-function applyStyle(dom, styleFn) {
- if (styleFn) {
- dom.attr("style", styleFn);
- }
-}
-function addHtmlLabel(node) {
- const fo = (0,d3__WEBPACK_IMPORTED_MODULE_0__/* .select */ .Ltv)(document.createElementNS("http://www.w3.org/2000/svg", "foreignObject"));
- const div = fo.append("xhtml:div");
- const label = node.label;
- const labelClass = node.isNode ? "nodeLabel" : "edgeLabel";
- div.html(
- '<span class="' + labelClass + '" ' + (node.labelStyle ? 'style="' + node.labelStyle + '"' : "") + ">" + label + "</span>"
- );
- applyStyle(div, node.labelStyle);
- div.style("display", "inline-block");
- div.style("white-space", "nowrap");
- div.attr("xmlns", "http://www.w3.org/1999/xhtml");
- return fo.node();
-}
-const createLabel = (_vertexText, style, isTitle, isNode) => {
- let vertexText = _vertexText || "";
- if (typeof vertexText === "object") {
- vertexText = vertexText[0];
- }
- if ((0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.m)((0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)().flowchart.htmlLabels)) {
- vertexText = vertexText.replace(/\\n|\n/g, "<br />");
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.debug("vertexText" + vertexText);
- const node = {
- isNode,
- label: (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.M)(vertexText).replace(
- /fa[blrs]?:fa-[\w-]+/g,
- // cspell: disable-line
- (s) => `<i class='${s.replace(":", " ")}'></i>`
- ),
- labelStyle: style.replace("fill:", "color:")
- };
- let vertexNode = addHtmlLabel(node);
- return vertexNode;
- } else {
- const svgLabel = document.createElementNS("http://www.w3.org/2000/svg", "text");
- svgLabel.setAttribute("style", style.replace("color:", "fill:"));
- let rows = [];
- if (typeof vertexText === "string") {
- rows = vertexText.split(/\\n|\n|<br\s*\/?>/gi);
- } else if (Array.isArray(vertexText)) {
- rows = vertexText;
- } else {
- rows = [];
- }
- for (const row of rows) {
- const tspan = document.createElementNS("http://www.w3.org/2000/svg", "tspan");
- tspan.setAttributeNS("http://www.w3.org/XML/1998/namespace", "xml:space", "preserve");
- tspan.setAttribute("dy", "1em");
- tspan.setAttribute("x", "0");
- if (isTitle) {
- tspan.setAttribute("class", "title-row");
- } else {
- tspan.setAttribute("class", "row");
- }
- tspan.textContent = row.trim();
- svgLabel.appendChild(tspan);
- }
- return svgLabel;
- }
-};
-const createLabel$1 = createLabel;
-const labelHelper = async (parent, node, _classes, isNode) => {
- let classes;
- const useHtmlLabels = node.useHtmlLabels || (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.m)((0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)().flowchart.htmlLabels);
- if (!_classes) {
- classes = "node default";
- } else {
- classes = _classes;
- }
- const shapeSvg = parent.insert("g").attr("class", classes).attr("id", node.domId || node.id);
- const label = shapeSvg.insert("g").attr("class", "label").attr("style", node.labelStyle);
- let labelText;
- if (node.labelText === void 0) {
- labelText = "";
- } else {
- labelText = typeof node.labelText === "string" ? node.labelText : node.labelText[0];
- }
- const textNode = label.node();
- let text;
- if (node.labelType === "markdown") {
- text = (0,_createText_ca0c5216_js__WEBPACK_IMPORTED_MODULE_2__.a)(label, (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.d)((0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.M)(labelText), (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)()), {
- useHtmlLabels,
- width: node.width || (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)().flowchart.wrappingWidth,
- classes: "markdown-node-label"
- });
- } else {
- text = textNode.appendChild(
- createLabel$1(
- (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.d)((0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.M)(labelText), (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)()),
- node.labelStyle,
- false,
- isNode
- )
- );
- }
- let bbox = text.getBBox();
- const halfPadding = node.padding / 2;
- if ((0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.m)((0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)().flowchart.htmlLabels)) {
- const div = text.children[0];
- const dv = (0,d3__WEBPACK_IMPORTED_MODULE_0__/* .select */ .Ltv)(text);
- const images = div.getElementsByTagName("img");
- if (images) {
- const noImgText = labelText.replace(/<img[^>]*>/g, "").trim() === "";
- await Promise.all(
- [...images].map(
- (img) => new Promise((res) => {
- function setupImage() {
- img.style.display = "flex";
- img.style.flexDirection = "column";
- if (noImgText) {
- const bodyFontSize = (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)().fontSize ? (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)().fontSize : window.getComputedStyle(document.body).fontSize;
- const enlargingFactor = 5;
- const width = parseInt(bodyFontSize, 10) * enlargingFactor + "px";
- img.style.minWidth = width;
- img.style.maxWidth = width;
- } else {
- img.style.width = "100%";
- }
- res(img);
- }
- setTimeout(() => {
- if (img.complete) {
- setupImage();
- }
- });
- img.addEventListener("error", setupImage);
- img.addEventListener("load", setupImage);
- })
- )
- );
- }
- bbox = div.getBoundingClientRect();
- dv.attr("width", bbox.width);
- dv.attr("height", bbox.height);
- }
- if (useHtmlLabels) {
- label.attr("transform", "translate(" + -bbox.width / 2 + ", " + -bbox.height / 2 + ")");
- } else {
- label.attr("transform", "translate(0, " + -bbox.height / 2 + ")");
- }
- if (node.centerLabel) {
- label.attr("transform", "translate(" + -bbox.width / 2 + ", " + -bbox.height / 2 + ")");
- }
- label.insert("rect", ":first-child");
- return { shapeSvg, bbox, halfPadding, label };
-};
-const updateNodeBounds = (node, element) => {
- const bbox = element.node().getBBox();
- node.width = bbox.width;
- node.height = bbox.height;
-};
-function insertPolygonShape(parent, w, h, points) {
- return parent.insert("polygon", ":first-child").attr(
- "points",
- points.map(function(d) {
- return d.x + "," + d.y;
- }).join(" ")
- ).attr("class", "label-container").attr("transform", "translate(" + -w / 2 + "," + h / 2 + ")");
-}
-function intersectNode(node, point2) {
- return node.intersect(point2);
-}
-function intersectEllipse(node, rx, ry, point2) {
- var cx = node.x;
- var cy = node.y;
- var px = cx - point2.x;
- var py = cy - point2.y;
- var det = Math.sqrt(rx * rx * py * py + ry * ry * px * px);
- var dx = Math.abs(rx * ry * px / det);
- if (point2.x < cx) {
- dx = -dx;
- }
- var dy = Math.abs(rx * ry * py / det);
- if (point2.y < cy) {
- dy = -dy;
- }
- return { x: cx + dx, y: cy + dy };
-}
-function intersectCircle(node, rx, point2) {
- return intersectEllipse(node, rx, rx, point2);
-}
-function intersectLine(p1, p2, q1, q2) {
- var a1, a2, b1, b2, c1, c2;
- var r1, r2, r3, r4;
- var denom, offset, num;
- var x, y;
- a1 = p2.y - p1.y;
- b1 = p1.x - p2.x;
- c1 = p2.x * p1.y - p1.x * p2.y;
- r3 = a1 * q1.x + b1 * q1.y + c1;
- r4 = a1 * q2.x + b1 * q2.y + c1;
- if (r3 !== 0 && r4 !== 0 && sameSign(r3, r4)) {
- return;
- }
- a2 = q2.y - q1.y;
- b2 = q1.x - q2.x;
- c2 = q2.x * q1.y - q1.x * q2.y;
- r1 = a2 * p1.x + b2 * p1.y + c2;
- r2 = a2 * p2.x + b2 * p2.y + c2;
- if (r1 !== 0 && r2 !== 0 && sameSign(r1, r2)) {
- return;
- }
- denom = a1 * b2 - a2 * b1;
- if (denom === 0) {
- return;
- }
- offset = Math.abs(denom / 2);
- num = b1 * c2 - b2 * c1;
- x = num < 0 ? (num - offset) / denom : (num + offset) / denom;
- num = a2 * c1 - a1 * c2;
- y = num < 0 ? (num - offset) / denom : (num + offset) / denom;
- return { x, y };
-}
-function sameSign(r1, r2) {
- return r1 * r2 > 0;
-}
-function intersectPolygon(node, polyPoints, point2) {
- var x1 = node.x;
- var y1 = node.y;
- var intersections = [];
- var minX = Number.POSITIVE_INFINITY;
- var minY = Number.POSITIVE_INFINITY;
- if (typeof polyPoints.forEach === "function") {
- polyPoints.forEach(function(entry) {
- minX = Math.min(minX, entry.x);
- minY = Math.min(minY, entry.y);
- });
- } else {
- minX = Math.min(minX, polyPoints.x);
- minY = Math.min(minY, polyPoints.y);
- }
- var left = x1 - node.width / 2 - minX;
- var top = y1 - node.height / 2 - minY;
- for (var i = 0; i < polyPoints.length; i++) {
- var p1 = polyPoints[i];
- var p2 = polyPoints[i < polyPoints.length - 1 ? i + 1 : 0];
- var intersect2 = intersectLine(
- node,
- point2,
- { x: left + p1.x, y: top + p1.y },
- { x: left + p2.x, y: top + p2.y }
- );
- if (intersect2) {
- intersections.push(intersect2);
- }
- }
- if (!intersections.length) {
- return node;
- }
- if (intersections.length > 1) {
- intersections.sort(function(p, q) {
- var pdx = p.x - point2.x;
- var pdy = p.y - point2.y;
- var distp = Math.sqrt(pdx * pdx + pdy * pdy);
- var qdx = q.x - point2.x;
- var qdy = q.y - point2.y;
- var distq = Math.sqrt(qdx * qdx + qdy * qdy);
- return distp < distq ? -1 : distp === distq ? 0 : 1;
- });
- }
- return intersections[0];
-}
-const intersectRect = (node, point2) => {
- var x = node.x;
- var y = node.y;
- var dx = point2.x - x;
- var dy = point2.y - y;
- var w = node.width / 2;
- var h = node.height / 2;
- var sx, sy;
- if (Math.abs(dy) * w > Math.abs(dx) * h) {
- if (dy < 0) {
- h = -h;
- }
- sx = dy === 0 ? 0 : h * dx / dy;
- sy = h;
- } else {
- if (dx < 0) {
- w = -w;
- }
- sx = w;
- sy = dx === 0 ? 0 : w * dy / dx;
- }
- return { x: x + sx, y: y + sy };
-};
-const intersectRect$1 = intersectRect;
-const intersect = {
- node: intersectNode,
- circle: intersectCircle,
- ellipse: intersectEllipse,
- polygon: intersectPolygon,
- rect: intersectRect$1
-};
-const note = async (parent, node) => {
- const useHtmlLabels = node.useHtmlLabels || (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)().flowchart.htmlLabels;
- if (!useHtmlLabels) {
- node.centerLabel = true;
- }
- const { shapeSvg, bbox, halfPadding } = await labelHelper(
- parent,
- node,
- "node " + node.classes,
- true
- );
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.info("Classes = ", node.classes);
- const rect2 = shapeSvg.insert("rect", ":first-child");
- rect2.attr("rx", node.rx).attr("ry", node.ry).attr("x", -bbox.width / 2 - halfPadding).attr("y", -bbox.height / 2 - halfPadding).attr("width", bbox.width + node.padding).attr("height", bbox.height + node.padding);
- updateNodeBounds(node, rect2);
- node.intersect = function(point2) {
- return intersect.rect(node, point2);
- };
- return shapeSvg;
-};
-const note$1 = note;
-const expandAndDeduplicateDirections = (directions) => {
- const uniqueDirections = /* @__PURE__ */ new Set();
- for (const direction of directions) {
- switch (direction) {
- case "x":
- uniqueDirections.add("right");
- uniqueDirections.add("left");
- break;
- case "y":
- uniqueDirections.add("up");
- uniqueDirections.add("down");
- break;
- default:
- uniqueDirections.add(direction);
- break;
- }
- }
- return uniqueDirections;
-};
-const getArrowPoints = (duplicatedDirections, bbox, node) => {
- const directions = expandAndDeduplicateDirections(duplicatedDirections);
- const f = 2;
- const height = bbox.height + 2 * node.padding;
- const midpoint = height / f;
- const width = bbox.width + 2 * midpoint + node.padding;
- const padding = node.padding / 2;
- if (directions.has("right") && directions.has("left") && directions.has("up") && directions.has("down")) {
- return [
- // Bottom
- { x: 0, y: 0 },
- { x: midpoint, y: 0 },
- { x: width / 2, y: 2 * padding },
- { x: width - midpoint, y: 0 },
- { x: width, y: 0 },
- // Right
- { x: width, y: -height / 3 },
- { x: width + 2 * padding, y: -height / 2 },
- { x: width, y: -2 * height / 3 },
- { x: width, y: -height },
- // Top
- { x: width - midpoint, y: -height },
- { x: width / 2, y: -height - 2 * padding },
- { x: midpoint, y: -height },
- // Left
- { x: 0, y: -height },
- { x: 0, y: -2 * height / 3 },
- { x: -2 * padding, y: -height / 2 },
- { x: 0, y: -height / 3 }
- ];
- }
- if (directions.has("right") && directions.has("left") && directions.has("up")) {
- return [
- { x: midpoint, y: 0 },
- { x: width - midpoint, y: 0 },
- { x: width, y: -height / 2 },
- { x: width - midpoint, y: -height },
- { x: midpoint, y: -height },
- { x: 0, y: -height / 2 }
- ];
- }
- if (directions.has("right") && directions.has("left") && directions.has("down")) {
- return [
- { x: 0, y: 0 },
- { x: midpoint, y: -height },
- { x: width - midpoint, y: -height },
- { x: width, y: 0 }
- ];
- }
- if (directions.has("right") && directions.has("up") && directions.has("down")) {
- return [
- { x: 0, y: 0 },
- { x: width, y: -midpoint },
- { x: width, y: -height + midpoint },
- { x: 0, y: -height }
- ];
- }
- if (directions.has("left") && directions.has("up") && directions.has("down")) {
- return [
- { x: width, y: 0 },
- { x: 0, y: -midpoint },
- { x: 0, y: -height + midpoint },
- { x: width, y: -height }
- ];
- }
- if (directions.has("right") && directions.has("left")) {
- return [
- { x: midpoint, y: 0 },
- { x: midpoint, y: -padding },
- { x: width - midpoint, y: -padding },
- { x: width - midpoint, y: 0 },
- { x: width, y: -height / 2 },
- { x: width - midpoint, y: -height },
- { x: width - midpoint, y: -height + padding },
- { x: midpoint, y: -height + padding },
- { x: midpoint, y: -height },
- { x: 0, y: -height / 2 }
- ];
- }
- if (directions.has("up") && directions.has("down")) {
- return [
- // Bottom center
- { x: width / 2, y: 0 },
- // Left pont of bottom arrow
- { x: 0, y: -padding },
- { x: midpoint, y: -padding },
- // Left top over vertical section
- { x: midpoint, y: -height + padding },
- { x: 0, y: -height + padding },
- // Top of arrow
- { x: width / 2, y: -height },
- { x: width, y: -height + padding },
- // Top of right vertical bar
- { x: width - midpoint, y: -height + padding },
- { x: width - midpoint, y: -padding },
- { x: width, y: -padding }
- ];
- }
- if (directions.has("right") && directions.has("up")) {
- return [
- { x: 0, y: 0 },
- { x: width, y: -midpoint },
- { x: 0, y: -height }
- ];
- }
- if (directions.has("right") && directions.has("down")) {
- return [
- { x: 0, y: 0 },
- { x: width, y: 0 },
- { x: 0, y: -height }
- ];
- }
- if (directions.has("left") && directions.has("up")) {
- return [
- { x: width, y: 0 },
- { x: 0, y: -midpoint },
- { x: width, y: -height }
- ];
- }
- if (directions.has("left") && directions.has("down")) {
- return [
- { x: width, y: 0 },
- { x: 0, y: 0 },
- { x: width, y: -height }
- ];
- }
- if (directions.has("right")) {
- return [
- { x: midpoint, y: -padding },
- { x: midpoint, y: -padding },
- { x: width - midpoint, y: -padding },
- { x: width - midpoint, y: 0 },
- { x: width, y: -height / 2 },
- { x: width - midpoint, y: -height },
- { x: width - midpoint, y: -height + padding },
- // top left corner of arrow
- { x: midpoint, y: -height + padding },
- { x: midpoint, y: -height + padding }
- ];
- }
- if (directions.has("left")) {
- return [
- { x: midpoint, y: 0 },
- { x: midpoint, y: -padding },
- // Two points, the right corners
- { x: width - midpoint, y: -padding },
- { x: width - midpoint, y: -height + padding },
- { x: midpoint, y: -height + padding },
- { x: midpoint, y: -height },
- { x: 0, y: -height / 2 }
- ];
- }
- if (directions.has("up")) {
- return [
- // Bottom center
- { x: midpoint, y: -padding },
- // Left top over vertical section
- { x: midpoint, y: -height + padding },
- { x: 0, y: -height + padding },
- // Top of arrow
- { x: width / 2, y: -height },
- { x: width, y: -height + padding },
- // Top of right vertical bar
- { x: width - midpoint, y: -height + padding },
- { x: width - midpoint, y: -padding }
- ];
- }
- if (directions.has("down")) {
- return [
- // Bottom center
- { x: width / 2, y: 0 },
- // Left pont of bottom arrow
- { x: 0, y: -padding },
- { x: midpoint, y: -padding },
- // Left top over vertical section
- { x: midpoint, y: -height + padding },
- { x: width - midpoint, y: -height + padding },
- { x: width - midpoint, y: -padding },
- { x: width, y: -padding }
- ];
- }
- return [{ x: 0, y: 0 }];
-};
-const formatClass = (str) => {
- if (str) {
- return " " + str;
- }
- return "";
-};
-const getClassesFromNode = (node, otherClasses) => {
- return `${otherClasses ? otherClasses : "node default"}${formatClass(node.classes)} ${formatClass(
- node.class
- )}`;
-};
-const question = async (parent, node) => {
- const { shapeSvg, bbox } = await labelHelper(
- parent,
- node,
- getClassesFromNode(node, void 0),
- true
- );
- const w = bbox.width + node.padding;
- const h = bbox.height + node.padding;
- const s = w + h;
- const points = [
- { x: s / 2, y: 0 },
- { x: s, y: -s / 2 },
- { x: s / 2, y: -s },
- { x: 0, y: -s / 2 }
- ];
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.info("Question main (Circle)");
- const questionElem = insertPolygonShape(shapeSvg, s, s, points);
- questionElem.attr("style", node.style);
- updateNodeBounds(node, questionElem);
- node.intersect = function(point2) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.warn("Intersect called");
- return intersect.polygon(node, points, point2);
- };
- return shapeSvg;
-};
-const choice = (parent, node) => {
- const shapeSvg = parent.insert("g").attr("class", "node default").attr("id", node.domId || node.id);
- const s = 28;
- const points = [
- { x: 0, y: s / 2 },
- { x: s / 2, y: 0 },
- { x: 0, y: -s / 2 },
- { x: -s / 2, y: 0 }
- ];
- const choice2 = shapeSvg.insert("polygon", ":first-child").attr(
- "points",
- points.map(function(d) {
- return d.x + "," + d.y;
- }).join(" ")
- );
- choice2.attr("class", "state-start").attr("r", 7).attr("width", 28).attr("height", 28);
- node.width = 28;
- node.height = 28;
- node.intersect = function(point2) {
- return intersect.circle(node, 14, point2);
- };
- return shapeSvg;
-};
-const hexagon = async (parent, node) => {
- const { shapeSvg, bbox } = await labelHelper(
- parent,
- node,
- getClassesFromNode(node, void 0),
- true
- );
- const f = 4;
- const h = bbox.height + node.padding;
- const m = h / f;
- const w = bbox.width + 2 * m + node.padding;
- const points = [
- { x: m, y: 0 },
- { x: w - m, y: 0 },
- { x: w, y: -h / 2 },
- { x: w - m, y: -h },
- { x: m, y: -h },
- { x: 0, y: -h / 2 }
- ];
- const hex = insertPolygonShape(shapeSvg, w, h, points);
- hex.attr("style", node.style);
- updateNodeBounds(node, hex);
- node.intersect = function(point2) {
- return intersect.polygon(node, points, point2);
- };
- return shapeSvg;
-};
-const block_arrow = async (parent, node) => {
- const { shapeSvg, bbox } = await labelHelper(parent, node, void 0, true);
- const f = 2;
- const h = bbox.height + 2 * node.padding;
- const m = h / f;
- const w = bbox.width + 2 * m + node.padding;
- const points = getArrowPoints(node.directions, bbox, node);
- const blockArrow = insertPolygonShape(shapeSvg, w, h, points);
- blockArrow.attr("style", node.style);
- updateNodeBounds(node, blockArrow);
- node.intersect = function(point2) {
- return intersect.polygon(node, points, point2);
- };
- return shapeSvg;
-};
-const rect_left_inv_arrow = async (parent, node) => {
- const { shapeSvg, bbox } = await labelHelper(
- parent,
- node,
- getClassesFromNode(node, void 0),
- true
- );
- const w = bbox.width + node.padding;
- const h = bbox.height + node.padding;
- const points = [
- { x: -h / 2, y: 0 },
- { x: w, y: 0 },
- { x: w, y: -h },
- { x: -h / 2, y: -h },
- { x: 0, y: -h / 2 }
- ];
- const el = insertPolygonShape(shapeSvg, w, h, points);
- el.attr("style", node.style);
- node.width = w + h;
- node.height = h;
- node.intersect = function(point2) {
- return intersect.polygon(node, points, point2);
- };
- return shapeSvg;
-};
-const lean_right = async (parent, node) => {
- const { shapeSvg, bbox } = await labelHelper(parent, node, getClassesFromNode(node), true);
- const w = bbox.width + node.padding;
- const h = bbox.height + node.padding;
- const points = [
- { x: -2 * h / 6, y: 0 },
- { x: w - h / 6, y: 0 },
- { x: w + 2 * h / 6, y: -h },
- { x: h / 6, y: -h }
- ];
- const el = insertPolygonShape(shapeSvg, w, h, points);
- el.attr("style", node.style);
- updateNodeBounds(node, el);
- node.intersect = function(point2) {
- return intersect.polygon(node, points, point2);
- };
- return shapeSvg;
-};
-const lean_left = async (parent, node) => {
- const { shapeSvg, bbox } = await labelHelper(
- parent,
- node,
- getClassesFromNode(node, void 0),
- true
- );
- const w = bbox.width + node.padding;
- const h = bbox.height + node.padding;
- const points = [
- { x: 2 * h / 6, y: 0 },
- { x: w + h / 6, y: 0 },
- { x: w - 2 * h / 6, y: -h },
- { x: -h / 6, y: -h }
- ];
- const el = insertPolygonShape(shapeSvg, w, h, points);
- el.attr("style", node.style);
- updateNodeBounds(node, el);
- node.intersect = function(point2) {
- return intersect.polygon(node, points, point2);
- };
- return shapeSvg;
-};
-const trapezoid = async (parent, node) => {
- const { shapeSvg, bbox } = await labelHelper(
- parent,
- node,
- getClassesFromNode(node, void 0),
- true
- );
- const w = bbox.width + node.padding;
- const h = bbox.height + node.padding;
- const points = [
- { x: -2 * h / 6, y: 0 },
- { x: w + 2 * h / 6, y: 0 },
- { x: w - h / 6, y: -h },
- { x: h / 6, y: -h }
- ];
- const el = insertPolygonShape(shapeSvg, w, h, points);
- el.attr("style", node.style);
- updateNodeBounds(node, el);
- node.intersect = function(point2) {
- return intersect.polygon(node, points, point2);
- };
- return shapeSvg;
-};
-const inv_trapezoid = async (parent, node) => {
- const { shapeSvg, bbox } = await labelHelper(
- parent,
- node,
- getClassesFromNode(node, void 0),
- true
- );
- const w = bbox.width + node.padding;
- const h = bbox.height + node.padding;
- const points = [
- { x: h / 6, y: 0 },
- { x: w - h / 6, y: 0 },
- { x: w + 2 * h / 6, y: -h },
- { x: -2 * h / 6, y: -h }
- ];
- const el = insertPolygonShape(shapeSvg, w, h, points);
- el.attr("style", node.style);
- updateNodeBounds(node, el);
- node.intersect = function(point2) {
- return intersect.polygon(node, points, point2);
- };
- return shapeSvg;
-};
-const rect_right_inv_arrow = async (parent, node) => {
- const { shapeSvg, bbox } = await labelHelper(
- parent,
- node,
- getClassesFromNode(node, void 0),
- true
- );
- const w = bbox.width + node.padding;
- const h = bbox.height + node.padding;
- const points = [
- { x: 0, y: 0 },
- { x: w + h / 2, y: 0 },
- { x: w, y: -h / 2 },
- { x: w + h / 2, y: -h },
- { x: 0, y: -h }
- ];
- const el = insertPolygonShape(shapeSvg, w, h, points);
- el.attr("style", node.style);
- updateNodeBounds(node, el);
- node.intersect = function(point2) {
- return intersect.polygon(node, points, point2);
- };
- return shapeSvg;
-};
-const cylinder = async (parent, node) => {
- const { shapeSvg, bbox } = await labelHelper(
- parent,
- node,
- getClassesFromNode(node, void 0),
- true
- );
- const w = bbox.width + node.padding;
- const rx = w / 2;
- const ry = rx / (2.5 + w / 50);
- const h = bbox.height + ry + node.padding;
- const shape = "M 0," + ry + " a " + rx + "," + ry + " 0,0,0 " + w + " 0 a " + rx + "," + ry + " 0,0,0 " + -w + " 0 l 0," + h + " a " + rx + "," + ry + " 0,0,0 " + w + " 0 l 0," + -h;
- const el = shapeSvg.attr("label-offset-y", ry).insert("path", ":first-child").attr("style", node.style).attr("d", shape).attr("transform", "translate(" + -w / 2 + "," + -(h / 2 + ry) + ")");
- updateNodeBounds(node, el);
- node.intersect = function(point2) {
- const pos = intersect.rect(node, point2);
- const x = pos.x - node.x;
- if (rx != 0 && (Math.abs(x) < node.width / 2 || Math.abs(x) == node.width / 2 && Math.abs(pos.y - node.y) > node.height / 2 - ry)) {
- let y = ry * ry * (1 - x * x / (rx * rx));
- if (y != 0) {
- y = Math.sqrt(y);
- }
- y = ry - y;
- if (point2.y - node.y > 0) {
- y = -y;
- }
- pos.y += y;
- }
- return pos;
- };
- return shapeSvg;
-};
-const rect = async (parent, node) => {
- const { shapeSvg, bbox, halfPadding } = await labelHelper(
- parent,
- node,
- "node " + node.classes + " " + node.class,
- true
- );
- const rect2 = shapeSvg.insert("rect", ":first-child");
- const totalWidth = node.positioned ? node.width : bbox.width + node.padding;
- const totalHeight = node.positioned ? node.height : bbox.height + node.padding;
- const x = node.positioned ? -totalWidth / 2 : -bbox.width / 2 - halfPadding;
- const y = node.positioned ? -totalHeight / 2 : -bbox.height / 2 - halfPadding;
- rect2.attr("class", "basic label-container").attr("style", node.style).attr("rx", node.rx).attr("ry", node.ry).attr("x", x).attr("y", y).attr("width", totalWidth).attr("height", totalHeight);
- if (node.props) {
- const propKeys = new Set(Object.keys(node.props));
- if (node.props.borders) {
- applyNodePropertyBorders(rect2, node.props.borders, totalWidth, totalHeight);
- propKeys.delete("borders");
- }
- propKeys.forEach((propKey) => {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.warn(`Unknown node property ${propKey}`);
- });
- }
- updateNodeBounds(node, rect2);
- node.intersect = function(point2) {
- return intersect.rect(node, point2);
- };
- return shapeSvg;
-};
-const composite = async (parent, node) => {
- const { shapeSvg, bbox, halfPadding } = await labelHelper(
- parent,
- node,
- "node " + node.classes,
- true
- );
- const rect2 = shapeSvg.insert("rect", ":first-child");
- const totalWidth = node.positioned ? node.width : bbox.width + node.padding;
- const totalHeight = node.positioned ? node.height : bbox.height + node.padding;
- const x = node.positioned ? -totalWidth / 2 : -bbox.width / 2 - halfPadding;
- const y = node.positioned ? -totalHeight / 2 : -bbox.height / 2 - halfPadding;
- rect2.attr("class", "basic cluster composite label-container").attr("style", node.style).attr("rx", node.rx).attr("ry", node.ry).attr("x", x).attr("y", y).attr("width", totalWidth).attr("height", totalHeight);
- if (node.props) {
- const propKeys = new Set(Object.keys(node.props));
- if (node.props.borders) {
- applyNodePropertyBorders(rect2, node.props.borders, totalWidth, totalHeight);
- propKeys.delete("borders");
- }
- propKeys.forEach((propKey) => {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.warn(`Unknown node property ${propKey}`);
- });
- }
- updateNodeBounds(node, rect2);
- node.intersect = function(point2) {
- return intersect.rect(node, point2);
- };
- return shapeSvg;
-};
-const labelRect = async (parent, node) => {
- const { shapeSvg } = await labelHelper(parent, node, "label", true);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.trace("Classes = ", node.class);
- const rect2 = shapeSvg.insert("rect", ":first-child");
- const totalWidth = 0;
- const totalHeight = 0;
- rect2.attr("width", totalWidth).attr("height", totalHeight);
- shapeSvg.attr("class", "label edgeLabel");
- if (node.props) {
- const propKeys = new Set(Object.keys(node.props));
- if (node.props.borders) {
- applyNodePropertyBorders(rect2, node.props.borders, totalWidth, totalHeight);
- propKeys.delete("borders");
- }
- propKeys.forEach((propKey) => {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.warn(`Unknown node property ${propKey}`);
- });
- }
- updateNodeBounds(node, rect2);
- node.intersect = function(point2) {
- return intersect.rect(node, point2);
- };
- return shapeSvg;
-};
-function applyNodePropertyBorders(rect2, borders, totalWidth, totalHeight) {
- const strokeDashArray = [];
- const addBorder = (length) => {
- strokeDashArray.push(length, 0);
- };
- const skipBorder = (length) => {
- strokeDashArray.push(0, length);
- };
- if (borders.includes("t")) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.debug("add top border");
- addBorder(totalWidth);
- } else {
- skipBorder(totalWidth);
- }
- if (borders.includes("r")) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.debug("add right border");
- addBorder(totalHeight);
- } else {
- skipBorder(totalHeight);
- }
- if (borders.includes("b")) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.debug("add bottom border");
- addBorder(totalWidth);
- } else {
- skipBorder(totalWidth);
- }
- if (borders.includes("l")) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.debug("add left border");
- addBorder(totalHeight);
- } else {
- skipBorder(totalHeight);
- }
- rect2.attr("stroke-dasharray", strokeDashArray.join(" "));
-}
-const rectWithTitle = (parent, node) => {
- let classes;
- if (!node.classes) {
- classes = "node default";
- } else {
- classes = "node " + node.classes;
- }
- const shapeSvg = parent.insert("g").attr("class", classes).attr("id", node.domId || node.id);
- const rect2 = shapeSvg.insert("rect", ":first-child");
- const innerLine = shapeSvg.insert("line");
- const label = shapeSvg.insert("g").attr("class", "label");
- const text2 = node.labelText.flat ? node.labelText.flat() : node.labelText;
- let title = "";
- if (typeof text2 === "object") {
- title = text2[0];
- } else {
- title = text2;
- }
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.info("Label text abc79", title, text2, typeof text2 === "object");
- const text = label.node().appendChild(createLabel$1(title, node.labelStyle, true, true));
- let bbox = { width: 0, height: 0 };
- if ((0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.m)((0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)().flowchart.htmlLabels)) {
- const div = text.children[0];
- const dv = (0,d3__WEBPACK_IMPORTED_MODULE_0__/* .select */ .Ltv)(text);
- bbox = div.getBoundingClientRect();
- dv.attr("width", bbox.width);
- dv.attr("height", bbox.height);
- }
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.info("Text 2", text2);
- const textRows = text2.slice(1, text2.length);
- let titleBox = text.getBBox();
- const descr = label.node().appendChild(
- createLabel$1(textRows.join ? textRows.join("<br/>") : textRows, node.labelStyle, true, true)
- );
- if ((0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.m)((0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)().flowchart.htmlLabels)) {
- const div = descr.children[0];
- const dv = (0,d3__WEBPACK_IMPORTED_MODULE_0__/* .select */ .Ltv)(descr);
- bbox = div.getBoundingClientRect();
- dv.attr("width", bbox.width);
- dv.attr("height", bbox.height);
- }
- const halfPadding = node.padding / 2;
- (0,d3__WEBPACK_IMPORTED_MODULE_0__/* .select */ .Ltv)(descr).attr(
- "transform",
- "translate( " + // (titleBox.width - bbox.width) / 2 +
- (bbox.width > titleBox.width ? 0 : (titleBox.width - bbox.width) / 2) + ", " + (titleBox.height + halfPadding + 5) + ")"
- );
- (0,d3__WEBPACK_IMPORTED_MODULE_0__/* .select */ .Ltv)(text).attr(
- "transform",
- "translate( " + // (titleBox.width - bbox.width) / 2 +
- (bbox.width < titleBox.width ? 0 : -(titleBox.width - bbox.width) / 2) + ", 0)"
- );
- bbox = label.node().getBBox();
- label.attr(
- "transform",
- "translate(" + -bbox.width / 2 + ", " + (-bbox.height / 2 - halfPadding + 3) + ")"
- );
- rect2.attr("class", "outer title-state").attr("x", -bbox.width / 2 - halfPadding).attr("y", -bbox.height / 2 - halfPadding).attr("width", bbox.width + node.padding).attr("height", bbox.height + node.padding);
- innerLine.attr("class", "divider").attr("x1", -bbox.width / 2 - halfPadding).attr("x2", bbox.width / 2 + halfPadding).attr("y1", -bbox.height / 2 - halfPadding + titleBox.height + halfPadding).attr("y2", -bbox.height / 2 - halfPadding + titleBox.height + halfPadding);
- updateNodeBounds(node, rect2);
- node.intersect = function(point2) {
- return intersect.rect(node, point2);
- };
- return shapeSvg;
-};
-const stadium = async (parent, node) => {
- const { shapeSvg, bbox } = await labelHelper(
- parent,
- node,
- getClassesFromNode(node, void 0),
- true
- );
- const h = bbox.height + node.padding;
- const w = bbox.width + h / 4 + node.padding;
- const rect2 = shapeSvg.insert("rect", ":first-child").attr("style", node.style).attr("rx", h / 2).attr("ry", h / 2).attr("x", -w / 2).attr("y", -h / 2).attr("width", w).attr("height", h);
- updateNodeBounds(node, rect2);
- node.intersect = function(point2) {
- return intersect.rect(node, point2);
- };
- return shapeSvg;
-};
-const circle = async (parent, node) => {
- const { shapeSvg, bbox, halfPadding } = await labelHelper(
- parent,
- node,
- getClassesFromNode(node, void 0),
- true
- );
- const circle2 = shapeSvg.insert("circle", ":first-child");
- circle2.attr("style", node.style).attr("rx", node.rx).attr("ry", node.ry).attr("r", bbox.width / 2 + halfPadding).attr("width", bbox.width + node.padding).attr("height", bbox.height + node.padding);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.info("Circle main");
- updateNodeBounds(node, circle2);
- node.intersect = function(point2) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.info("Circle intersect", node, bbox.width / 2 + halfPadding, point2);
- return intersect.circle(node, bbox.width / 2 + halfPadding, point2);
- };
- return shapeSvg;
-};
-const doublecircle = async (parent, node) => {
- const { shapeSvg, bbox, halfPadding } = await labelHelper(
- parent,
- node,
- getClassesFromNode(node, void 0),
- true
- );
- const gap = 5;
- const circleGroup = shapeSvg.insert("g", ":first-child");
- const outerCircle = circleGroup.insert("circle");
- const innerCircle = circleGroup.insert("circle");
- circleGroup.attr("class", node.class);
- outerCircle.attr("style", node.style).attr("rx", node.rx).attr("ry", node.ry).attr("r", bbox.width / 2 + halfPadding + gap).attr("width", bbox.width + node.padding + gap * 2).attr("height", bbox.height + node.padding + gap * 2);
- innerCircle.attr("style", node.style).attr("rx", node.rx).attr("ry", node.ry).attr("r", bbox.width / 2 + halfPadding).attr("width", bbox.width + node.padding).attr("height", bbox.height + node.padding);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.info("DoubleCircle main");
- updateNodeBounds(node, outerCircle);
- node.intersect = function(point2) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.info("DoubleCircle intersect", node, bbox.width / 2 + halfPadding + gap, point2);
- return intersect.circle(node, bbox.width / 2 + halfPadding + gap, point2);
- };
- return shapeSvg;
-};
-const subroutine = async (parent, node) => {
- const { shapeSvg, bbox } = await labelHelper(
- parent,
- node,
- getClassesFromNode(node, void 0),
- true
- );
- const w = bbox.width + node.padding;
- const h = bbox.height + node.padding;
- const points = [
- { x: 0, y: 0 },
- { x: w, y: 0 },
- { x: w, y: -h },
- { x: 0, y: -h },
- { x: 0, y: 0 },
- { x: -8, y: 0 },
- { x: w + 8, y: 0 },
- { x: w + 8, y: -h },
- { x: -8, y: -h },
- { x: -8, y: 0 }
- ];
- const el = insertPolygonShape(shapeSvg, w, h, points);
- el.attr("style", node.style);
- updateNodeBounds(node, el);
- node.intersect = function(point2) {
- return intersect.polygon(node, points, point2);
- };
- return shapeSvg;
-};
-const start = (parent, node) => {
- const shapeSvg = parent.insert("g").attr("class", "node default").attr("id", node.domId || node.id);
- const circle2 = shapeSvg.insert("circle", ":first-child");
- circle2.attr("class", "state-start").attr("r", 7).attr("width", 14).attr("height", 14);
- updateNodeBounds(node, circle2);
- node.intersect = function(point2) {
- return intersect.circle(node, 7, point2);
- };
- return shapeSvg;
-};
-const forkJoin = (parent, node, dir) => {
- const shapeSvg = parent.insert("g").attr("class", "node default").attr("id", node.domId || node.id);
- let width = 70;
- let height = 10;
- if (dir === "LR") {
- width = 10;
- height = 70;
- }
- const shape = shapeSvg.append("rect").attr("x", -1 * width / 2).attr("y", -1 * height / 2).attr("width", width).attr("height", height).attr("class", "fork-join");
- updateNodeBounds(node, shape);
- node.height = node.height + node.padding / 2;
- node.width = node.width + node.padding / 2;
- node.intersect = function(point2) {
- return intersect.rect(node, point2);
- };
- return shapeSvg;
-};
-const end = (parent, node) => {
- const shapeSvg = parent.insert("g").attr("class", "node default").attr("id", node.domId || node.id);
- const innerCircle = shapeSvg.insert("circle", ":first-child");
- const circle2 = shapeSvg.insert("circle", ":first-child");
- circle2.attr("class", "state-start").attr("r", 7).attr("width", 14).attr("height", 14);
- innerCircle.attr("class", "state-end").attr("r", 5).attr("width", 10).attr("height", 10);
- updateNodeBounds(node, circle2);
- node.intersect = function(point2) {
- return intersect.circle(node, 7, point2);
- };
- return shapeSvg;
-};
-const class_box = (parent, node) => {
- const halfPadding = node.padding / 2;
- const rowPadding = 4;
- const lineHeight = 8;
- let classes;
- if (!node.classes) {
- classes = "node default";
- } else {
- classes = "node " + node.classes;
- }
- const shapeSvg = parent.insert("g").attr("class", classes).attr("id", node.domId || node.id);
- const rect2 = shapeSvg.insert("rect", ":first-child");
- const topLine = shapeSvg.insert("line");
- const bottomLine = shapeSvg.insert("line");
- let maxWidth = 0;
- let maxHeight = rowPadding;
- const labelContainer = shapeSvg.insert("g").attr("class", "label");
- let verticalPos = 0;
- const hasInterface = node.classData.annotations && node.classData.annotations[0];
- const interfaceLabelText = node.classData.annotations[0] ? "«" + node.classData.annotations[0] + "»" : "";
- const interfaceLabel = labelContainer.node().appendChild(createLabel$1(interfaceLabelText, node.labelStyle, true, true));
- let interfaceBBox = interfaceLabel.getBBox();
- if ((0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.m)((0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)().flowchart.htmlLabels)) {
- const div = interfaceLabel.children[0];
- const dv = (0,d3__WEBPACK_IMPORTED_MODULE_0__/* .select */ .Ltv)(interfaceLabel);
- interfaceBBox = div.getBoundingClientRect();
- dv.attr("width", interfaceBBox.width);
- dv.attr("height", interfaceBBox.height);
- }
- if (node.classData.annotations[0]) {
- maxHeight += interfaceBBox.height + rowPadding;
- maxWidth += interfaceBBox.width;
- }
- let classTitleString = node.classData.label;
- if (node.classData.type !== void 0 && node.classData.type !== "") {
- if ((0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)().flowchart.htmlLabels) {
- classTitleString += "&lt;" + node.classData.type + "&gt;";
- } else {
- classTitleString += "<" + node.classData.type + ">";
- }
- }
- const classTitleLabel = labelContainer.node().appendChild(createLabel$1(classTitleString, node.labelStyle, true, true));
- (0,d3__WEBPACK_IMPORTED_MODULE_0__/* .select */ .Ltv)(classTitleLabel).attr("class", "classTitle");
- let classTitleBBox = classTitleLabel.getBBox();
- if ((0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.m)((0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)().flowchart.htmlLabels)) {
- const div = classTitleLabel.children[0];
- const dv = (0,d3__WEBPACK_IMPORTED_MODULE_0__/* .select */ .Ltv)(classTitleLabel);
- classTitleBBox = div.getBoundingClientRect();
- dv.attr("width", classTitleBBox.width);
- dv.attr("height", classTitleBBox.height);
- }
- maxHeight += classTitleBBox.height + rowPadding;
- if (classTitleBBox.width > maxWidth) {
- maxWidth = classTitleBBox.width;
- }
- const classAttributes = [];
- node.classData.members.forEach((member) => {
- const parsedInfo = member.getDisplayDetails();
- let parsedText = parsedInfo.displayText;
- if ((0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)().flowchart.htmlLabels) {
- parsedText = parsedText.replace(/</g, "&lt;").replace(/>/g, "&gt;");
- }
- const lbl = labelContainer.node().appendChild(
- createLabel$1(
- parsedText,
- parsedInfo.cssStyle ? parsedInfo.cssStyle : node.labelStyle,
- true,
- true
- )
- );
- let bbox = lbl.getBBox();
- if ((0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.m)((0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)().flowchart.htmlLabels)) {
- const div = lbl.children[0];
- const dv = (0,d3__WEBPACK_IMPORTED_MODULE_0__/* .select */ .Ltv)(lbl);
- bbox = div.getBoundingClientRect();
- dv.attr("width", bbox.width);
- dv.attr("height", bbox.height);
- }
- if (bbox.width > maxWidth) {
- maxWidth = bbox.width;
- }
- maxHeight += bbox.height + rowPadding;
- classAttributes.push(lbl);
- });
- maxHeight += lineHeight;
- const classMethods = [];
- node.classData.methods.forEach((member) => {
- const parsedInfo = member.getDisplayDetails();
- let displayText = parsedInfo.displayText;
- if ((0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)().flowchart.htmlLabels) {
- displayText = displayText.replace(/</g, "&lt;").replace(/>/g, "&gt;");
- }
- const lbl = labelContainer.node().appendChild(
- createLabel$1(
- displayText,
- parsedInfo.cssStyle ? parsedInfo.cssStyle : node.labelStyle,
- true,
- true
- )
- );
- let bbox = lbl.getBBox();
- if ((0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.m)((0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)().flowchart.htmlLabels)) {
- const div = lbl.children[0];
- const dv = (0,d3__WEBPACK_IMPORTED_MODULE_0__/* .select */ .Ltv)(lbl);
- bbox = div.getBoundingClientRect();
- dv.attr("width", bbox.width);
- dv.attr("height", bbox.height);
- }
- if (bbox.width > maxWidth) {
- maxWidth = bbox.width;
- }
- maxHeight += bbox.height + rowPadding;
- classMethods.push(lbl);
- });
- maxHeight += lineHeight;
- if (hasInterface) {
- let diffX2 = (maxWidth - interfaceBBox.width) / 2;
- (0,d3__WEBPACK_IMPORTED_MODULE_0__/* .select */ .Ltv)(interfaceLabel).attr(
- "transform",
- "translate( " + (-1 * maxWidth / 2 + diffX2) + ", " + -1 * maxHeight / 2 + ")"
- );
- verticalPos = interfaceBBox.height + rowPadding;
- }
- let diffX = (maxWidth - classTitleBBox.width) / 2;
- (0,d3__WEBPACK_IMPORTED_MODULE_0__/* .select */ .Ltv)(classTitleLabel).attr(
- "transform",
- "translate( " + (-1 * maxWidth / 2 + diffX) + ", " + (-1 * maxHeight / 2 + verticalPos) + ")"
- );
- verticalPos += classTitleBBox.height + rowPadding;
- topLine.attr("class", "divider").attr("x1", -maxWidth / 2 - halfPadding).attr("x2", maxWidth / 2 + halfPadding).attr("y1", -maxHeight / 2 - halfPadding + lineHeight + verticalPos).attr("y2", -maxHeight / 2 - halfPadding + lineHeight + verticalPos);
- verticalPos += lineHeight;
- classAttributes.forEach((lbl) => {
- (0,d3__WEBPACK_IMPORTED_MODULE_0__/* .select */ .Ltv)(lbl).attr(
- "transform",
- "translate( " + -maxWidth / 2 + ", " + (-1 * maxHeight / 2 + verticalPos + lineHeight / 2) + ")"
- );
- const memberBBox = lbl == null ? void 0 : lbl.getBBox();
- verticalPos += ((memberBBox == null ? void 0 : memberBBox.height) ?? 0) + rowPadding;
- });
- verticalPos += lineHeight;
- bottomLine.attr("class", "divider").attr("x1", -maxWidth / 2 - halfPadding).attr("x2", maxWidth / 2 + halfPadding).attr("y1", -maxHeight / 2 - halfPadding + lineHeight + verticalPos).attr("y2", -maxHeight / 2 - halfPadding + lineHeight + verticalPos);
- verticalPos += lineHeight;
- classMethods.forEach((lbl) => {
- (0,d3__WEBPACK_IMPORTED_MODULE_0__/* .select */ .Ltv)(lbl).attr(
- "transform",
- "translate( " + -maxWidth / 2 + ", " + (-1 * maxHeight / 2 + verticalPos) + ")"
- );
- const memberBBox = lbl == null ? void 0 : lbl.getBBox();
- verticalPos += ((memberBBox == null ? void 0 : memberBBox.height) ?? 0) + rowPadding;
- });
- rect2.attr("style", node.style).attr("class", "outer title-state").attr("x", -maxWidth / 2 - halfPadding).attr("y", -(maxHeight / 2) - halfPadding).attr("width", maxWidth + node.padding).attr("height", maxHeight + node.padding);
- updateNodeBounds(node, rect2);
- node.intersect = function(point2) {
- return intersect.rect(node, point2);
- };
- return shapeSvg;
-};
-const shapes = {
- rhombus: question,
- composite,
- question,
- rect,
- labelRect,
- rectWithTitle,
- choice,
- circle,
- doublecircle,
- stadium,
- hexagon,
- block_arrow,
- rect_left_inv_arrow,
- lean_right,
- lean_left,
- trapezoid,
- inv_trapezoid,
- rect_right_inv_arrow,
- cylinder,
- start,
- end,
- note: note$1,
- subroutine,
- fork: forkJoin,
- join: forkJoin,
- class_box
-};
-let nodeElems = {};
-const insertNode = async (elem, node, dir) => {
- let newEl;
- let el;
- if (node.link) {
- let target;
- if ((0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)().securityLevel === "sandbox") {
- target = "_top";
- } else if (node.linkTarget) {
- target = node.linkTarget || "_blank";
- }
- newEl = elem.insert("svg:a").attr("xlink:href", node.link).attr("target", target);
- el = await shapes[node.shape](newEl, node, dir);
- } else {
- el = await shapes[node.shape](elem, node, dir);
- newEl = el;
- }
- if (node.tooltip) {
- el.attr("title", node.tooltip);
- }
- if (node.class) {
- el.attr("class", "node default " + node.class);
- }
- newEl.attr("data-node", "true");
- newEl.attr("data-id", node.id);
- nodeElems[node.id] = newEl;
- if (node.haveCallback) {
- nodeElems[node.id].attr("class", nodeElems[node.id].attr("class") + " clickable");
- }
- return newEl;
-};
-const setNodeElem = (elem, node) => {
- nodeElems[node.id] = elem;
-};
-const clear$1 = () => {
- nodeElems = {};
-};
-const positionNode = (node) => {
- const el = nodeElems[node.id];
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.trace(
- "Transforming node",
- node.diff,
- node,
- "translate(" + (node.x - node.width / 2 - 5) + ", " + node.width / 2 + ")"
- );
- const padding = 8;
- const diff = node.diff || 0;
- if (node.clusterNode) {
- el.attr(
- "transform",
- "translate(" + (node.x + diff - node.width / 2) + ", " + (node.y - node.height / 2 - padding) + ")"
- );
- } else {
- el.attr("transform", "translate(" + node.x + ", " + node.y + ")");
- }
- return diff;
-};
-const getSubGraphTitleMargins = ({
- flowchart
-}) => {
- var _a, _b;
- const subGraphTitleTopMargin = ((_a = flowchart == null ? void 0 : flowchart.subGraphTitleMargin) == null ? void 0 : _a.top) ?? 0;
- const subGraphTitleBottomMargin = ((_b = flowchart == null ? void 0 : flowchart.subGraphTitleMargin) == null ? void 0 : _b.bottom) ?? 0;
- const subGraphTitleTotalMargin = subGraphTitleTopMargin + subGraphTitleBottomMargin;
- return {
- subGraphTitleTopMargin,
- subGraphTitleBottomMargin,
- subGraphTitleTotalMargin
- };
-};
-const markerOffsets = {
- aggregation: 18,
- extension: 18,
- composition: 18,
- dependency: 6,
- lollipop: 13.5,
- arrow_point: 5.3
-};
-function calculateDeltaAndAngle(point1, point2) {
- if (point1 === void 0 || point2 === void 0) {
- return { angle: 0, deltaX: 0, deltaY: 0 };
- }
- point1 = pointTransformer(point1);
- point2 = pointTransformer(point2);
- const [x1, y1] = [point1.x, point1.y];
- const [x2, y2] = [point2.x, point2.y];
- const deltaX = x2 - x1;
- const deltaY = y2 - y1;
- return { angle: Math.atan(deltaY / deltaX), deltaX, deltaY };
-}
-const pointTransformer = (data) => {
- if (Array.isArray(data)) {
- return { x: data[0], y: data[1] };
- }
- return data;
-};
-const getLineFunctionsWithOffset = (edge) => {
- return {
- x: function(d, i, data) {
- let offset = 0;
- if (i === 0 && Object.hasOwn(markerOffsets, edge.arrowTypeStart)) {
- const { angle, deltaX } = calculateDeltaAndAngle(data[0], data[1]);
- offset = markerOffsets[edge.arrowTypeStart] * Math.cos(angle) * (deltaX >= 0 ? 1 : -1);
- } else if (i === data.length - 1 && Object.hasOwn(markerOffsets, edge.arrowTypeEnd)) {
- const { angle, deltaX } = calculateDeltaAndAngle(
- data[data.length - 1],
- data[data.length - 2]
- );
- offset = markerOffsets[edge.arrowTypeEnd] * Math.cos(angle) * (deltaX >= 0 ? 1 : -1);
- }
- return pointTransformer(d).x + offset;
- },
- y: function(d, i, data) {
- let offset = 0;
- if (i === 0 && Object.hasOwn(markerOffsets, edge.arrowTypeStart)) {
- const { angle, deltaY } = calculateDeltaAndAngle(data[0], data[1]);
- offset = markerOffsets[edge.arrowTypeStart] * Math.abs(Math.sin(angle)) * (deltaY >= 0 ? 1 : -1);
- } else if (i === data.length - 1 && Object.hasOwn(markerOffsets, edge.arrowTypeEnd)) {
- const { angle, deltaY } = calculateDeltaAndAngle(
- data[data.length - 1],
- data[data.length - 2]
- );
- offset = markerOffsets[edge.arrowTypeEnd] * Math.abs(Math.sin(angle)) * (deltaY >= 0 ? 1 : -1);
- }
- return pointTransformer(d).y + offset;
- }
- };
-};
-const addEdgeMarkers = (svgPath, edge, url, id, diagramType) => {
- if (edge.arrowTypeStart) {
- addEdgeMarker(svgPath, "start", edge.arrowTypeStart, url, id, diagramType);
- }
- if (edge.arrowTypeEnd) {
- addEdgeMarker(svgPath, "end", edge.arrowTypeEnd, url, id, diagramType);
- }
-};
-const arrowTypesMap = {
- arrow_cross: "cross",
- arrow_point: "point",
- arrow_barb: "barb",
- arrow_circle: "circle",
- aggregation: "aggregation",
- extension: "extension",
- composition: "composition",
- dependency: "dependency",
- lollipop: "lollipop"
-};
-const addEdgeMarker = (svgPath, position, arrowType, url, id, diagramType) => {
- const endMarkerType = arrowTypesMap[arrowType];
- if (!endMarkerType) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.warn(`Unknown arrow type: ${arrowType}`);
- return;
- }
- const suffix = position === "start" ? "Start" : "End";
- svgPath.attr(`marker-${position}`, `url(${url}#${id}_${diagramType}-${endMarkerType}${suffix})`);
-};
-let edgeLabels = {};
-let terminalLabels = {};
-const clear = () => {
- edgeLabels = {};
- terminalLabels = {};
-};
-const insertEdgeLabel = (elem, edge) => {
- const useHtmlLabels = (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.m)((0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)().flowchart.htmlLabels);
- const labelElement = edge.labelType === "markdown" ? (0,_createText_ca0c5216_js__WEBPACK_IMPORTED_MODULE_2__.a)(elem, edge.label, {
- style: edge.labelStyle,
- useHtmlLabels,
- addSvgBackground: true
- }) : createLabel$1(edge.label, edge.labelStyle);
- const edgeLabel = elem.insert("g").attr("class", "edgeLabel");
- const label = edgeLabel.insert("g").attr("class", "label");
- label.node().appendChild(labelElement);
- let bbox = labelElement.getBBox();
- if (useHtmlLabels) {
- const div = labelElement.children[0];
- const dv = (0,d3__WEBPACK_IMPORTED_MODULE_0__/* .select */ .Ltv)(labelElement);
- bbox = div.getBoundingClientRect();
- dv.attr("width", bbox.width);
- dv.attr("height", bbox.height);
- }
- label.attr("transform", "translate(" + -bbox.width / 2 + ", " + -bbox.height / 2 + ")");
- edgeLabels[edge.id] = edgeLabel;
- edge.width = bbox.width;
- edge.height = bbox.height;
- let fo;
- if (edge.startLabelLeft) {
- const startLabelElement = createLabel$1(edge.startLabelLeft, edge.labelStyle);
- const startEdgeLabelLeft = elem.insert("g").attr("class", "edgeTerminals");
- const inner = startEdgeLabelLeft.insert("g").attr("class", "inner");
- fo = inner.node().appendChild(startLabelElement);
- const slBox = startLabelElement.getBBox();
- inner.attr("transform", "translate(" + -slBox.width / 2 + ", " + -slBox.height / 2 + ")");
- if (!terminalLabels[edge.id]) {
- terminalLabels[edge.id] = {};
- }
- terminalLabels[edge.id].startLeft = startEdgeLabelLeft;
- setTerminalWidth(fo, edge.startLabelLeft);
- }
- if (edge.startLabelRight) {
- const startLabelElement = createLabel$1(edge.startLabelRight, edge.labelStyle);
- const startEdgeLabelRight = elem.insert("g").attr("class", "edgeTerminals");
- const inner = startEdgeLabelRight.insert("g").attr("class", "inner");
- fo = startEdgeLabelRight.node().appendChild(startLabelElement);
- inner.node().appendChild(startLabelElement);
- const slBox = startLabelElement.getBBox();
- inner.attr("transform", "translate(" + -slBox.width / 2 + ", " + -slBox.height / 2 + ")");
- if (!terminalLabels[edge.id]) {
- terminalLabels[edge.id] = {};
- }
- terminalLabels[edge.id].startRight = startEdgeLabelRight;
- setTerminalWidth(fo, edge.startLabelRight);
- }
- if (edge.endLabelLeft) {
- const endLabelElement = createLabel$1(edge.endLabelLeft, edge.labelStyle);
- const endEdgeLabelLeft = elem.insert("g").attr("class", "edgeTerminals");
- const inner = endEdgeLabelLeft.insert("g").attr("class", "inner");
- fo = inner.node().appendChild(endLabelElement);
- const slBox = endLabelElement.getBBox();
- inner.attr("transform", "translate(" + -slBox.width / 2 + ", " + -slBox.height / 2 + ")");
- endEdgeLabelLeft.node().appendChild(endLabelElement);
- if (!terminalLabels[edge.id]) {
- terminalLabels[edge.id] = {};
- }
- terminalLabels[edge.id].endLeft = endEdgeLabelLeft;
- setTerminalWidth(fo, edge.endLabelLeft);
- }
- if (edge.endLabelRight) {
- const endLabelElement = createLabel$1(edge.endLabelRight, edge.labelStyle);
- const endEdgeLabelRight = elem.insert("g").attr("class", "edgeTerminals");
- const inner = endEdgeLabelRight.insert("g").attr("class", "inner");
- fo = inner.node().appendChild(endLabelElement);
- const slBox = endLabelElement.getBBox();
- inner.attr("transform", "translate(" + -slBox.width / 2 + ", " + -slBox.height / 2 + ")");
- endEdgeLabelRight.node().appendChild(endLabelElement);
- if (!terminalLabels[edge.id]) {
- terminalLabels[edge.id] = {};
- }
- terminalLabels[edge.id].endRight = endEdgeLabelRight;
- setTerminalWidth(fo, edge.endLabelRight);
- }
- return labelElement;
-};
-function setTerminalWidth(fo, value) {
- if ((0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)().flowchart.htmlLabels && fo) {
- fo.style.width = value.length * 9 + "px";
- fo.style.height = "12px";
- }
-}
-const positionEdgeLabel = (edge, paths) => {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.debug("Moving label abc88 ", edge.id, edge.label, edgeLabels[edge.id], paths);
- let path = paths.updatedPath ? paths.updatedPath : paths.originalPath;
- const siteConfig = (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)();
- const { subGraphTitleTotalMargin } = getSubGraphTitleMargins(siteConfig);
- if (edge.label) {
- const el = edgeLabels[edge.id];
- let x = edge.x;
- let y = edge.y;
- if (path) {
- const pos = _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.u.calcLabelPosition(path);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.debug(
- "Moving label " + edge.label + " from (",
- x,
- ",",
- y,
- ") to (",
- pos.x,
- ",",
- pos.y,
- ") abc88"
- );
- if (paths.updatedPath) {
- x = pos.x;
- y = pos.y;
- }
- }
- el.attr("transform", `translate(${x}, ${y + subGraphTitleTotalMargin / 2})`);
- }
- if (edge.startLabelLeft) {
- const el = terminalLabels[edge.id].startLeft;
- let x = edge.x;
- let y = edge.y;
- if (path) {
- const pos = _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.u.calcTerminalLabelPosition(edge.arrowTypeStart ? 10 : 0, "start_left", path);
- x = pos.x;
- y = pos.y;
- }
- el.attr("transform", `translate(${x}, ${y})`);
- }
- if (edge.startLabelRight) {
- const el = terminalLabels[edge.id].startRight;
- let x = edge.x;
- let y = edge.y;
- if (path) {
- const pos = _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.u.calcTerminalLabelPosition(
- edge.arrowTypeStart ? 10 : 0,
- "start_right",
- path
- );
- x = pos.x;
- y = pos.y;
- }
- el.attr("transform", `translate(${x}, ${y})`);
- }
- if (edge.endLabelLeft) {
- const el = terminalLabels[edge.id].endLeft;
- let x = edge.x;
- let y = edge.y;
- if (path) {
- const pos = _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.u.calcTerminalLabelPosition(edge.arrowTypeEnd ? 10 : 0, "end_left", path);
- x = pos.x;
- y = pos.y;
- }
- el.attr("transform", `translate(${x}, ${y})`);
- }
- if (edge.endLabelRight) {
- const el = terminalLabels[edge.id].endRight;
- let x = edge.x;
- let y = edge.y;
- if (path) {
- const pos = _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.u.calcTerminalLabelPosition(edge.arrowTypeEnd ? 10 : 0, "end_right", path);
- x = pos.x;
- y = pos.y;
- }
- el.attr("transform", `translate(${x}, ${y})`);
- }
-};
-const outsideNode = (node, point2) => {
- const x = node.x;
- const y = node.y;
- const dx = Math.abs(point2.x - x);
- const dy = Math.abs(point2.y - y);
- const w = node.width / 2;
- const h = node.height / 2;
- if (dx >= w || dy >= h) {
- return true;
- }
- return false;
-};
-const intersection = (node, outsidePoint, insidePoint) => {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.debug(`intersection calc abc89:
- outsidePoint: ${JSON.stringify(outsidePoint)}
- insidePoint : ${JSON.stringify(insidePoint)}
- node : x:${node.x} y:${node.y} w:${node.width} h:${node.height}`);
- const x = node.x;
- const y = node.y;
- const dx = Math.abs(x - insidePoint.x);
- const w = node.width / 2;
- let r = insidePoint.x < outsidePoint.x ? w - dx : w + dx;
- const h = node.height / 2;
- const Q = Math.abs(outsidePoint.y - insidePoint.y);
- const R = Math.abs(outsidePoint.x - insidePoint.x);
- if (Math.abs(y - outsidePoint.y) * w > Math.abs(x - outsidePoint.x) * h) {
- let q = insidePoint.y < outsidePoint.y ? outsidePoint.y - h - y : y - h - outsidePoint.y;
- r = R * q / Q;
- const res = {
- x: insidePoint.x < outsidePoint.x ? insidePoint.x + r : insidePoint.x - R + r,
- y: insidePoint.y < outsidePoint.y ? insidePoint.y + Q - q : insidePoint.y - Q + q
- };
- if (r === 0) {
- res.x = outsidePoint.x;
- res.y = outsidePoint.y;
- }
- if (R === 0) {
- res.x = outsidePoint.x;
- }
- if (Q === 0) {
- res.y = outsidePoint.y;
- }
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.debug(`abc89 topp/bott calc, Q ${Q}, q ${q}, R ${R}, r ${r}`, res);
- return res;
- } else {
- if (insidePoint.x < outsidePoint.x) {
- r = outsidePoint.x - w - x;
- } else {
- r = x - w - outsidePoint.x;
- }
- let q = Q * r / R;
- let _x = insidePoint.x < outsidePoint.x ? insidePoint.x + R - r : insidePoint.x - R + r;
- let _y = insidePoint.y < outsidePoint.y ? insidePoint.y + q : insidePoint.y - q;
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.debug(`sides calc abc89, Q ${Q}, q ${q}, R ${R}, r ${r}`, { _x, _y });
- if (r === 0) {
- _x = outsidePoint.x;
- _y = outsidePoint.y;
- }
- if (R === 0) {
- _x = outsidePoint.x;
- }
- if (Q === 0) {
- _y = outsidePoint.y;
- }
- return { x: _x, y: _y };
- }
-};
-const cutPathAtIntersect = (_points, boundaryNode) => {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.debug("abc88 cutPathAtIntersect", _points, boundaryNode);
- let points = [];
- let lastPointOutside = _points[0];
- let isInside = false;
- _points.forEach((point2) => {
- if (!outsideNode(boundaryNode, point2) && !isInside) {
- const inter = intersection(boundaryNode, lastPointOutside, point2);
- let pointPresent = false;
- points.forEach((p) => {
- pointPresent = pointPresent || p.x === inter.x && p.y === inter.y;
- });
- if (!points.some((e) => e.x === inter.x && e.y === inter.y)) {
- points.push(inter);
- }
- isInside = true;
- } else {
- lastPointOutside = point2;
- if (!isInside) {
- points.push(point2);
- }
- }
- });
- return points;
-};
-const insertEdge = function(elem, e, edge, clusterDb, diagramType, graph, id) {
- let points = edge.points;
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.debug("abc88 InsertEdge: edge=", edge, "e=", e);
- let pointsHasChanged = false;
- const tail = graph.node(e.v);
- var head = graph.node(e.w);
- if ((head == null ? void 0 : head.intersect) && (tail == null ? void 0 : tail.intersect)) {
- points = points.slice(1, edge.points.length - 1);
- points.unshift(tail.intersect(points[0]));
- points.push(head.intersect(points[points.length - 1]));
- }
- if (edge.toCluster) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.debug("to cluster abc88", clusterDb[edge.toCluster]);
- points = cutPathAtIntersect(edge.points, clusterDb[edge.toCluster].node);
- pointsHasChanged = true;
- }
- if (edge.fromCluster) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.debug("from cluster abc88", clusterDb[edge.fromCluster]);
- points = cutPathAtIntersect(points.reverse(), clusterDb[edge.fromCluster].node).reverse();
- pointsHasChanged = true;
- }
- const lineData = points.filter((p) => !Number.isNaN(p.y));
- let curve = d3__WEBPACK_IMPORTED_MODULE_0__/* .curveBasis */ .qrM;
- if (edge.curve && (diagramType === "graph" || diagramType === "flowchart")) {
- curve = edge.curve;
- }
- const { x, y } = getLineFunctionsWithOffset(edge);
- const lineFunction = (0,d3__WEBPACK_IMPORTED_MODULE_0__/* .line */ .n8j)().x(x).y(y).curve(curve);
- let strokeClasses;
- switch (edge.thickness) {
- case "normal":
- strokeClasses = "edge-thickness-normal";
- break;
- case "thick":
- strokeClasses = "edge-thickness-thick";
- break;
- case "invisible":
- strokeClasses = "edge-thickness-thick";
- break;
- default:
- strokeClasses = "";
- }
- switch (edge.pattern) {
- case "solid":
- strokeClasses += " edge-pattern-solid";
- break;
- case "dotted":
- strokeClasses += " edge-pattern-dotted";
- break;
- case "dashed":
- strokeClasses += " edge-pattern-dashed";
- break;
- }
- const svgPath = elem.append("path").attr("d", lineFunction(lineData)).attr("id", edge.id).attr("class", " " + strokeClasses + (edge.classes ? " " + edge.classes : "")).attr("style", edge.style);
- let url = "";
- if ((0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)().flowchart.arrowMarkerAbsolute || (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)().state.arrowMarkerAbsolute) {
- url = window.location.protocol + "//" + window.location.host + window.location.pathname + window.location.search;
- url = url.replace(/\(/g, "\\(");
- url = url.replace(/\)/g, "\\)");
- }
- addEdgeMarkers(svgPath, edge, url, id, diagramType);
- let paths = {};
- if (pointsHasChanged) {
- paths.updatedPath = points;
- }
- paths.originalPath = edge.points;
- return paths;
-};
-
-
-
-/***/ }),
-
-/***/ 35364:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ r: () => (/* binding */ render)
-/* harmony export */ });
-/* harmony import */ var dagre_d3_es_src_dagre_index_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(21176);
-/* harmony import */ var dagre_d3_es_src_graphlib_json_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(14075);
-/* harmony import */ var _edges_066a5561_js__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(98055);
-/* harmony import */ var _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(99702);
-/* harmony import */ var dagre_d3_es_src_graphlib_index_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(697);
-/* harmony import */ var _createText_ca0c5216_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(18897);
-/* harmony import */ var d3__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(26312);
-
-
-
-
-
-
-
-let clusterDb = {};
-let descendants = {};
-let parents = {};
-const clear$1 = () => {
- descendants = {};
- parents = {};
- clusterDb = {};
-};
-const isDescendant = (id, ancestorId) => {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.trace("In isDescendant", ancestorId, " ", id, " = ", descendants[ancestorId].includes(id));
- if (descendants[ancestorId].includes(id)) {
- return true;
- }
- return false;
-};
-const edgeInCluster = (edge, clusterId) => {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info("Descendants of ", clusterId, " is ", descendants[clusterId]);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info("Edge is ", edge);
- if (edge.v === clusterId) {
- return false;
- }
- if (edge.w === clusterId) {
- return false;
- }
- if (!descendants[clusterId]) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.debug("Tilt, ", clusterId, ",not in descendants");
- return false;
- }
- return descendants[clusterId].includes(edge.v) || isDescendant(edge.v, clusterId) || isDescendant(edge.w, clusterId) || descendants[clusterId].includes(edge.w);
-};
-const copy = (clusterId, graph, newGraph, rootId) => {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.warn(
- "Copying children of ",
- clusterId,
- "root",
- rootId,
- "data",
- graph.node(clusterId),
- rootId
- );
- const nodes = graph.children(clusterId) || [];
- if (clusterId !== rootId) {
- nodes.push(clusterId);
- }
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.warn("Copying (nodes) clusterId", clusterId, "nodes", nodes);
- nodes.forEach((node) => {
- if (graph.children(node).length > 0) {
- copy(node, graph, newGraph, rootId);
- } else {
- const data = graph.node(node);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info("cp ", node, " to ", rootId, " with parent ", clusterId);
- newGraph.setNode(node, data);
- if (rootId !== graph.parent(node)) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.warn("Setting parent", node, graph.parent(node));
- newGraph.setParent(node, graph.parent(node));
- }
- if (clusterId !== rootId && node !== clusterId) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.debug("Setting parent", node, clusterId);
- newGraph.setParent(node, clusterId);
- } else {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info("In copy ", clusterId, "root", rootId, "data", graph.node(clusterId), rootId);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.debug(
- "Not Setting parent for node=",
- node,
- "cluster!==rootId",
- clusterId !== rootId,
- "node!==clusterId",
- node !== clusterId
- );
- }
- const edges = graph.edges(node);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.debug("Copying Edges", edges);
- edges.forEach((edge) => {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info("Edge", edge);
- const data2 = graph.edge(edge.v, edge.w, edge.name);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info("Edge data", data2, rootId);
- try {
- if (edgeInCluster(edge, rootId)) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info("Copying as ", edge.v, edge.w, data2, edge.name);
- newGraph.setEdge(edge.v, edge.w, data2, edge.name);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info("newGraph edges ", newGraph.edges(), newGraph.edge(newGraph.edges()[0]));
- } else {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info(
- "Skipping copy of edge ",
- edge.v,
- "-->",
- edge.w,
- " rootId: ",
- rootId,
- " clusterId:",
- clusterId
- );
- }
- } catch (e) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.error(e);
- }
- });
- }
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.debug("Removing node", node);
- graph.removeNode(node);
- });
-};
-const extractDescendants = (id, graph) => {
- const children = graph.children(id);
- let res = [...children];
- for (const child of children) {
- parents[child] = id;
- res = [...res, ...extractDescendants(child, graph)];
- }
- return res;
-};
-const findNonClusterChild = (id, graph) => {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.trace("Searching", id);
- const children = graph.children(id);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.trace("Searching children of id ", id, children);
- if (children.length < 1) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.trace("This is a valid node", id);
- return id;
- }
- for (const child of children) {
- const _id = findNonClusterChild(child, graph);
- if (_id) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.trace("Found replacement for", id, " => ", _id);
- return _id;
- }
- }
-};
-const getAnchorId = (id) => {
- if (!clusterDb[id]) {
- return id;
- }
- if (!clusterDb[id].externalConnections) {
- return id;
- }
- if (clusterDb[id]) {
- return clusterDb[id].id;
- }
- return id;
-};
-const adjustClustersAndEdges = (graph, depth) => {
- if (!graph || depth > 10) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.debug("Opting out, no graph ");
- return;
- } else {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.debug("Opting in, graph ");
- }
- graph.nodes().forEach(function(id) {
- const children = graph.children(id);
- if (children.length > 0) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.warn(
- "Cluster identified",
- id,
- " Replacement id in edges: ",
- findNonClusterChild(id, graph)
- );
- descendants[id] = extractDescendants(id, graph);
- clusterDb[id] = { id: findNonClusterChild(id, graph), clusterData: graph.node(id) };
- }
- });
- graph.nodes().forEach(function(id) {
- const children = graph.children(id);
- const edges = graph.edges();
- if (children.length > 0) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.debug("Cluster identified", id, descendants);
- edges.forEach((edge) => {
- if (edge.v !== id && edge.w !== id) {
- const d1 = isDescendant(edge.v, id);
- const d2 = isDescendant(edge.w, id);
- if (d1 ^ d2) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.warn("Edge: ", edge, " leaves cluster ", id);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.warn("Descendants of XXX ", id, ": ", descendants[id]);
- clusterDb[id].externalConnections = true;
- }
- }
- });
- } else {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.debug("Not a cluster ", id, descendants);
- }
- });
- for (let id of Object.keys(clusterDb)) {
- const nonClusterChild = clusterDb[id].id;
- const parent = graph.parent(nonClusterChild);
- if (parent !== id && clusterDb[parent] && !clusterDb[parent].externalConnections) {
- clusterDb[id].id = parent;
- }
- }
- graph.edges().forEach(function(e) {
- const edge = graph.edge(e);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.warn("Edge " + e.v + " -> " + e.w + ": " + JSON.stringify(e));
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.warn("Edge " + e.v + " -> " + e.w + ": " + JSON.stringify(graph.edge(e)));
- let v = e.v;
- let w = e.w;
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.warn(
- "Fix XXX",
- clusterDb,
- "ids:",
- e.v,
- e.w,
- "Translating: ",
- clusterDb[e.v],
- " --- ",
- clusterDb[e.w]
- );
- if (clusterDb[e.v] && clusterDb[e.w] && clusterDb[e.v] === clusterDb[e.w]) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.warn("Fixing and trixing link to self - removing XXX", e.v, e.w, e.name);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.warn("Fixing and trixing - removing XXX", e.v, e.w, e.name);
- v = getAnchorId(e.v);
- w = getAnchorId(e.w);
- graph.removeEdge(e.v, e.w, e.name);
- const specialId = e.w + "---" + e.v;
- graph.setNode(specialId, {
- domId: specialId,
- id: specialId,
- labelStyle: "",
- labelText: edge.label,
- padding: 0,
- shape: "labelRect",
- style: ""
- });
- const edge1 = structuredClone(edge);
- const edge2 = structuredClone(edge);
- edge1.label = "";
- edge1.arrowTypeEnd = "none";
- edge2.label = "";
- edge1.fromCluster = e.v;
- edge2.toCluster = e.v;
- graph.setEdge(v, specialId, edge1, e.name + "-cyclic-special");
- graph.setEdge(specialId, w, edge2, e.name + "-cyclic-special");
- } else if (clusterDb[e.v] || clusterDb[e.w]) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.warn("Fixing and trixing - removing XXX", e.v, e.w, e.name);
- v = getAnchorId(e.v);
- w = getAnchorId(e.w);
- graph.removeEdge(e.v, e.w, e.name);
- if (v !== e.v) {
- const parent = graph.parent(v);
- clusterDb[parent].externalConnections = true;
- edge.fromCluster = e.v;
- }
- if (w !== e.w) {
- const parent = graph.parent(w);
- clusterDb[parent].externalConnections = true;
- edge.toCluster = e.w;
- }
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.warn("Fix Replacing with XXX", v, w, e.name);
- graph.setEdge(v, w, edge, e.name);
- }
- });
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.warn("Adjusted Graph", dagre_d3_es_src_graphlib_json_js__WEBPACK_IMPORTED_MODULE_1__/* .write */ .M(graph));
- extractor(graph, 0);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.trace(clusterDb);
-};
-const extractor = (graph, depth) => {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.warn("extractor - ", depth, dagre_d3_es_src_graphlib_json_js__WEBPACK_IMPORTED_MODULE_1__/* .write */ .M(graph), graph.children("D"));
- if (depth > 10) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.error("Bailing out");
- return;
- }
- let nodes = graph.nodes();
- let hasChildren = false;
- for (const node of nodes) {
- const children = graph.children(node);
- hasChildren = hasChildren || children.length > 0;
- }
- if (!hasChildren) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.debug("Done, no node has children", graph.nodes());
- return;
- }
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.debug("Nodes = ", nodes, depth);
- for (const node of nodes) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.debug(
- "Extracting node",
- node,
- clusterDb,
- clusterDb[node] && !clusterDb[node].externalConnections,
- !graph.parent(node),
- graph.node(node),
- graph.children("D"),
- " Depth ",
- depth
- );
- if (!clusterDb[node]) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.debug("Not a cluster", node, depth);
- } else if (!clusterDb[node].externalConnections && // !graph.parent(node) &&
- graph.children(node) && graph.children(node).length > 0) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.warn(
- "Cluster without external connections, without a parent and with children",
- node,
- depth
- );
- const graphSettings = graph.graph();
- let dir = graphSettings.rankdir === "TB" ? "LR" : "TB";
- if (clusterDb[node] && clusterDb[node].clusterData && clusterDb[node].clusterData.dir) {
- dir = clusterDb[node].clusterData.dir;
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.warn("Fixing dir", clusterDb[node].clusterData.dir, dir);
- }
- const clusterGraph = new dagre_d3_es_src_graphlib_index_js__WEBPACK_IMPORTED_MODULE_2__/* .Graph */ .T({
- multigraph: true,
- compound: true
- }).setGraph({
- rankdir: dir,
- // Todo: set proper spacing
- nodesep: 50,
- ranksep: 50,
- marginx: 8,
- marginy: 8
- }).setDefaultEdgeLabel(function() {
- return {};
- });
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.warn("Old graph before copy", dagre_d3_es_src_graphlib_json_js__WEBPACK_IMPORTED_MODULE_1__/* .write */ .M(graph));
- copy(node, graph, clusterGraph, node);
- graph.setNode(node, {
- clusterNode: true,
- id: node,
- clusterData: clusterDb[node].clusterData,
- labelText: clusterDb[node].labelText,
- graph: clusterGraph
- });
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.warn("New graph after copy node: (", node, ")", dagre_d3_es_src_graphlib_json_js__WEBPACK_IMPORTED_MODULE_1__/* .write */ .M(clusterGraph));
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.debug("Old graph after copy", dagre_d3_es_src_graphlib_json_js__WEBPACK_IMPORTED_MODULE_1__/* .write */ .M(graph));
- } else {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.warn(
- "Cluster ** ",
- node,
- " **not meeting the criteria !externalConnections:",
- !clusterDb[node].externalConnections,
- " no parent: ",
- !graph.parent(node),
- " children ",
- graph.children(node) && graph.children(node).length > 0,
- graph.children("D"),
- depth
- );
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.debug(clusterDb);
- }
- }
- nodes = graph.nodes();
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.warn("New list of nodes", nodes);
- for (const node of nodes) {
- const data = graph.node(node);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.warn(" Now next level", node, data);
- if (data.clusterNode) {
- extractor(data.graph, depth + 1);
- }
- }
-};
-const sorter = (graph, nodes) => {
- if (nodes.length === 0) {
- return [];
- }
- let result = Object.assign(nodes);
- nodes.forEach((node) => {
- const children = graph.children(node);
- const sorted = sorter(graph, children);
- result = [...result, ...sorted];
- });
- return result;
-};
-const sortNodesByHierarchy = (graph) => sorter(graph, graph.children());
-const rect = (parent, node) => {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info("Creating subgraph rect for ", node.id, node);
- const siteConfig = (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.c)();
- const shapeSvg = parent.insert("g").attr("class", "cluster" + (node.class ? " " + node.class : "")).attr("id", node.id);
- const rect2 = shapeSvg.insert("rect", ":first-child");
- const useHtmlLabels = (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.m)(siteConfig.flowchart.htmlLabels);
- const label = shapeSvg.insert("g").attr("class", "cluster-label");
- const text = node.labelType === "markdown" ? (0,_createText_ca0c5216_js__WEBPACK_IMPORTED_MODULE_5__.a)(label, node.labelText, { style: node.labelStyle, useHtmlLabels }) : label.node().appendChild((0,_edges_066a5561_js__WEBPACK_IMPORTED_MODULE_6__.c)(node.labelText, node.labelStyle, void 0, true));
- let bbox = text.getBBox();
- if ((0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.m)(siteConfig.flowchart.htmlLabels)) {
- const div = text.children[0];
- const dv = (0,d3__WEBPACK_IMPORTED_MODULE_3__/* .select */ .Ltv)(text);
- bbox = div.getBoundingClientRect();
- dv.attr("width", bbox.width);
- dv.attr("height", bbox.height);
- }
- const padding = 0 * node.padding;
- const halfPadding = padding / 2;
- const width = node.width <= bbox.width + padding ? bbox.width + padding : node.width;
- if (node.width <= bbox.width + padding) {
- node.diff = (bbox.width - node.width) / 2 - node.padding / 2;
- } else {
- node.diff = -node.padding / 2;
- }
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.trace("Data ", node, JSON.stringify(node));
- rect2.attr("style", node.style).attr("rx", node.rx).attr("ry", node.ry).attr("x", node.x - width / 2).attr("y", node.y - node.height / 2 - halfPadding).attr("width", width).attr("height", node.height + padding);
- const { subGraphTitleTopMargin } = (0,_edges_066a5561_js__WEBPACK_IMPORTED_MODULE_6__.g)(siteConfig);
- if (useHtmlLabels) {
- label.attr(
- "transform",
- // This puts the label on top of the box instead of inside it
- `translate(${node.x - bbox.width / 2}, ${node.y - node.height / 2 + subGraphTitleTopMargin})`
- );
- } else {
- label.attr(
- "transform",
- // This puts the label on top of the box instead of inside it
- `translate(${node.x}, ${node.y - node.height / 2 + subGraphTitleTopMargin})`
- );
- }
- const rectBox = rect2.node().getBBox();
- node.width = rectBox.width;
- node.height = rectBox.height;
- node.intersect = function(point) {
- return (0,_edges_066a5561_js__WEBPACK_IMPORTED_MODULE_6__.i)(node, point);
- };
- return shapeSvg;
-};
-const noteGroup = (parent, node) => {
- const shapeSvg = parent.insert("g").attr("class", "note-cluster").attr("id", node.id);
- const rect2 = shapeSvg.insert("rect", ":first-child");
- const padding = 0 * node.padding;
- const halfPadding = padding / 2;
- rect2.attr("rx", node.rx).attr("ry", node.ry).attr("x", node.x - node.width / 2 - halfPadding).attr("y", node.y - node.height / 2 - halfPadding).attr("width", node.width + padding).attr("height", node.height + padding).attr("fill", "none");
- const rectBox = rect2.node().getBBox();
- node.width = rectBox.width;
- node.height = rectBox.height;
- node.intersect = function(point) {
- return (0,_edges_066a5561_js__WEBPACK_IMPORTED_MODULE_6__.i)(node, point);
- };
- return shapeSvg;
-};
-const roundedWithTitle = (parent, node) => {
- const siteConfig = (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.c)();
- const shapeSvg = parent.insert("g").attr("class", node.classes).attr("id", node.id);
- const rect2 = shapeSvg.insert("rect", ":first-child");
- const label = shapeSvg.insert("g").attr("class", "cluster-label");
- const innerRect = shapeSvg.append("rect");
- const text = label.node().appendChild((0,_edges_066a5561_js__WEBPACK_IMPORTED_MODULE_6__.c)(node.labelText, node.labelStyle, void 0, true));
- let bbox = text.getBBox();
- if ((0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.m)(siteConfig.flowchart.htmlLabels)) {
- const div = text.children[0];
- const dv = (0,d3__WEBPACK_IMPORTED_MODULE_3__/* .select */ .Ltv)(text);
- bbox = div.getBoundingClientRect();
- dv.attr("width", bbox.width);
- dv.attr("height", bbox.height);
- }
- bbox = text.getBBox();
- const padding = 0 * node.padding;
- const halfPadding = padding / 2;
- const width = node.width <= bbox.width + node.padding ? bbox.width + node.padding : node.width;
- if (node.width <= bbox.width + node.padding) {
- node.diff = (bbox.width + node.padding * 0 - node.width) / 2;
- } else {
- node.diff = -node.padding / 2;
- }
- rect2.attr("class", "outer").attr("x", node.x - width / 2 - halfPadding).attr("y", node.y - node.height / 2 - halfPadding).attr("width", width + padding).attr("height", node.height + padding);
- innerRect.attr("class", "inner").attr("x", node.x - width / 2 - halfPadding).attr("y", node.y - node.height / 2 - halfPadding + bbox.height - 1).attr("width", width + padding).attr("height", node.height + padding - bbox.height - 3);
- const { subGraphTitleTopMargin } = (0,_edges_066a5561_js__WEBPACK_IMPORTED_MODULE_6__.g)(siteConfig);
- label.attr(
- "transform",
- `translate(${node.x - bbox.width / 2}, ${node.y - node.height / 2 - node.padding / 3 + ((0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.m)(siteConfig.flowchart.htmlLabels) ? 5 : 3) + subGraphTitleTopMargin})`
- );
- const rectBox = rect2.node().getBBox();
- node.height = rectBox.height;
- node.intersect = function(point) {
- return (0,_edges_066a5561_js__WEBPACK_IMPORTED_MODULE_6__.i)(node, point);
- };
- return shapeSvg;
-};
-const divider = (parent, node) => {
- const shapeSvg = parent.insert("g").attr("class", node.classes).attr("id", node.id);
- const rect2 = shapeSvg.insert("rect", ":first-child");
- const padding = 0 * node.padding;
- const halfPadding = padding / 2;
- rect2.attr("class", "divider").attr("x", node.x - node.width / 2 - halfPadding).attr("y", node.y - node.height / 2).attr("width", node.width + padding).attr("height", node.height + padding);
- const rectBox = rect2.node().getBBox();
- node.width = rectBox.width;
- node.height = rectBox.height;
- node.diff = -node.padding / 2;
- node.intersect = function(point) {
- return (0,_edges_066a5561_js__WEBPACK_IMPORTED_MODULE_6__.i)(node, point);
- };
- return shapeSvg;
-};
-const shapes = { rect, roundedWithTitle, noteGroup, divider };
-let clusterElems = {};
-const insertCluster = (elem, node) => {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.trace("Inserting cluster");
- const shape = node.shape || "rect";
- clusterElems[node.id] = shapes[shape](elem, node);
-};
-const clear = () => {
- clusterElems = {};
-};
-const recursiveRender = async (_elem, graph, diagramType, id, parentCluster, siteConfig) => {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info("Graph in recursive render: XXX", dagre_d3_es_src_graphlib_json_js__WEBPACK_IMPORTED_MODULE_1__/* .write */ .M(graph), parentCluster);
- const dir = graph.graph().rankdir;
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.trace("Dir in recursive render - dir:", dir);
- const elem = _elem.insert("g").attr("class", "root");
- if (!graph.nodes()) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info("No nodes found for", graph);
- } else {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info("Recursive render XXX", graph.nodes());
- }
- if (graph.edges().length > 0) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.trace("Recursive edges", graph.edge(graph.edges()[0]));
- }
- const clusters = elem.insert("g").attr("class", "clusters");
- const edgePaths = elem.insert("g").attr("class", "edgePaths");
- const edgeLabels = elem.insert("g").attr("class", "edgeLabels");
- const nodes = elem.insert("g").attr("class", "nodes");
- await Promise.all(
- graph.nodes().map(async function(v) {
- const node = graph.node(v);
- if (parentCluster !== void 0) {
- const data = JSON.parse(JSON.stringify(parentCluster.clusterData));
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info("Setting data for cluster XXX (", v, ") ", data, parentCluster);
- graph.setNode(parentCluster.id, data);
- if (!graph.parent(v)) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.trace("Setting parent", v, parentCluster.id);
- graph.setParent(v, parentCluster.id, data);
- }
- }
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info("(Insert) Node XXX" + v + ": " + JSON.stringify(graph.node(v)));
- if (node && node.clusterNode) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info("Cluster identified", v, node.width, graph.node(v));
- const o = await recursiveRender(
- nodes,
- node.graph,
- diagramType,
- id,
- graph.node(v),
- siteConfig
- );
- const newEl = o.elem;
- (0,_edges_066a5561_js__WEBPACK_IMPORTED_MODULE_6__.u)(node, newEl);
- node.diff = o.diff || 0;
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info("Node bounds (abc123)", v, node, node.width, node.x, node.y);
- (0,_edges_066a5561_js__WEBPACK_IMPORTED_MODULE_6__.s)(newEl, node);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.warn("Recursive render complete ", newEl, node);
- } else {
- if (graph.children(v).length > 0) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info("Cluster - the non recursive path XXX", v, node.id, node, graph);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info(findNonClusterChild(node.id, graph));
- clusterDb[node.id] = { id: findNonClusterChild(node.id, graph), node };
- } else {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info("Node - the non recursive path", v, node.id, node);
- await (0,_edges_066a5561_js__WEBPACK_IMPORTED_MODULE_6__.e)(nodes, graph.node(v), dir);
- }
- }
- })
- );
- graph.edges().forEach(function(e) {
- const edge = graph.edge(e.v, e.w, e.name);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info("Edge " + e.v + " -> " + e.w + ": " + JSON.stringify(e));
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info("Edge " + e.v + " -> " + e.w + ": ", e, " ", JSON.stringify(graph.edge(e)));
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info("Fix", clusterDb, "ids:", e.v, e.w, "Translating: ", clusterDb[e.v], clusterDb[e.w]);
- (0,_edges_066a5561_js__WEBPACK_IMPORTED_MODULE_6__.f)(edgeLabels, edge);
- });
- graph.edges().forEach(function(e) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info("Edge " + e.v + " -> " + e.w + ": " + JSON.stringify(e));
- });
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info("#############################################");
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info("### Layout ###");
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info("#############################################");
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info(graph);
- (0,dagre_d3_es_src_dagre_index_js__WEBPACK_IMPORTED_MODULE_0__/* .layout */ .Zp)(graph);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info("Graph after layout:", dagre_d3_es_src_graphlib_json_js__WEBPACK_IMPORTED_MODULE_1__/* .write */ .M(graph));
- let diff = 0;
- const { subGraphTitleTotalMargin } = (0,_edges_066a5561_js__WEBPACK_IMPORTED_MODULE_6__.g)(siteConfig);
- sortNodesByHierarchy(graph).forEach(function(v) {
- const node = graph.node(v);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info("Position " + v + ": " + JSON.stringify(graph.node(v)));
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info(
- "Position " + v + ": (" + node.x,
- "," + node.y,
- ") width: ",
- node.width,
- " height: ",
- node.height
- );
- if (node && node.clusterNode) {
- node.y += subGraphTitleTotalMargin;
- (0,_edges_066a5561_js__WEBPACK_IMPORTED_MODULE_6__.p)(node);
- } else {
- if (graph.children(v).length > 0) {
- node.height += subGraphTitleTotalMargin;
- insertCluster(clusters, node);
- clusterDb[node.id].node = node;
- } else {
- node.y += subGraphTitleTotalMargin / 2;
- (0,_edges_066a5561_js__WEBPACK_IMPORTED_MODULE_6__.p)(node);
- }
- }
- });
- graph.edges().forEach(function(e) {
- const edge = graph.edge(e);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info("Edge " + e.v + " -> " + e.w + ": " + JSON.stringify(edge), edge);
- edge.points.forEach((point) => point.y += subGraphTitleTotalMargin / 2);
- const paths = (0,_edges_066a5561_js__WEBPACK_IMPORTED_MODULE_6__.h)(edgePaths, e, edge, clusterDb, diagramType, graph, id);
- (0,_edges_066a5561_js__WEBPACK_IMPORTED_MODULE_6__.j)(edge, paths);
- });
- graph.nodes().forEach(function(v) {
- const n = graph.node(v);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.info(v, n.type, n.diff);
- if (n.type === "group") {
- diff = n.diff;
- }
- });
- return { elem, diff };
-};
-const render = async (elem, graph, markers, diagramType, id) => {
- (0,_edges_066a5561_js__WEBPACK_IMPORTED_MODULE_6__.a)(elem, markers, diagramType, id);
- (0,_edges_066a5561_js__WEBPACK_IMPORTED_MODULE_6__.b)();
- (0,_edges_066a5561_js__WEBPACK_IMPORTED_MODULE_6__.d)();
- clear();
- clear$1();
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.warn("Graph at first:", JSON.stringify(dagre_d3_es_src_graphlib_json_js__WEBPACK_IMPORTED_MODULE_1__/* .write */ .M(graph)));
- adjustClustersAndEdges(graph);
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.l.warn("Graph after:", JSON.stringify(dagre_d3_es_src_graphlib_json_js__WEBPACK_IMPORTED_MODULE_1__/* .write */ .M(graph)));
- const siteConfig = (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_4__.c)();
- await recursiveRender(elem, graph, diagramType, id, void 0, siteConfig);
-};
-
-
-
-/***/ }),
-
-/***/ 63626:
-/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
-
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ d: () => (/* binding */ db),
-/* harmony export */ p: () => (/* binding */ parser$1),
-/* harmony export */ s: () => (/* binding */ styles)
-/* harmony export */ });
-/* harmony import */ var d3__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(26312);
-/* harmony import */ var _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(99702);
-
-
-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, 17], $V1 = [1, 18], $V2 = [1, 19], $V3 = [1, 39], $V4 = [1, 40], $V5 = [1, 25], $V6 = [1, 23], $V7 = [1, 24], $V8 = [1, 31], $V9 = [1, 32], $Va = [1, 33], $Vb = [1, 34], $Vc = [1, 35], $Vd = [1, 36], $Ve = [1, 26], $Vf = [1, 27], $Vg = [1, 28], $Vh = [1, 29], $Vi = [1, 43], $Vj = [1, 30], $Vk = [1, 42], $Vl = [1, 44], $Vm = [1, 41], $Vn = [1, 45], $Vo = [1, 9], $Vp = [1, 8, 9], $Vq = [1, 56], $Vr = [1, 57], $Vs = [1, 58], $Vt = [1, 59], $Vu = [1, 60], $Vv = [1, 61], $Vw = [1, 62], $Vx = [1, 8, 9, 39], $Vy = [1, 74], $Vz = [1, 8, 9, 12, 13, 21, 37, 39, 42, 59, 60, 61, 62, 63, 64, 65, 70, 72], $VA = [1, 8, 9, 12, 13, 19, 21, 37, 39, 42, 46, 59, 60, 61, 62, 63, 64, 65, 70, 72, 74, 80, 95, 97, 98], $VB = [13, 74, 80, 95, 97, 98], $VC = [13, 64, 65, 74, 80, 95, 97, 98], $VD = [13, 59, 60, 61, 62, 63, 74, 80, 95, 97, 98], $VE = [1, 93], $VF = [1, 110], $VG = [1, 108], $VH = [1, 102], $VI = [1, 103], $VJ = [1, 104], $VK = [1, 105], $VL = [1, 106], $VM = [1, 107], $VN = [1, 109], $VO = [1, 8, 9, 37, 39, 42], $VP = [1, 8, 9, 21], $VQ = [1, 8, 9, 78], $VR = [1, 8, 9, 21, 73, 74, 78, 80, 81, 82, 83, 84, 85];
- var parser2 = {
- trace: function trace() {
- },
- yy: {},
- symbols_: { "error": 2, "start": 3, "mermaidDoc": 4, "statements": 5, "graphConfig": 6, "CLASS_DIAGRAM": 7, "NEWLINE": 8, "EOF": 9, "statement": 10, "classLabel": 11, "SQS": 12, "STR": 13, "SQE": 14, "namespaceName": 15, "alphaNumToken": 16, "className": 17, "classLiteralName": 18, "GENERICTYPE": 19, "relationStatement": 20, "LABEL": 21, "namespaceStatement": 22, "classStatement": 23, "memberStatement": 24, "annotationStatement": 25, "clickStatement": 26, "styleStatement": 27, "cssClassStatement": 28, "noteStatement": 29, "direction": 30, "acc_title": 31, "acc_title_value": 32, "acc_descr": 33, "acc_descr_value": 34, "acc_descr_multiline_value": 35, "namespaceIdentifier": 36, "STRUCT_START": 37, "classStatements": 38, "STRUCT_STOP": 39, "NAMESPACE": 40, "classIdentifier": 41, "STYLE_SEPARATOR": 42, "members": 43, "CLASS": 44, "ANNOTATION_START": 45, "ANNOTATION_END": 46, "MEMBER": 47, "SEPARATOR": 48, "relation": 49, "NOTE_FOR": 50, "noteText": 51, "NOTE": 52, "direction_tb": 53, "direction_bt": 54, "direction_rl": 55, "direction_lr": 56, "relationType": 57, "lineType": 58, "AGGREGATION": 59, "EXTENSION": 60, "COMPOSITION": 61, "DEPENDENCY": 62, "LOLLIPOP": 63, "LINE": 64, "DOTTED_LINE": 65, "CALLBACK": 66, "LINK": 67, "LINK_TARGET": 68, "CLICK": 69, "CALLBACK_NAME": 70, "CALLBACK_ARGS": 71, "HREF": 72, "STYLE": 73, "ALPHA": 74, "stylesOpt": 75, "CSSCLASS": 76, "style": 77, "COMMA": 78, "styleComponent": 79, "NUM": 80, "COLON": 81, "UNIT": 82, "SPACE": 83, "BRKT": 84, "PCT": 85, "commentToken": 86, "textToken": 87, "graphCodeTokens": 88, "textNoTagsToken": 89, "TAGSTART": 90, "TAGEND": 91, "==": 92, "--": 93, "DEFAULT": 94, "MINUS": 95, "keywords": 96, "UNICODE_TEXT": 97, "BQUOTE_STR": 98, "$accept": 0, "$end": 1 },
- terminals_: { 2: "error", 7: "CLASS_DIAGRAM", 8: "NEWLINE", 9: "EOF", 12: "SQS", 13: "STR", 14: "SQE", 19: "GENERICTYPE", 21: "LABEL", 31: "acc_title", 32: "acc_title_value", 33: "acc_descr", 34: "acc_descr_value", 35: "acc_descr_multiline_value", 37: "STRUCT_START", 39: "STRUCT_STOP", 40: "NAMESPACE", 42: "STYLE_SEPARATOR", 44: "CLASS", 45: "ANNOTATION_START", 46: "ANNOTATION_END", 47: "MEMBER", 48: "SEPARATOR", 50: "NOTE_FOR", 52: "NOTE", 53: "direction_tb", 54: "direction_bt", 55: "direction_rl", 56: "direction_lr", 59: "AGGREGATION", 60: "EXTENSION", 61: "COMPOSITION", 62: "DEPENDENCY", 63: "LOLLIPOP", 64: "LINE", 65: "DOTTED_LINE", 66: "CALLBACK", 67: "LINK", 68: "LINK_TARGET", 69: "CLICK", 70: "CALLBACK_NAME", 71: "CALLBACK_ARGS", 72: "HREF", 73: "STYLE", 74: "ALPHA", 76: "CSSCLASS", 78: "COMMA", 80: "NUM", 81: "COLON", 82: "UNIT", 83: "SPACE", 84: "BRKT", 85: "PCT", 88: "graphCodeTokens", 90: "TAGSTART", 91: "TAGEND", 92: "==", 93: "--", 94: "DEFAULT", 95: "MINUS", 96: "keywords", 97: "UNICODE_TEXT", 98: "BQUOTE_STR" },
- productions_: [0, [3, 1], [3, 1], [4, 1], [6, 4], [5, 1], [5, 2], [5, 3], [11, 3], [15, 1], [15, 2], [17, 1], [17, 1], [17, 2], [17, 2], [17, 2], [10, 1], [10, 2], [10, 1], [10, 1], [10, 1], [10, 1], [10, 1], [10, 1], [10, 1], [10, 1], [10, 1], [10, 2], [10, 2], [10, 1], [22, 4], [22, 5], [36, 2], [38, 1], [38, 2], [38, 3], [23, 1], [23, 3], [23, 4], [23, 6], [41, 2], [41, 3], [25, 4], [43, 1], [43, 2], [24, 1], [24, 2], [24, 1], [24, 1], [20, 3], [20, 4], [20, 4], [20, 5], [29, 3], [29, 2], [30, 1], [30, 1], [30, 1], [30, 1], [49, 3], [49, 2], [49, 2], [49, 1], [57, 1], [57, 1], [57, 1], [57, 1], [57, 1], [58, 1], [58, 1], [26, 3], [26, 4], [26, 3], [26, 4], [26, 4], [26, 5], [26, 3], [26, 4], [26, 4], [26, 5], [26, 4], [26, 5], [26, 5], [26, 6], [27, 3], [28, 3], [75, 1], [75, 3], [77, 1], [77, 2], [79, 1], [79, 1], [79, 1], [79, 1], [79, 1], [79, 1], [79, 1], [79, 1], [79, 1], [86, 1], [86, 1], [87, 1], [87, 1], [87, 1], [87, 1], [87, 1], [87, 1], [87, 1], [89, 1], [89, 1], [89, 1], [89, 1], [16, 1], [16, 1], [16, 1], [16, 1], [18, 1], [51, 1]],
- performAction: function anonymous(yytext, yyleng, yylineno, yy, yystate, $$, _$) {
- var $0 = $$.length - 1;
- switch (yystate) {
- case 8:
- this.$ = $$[$0 - 1];
- break;
- case 9:
- case 11:
- case 12:
- this.$ = $$[$0];
- break;
- case 10:
- case 13:
- this.$ = $$[$0 - 1] + $$[$0];
- break;
- case 14:
- case 15:
- this.$ = $$[$0 - 1] + "~" + $$[$0] + "~";
- break;
- case 16:
- yy.addRelation($$[$0]);
- break;
- case 17:
- $$[$0 - 1].title = yy.cleanupLabel($$[$0]);
- yy.addRelation($$[$0 - 1]);
- break;
- case 27:
- this.$ = $$[$0].trim();
- yy.setAccTitle(this.$);
- break;
- case 28:
- case 29:
- this.$ = $$[$0].trim();
- yy.setAccDescription(this.$);
- break;
- case 30:
- yy.addClassesToNamespace($$[$0 - 3], $$[$0 - 1]);
- break;
- case 31:
- yy.addClassesToNamespace($$[$0 - 4], $$[$0 - 1]);
- break;
- case 32:
- this.$ = $$[$0];
- yy.addNamespace($$[$0]);
- break;
- case 33:
- this.$ = [$$[$0]];
- break;
- case 34:
- this.$ = [$$[$0 - 1]];
- break;
- case 35:
- $$[$0].unshift($$[$0 - 2]);
- this.$ = $$[$0];
- break;
- case 37:
- yy.setCssClass($$[$0 - 2], $$[$0]);
- break;
- case 38:
- yy.addMembers($$[$0 - 3], $$[$0 - 1]);
- break;
- case 39:
- yy.setCssClass($$[$0 - 5], $$[$0 - 3]);
- yy.addMembers($$[$0 - 5], $$[$0 - 1]);
- break;
- case 40:
- this.$ = $$[$0];
- yy.addClass($$[$0]);
- break;
- case 41:
- this.$ = $$[$0 - 1];
- yy.addClass($$[$0 - 1]);
- yy.setClassLabel($$[$0 - 1], $$[$0]);
- break;
- case 42:
- yy.addAnnotation($$[$0], $$[$0 - 2]);
- break;
- case 43:
- this.$ = [$$[$0]];
- break;
- case 44:
- $$[$0].push($$[$0 - 1]);
- this.$ = $$[$0];
- break;
- case 45:
- break;
- case 46:
- yy.addMember($$[$0 - 1], yy.cleanupLabel($$[$0]));
- break;
- case 47:
- break;
- case 48:
- break;
- case 49:
- this.$ = { "id1": $$[$0 - 2], "id2": $$[$0], relation: $$[$0 - 1], relationTitle1: "none", relationTitle2: "none" };
- break;
- case 50:
- this.$ = { id1: $$[$0 - 3], id2: $$[$0], relation: $$[$0 - 1], relationTitle1: $$[$0 - 2], relationTitle2: "none" };
- break;
- case 51:
- this.$ = { id1: $$[$0 - 3], id2: $$[$0], relation: $$[$0 - 2], relationTitle1: "none", relationTitle2: $$[$0 - 1] };
- break;
- case 52:
- this.$ = { id1: $$[$0 - 4], id2: $$[$0], relation: $$[$0 - 2], relationTitle1: $$[$0 - 3], relationTitle2: $$[$0 - 1] };
- break;
- case 53:
- yy.addNote($$[$0], $$[$0 - 1]);
- break;
- case 54:
- yy.addNote($$[$0]);
- break;
- case 55:
- yy.setDirection("TB");
- break;
- case 56:
- yy.setDirection("BT");
- break;
- case 57:
- yy.setDirection("RL");
- break;
- case 58:
- yy.setDirection("LR");
- break;
- case 59:
- this.$ = { type1: $$[$0 - 2], type2: $$[$0], lineType: $$[$0 - 1] };
- break;
- case 60:
- this.$ = { type1: "none", type2: $$[$0], lineType: $$[$0 - 1] };
- break;
- case 61:
- this.$ = { type1: $$[$0 - 1], type2: "none", lineType: $$[$0] };
- break;
- case 62:
- this.$ = { type1: "none", type2: "none", lineType: $$[$0] };
- break;
- case 63:
- this.$ = yy.relationType.AGGREGATION;
- break;
- case 64:
- this.$ = yy.relationType.EXTENSION;
- break;
- case 65:
- this.$ = yy.relationType.COMPOSITION;
- break;
- case 66:
- this.$ = yy.relationType.DEPENDENCY;
- break;
- case 67:
- this.$ = yy.relationType.LOLLIPOP;
- break;
- case 68:
- this.$ = yy.lineType.LINE;
- break;
- case 69:
- this.$ = yy.lineType.DOTTED_LINE;
- break;
- case 70:
- case 76:
- this.$ = $$[$0 - 2];
- yy.setClickEvent($$[$0 - 1], $$[$0]);
- break;
- case 71:
- case 77:
- this.$ = $$[$0 - 3];
- yy.setClickEvent($$[$0 - 2], $$[$0 - 1]);
- yy.setTooltip($$[$0 - 2], $$[$0]);
- break;
- case 72:
- this.$ = $$[$0 - 2];
- yy.setLink($$[$0 - 1], $$[$0]);
- break;
- case 73:
- this.$ = $$[$0 - 3];
- yy.setLink($$[$0 - 2], $$[$0 - 1], $$[$0]);
- break;
- case 74:
- this.$ = $$[$0 - 3];
- yy.setLink($$[$0 - 2], $$[$0 - 1]);
- yy.setTooltip($$[$0 - 2], $$[$0]);
- break;
- case 75:
- this.$ = $$[$0 - 4];
- yy.setLink($$[$0 - 3], $$[$0 - 2], $$[$0]);
- yy.setTooltip($$[$0 - 3], $$[$0 - 1]);
- break;
- case 78:
- this.$ = $$[$0 - 3];
- yy.setClickEvent($$[$0 - 2], $$[$0 - 1], $$[$0]);
- break;
- case 79:
- this.$ = $$[$0 - 4];
- yy.setClickEvent($$[$0 - 3], $$[$0 - 2], $$[$0 - 1]);
- yy.setTooltip($$[$0 - 3], $$[$0]);
- break;
- case 80:
- this.$ = $$[$0 - 3];
- yy.setLink($$[$0 - 2], $$[$0]);
- break;
- case 81:
- this.$ = $$[$0 - 4];
- yy.setLink($$[$0 - 3], $$[$0 - 1], $$[$0]);
- break;
- case 82:
- this.$ = $$[$0 - 4];
- yy.setLink($$[$0 - 3], $$[$0 - 1]);
- yy.setTooltip($$[$0 - 3], $$[$0]);
- break;
- case 83:
- this.$ = $$[$0 - 5];
- yy.setLink($$[$0 - 4], $$[$0 - 2], $$[$0]);
- yy.setTooltip($$[$0 - 4], $$[$0 - 1]);
- break;
- case 84:
- this.$ = $$[$0 - 2];
- yy.setCssStyle($$[$0 - 1], $$[$0]);
- break;
- case 85:
- yy.setCssClass($$[$0 - 1], $$[$0]);
- break;
- case 86:
- this.$ = [$$[$0]];
- break;
- case 87:
- $$[$0 - 2].push($$[$0]);
- this.$ = $$[$0 - 2];
- break;
- case 89:
- this.$ = $$[$0 - 1] + $$[$0];
- break;
- }
- },
- table: [{ 3: 1, 4: 2, 5: 3, 6: 4, 7: [1, 6], 10: 5, 16: 37, 17: 20, 18: 38, 20: 7, 22: 8, 23: 9, 24: 10, 25: 11, 26: 12, 27: 13, 28: 14, 29: 15, 30: 16, 31: $V0, 33: $V1, 35: $V2, 36: 21, 40: $V3, 41: 22, 44: $V4, 45: $V5, 47: $V6, 48: $V7, 50: $V8, 52: $V9, 53: $Va, 54: $Vb, 55: $Vc, 56: $Vd, 66: $Ve, 67: $Vf, 69: $Vg, 73: $Vh, 74: $Vi, 76: $Vj, 80: $Vk, 95: $Vl, 97: $Vm, 98: $Vn }, { 1: [3] }, { 1: [2, 1] }, { 1: [2, 2] }, { 1: [2, 3] }, o($Vo, [2, 5], { 8: [1, 46] }), { 8: [1, 47] }, o($Vp, [2, 16], { 21: [1, 48] }), o($Vp, [2, 18]), o($Vp, [2, 19]), o($Vp, [2, 20]), o($Vp, [2, 21]), o($Vp, [2, 22]), o($Vp, [2, 23]), o($Vp, [2, 24]), o($Vp, [2, 25]), o($Vp, [2, 26]), { 32: [1, 49] }, { 34: [1, 50] }, o($Vp, [2, 29]), o($Vp, [2, 45], { 49: 51, 57: 54, 58: 55, 13: [1, 52], 21: [1, 53], 59: $Vq, 60: $Vr, 61: $Vs, 62: $Vt, 63: $Vu, 64: $Vv, 65: $Vw }), { 37: [1, 63] }, o($Vx, [2, 36], { 37: [1, 65], 42: [1, 64] }), o($Vp, [2, 47]), o($Vp, [2, 48]), { 16: 66, 74: $Vi, 80: $Vk, 95: $Vl, 97: $Vm }, { 16: 37, 17: 67, 18: 38, 74: $Vi, 80: $Vk, 95: $Vl, 97: $Vm, 98: $Vn }, { 16: 37, 17: 68, 18: 38, 74: $Vi, 80: $Vk, 95: $Vl, 97: $Vm, 98: $Vn }, { 16: 37, 17: 69, 18: 38, 74: $Vi, 80: $Vk, 95: $Vl, 97: $Vm, 98: $Vn }, { 74: [1, 70] }, { 13: [1, 71] }, { 16: 37, 17: 72, 18: 38, 74: $Vi, 80: $Vk, 95: $Vl, 97: $Vm, 98: $Vn }, { 13: $Vy, 51: 73 }, o($Vp, [2, 55]), o($Vp, [2, 56]), o($Vp, [2, 57]), o($Vp, [2, 58]), o($Vz, [2, 11], { 16: 37, 18: 38, 17: 75, 19: [1, 76], 74: $Vi, 80: $Vk, 95: $Vl, 97: $Vm, 98: $Vn }), o($Vz, [2, 12], { 19: [1, 77] }), { 15: 78, 16: 79, 74: $Vi, 80: $Vk, 95: $Vl, 97: $Vm }, { 16: 37, 17: 80, 18: 38, 74: $Vi, 80: $Vk, 95: $Vl, 97: $Vm, 98: $Vn }, o($VA, [2, 112]), o($VA, [2, 113]), o($VA, [2, 114]), o($VA, [2, 115]), o([1, 8, 9, 12, 13, 19, 21, 37, 39, 42, 59, 60, 61, 62, 63, 64, 65, 70, 72], [2, 116]), o($Vo, [2, 6], { 10: 5, 20: 7, 22: 8, 23: 9, 24: 10, 25: 11, 26: 12, 27: 13, 28: 14, 29: 15, 30: 16, 17: 20, 36: 21, 41: 22, 16: 37, 18: 38, 5: 81, 31: $V0, 33: $V1, 35: $V2, 40: $V3, 44: $V4, 45: $V5, 47: $V6, 48: $V7, 50: $V8, 52: $V9, 53: $Va, 54: $Vb, 55: $Vc, 56: $Vd, 66: $Ve, 67: $Vf, 69: $Vg, 73: $Vh, 74: $Vi, 76: $Vj, 80: $Vk, 95: $Vl, 97: $Vm, 98: $Vn }), { 5: 82, 10: 5, 16: 37, 17: 20, 18: 38, 20: 7, 22: 8, 23: 9, 24: 10, 25: 11, 26: 12, 27: 13, 28: 14, 29: 15, 30: 16, 31: $V0, 33: $V1, 35: $V2, 36: 21, 40: $V3, 41: 22, 44: $V4, 45: $V5, 47: $V6, 48: $V7, 50: $V8, 52: $V9, 53: $Va, 54: $Vb, 55: $Vc, 56: $Vd, 66: $Ve, 67: $Vf, 69: $Vg, 73: $Vh, 74: $Vi, 76: $Vj, 80: $Vk, 95: $Vl, 97: $Vm, 98: $Vn }, o($Vp, [2, 17]), o($Vp, [2, 27]), o($Vp, [2, 28]), { 13: [1, 84], 16: 37, 17: 83, 18: 38, 74: $Vi, 80: $Vk, 95: $Vl, 97: $Vm, 98: $Vn }, { 49: 85, 57: 54, 58: 55, 59: $Vq, 60: $Vr, 61: $Vs, 62: $Vt, 63: $Vu, 64: $Vv, 65: $Vw }, o($Vp, [2, 46]), { 58: 86, 64: $Vv, 65: $Vw }, o($VB, [2, 62], { 57: 87, 59: $Vq, 60: $Vr, 61: $Vs, 62: $Vt, 63: $Vu }), o($VC, [2, 63]), o($VC, [2, 64]), o($VC, [2, 65]), o($VC, [2, 66]), o($VC, [2, 67]), o($VD, [2, 68]), o($VD, [2, 69]), { 8: [1, 89], 23: 90, 38: 88, 41: 22, 44: $V4 }, { 16: 91, 74: $Vi, 80: $Vk, 95: $Vl, 97: $Vm }, { 43: 92, 47: $VE }, { 46: [1, 94] }, { 13: [1, 95] }, { 13: [1, 96] }, { 70: [1, 97], 72: [1, 98] }, { 21: $VF, 73: $VG, 74: $VH, 75: 99, 77: 100, 79: 101, 80: $VI, 81: $VJ, 82: $VK, 83: $VL, 84: $VM, 85: $VN }, { 74: [1, 111] }, { 13: $Vy, 51: 112 }, o($Vp, [2, 54]), o($Vp, [2, 117]), o($Vz, [2, 13]), o($Vz, [2, 14]), o($Vz, [2, 15]), { 37: [2, 32] }, { 15: 113, 16: 79, 37: [2, 9], 74: $Vi, 80: $Vk, 95: $Vl, 97: $Vm }, o($VO, [2, 40], { 11: 114, 12: [1, 115] }), o($Vo, [2, 7]), { 9: [1, 116] }, o($VP, [2, 49]), { 16: 37, 17: 117, 18: 38, 74: $Vi, 80: $Vk, 95: $Vl, 97: $Vm, 98: $Vn }, { 13: [1, 119], 16: 37, 17: 118, 18: 38, 74: $Vi, 80: $Vk, 95: $Vl, 97: $Vm, 98: $Vn }, o($VB, [2, 61], { 57: 120, 59: $Vq, 60: $Vr, 61: $Vs, 62: $Vt, 63: $Vu }), o($VB, [2, 60]), { 39: [1, 121] }, { 23: 90, 38: 122, 41: 22, 44: $V4 }, { 8: [1, 123], 39: [2, 33] }, o($Vx, [2, 37], { 37: [1, 124] }), { 39: [1, 125] }, { 39: [2, 43], 43: 126, 47: $VE }, { 16: 37, 17: 127, 18: 38, 74: $Vi, 80: $Vk, 95: $Vl, 97: $Vm, 98: $Vn }, o($Vp, [2, 70], { 13: [1, 128] }), o($Vp, [2, 72], { 13: [1, 130], 68: [1, 129] }), o($Vp, [2, 76], { 13: [1, 131], 71: [1, 132] }), { 13: [1, 133] }, o($Vp, [2, 84], { 78: [1, 134] }), o($VQ, [2, 86], { 79: 135, 21: $VF, 73: $VG, 74: $VH, 80: $VI, 81: $VJ, 82: $VK, 83: $VL, 84: $VM, 85: $VN }), o($VR, [2, 88]), o($VR, [2, 90]), o($VR, [2, 91]), o($VR, [2, 92]), o($VR, [2, 93]), o($VR, [2, 94]), o($VR, [2, 95]), o($VR, [2, 96]), o($VR, [2, 97]), o($VR, [2, 98]), o($Vp, [2, 85]), o($Vp, [2, 53]), { 37: [2, 10] }, o($VO, [2, 41]), { 13: [1, 136] }, { 1: [2, 4] }, o($VP, [2, 51]), o($VP, [2, 50]), { 16: 37, 17: 137, 18: 38, 74: $Vi, 80: $Vk, 95: $Vl, 97: $Vm, 98: $Vn }, o($VB, [2, 59]), o($Vp, [2, 30]), { 39: [1, 138] }, { 23: 90, 38: 139, 39: [2, 34], 41: 22, 44: $V4 }, { 43: 140, 47: $VE }, o($Vx, [2, 38]), { 39: [2, 44] }, o($Vp, [2, 42]), o($Vp, [2, 71]), o($Vp, [2, 73]), o($Vp, [2, 74], { 68: [1, 141] }), o($Vp, [2, 77]), o($Vp, [2, 78], { 13: [1, 142] }), o($Vp, [2, 80], { 13: [1, 144], 68: [1, 143] }), { 21: $VF, 73: $VG, 74: $VH, 77: 145, 79: 101, 80: $VI, 81: $VJ, 82: $VK, 83: $VL, 84: $VM, 85: $VN }, o($VR, [2, 89]), { 14: [1, 146] }, o($VP, [2, 52]), o($Vp, [2, 31]), { 39: [2, 35] }, { 39: [1, 147] }, o($Vp, [2, 75]), o($Vp, [2, 79]), o($Vp, [2, 81]), o($Vp, [2, 82], { 68: [1, 148] }), o($VQ, [2, 87], { 79: 135, 21: $VF, 73: $VG, 74: $VH, 80: $VI, 81: $VJ, 82: $VK, 83: $VL, 84: $VM, 85: $VN }), o($VO, [2, 8]), o($Vx, [2, 39]), o($Vp, [2, 83])],
- defaultActions: { 2: [2, 1], 3: [2, 2], 4: [2, 3], 78: [2, 32], 113: [2, 10], 116: [2, 4], 126: [2, 44], 139: [2, 35] },
- 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: {},
- performAction: function anonymous(yy, yy_, $avoiding_name_collisions, YY_START) {
- switch ($avoiding_name_collisions) {
- case 0:
- return 53;
- case 1:
- return 54;
- case 2:
- return 55;
- case 3:
- return 56;
- case 4:
- break;
- case 5:
- break;
- case 6:
- this.begin("acc_title");
- return 31;
- case 7:
- this.popState();
- return "acc_title_value";
- case 8:
- this.begin("acc_descr");
- return 33;
- case 9:
- this.popState();
- return "acc_descr_value";
- case 10:
- this.begin("acc_descr_multiline");
- break;
- case 11:
- this.popState();
- break;
- case 12:
- return "acc_descr_multiline_value";
- case 13:
- return 8;
- case 14:
- break;
- case 15:
- return 7;
- case 16:
- return 7;
- case 17:
- return "EDGE_STATE";
- case 18:
- this.begin("callback_name");
- break;
- case 19:
- this.popState();
- break;
- case 20:
- this.popState();
- this.begin("callback_args");
- break;
- case 21:
- return 70;
- case 22:
- this.popState();
- break;
- case 23:
- return 71;
- case 24:
- this.popState();
- break;
- case 25:
- return "STR";
- case 26:
- this.begin("string");
- break;
- case 27:
- return 73;
- case 28:
- this.begin("namespace");
- return 40;
- case 29:
- this.popState();
- return 8;
- case 30:
- break;
- case 31:
- this.begin("namespace-body");
- return 37;
- case 32:
- this.popState();
- return 39;
- case 33:
- return "EOF_IN_STRUCT";
- case 34:
- return 8;
- case 35:
- break;
- case 36:
- return "EDGE_STATE";
- case 37:
- this.begin("class");
- return 44;
- case 38:
- this.popState();
- return 8;
- case 39:
- break;
- case 40:
- this.popState();
- this.popState();
- return 39;
- case 41:
- this.begin("class-body");
- return 37;
- case 42:
- this.popState();
- return 39;
- case 43:
- return "EOF_IN_STRUCT";
- case 44:
- return "EDGE_STATE";
- case 45:
- return "OPEN_IN_STRUCT";
- case 46:
- break;
- case 47:
- return "MEMBER";
- case 48:
- return 76;
- case 49:
- return 66;
- case 50:
- return 67;
- case 51:
- return 69;
- case 52:
- return 50;
- case 53:
- return 52;
- case 54:
- return 45;
- case 55:
- return 46;
- case 56:
- return 72;
- case 57:
- this.popState();
- break;
- case 58:
- return "GENERICTYPE";
- case 59:
- this.begin("generic");
- break;
- case 60:
- this.popState();
- break;
- case 61:
- return "BQUOTE_STR";
- case 62:
- this.begin("bqstring");
- break;
- case 63:
- return 68;
- case 64:
- return 68;
- case 65:
- return 68;
- case 66:
- return 68;
- case 67:
- return 60;
- case 68:
- return 60;
- case 69:
- return 62;
- case 70:
- return 62;
- case 71:
- return 61;
- case 72:
- return 59;
- case 73:
- return 63;
- case 74:
- return 64;
- case 75:
- return 65;
- case 76:
- return 21;
- case 77:
- return 42;
- case 78:
- return 95;
- case 79:
- return "DOT";
- case 80:
- return "PLUS";
- case 81:
- return 81;
- case 82:
- return 78;
- case 83:
- return 84;
- case 84:
- return 84;
- case 85:
- return 85;
- case 86:
- return "EQUALS";
- case 87:
- return "EQUALS";
- case 88:
- return 74;
- case 89:
- return 12;
- case 90:
- return 14;
- case 91:
- return "PUNCTUATION";
- case 92:
- return 80;
- case 93:
- return 97;
- case 94:
- return 83;
- case 95:
- return 83;
- case 96:
- return 9;
- }
- },
- rules: [/^(?:.*direction\s+TB[^\n]*)/, /^(?:.*direction\s+BT[^\n]*)/, /^(?:.*direction\s+RL[^\n]*)/, /^(?:.*direction\s+LR[^\n]*)/, /^(?:%%(?!\{)*[^\n]*(\r?\n?)+)/, /^(?:%%[^\n]*(\r?\n)*)/, /^(?:accTitle\s*:\s*)/, /^(?:(?!\n||)*[^\n]*)/, /^(?:accDescr\s*:\s*)/, /^(?:(?!\n||)*[^\n]*)/, /^(?:accDescr\s*\{\s*)/, /^(?:[\}])/, /^(?:[^\}]*)/, /^(?:\s*(\r?\n)+)/, /^(?:\s+)/, /^(?:classDiagram-v2\b)/, /^(?:classDiagram\b)/, /^(?:\[\*\])/, /^(?:call[\s]+)/, /^(?:\([\s]*\))/, /^(?:\()/, /^(?:[^(]*)/, /^(?:\))/, /^(?:[^)]*)/, /^(?:["])/, /^(?:[^"]*)/, /^(?:["])/, /^(?:style\b)/, /^(?:namespace\b)/, /^(?:\s*(\r?\n)+)/, /^(?:\s+)/, /^(?:[{])/, /^(?:[}])/, /^(?:$)/, /^(?:\s*(\r?\n)+)/, /^(?:\s+)/, /^(?:\[\*\])/, /^(?:class\b)/, /^(?:\s*(\r?\n)+)/, /^(?:\s+)/, /^(?:[}])/, /^(?:[{])/, /^(?:[}])/, /^(?:$)/, /^(?:\[\*\])/, /^(?:[{])/, /^(?:[\n])/, /^(?:[^{}\n]*)/, /^(?:cssClass\b)/, /^(?:callback\b)/, /^(?:link\b)/, /^(?:click\b)/, /^(?:note for\b)/, /^(?:note\b)/, /^(?:<<)/, /^(?:>>)/, /^(?:href\b)/, /^(?:[~])/, /^(?:[^~]*)/, /^(?:~)/, /^(?:[`])/, /^(?:[^`]+)/, /^(?:[`])/, /^(?:_self\b)/, /^(?:_blank\b)/, /^(?:_parent\b)/, /^(?:_top\b)/, /^(?:\s*<\|)/, /^(?:\s*\|>)/, /^(?:\s*>)/, /^(?:\s*<)/, /^(?:\s*\*)/, /^(?:\s*o\b)/, /^(?:\s*\(\))/, /^(?:--)/, /^(?:\.\.)/, /^(?::{1}[^:\n;]+)/, /^(?::{3})/, /^(?:-)/, /^(?:\.)/, /^(?:\+)/, /^(?::)/, /^(?:,)/, /^(?:#)/, /^(?:#)/, /^(?:%)/, /^(?:=)/, /^(?:=)/, /^(?:\w+)/, /^(?:\[)/, /^(?:\])/, /^(?:[!"#$%&'*+,-.`?\\/])/, /^(?:[0-9]+)/, /^(?:[\u00AA\u00B5\u00BA\u00C0-\u00D6\u00D8-\u00F6]|[\u00F8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0370-\u0374\u0376\u0377]|[\u037A-\u037D\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5]|[\u03F7-\u0481\u048A-\u0527\u0531-\u0556\u0559\u0561-\u0587\u05D0-\u05EA]|[\u05F0-\u05F2\u0620-\u064A\u066E\u066F\u0671-\u06D3\u06D5\u06E5\u06E6\u06EE]|[\u06EF\u06FA-\u06FC\u06FF\u0710\u0712-\u072F\u074D-\u07A5\u07B1\u07CA-\u07EA]|[\u07F4\u07F5\u07FA\u0800-\u0815\u081A\u0824\u0828\u0840-\u0858\u08A0]|[\u08A2-\u08AC\u0904-\u0939\u093D\u0950\u0958-\u0961\u0971-\u0977]|[\u0979-\u097F\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2]|[\u09B6-\u09B9\u09BD\u09CE\u09DC\u09DD\u09DF-\u09E1\u09F0\u09F1\u0A05-\u0A0A]|[\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39]|[\u0A59-\u0A5C\u0A5E\u0A72-\u0A74\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8]|[\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABD\u0AD0\u0AE0\u0AE1\u0B05-\u0B0C]|[\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3D\u0B5C]|[\u0B5D\u0B5F-\u0B61\u0B71\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99]|[\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BD0]|[\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C33\u0C35-\u0C39\u0C3D]|[\u0C58\u0C59\u0C60\u0C61\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3]|[\u0CB5-\u0CB9\u0CBD\u0CDE\u0CE0\u0CE1\u0CF1\u0CF2\u0D05-\u0D0C\u0D0E-\u0D10]|[\u0D12-\u0D3A\u0D3D\u0D4E\u0D60\u0D61\u0D7A-\u0D7F\u0D85-\u0D96\u0D9A-\u0DB1]|[\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0E01-\u0E30\u0E32\u0E33\u0E40-\u0E46\u0E81]|[\u0E82\u0E84\u0E87\u0E88\u0E8A\u0E8D\u0E94-\u0E97\u0E99-\u0E9F\u0EA1-\u0EA3]|[\u0EA5\u0EA7\u0EAA\u0EAB\u0EAD-\u0EB0\u0EB2\u0EB3\u0EBD\u0EC0-\u0EC4\u0EC6]|[\u0EDC-\u0EDF\u0F00\u0F40-\u0F47\u0F49-\u0F6C\u0F88-\u0F8C\u1000-\u102A]|[\u103F\u1050-\u1055\u105A-\u105D\u1061\u1065\u1066\u106E-\u1070\u1075-\u1081]|[\u108E\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D]|[\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0]|[\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310]|[\u1312-\u1315\u1318-\u135A\u1380-\u138F\u13A0-\u13F4\u1401-\u166C]|[\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u1700-\u170C\u170E-\u1711]|[\u1720-\u1731\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17D7]|[\u17DC\u1820-\u1877\u1880-\u18A8\u18AA\u18B0-\u18F5\u1900-\u191C]|[\u1950-\u196D\u1970-\u1974\u1980-\u19AB\u19C1-\u19C7\u1A00-\u1A16]|[\u1A20-\u1A54\u1AA7\u1B05-\u1B33\u1B45-\u1B4B\u1B83-\u1BA0\u1BAE\u1BAF]|[\u1BBA-\u1BE5\u1C00-\u1C23\u1C4D-\u1C4F\u1C5A-\u1C7D\u1CE9-\u1CEC]|[\u1CEE-\u1CF1\u1CF5\u1CF6\u1D00-\u1DBF\u1E00-\u1F15\u1F18-\u1F1D]|[\u1F20-\u1F45\u1F48-\u1F4D\u1F50-\u1F57\u1F59\u1F5B\u1F5D\u1F5F-\u1F7D]|[\u1F80-\u1FB4\u1FB6-\u1FBC\u1FBE\u1FC2-\u1FC4\u1FC6-\u1FCC\u1FD0-\u1FD3]|[\u1FD6-\u1FDB\u1FE0-\u1FEC\u1FF2-\u1FF4\u1FF6-\u1FFC\u2071\u207F]|[\u2090-\u209C\u2102\u2107\u210A-\u2113\u2115\u2119-\u211D\u2124\u2126\u2128]|[\u212A-\u212D\u212F-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2183\u2184]|[\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\u2CE4\u2CEB-\u2CEE\u2CF2\u2CF3]|[\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D80-\u2D96\u2DA0-\u2DA6]|[\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE]|[\u2DD0-\u2DD6\u2DD8-\u2DDE\u2E2F\u3005\u3006\u3031-\u3035\u303B\u303C]|[\u3041-\u3096\u309D-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312D]|[\u3131-\u318E\u31A0-\u31BA\u31F0-\u31FF\u3400-\u4DB5\u4E00-\u9FCC]|[\uA000-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA61F\uA62A\uA62B]|[\uA640-\uA66E\uA67F-\uA697\uA6A0-\uA6E5\uA717-\uA71F\uA722-\uA788]|[\uA78B-\uA78E\uA790-\uA793\uA7A0-\uA7AA\uA7F8-\uA801\uA803-\uA805]|[\uA807-\uA80A\uA80C-\uA822\uA840-\uA873\uA882-\uA8B3\uA8F2-\uA8F7\uA8FB]|[\uA90A-\uA925\uA930-\uA946\uA960-\uA97C\uA984-\uA9B2\uA9CF\uAA00-\uAA28]|[\uAA40-\uAA42\uAA44-\uAA4B\uAA60-\uAA76\uAA7A\uAA80-\uAAAF\uAAB1\uAAB5]|[\uAAB6\uAAB9-\uAABD\uAAC0\uAAC2\uAADB-\uAADD\uAAE0-\uAAEA\uAAF2-\uAAF4]|[\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E]|[\uABC0-\uABE2\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D]|[\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D\uFB1F-\uFB28\uFB2A-\uFB36]|[\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D]|[\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE70-\uFE74\uFE76-\uFEFC]|[\uFF21-\uFF3A\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF]|[\uFFD2-\uFFD7\uFFDA-\uFFDC])/, /^(?:\s)/, /^(?:\s)/, /^(?:$)/],
- conditions: { "namespace-body": { "rules": [26, 32, 33, 34, 35, 36, 37, 48, 49, 50, 51, 52, 53, 54, 55, 56, 59, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 96], "inclusive": false }, "namespace": { "rules": [26, 28, 29, 30, 31, 48, 49, 50, 51, 52, 53, 54, 55, 56, 59, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 96], "inclusive": false }, "class-body": { "rules": [26, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 59, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 96], "inclusive": false }, "class": { "rules": [26, 38, 39, 40, 41, 48, 49, 50, 51, 52, 53, 54, 55, 56, 59, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 96], "inclusive": false }, "acc_descr_multiline": { "rules": [11, 12, 26, 48, 49, 50, 51, 52, 53, 54, 55, 56, 59, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 96], "inclusive": false }, "acc_descr": { "rules": [9, 26, 48, 49, 50, 51, 52, 53, 54, 55, 56, 59, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 96], "inclusive": false }, "acc_title": { "rules": [7, 26, 48, 49, 50, 51, 52, 53, 54, 55, 56, 59, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 96], "inclusive": false }, "callback_args": { "rules": [22, 23, 26, 48, 49, 50, 51, 52, 53, 54, 55, 56, 59, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 96], "inclusive": false }, "callback_name": { "rules": [19, 20, 21, 26, 48, 49, 50, 51, 52, 53, 54, 55, 56, 59, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 96], "inclusive": false }, "href": { "rules": [26, 48, 49, 50, 51, 52, 53, 54, 55, 56, 59, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 96], "inclusive": false }, "struct": { "rules": [26, 48, 49, 50, 51, 52, 53, 54, 55, 56, 59, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 96], "inclusive": false }, "generic": { "rules": [26, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 96], "inclusive": false }, "bqstring": { "rules": [26, 48, 49, 50, 51, 52, 53, 54, 55, 56, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 96], "inclusive": false }, "string": { "rules": [24, 25, 26, 48, 49, 50, 51, 52, 53, 54, 55, 56, 59, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 96], "inclusive": false }, "INITIAL": { "rules": [0, 1, 2, 3, 4, 5, 6, 8, 10, 13, 14, 15, 16, 17, 18, 26, 27, 28, 37, 48, 49, 50, 51, 52, 53, 54, 55, 56, 59, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96], "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;
-const visibilityValues = ["#", "+", "~", "-", ""];
-class ClassMember {
- constructor(input, memberType) {
- this.memberType = memberType;
- this.visibility = "";
- this.classifier = "";
- const sanitizedInput = (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.d)(input, (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)());
- this.parseMember(sanitizedInput);
- }
- getDisplayDetails() {
- let displayText = this.visibility + (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.x)(this.id);
- if (this.memberType === "method") {
- displayText += `(${(0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.x)(this.parameters.trim())})`;
- if (this.returnType) {
- displayText += " : " + (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.x)(this.returnType);
- }
- }
- displayText = displayText.trim();
- const cssStyle = this.parseClassifier();
- return {
- displayText,
- cssStyle
- };
- }
- parseMember(input) {
- let potentialClassifier = "";
- if (this.memberType === "method") {
- const methodRegEx = /([#+~-])?(.+)\((.*)\)([\s$*])?(.*)([$*])?/;
- const match = input.match(methodRegEx);
- if (match) {
- const detectedVisibility = match[1] ? match[1].trim() : "";
- if (visibilityValues.includes(detectedVisibility)) {
- this.visibility = detectedVisibility;
- }
- this.id = match[2].trim();
- this.parameters = match[3] ? match[3].trim() : "";
- potentialClassifier = match[4] ? match[4].trim() : "";
- this.returnType = match[5] ? match[5].trim() : "";
- if (potentialClassifier === "") {
- const lastChar = this.returnType.substring(this.returnType.length - 1);
- if (lastChar.match(/[$*]/)) {
- potentialClassifier = lastChar;
- this.returnType = this.returnType.substring(0, this.returnType.length - 1);
- }
- }
- }
- } else {
- const length = input.length;
- const firstChar = input.substring(0, 1);
- const lastChar = input.substring(length - 1);
- if (visibilityValues.includes(firstChar)) {
- this.visibility = firstChar;
- }
- if (lastChar.match(/[$*]/)) {
- potentialClassifier = lastChar;
- }
- this.id = input.substring(
- this.visibility === "" ? 0 : 1,
- potentialClassifier === "" ? length : length - 1
- );
- }
- this.classifier = potentialClassifier;
- }
- parseClassifier() {
- switch (this.classifier) {
- case "*":
- return "font-style:italic;";
- case "$":
- return "text-decoration:underline;";
- default:
- return "";
- }
- }
-}
-const MERMAID_DOM_ID_PREFIX = "classId-";
-let relations = [];
-let classes = {};
-let notes = [];
-let classCounter = 0;
-let namespaces = {};
-let namespaceCounter = 0;
-let functions = [];
-const sanitizeText = (txt) => _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.e.sanitizeText(txt, (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)());
-const splitClassNameAndType = function(_id) {
- const id = _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.e.sanitizeText(_id, (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)());
- let genericType = "";
- let className = id;
- if (id.indexOf("~") > 0) {
- const split = id.split("~");
- className = sanitizeText(split[0]);
- genericType = sanitizeText(split[1]);
- }
- return { className, type: genericType };
-};
-const setClassLabel = function(_id, label) {
- const id = _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.e.sanitizeText(_id, (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)());
- if (label) {
- label = sanitizeText(label);
- }
- const { className } = splitClassNameAndType(id);
- classes[className].label = label;
-};
-const addClass = function(_id) {
- const id = _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.e.sanitizeText(_id, (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)());
- const { className, type } = splitClassNameAndType(id);
- if (Object.hasOwn(classes, className)) {
- return;
- }
- const name = _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.e.sanitizeText(className, (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)());
- classes[name] = {
- id: name,
- type,
- label: name,
- cssClasses: [],
- methods: [],
- members: [],
- annotations: [],
- styles: [],
- domId: MERMAID_DOM_ID_PREFIX + name + "-" + classCounter
- };
- classCounter++;
-};
-const lookUpDomId = function(_id) {
- const id = _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.e.sanitizeText(_id, (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)());
- if (id in classes) {
- return classes[id].domId;
- }
- throw new Error("Class not found: " + id);
-};
-const clear = function() {
- relations = [];
- classes = {};
- notes = [];
- functions = [];
- functions.push(setupToolTips);
- namespaces = {};
- namespaceCounter = 0;
- (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.v)();
-};
-const getClass = function(id) {
- return classes[id];
-};
-const getClasses = function() {
- return classes;
-};
-const getRelations = function() {
- return relations;
-};
-const getNotes = function() {
- return notes;
-};
-const addRelation = function(relation) {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.l.debug("Adding relation: " + JSON.stringify(relation));
- addClass(relation.id1);
- addClass(relation.id2);
- relation.id1 = splitClassNameAndType(relation.id1).className;
- relation.id2 = splitClassNameAndType(relation.id2).className;
- relation.relationTitle1 = _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.e.sanitizeText(relation.relationTitle1.trim(), (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)());
- relation.relationTitle2 = _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.e.sanitizeText(relation.relationTitle2.trim(), (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)());
- relations.push(relation);
-};
-const addAnnotation = function(className, annotation) {
- const validatedClassName = splitClassNameAndType(className).className;
- classes[validatedClassName].annotations.push(annotation);
-};
-const addMember = function(className, member) {
- addClass(className);
- const validatedClassName = splitClassNameAndType(className).className;
- const theClass = classes[validatedClassName];
- if (typeof member === "string") {
- const memberString = member.trim();
- if (memberString.startsWith("<<") && memberString.endsWith(">>")) {
- theClass.annotations.push(sanitizeText(memberString.substring(2, memberString.length - 2)));
- } else if (memberString.indexOf(")") > 0) {
- theClass.methods.push(new ClassMember(memberString, "method"));
- } else if (memberString) {
- theClass.members.push(new ClassMember(memberString, "attribute"));
- }
- }
-};
-const addMembers = function(className, members) {
- if (Array.isArray(members)) {
- members.reverse();
- members.forEach((member) => addMember(className, member));
- }
-};
-const addNote = function(text, className) {
- const note = {
- id: `note${notes.length}`,
- class: className,
- text
- };
- notes.push(note);
-};
-const cleanupLabel = function(label) {
- if (label.startsWith(":")) {
- label = label.substring(1);
- }
- return sanitizeText(label.trim());
-};
-const setCssClass = function(ids, className) {
- ids.split(",").forEach(function(_id) {
- let id = _id;
- if (_id[0].match(/\d/)) {
- id = MERMAID_DOM_ID_PREFIX + id;
- }
- if (classes[id] !== void 0) {
- classes[id].cssClasses.push(className);
- }
- });
-};
-const setTooltip = function(ids, tooltip) {
- ids.split(",").forEach(function(id) {
- if (tooltip !== void 0) {
- classes[id].tooltip = sanitizeText(tooltip);
- }
- });
-};
-const getTooltip = function(id, namespace) {
- if (namespace) {
- return namespaces[namespace].classes[id].tooltip;
- }
- return classes[id].tooltip;
-};
-const setLink = function(ids, linkStr, target) {
- const config = (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)();
- ids.split(",").forEach(function(_id) {
- let id = _id;
- if (_id[0].match(/\d/)) {
- id = MERMAID_DOM_ID_PREFIX + id;
- }
- if (classes[id] !== void 0) {
- classes[id].link = _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.u.formatUrl(linkStr, config);
- if (config.securityLevel === "sandbox") {
- classes[id].linkTarget = "_top";
- } else if (typeof target === "string") {
- classes[id].linkTarget = sanitizeText(target);
- } else {
- classes[id].linkTarget = "_blank";
- }
- }
- });
- setCssClass(ids, "clickable");
-};
-const setClickEvent = function(ids, functionName, functionArgs) {
- ids.split(",").forEach(function(id) {
- setClickFunc(id, functionName, functionArgs);
- classes[id].haveCallback = true;
- });
- setCssClass(ids, "clickable");
-};
-const setClickFunc = function(_domId, functionName, functionArgs) {
- const domId = _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.e.sanitizeText(_domId, (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)());
- const config = (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)();
- if (config.securityLevel !== "loose") {
- return;
- }
- if (functionName === void 0) {
- return;
- }
- const id = domId;
- if (classes[id] !== void 0) {
- const elemId = lookUpDomId(id);
- let argList = [];
- if (typeof functionArgs === "string") {
- argList = functionArgs.split(/,(?=(?:(?:[^"]*"){2})*[^"]*$)/);
- for (let i = 0; i < argList.length; i++) {
- let item = argList[i].trim();
- if (item.charAt(0) === '"' && item.charAt(item.length - 1) === '"') {
- item = item.substr(1, item.length - 2);
- }
- argList[i] = item;
- }
- }
- if (argList.length === 0) {
- argList.push(elemId);
- }
- functions.push(function() {
- const elem = document.querySelector(`[id="${elemId}"]`);
- if (elem !== null) {
- elem.addEventListener(
- "click",
- function() {
- _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.u.runFunc(functionName, ...argList);
- },
- false
- );
- }
- });
- }
-};
-const bindFunctions = function(element) {
- functions.forEach(function(fun) {
- fun(element);
- });
-};
-const lineType = {
- LINE: 0,
- DOTTED_LINE: 1
-};
-const relationType = {
- AGGREGATION: 0,
- EXTENSION: 1,
- COMPOSITION: 2,
- DEPENDENCY: 3,
- LOLLIPOP: 4
-};
-const setupToolTips = function(element) {
- let tooltipElem = (0,d3__WEBPACK_IMPORTED_MODULE_0__/* .select */ .Ltv)(".mermaidTooltip");
- if ((tooltipElem._groups || tooltipElem)[0][0] === null) {
- tooltipElem = (0,d3__WEBPACK_IMPORTED_MODULE_0__/* .select */ .Ltv)("body").append("div").attr("class", "mermaidTooltip").style("opacity", 0);
- }
- const svg = (0,d3__WEBPACK_IMPORTED_MODULE_0__/* .select */ .Ltv)(element).select("svg");
- const nodes = svg.selectAll("g.node");
- nodes.on("mouseover", function() {
- const el = (0,d3__WEBPACK_IMPORTED_MODULE_0__/* .select */ .Ltv)(this);
- const title = el.attr("title");
- if (title === null) {
- return;
- }
- const rect = this.getBoundingClientRect();
- tooltipElem.transition().duration(200).style("opacity", ".9");
- tooltipElem.text(el.attr("title")).style("left", window.scrollX + rect.left + (rect.right - rect.left) / 2 + "px").style("top", window.scrollY + rect.top - 14 + document.body.scrollTop + "px");
- tooltipElem.html(tooltipElem.html().replace(/&lt;br\/&gt;/g, "<br/>"));
- el.classed("hover", true);
- }).on("mouseout", function() {
- tooltipElem.transition().duration(500).style("opacity", 0);
- const el = (0,d3__WEBPACK_IMPORTED_MODULE_0__/* .select */ .Ltv)(this);
- el.classed("hover", false);
- });
-};
-functions.push(setupToolTips);
-let direction = "TB";
-const getDirection = () => direction;
-const setDirection = (dir) => {
- direction = dir;
-};
-const addNamespace = function(id) {
- if (namespaces[id] !== void 0) {
- return;
- }
- namespaces[id] = {
- id,
- classes: {},
- children: {},
- domId: MERMAID_DOM_ID_PREFIX + id + "-" + namespaceCounter
- };
- namespaceCounter++;
-};
-const getNamespace = function(name) {
- return namespaces[name];
-};
-const getNamespaces = function() {
- return namespaces;
-};
-const addClassesToNamespace = function(id, classNames) {
- if (namespaces[id] === void 0) {
- return;
- }
- for (const name of classNames) {
- const { className } = splitClassNameAndType(name);
- classes[className].parent = id;
- namespaces[id].classes[className] = classes[className];
- }
-};
-const setCssStyle = function(id, styles2) {
- const thisClass = classes[id];
- if (!styles2 || !thisClass) {
- return;
- }
- for (const s of styles2) {
- if (s.includes(",")) {
- thisClass.styles.push(...s.split(","));
- } else {
- thisClass.styles.push(s);
- }
- }
-};
-const db = {
- setAccTitle: _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.s,
- getAccTitle: _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.g,
- getAccDescription: _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.a,
- setAccDescription: _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.b,
- getConfig: () => (0,_mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.c)().class,
- addClass,
- bindFunctions,
- clear,
- getClass,
- getClasses,
- getNotes,
- addAnnotation,
- addNote,
- getRelations,
- addRelation,
- getDirection,
- setDirection,
- addMember,
- addMembers,
- cleanupLabel,
- lineType,
- relationType,
- setClickEvent,
- setCssClass,
- setLink,
- getTooltip,
- setTooltip,
- lookUpDomId,
- setDiagramTitle: _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.q,
- getDiagramTitle: _mermaid_6dc72991_js__WEBPACK_IMPORTED_MODULE_1__.t,
- setClassLabel,
- addNamespace,
- addClassesToNamespace,
- getNamespace,
- getNamespaces,
- setCssStyle
-};
-const getStyles = (options) => `g.classGroup text {
- fill: ${options.nodeBorder || options.classText};
- stroke: none;
- font-family: ${options.fontFamily};
- font-size: 10px;
-
- .title {
- font-weight: bolder;
- }
-
-}
-
-.nodeLabel, .edgeLabel {
- color: ${options.classText};
-}
-.edgeLabel .label rect {
- fill: ${options.mainBkg};
-}
-.label text {
- fill: ${options.classText};
-}
-.edgeLabel .label span {
- background: ${options.mainBkg};
-}
-
-.classTitle {
- font-weight: bolder;
-}
-.node rect,
- .node circle,
- .node ellipse,
- .node polygon,
- .node path {
- fill: ${options.mainBkg};
- stroke: ${options.nodeBorder};
- stroke-width: 1px;
- }
-
-
-.divider {
- stroke: ${options.nodeBorder};
- stroke-width: 1;
-}
-
-g.clickable {
- cursor: pointer;
-}
-
-g.classGroup rect {
- fill: ${options.mainBkg};
- stroke: ${options.nodeBorder};
-}
-
-g.classGroup line {
- stroke: ${options.nodeBorder};
- stroke-width: 1;
-}
-
-.classLabel .box {
- stroke: none;
- stroke-width: 0;
- fill: ${options.mainBkg};
- opacity: 0.5;
-}
-
-.classLabel .label {
- fill: ${options.nodeBorder};
- font-size: 10px;
-}
-
-.relation {
- stroke: ${options.lineColor};
- stroke-width: 1;
- fill: none;
-}
-
-.dashed-line{
- stroke-dasharray: 3;
-}
-
-.dotted-line{
- stroke-dasharray: 1 2;
-}
-
-#compositionStart, .composition {
- fill: ${options.lineColor} !important;
- stroke: ${options.lineColor} !important;
- stroke-width: 1;
-}
-
-#compositionEnd, .composition {
- fill: ${options.lineColor} !important;
- stroke: ${options.lineColor} !important;
- stroke-width: 1;
-}
-
-#dependencyStart, .dependency {
- fill: ${options.lineColor} !important;
- stroke: ${options.lineColor} !important;
- stroke-width: 1;
-}
-
-#dependencyStart, .dependency {
- fill: ${options.lineColor} !important;
- stroke: ${options.lineColor} !important;
- stroke-width: 1;
-}
-
-#extensionStart, .extension {
- fill: transparent !important;
- stroke: ${options.lineColor} !important;
- stroke-width: 1;
-}
-
-#extensionEnd, .extension {
- fill: transparent !important;
- stroke: ${options.lineColor} !important;
- stroke-width: 1;
-}
-
-#aggregationStart, .aggregation {
- fill: transparent !important;
- stroke: ${options.lineColor} !important;
- stroke-width: 1;
-}
-
-#aggregationEnd, .aggregation {
- fill: transparent !important;
- stroke: ${options.lineColor} !important;
- stroke-width: 1;
-}
-
-#lollipopStart, .lollipop {
- fill: ${options.mainBkg} !important;
- stroke: ${options.lineColor} !important;
- stroke-width: 1;
-}
-
-#lollipopEnd, .lollipop {
- fill: ${options.mainBkg} !important;
- stroke: ${options.lineColor} !important;
- stroke-width: 1;
-}
-
-.edgeTerminals {
- font-size: 11px;
- line-height: initial;
-}
-
-.classTitleText {
- text-anchor: middle;
- font-size: 18px;
- fill: ${options.textColor};
-}
-`;
-const styles = getStyles;
-
-
-
-/***/ })
-
-};
-; \ No newline at end of file
generated by cgit v1.2.3-54-g00ecf (git 2.39.0) at 2024-11-14 22:42:07 +0000