@hkyhy/marsun-components-core 0.1.113 → 0.1.115

package/dist/node_modules/@antv/layout/lib/algorithm/antv-dagre/index.js

@@ -0,0 +1,204 @@
+import { __awaiter as it } from "../../node_modules/tslib/tslib.es6.js";
+import { formatNodeSizeFn as ot, formatNumberFn as j } from "../../util/format.js";
+import { parsePoint as nt } from "../../util/point.js";
+import { BaseLayout as et } from "../base-layout.js";
+import { DagreGraph as q } from "./graph.js";
+import { layout as rt } from "./layout.js";
+import dt from "../../node_modules/@antv/util/esm/lodash/is-number.js";
+const F = {
+  nodeSize: 10,
+  nodeSpacing: 0,
+  rankdir: "TB",
+  nodesep: 50,
+  ranksep: 50,
+  edgeLabelSpace: !0,
+  ranker: "tight-tree",
+  controlPoints: !1,
+  radial: !1,
+  focusNode: null
+  // radial 为 true 时生效，关注的节点
+};
+class mt extends et {
+  constructor() {
+    super(...arguments), this.id = "antv-dagre";
+  }
+  getDefaultOptions() {
+    return F;
+  }
+  layout(E) {
+    return it(this, void 0, void 0, function* () {
+      const {
+        nodeSize: L,
+        nodeSpacing: S,
+        align: C,
+        rankdir: f = "TB",
+        ranksep: b,
+        nodesep: e,
+        edgeLabelSpace: v,
+        ranker: u = "tight-tree",
+        nodeOrder: p,
+        begin: h,
+        controlPoints: T,
+        radial: k,
+        sortByCombo: M,
+        // focusNode,
+        preset: P,
+        ranksepFunc: d,
+        nodesepFunc: c
+      } = E, w = j(d, b ?? 50, "node"), W = j(c, e ?? 50, "node");
+      let X = W, D = w;
+      (f === "LR" || f === "RL") && (X = w, D = W);
+      const n = new q({ tree: [] }), R = this.model.nodes(), J = this.model.edges(), K = ot(L, S, F.nodeSize, F.nodeSpacing);
+      R.forEach((t) => {
+        var i;
+        const s = t._original, l = K(s), m = D(s), Y = X(s), a = l[0] + 2 * Y, o = l[1] + 2 * m, r = (i = t.data) === null || i === void 0 ? void 0 : i.layer;
+        dt(r) ? n.addNode({
+          id: t.id,
+          data: {
+            width: a,
+            height: o,
+            layer: r,
+            originalWidth: l[0],
+            originalHeight: l[1]
+          }
+        }) : n.addNode({
+          id: t.id,
+          data: {
+            width: a,
+            height: o,
+            originalWidth: l[0],
+            originalHeight: l[1]
+          }
+        });
+      }), J.forEach((t) => {
+        n.addEdge({
+          id: t.id,
+          source: t.source,
+          target: t.target,
+          data: {}
+        });
+      }), M && (n.attachTreeStructure("combo"), R.forEach((t) => {
+        const i = t == null ? void 0 : t.parentId;
+        i !== void 0 && n.hasNode(i) && n.setParent(t.id, i, "combo");
+      }));
+      let B = null;
+      P != null && P.length && (B = new q(), P.forEach((t) => {
+        B.addNode({
+          id: t.id,
+          data: t.data
+        });
+      })), rt(n, {
+        prevGraph: B,
+        edgeLabelSpace: v,
+        keepNodeOrder: !!p,
+        nodeOrder: p || [],
+        acyclicer: "greedy",
+        ranker: u,
+        rankdir: f,
+        nodesep: e,
+        align: C
+      });
+      const I = [0, 0];
+      if (h) {
+        let t = 1 / 0, i = 1 / 0;
+        n.getAllNodes().forEach((s) => {
+          t > s.data.x && (t = s.data.x), i > s.data.y && (i = s.data.y);
+        }), n.getAllEdges().forEach((s) => {
+          var l;
+          (l = s.data.points) === null || l === void 0 || l.forEach((m) => {
+            t > m.x && (t = m.x), i > m.y && (i = m.y);
+          });
+        }), I[0] = h[0] - t, I[1] = h[1] - i;
+      }
+      const _ = f === "LR" || f === "RL";
+      if (!k) {
+        const t = /* @__PURE__ */ new Set(), s = f === "BT" || f === "RL" ? (a, o) => o - a : (a, o) => a - o;
+        n.getAllNodes().forEach((a) => {
+          a.data.x = a.data.x + I[0], a.data.y = a.data.y + I[1], t.add(_ ? a.data.x : a.data.y);
+        });
+        const l = Array.from(t).sort(s), m = _ ? (a, o) => a.x !== o.x : (a, o) => a.y !== o.y, Y = _ ? (a, o, r) => {
+          const N = Math.max(o.y, r.y), g = Math.min(o.y, r.y);
+          return a.filter((y) => y.y <= N && y.y >= g);
+        } : (a, o, r) => {
+          const N = Math.max(o.x, r.x), g = Math.min(o.x, r.x);
+          return a.filter((y) => y.x <= N && y.x >= g);
+        };
+        n.getAllEdges().forEach((a, o) => {
+          var r;
+          v && T && a.data.type !== "loop" && (a.data.controlPoints = st((r = a.data.points) === null || r === void 0 ? void 0 : r.map(({ x: N, y: g }) => ({
+            x: N + I[0],
+            y: g + I[1]
+          })), n.getNode(a.source), n.getNode(a.target), l, _, m, Y));
+        });
+      }
+      this.model.forEachNode((t) => {
+        const i = n.getNode(t.id);
+        if (i) {
+          const { x: s, y: l, width: m, height: Y, originalWidth: a, originalHeight: o } = i.data, r = M ? n.getChildren(t.id, "combo") : n.getChildren(t.id);
+          if (r.length > 0) {
+            let g = 1 / 0, y = -1 / 0, z = 1 / 0, A = -1 / 0;
+            r.forEach((tt) => {
+              const at = tt.id, x = n.getNode(at);
+              if (x != null && x.data) {
+                const G = x.data.x, U = x.data.y, V = x.data.originalWidth || x.data.width || 0, $ = x.data.originalHeight || x.data.height || 0;
+                g = Math.min(g, G - V / 2), y = Math.max(y, G + V / 2), z = Math.min(z, U - $ / 2), A = Math.max(A, U + $ / 2);
+              }
+            });
+            const H = 20, Q = (y - g || 0) + H * 2, Z = (A - z || 0) + H * 2;
+            t.x = (g + y) / 2, t.y = (z + A) / 2, t.size = [Q, Z];
+          } else
+            t.x = s, t.y = l, t.size = [a, o];
+        }
+      }), this.model.forEachEdge((t) => {
+        const i = n.getEdge(t.id);
+        i && i.data.controlPoints && (t.points = i.data.controlPoints.map(nt));
+      });
+    });
+  }
+}
+const st = (O, E, L, S, C, f, b) => {
+  let e = (O == null ? void 0 : O.slice(1, O.length - 1)) || [];
+  if (E && L) {
+    let { x: v, y: u } = E.data, { x: p, y: h } = L.data;
+    if (C && (v = E.data.y, u = E.data.x, p = L.data.y, h = L.data.x), h !== u && v !== p) {
+      const T = S.indexOf(u), k = S[T + 1];
+      if (k) {
+        const d = e[0], c = C ? {
+          x: (u + k) / 2,
+          y: (d == null ? void 0 : d.y) || p
+        } : {
+          x: (d == null ? void 0 : d.x) || p,
+          y: (u + k) / 2
+        };
+        (!d || f(d, c)) && e.unshift(c);
+      }
+      const M = S.indexOf(h), P = Math.abs(M - T);
+      if (P === 1)
+        e = b(e, E.data, L.data), e.length || e.push(C ? {
+          x: (u + h) / 2,
+          y: v
+        } : {
+          x: v,
+          y: (u + h) / 2
+        });
+      else if (P > 1) {
+        const d = S[M - 1];
+        if (d) {
+          const c = e[e.length - 1], w = C ? {
+            x: (h + d) / 2,
+            y: (c == null ? void 0 : c.y) || p
+          } : {
+            x: (c == null ? void 0 : c.x) || v,
+            y: (h + d) / 2
+          };
+          (!c || f(c, w)) && e.push(w);
+        }
+      }
+    }
+  }
+  return e;
+};
+export {
+  mt as AntVDagreLayout
+};
+//# sourceMappingURL=index.js.map

package/dist/node_modules/@antv/layout/lib/algorithm/antv-dagre/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../node_modules/@antv/layout/lib/algorithm/antv-dagre/index.js"],"sourcesContent":["import { __awaiter } from '../../node_modules/tslib/tslib.es6.js';\nimport '../../node_modules/@antv/expr/dist/index.esm.js';\nimport { formatNodeSizeFn, formatNumberFn } from '../../util/format.js';\nimport { parsePoint } from '../../util/point.js';\nimport { BaseLayout } from '../base-layout.js';\nimport { DagreGraph } from './graph.js';\nimport { layout } from './layout.js';\nimport isNumber from '../../node_modules/@antv/util/esm/lodash/is-number.js';\n\nconst DEFAULTS_LAYOUT_OPTIONS$8 = {\n    nodeSize: 10,\n    nodeSpacing: 0,\n    rankdir: 'TB',\n    nodesep: 50,\n    ranksep: 50,\n    edgeLabelSpace: true,\n    ranker: 'tight-tree',\n    controlPoints: false,\n    radial: false,\n    focusNode: null, // radial 为 true 时生效，关注的节点\n};\n/**\n * <zh/> AntV 实现的 Dagre 布局\n *\n * <en/> AntV implementation of Dagre layout\n */\nclass AntVDagreLayout extends BaseLayout {\n    constructor() {\n        super(...arguments);\n        this.id = 'antv-dagre';\n    }\n    getDefaultOptions() {\n        return DEFAULTS_LAYOUT_OPTIONS$8;\n    }\n    layout(options) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const { nodeSize, nodeSpacing, align, rankdir = 'TB', ranksep, nodesep, edgeLabelSpace, ranker = 'tight-tree', nodeOrder, begin, controlPoints, radial, sortByCombo, \n            // focusNode,\n            preset, ranksepFunc, nodesepFunc, } = options;\n            const ranksepfunc = formatNumberFn(ranksepFunc, ranksep !== null && ranksep !== void 0 ? ranksep : 50, 'node');\n            const nodesepfunc = formatNumberFn(nodesepFunc, nodesep !== null && nodesep !== void 0 ? nodesep : 50, 'node');\n            let horisep = nodesepfunc;\n            let vertisep = ranksepfunc;\n            if (rankdir === 'LR' || rankdir === 'RL') {\n                horisep = ranksepfunc;\n                vertisep = nodesepfunc;\n            }\n            // Create internal graph\n            const g = new DagreGraph({ tree: [] });\n            // copy graph to g\n            const nodes = this.model.nodes();\n            const edges = this.model.edges();\n            const sizeFn = formatNodeSizeFn(nodeSize, nodeSpacing, DEFAULTS_LAYOUT_OPTIONS$8.nodeSize, DEFAULTS_LAYOUT_OPTIONS$8.nodeSpacing);\n            nodes.forEach((node) => {\n                var _a;\n                const raw = node._original;\n                const size = sizeFn(raw);\n                const verti = vertisep(raw);\n                const hori = horisep(raw);\n                const width = size[0] + 2 * hori;\n                const height = size[1] + 2 * verti;\n                const layer = (_a = node.data) === null || _a === void 0 ? void 0 : _a.layer;\n                if (isNumber(layer)) {\n                    // 如果有layer属性，加入到node的label中\n                    g.addNode({\n                        id: node.id,\n                        data: {\n                            width,\n                            height,\n                            layer,\n                            originalWidth: size[0],\n                            originalHeight: size[1],\n                        },\n                    });\n                }\n                else {\n                    g.addNode({\n                        id: node.id,\n                        data: {\n                            width,\n                            height,\n                            originalWidth: size[0],\n                            originalHeight: size[1],\n                        },\n                    });\n                }\n            });\n            edges.forEach((edge) => {\n                g.addEdge({\n                    id: edge.id,\n                    source: edge.source,\n                    target: edge.target,\n                    data: {},\n                });\n            });\n            if (sortByCombo) {\n                g.attachTreeStructure('combo');\n                nodes.forEach((node) => {\n                    const parentId = node === null || node === void 0 ? void 0 : node.parentId;\n                    if (parentId === undefined)\n                        return;\n                    if (g.hasNode(parentId)) {\n                        g.setParent(node.id, parentId, 'combo');\n                    }\n                });\n            }\n            let prevGraph = null;\n            if (preset === null || preset === void 0 ? void 0 : preset.length) {\n                prevGraph = new DagreGraph();\n                preset.forEach((node) => {\n                    prevGraph.addNode({\n                        id: node.id,\n                        data: node.data,\n                    });\n                });\n            }\n            layout(g, {\n                prevGraph,\n                edgeLabelSpace,\n                keepNodeOrder: !!nodeOrder,\n                nodeOrder: nodeOrder || [],\n                acyclicer: 'greedy',\n                ranker,\n                rankdir,\n                nodesep,\n                align,\n            });\n            const layoutTopLeft = [0, 0];\n            if (begin) {\n                let minX = Infinity;\n                let minY = Infinity;\n                g.getAllNodes().forEach((node) => {\n                    if (minX > node.data.x)\n                        minX = node.data.x;\n                    if (minY > node.data.y)\n                        minY = node.data.y;\n                });\n                g.getAllEdges().forEach((edge) => {\n                    var _a;\n                    (_a = edge.data.points) === null || _a === void 0 ? void 0 : _a.forEach((point) => {\n                        if (minX > point.x)\n                            minX = point.x;\n                        if (minY > point.y)\n                            minY = point.y;\n                    });\n                });\n                layoutTopLeft[0] = begin[0] - minX;\n                layoutTopLeft[1] = begin[1] - minY;\n            }\n            const isHorizontal = rankdir === 'LR' || rankdir === 'RL';\n            if (radial) ;\n            else {\n                const layerCoords = new Set();\n                const isInvert = rankdir === 'BT' || rankdir === 'RL';\n                const layerCoordSort = isInvert\n                    ? (a, b) => b - a\n                    : (a, b) => a - b;\n                g.getAllNodes().forEach((node) => {\n                    // let ndata: any = this.nodeMap[node];\n                    // if (!ndata) {\n                    //   ndata = combos?.find((it) => it.id === node);\n                    // }\n                    // if (!ndata) return;\n                    // ndata.x = node.data.x! + dBegin[0];\n                    // ndata.y = node.data.y! + dBegin[1];\n                    // //  pass layer order to data for increment layout use\n                    // ndata._order = node.data._order;\n                    // layerCoords.add(isHorizontal ? ndata.x : ndata.y);\n                    node.data.x = node.data.x + layoutTopLeft[0];\n                    node.data.y = node.data.y + layoutTopLeft[1];\n                    layerCoords.add(isHorizontal ? node.data.x : node.data.y);\n                });\n                const layerCoordsArr = Array.from(layerCoords).sort(layerCoordSort);\n                // pre-define the isHorizontal related functions to avoid redundant calc in interations\n                const isDifferentLayer = isHorizontal\n                    ? (point1, point2) => point1.x !== point2.x\n                    : (point1, point2) => point1.y !== point2.y;\n                const filterControlPointsOutOfBoundary = isHorizontal\n                    ? (ps, point1, point2) => {\n                        const max = Math.max(point1.y, point2.y);\n                        const min = Math.min(point1.y, point2.y);\n                        return ps.filter((point) => point.y <= max && point.y >= min);\n                    }\n                    : (ps, point1, point2) => {\n                        const max = Math.max(point1.x, point2.x);\n                        const min = Math.min(point1.x, point2.x);\n                        return ps.filter((point) => point.x <= max && point.x >= min);\n                    };\n                g.getAllEdges().forEach((edge, i) => {\n                    var _a;\n                    // const i = edges.findIndex((it) => {\n                    //   return it.source === edge.source && it.target === edge.target;\n                    // });\n                    // if (i <= -1) return;\n                    if (edgeLabelSpace && controlPoints && edge.data.type !== 'loop') {\n                        edge.data.controlPoints = getControlPoints((_a = edge.data.points) === null || _a === void 0 ? void 0 : _a.map(({ x, y }) => ({\n                            x: x + layoutTopLeft[0],\n                            y: y + layoutTopLeft[1],\n                        })), g.getNode(edge.source), g.getNode(edge.target), layerCoordsArr, isHorizontal, isDifferentLayer, filterControlPointsOutOfBoundary);\n                    }\n                });\n            }\n            this.model.forEachNode((node) => {\n                const layoutNode = g.getNode(node.id);\n                if (layoutNode) {\n                    const { x, y, width, height, originalWidth, originalHeight } = layoutNode.data;\n                    const children = sortByCombo\n                        ? g.getChildren(node.id, 'combo')\n                        : g.getChildren(node.id);\n                    const hasChildren = children.length > 0;\n                    if (hasChildren) {\n                        let minX = Infinity, maxX = -Infinity;\n                        let minY = Infinity, maxY = -Infinity;\n                        children.forEach((child) => {\n                            const childId = child.id;\n                            const childNode = g.getNode(childId);\n                            if (childNode === null || childNode === void 0 ? void 0 : childNode.data) {\n                                const childX = childNode.data.x;\n                                const childY = childNode.data.y;\n                                const childWidth = childNode.data.originalWidth || childNode.data.width || 0;\n                                const childHeight = childNode.data.originalHeight || childNode.data.height || 0;\n                                minX = Math.min(minX, childX - childWidth / 2);\n                                maxX = Math.max(maxX, childX + childWidth / 2);\n                                minY = Math.min(minY, childY - childHeight / 2);\n                                maxY = Math.max(maxY, childY + childHeight / 2);\n                            }\n                        });\n                        const padding = 20;\n                        const groupWidth = (maxX - minX || 0) + padding * 2;\n                        const groupHeight = (maxY - minY || 0) + padding * 2;\n                        node.x = (minX + maxX) / 2;\n                        node.y = (minY + maxY) / 2;\n                        node.size = [groupWidth, groupHeight];\n                    }\n                    else {\n                        node.x = x;\n                        node.y = y;\n                        node.size = [originalWidth, originalHeight];\n                    }\n                }\n            });\n            this.model.forEachEdge((edge) => {\n                const layoutEdge = g.getEdge(edge.id);\n                if (layoutEdge && layoutEdge.data.controlPoints) {\n                    edge.points = layoutEdge.data.controlPoints.map(parsePoint);\n                }\n            });\n        });\n    }\n}\n/**\n * Format controlPoints to avoid polylines crossing nodes\n * @param points\n * @param sourceNode\n * @param targetNode\n * @param layerCoordsArr\n * @param isHorizontal\n * @returns\n */\nconst getControlPoints = (points, sourceNode, targetNode, layerCoordsArr, isHorizontal, isDifferentLayer, filterControlPointsOutOfBoundary) => {\n    let controlPoints = (points === null || points === void 0 ? void 0 : points.slice(1, points.length - 1)) || []; // 去掉头尾\n    // 酌情增加控制点，使折线不穿过跨层的节点\n    if (sourceNode && targetNode) {\n        let { x: sourceX, y: sourceY } = sourceNode.data;\n        let { x: targetX, y: targetY } = targetNode.data;\n        if (isHorizontal) {\n            sourceX = sourceNode.data.y;\n            sourceY = sourceNode.data.x;\n            targetX = targetNode.data.y;\n            targetY = targetNode.data.x;\n        }\n        // 为跨层级的边增加第一个控制点。忽略垂直的/横向的边。\n        // 新控制点 = {\n        //   x: 终点x,\n        //   y: (起点y + 下一层y) / 2,   #下一层y可能不等于终点y\n        // }\n        if (targetY !== sourceY && sourceX !== targetX) {\n            const sourceLayer = layerCoordsArr.indexOf(sourceY);\n            const sourceNextLayerCoord = layerCoordsArr[sourceLayer + 1];\n            if (sourceNextLayerCoord) {\n                const firstControlPoint = controlPoints[0];\n                const insertStartControlPoint = (isHorizontal\n                    ? {\n                        x: (sourceY + sourceNextLayerCoord) / 2,\n                        y: (firstControlPoint === null || firstControlPoint === void 0 ? void 0 : firstControlPoint.y) || targetX,\n                    }\n                    : {\n                        x: (firstControlPoint === null || firstControlPoint === void 0 ? void 0 : firstControlPoint.x) || targetX,\n                        y: (sourceY + sourceNextLayerCoord) / 2,\n                    });\n                // 当新增的控制点不存在（!=当前第一个控制点）时添加\n                if (!firstControlPoint ||\n                    isDifferentLayer(firstControlPoint, insertStartControlPoint)) {\n                    controlPoints.unshift(insertStartControlPoint);\n                }\n            }\n            const targetLayer = layerCoordsArr.indexOf(targetY);\n            const layerDiff = Math.abs(targetLayer - sourceLayer);\n            if (layerDiff === 1) {\n                controlPoints = filterControlPointsOutOfBoundary(controlPoints, sourceNode.data, targetNode.data);\n                // one controlPoint at least\n                if (!controlPoints.length) {\n                    controlPoints.push((isHorizontal\n                        ? {\n                            x: (sourceY + targetY) / 2,\n                            y: sourceX,\n                        }\n                        : {\n                            x: sourceX,\n                            y: (sourceY + targetY) / 2,\n                        }));\n                }\n            }\n            else if (layerDiff > 1) {\n                const targetLastLayerCoord = layerCoordsArr[targetLayer - 1];\n                if (targetLastLayerCoord) {\n                    const lastControlPoints = controlPoints[controlPoints.length - 1];\n                    const insertEndControlPoint = (isHorizontal\n                        ? {\n                            x: (targetY + targetLastLayerCoord) / 2,\n                            y: (lastControlPoints === null || lastControlPoints === void 0 ? void 0 : lastControlPoints.y) || targetX,\n                        }\n                        : {\n                            x: (lastControlPoints === null || lastControlPoints === void 0 ? void 0 : lastControlPoints.x) || sourceX,\n                            y: (targetY + targetLastLayerCoord) / 2,\n                        });\n                    // 当新增的控制点不存在（!=当前最后一个控制点）时添加\n                    if (!lastControlPoints ||\n                        isDifferentLayer(lastControlPoints, insertEndControlPoint)) {\n                        controlPoints.push(insertEndControlPoint);\n                    }\n                }\n            }\n        }\n    }\n    return controlPoints;\n};\n\nexport { AntVDagreLayout };\n//# sourceMappingURL=index.js.map\n"],"names":["DEFAULTS_LAYOUT_OPTIONS$8","AntVDagreLayout","BaseLayout","options","__awaiter","nodeSize","nodeSpacing","align","rankdir","ranksep","nodesep","edgeLabelSpace","ranker","nodeOrder","begin","controlPoints","radial","sortByCombo","preset","ranksepFunc","nodesepFunc","ranksepfunc","formatNumberFn","nodesepfunc","horisep","vertisep","g","DagreGraph","nodes","edges","sizeFn","formatNodeSizeFn","node","_a","raw","size","verti","hori","width","height","layer","isNumber","edge","parentId","prevGraph","layout","layoutTopLeft","minX","minY","point","isHorizontal","layerCoords","layerCoordSort","b","layerCoordsArr","isDifferentLayer","point1","point2","filterControlPointsOutOfBoundary","ps","max","min","i","getControlPoints","x","y","layoutNode","originalWidth","originalHeight","children","maxX","maxY","child","childId","childNode","childX","childY","childWidth","childHeight","padding","groupWidth","groupHeight","layoutEdge","parsePoint","points","sourceNode","targetNode","sourceX","sourceY","targetX","targetY","sourceLayer","sourceNextLayerCoord","firstControlPoint","insertStartControlPoint","targetLayer","layerDiff","targetLastLayerCoord","lastControlPoints","insertEndControlPoint"],"mappings":";;;;;;;AASA,MAAMA,IAA4B;AAAA,EAC9B,UAAU;AAAA,EACV,aAAa;AAAA,EACb,SAAS;AAAA,EACT,SAAS;AAAA,EACT,SAAS;AAAA,EACT,gBAAgB;AAAA,EAChB,QAAQ;AAAA,EACR,eAAe;AAAA,EACf,QAAQ;AAAA,EACR,WAAW;AAAA;AACf;AAMA,MAAMC,WAAwBC,GAAW;AAAA,EACrC,cAAc;AACV,UAAM,GAAG,SAAS,GAClB,KAAK,KAAK;AAAA,EACd;AAAA,EACA,oBAAoB;AAChB,WAAOF;AAAA,EACX;AAAA,EACA,OAAOG,GAAS;AACZ,WAAOC,GAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,YAAM;AAAA,QAAE,UAAAC;AAAA,QAAU,aAAAC;AAAA,QAAa,OAAAC;AAAA,QAAO,SAAAC,IAAU;AAAA,QAAM,SAAAC;AAAA,QAAS,SAAAC;AAAA,QAAS,gBAAAC;AAAA,QAAgB,QAAAC,IAAS;AAAA,QAAc,WAAAC;AAAA,QAAW,OAAAC;AAAA,QAAO,eAAAC;AAAA,QAAe,QAAAC;AAAA,QAAQ,aAAAC;AAAA;AAAA,QAExJ,QAAAC;AAAA,QAAQ,aAAAC;AAAA,QAAa,aAAAC;AAAA,MAAW,IAAMjB,GAChCkB,IAAcC,EAAeH,GAAaV,KAAmD,IAAI,MAAM,GACvGc,IAAcD,EAAeF,GAAaV,KAAmD,IAAI,MAAM;AAC7G,UAAIc,IAAUD,GACVE,IAAWJ;AACf,OAAIb,MAAY,QAAQA,MAAY,UAChCgB,IAAUH,GACVI,IAAWF;AAGf,YAAMG,IAAI,IAAIC,EAAW,EAAE,MAAM,CAAA,EAAE,CAAE,GAE/BC,IAAQ,KAAK,MAAM,MAAK,GACxBC,IAAQ,KAAK,MAAM,MAAK,GACxBC,IAASC,GAAiB1B,GAAUC,GAAaN,EAA0B,UAAUA,EAA0B,WAAW;AAChI,MAAA4B,EAAM,QAAQ,CAACI,MAAS;AACpB,YAAIC;AACJ,cAAMC,IAAMF,EAAK,WACXG,IAAOL,EAAOI,CAAG,GACjBE,IAAQX,EAASS,CAAG,GACpBG,IAAOb,EAAQU,CAAG,GAClBI,IAAQH,EAAK,CAAC,IAAI,IAAIE,GACtBE,IAASJ,EAAK,CAAC,IAAI,IAAIC,GACvBI,KAASP,IAAKD,EAAK,UAAU,QAAQC,MAAO,SAAS,SAASA,EAAG;AACvE,QAAIQ,GAASD,CAAK,IAEdd,EAAE,QAAQ;AAAA,UACN,IAAIM,EAAK;AAAA,UACT,MAAM;AAAA,YACF,OAAAM;AAAA,YACA,QAAAC;AAAA,YACA,OAAAC;AAAA,YACA,eAAeL,EAAK,CAAC;AAAA,YACrB,gBAAgBA,EAAK,CAAC;AAAA,UAClD;AAAA,QACA,CAAqB,IAGDT,EAAE,QAAQ;AAAA,UACN,IAAIM,EAAK;AAAA,UACT,MAAM;AAAA,YACF,OAAAM;AAAA,YACA,QAAAC;AAAA,YACA,eAAeJ,EAAK,CAAC;AAAA,YACrB,gBAAgBA,EAAK,CAAC;AAAA,UAClD;AAAA,QACA,CAAqB;AAAA,MAET,CAAC,GACDN,EAAM,QAAQ,CAACa,MAAS;AACpB,QAAAhB,EAAE,QAAQ;AAAA,UACN,IAAIgB,EAAK;AAAA,UACT,QAAQA,EAAK;AAAA,UACb,QAAQA,EAAK;AAAA,UACb,MAAM,CAAA;AAAA,QAC1B,CAAiB;AAAA,MACL,CAAC,GACGzB,MACAS,EAAE,oBAAoB,OAAO,GAC7BE,EAAM,QAAQ,CAACI,MAAS;AACpB,cAAMW,IAAWX,KAAS,OAA0B,SAASA,EAAK;AAClE,QAAIW,MAAa,UAEbjB,EAAE,QAAQiB,CAAQ,KAClBjB,EAAE,UAAUM,EAAK,IAAIW,GAAU,OAAO;AAAA,MAE9C,CAAC;AAEL,UAAIC,IAAY;AAChB,MAAI1B,KAAW,QAAqCA,EAAO,WACvD0B,IAAY,IAAIjB,EAAU,GAC1BT,EAAO,QAAQ,CAACc,MAAS;AACrB,QAAAY,EAAU,QAAQ;AAAA,UACd,IAAIZ,EAAK;AAAA,UACT,MAAMA,EAAK;AAAA,QACnC,CAAqB;AAAA,MACL,CAAC,IAELa,GAAOnB,GAAG;AAAA,QACN,WAAAkB;AAAA,QACA,gBAAAjC;AAAA,QACA,eAAe,CAAC,CAACE;AAAA,QACjB,WAAWA,KAAa,CAAA;AAAA,QACxB,WAAW;AAAA,QACX,QAAAD;AAAA,QACA,SAAAJ;AAAA,QACA,SAAAE;AAAA,QACA,OAAAH;AAAA,MAChB,CAAa;AACD,YAAMuC,IAAgB,CAAC,GAAG,CAAC;AAC3B,UAAIhC,GAAO;AACP,YAAIiC,IAAO,OACPC,IAAO;AACX,QAAAtB,EAAE,YAAW,EAAG,QAAQ,CAACM,MAAS;AAC9B,UAAIe,IAAOf,EAAK,KAAK,MACjBe,IAAOf,EAAK,KAAK,IACjBgB,IAAOhB,EAAK,KAAK,MACjBgB,IAAOhB,EAAK,KAAK;AAAA,QACzB,CAAC,GACDN,EAAE,YAAW,EAAG,QAAQ,CAACgB,MAAS;AAC9B,cAAIT;AACJ,WAACA,IAAKS,EAAK,KAAK,YAAY,QAAQT,MAAO,UAAkBA,EAAG,QAAQ,CAACgB,MAAU;AAC/E,YAAIF,IAAOE,EAAM,MACbF,IAAOE,EAAM,IACbD,IAAOC,EAAM,MACbD,IAAOC,EAAM;AAAA,UACrB,CAAC;AAAA,QACL,CAAC,GACDH,EAAc,CAAC,IAAIhC,EAAM,CAAC,IAAIiC,GAC9BD,EAAc,CAAC,IAAIhC,EAAM,CAAC,IAAIkC;AAAA,MAClC;AACA,YAAME,IAAe1C,MAAY,QAAQA,MAAY;AACrD,UAAI,CAAAQ,GACC;AACD,cAAMmC,IAAc,oBAAI,IAAG,GAErBC,IADW5C,MAAY,QAAQA,MAAY,OAE3C,CAAC,GAAG6C,MAAMA,IAAI,IACd,CAAC,GAAGA,MAAM,IAAIA;AACpB,QAAA3B,EAAE,YAAW,EAAG,QAAQ,CAACM,MAAS;AAW9B,UAAAA,EAAK,KAAK,IAAIA,EAAK,KAAK,IAAIc,EAAc,CAAC,GAC3Cd,EAAK,KAAK,IAAIA,EAAK,KAAK,IAAIc,EAAc,CAAC,GAC3CK,EAAY,IAAID,IAAelB,EAAK,KAAK,IAAIA,EAAK,KAAK,CAAC;AAAA,QAC5D,CAAC;AACD,cAAMsB,IAAiB,MAAM,KAAKH,CAAW,EAAE,KAAKC,CAAc,GAE5DG,IAAmBL,IACnB,CAACM,GAAQC,MAAWD,EAAO,MAAMC,EAAO,IACxC,CAACD,GAAQC,MAAWD,EAAO,MAAMC,EAAO,GACxCC,IAAmCR,IACnC,CAACS,GAAIH,GAAQC,MAAW;AACtB,gBAAMG,IAAM,KAAK,IAAIJ,EAAO,GAAGC,EAAO,CAAC,GACjCI,IAAM,KAAK,IAAIL,EAAO,GAAGC,EAAO,CAAC;AACvC,iBAAOE,EAAG,OAAO,CAACV,MAAUA,EAAM,KAAKW,KAAOX,EAAM,KAAKY,CAAG;AAAA,QAChE,IACE,CAACF,GAAIH,GAAQC,MAAW;AACtB,gBAAMG,IAAM,KAAK,IAAIJ,EAAO,GAAGC,EAAO,CAAC,GACjCI,IAAM,KAAK,IAAIL,EAAO,GAAGC,EAAO,CAAC;AACvC,iBAAOE,EAAG,OAAO,CAACV,MAAUA,EAAM,KAAKW,KAAOX,EAAM,KAAKY,CAAG;AAAA,QAChE;AACJ,QAAAnC,EAAE,YAAW,EAAG,QAAQ,CAACgB,GAAMoB,MAAM;AACjC,cAAI7B;AAKJ,UAAItB,KAAkBI,KAAiB2B,EAAK,KAAK,SAAS,WACtDA,EAAK,KAAK,gBAAgBqB,IAAkB9B,IAAKS,EAAK,KAAK,YAAY,QAAQT,MAAO,SAAS,SAASA,EAAG,IAAI,CAAC,EAAE,GAAA+B,GAAG,GAAAC,SAAS;AAAA,YAC1H,GAAGD,IAAIlB,EAAc,CAAC;AAAA,YACtB,GAAGmB,IAAInB,EAAc,CAAC;AAAA,UAClD,EAA0B,GAAGpB,EAAE,QAAQgB,EAAK,MAAM,GAAGhB,EAAE,QAAQgB,EAAK,MAAM,GAAGY,GAAgBJ,GAAcK,GAAkBG,CAAgC;AAAA,QAE7I,CAAC;AAAA,MACL;AACA,WAAK,MAAM,YAAY,CAAC1B,MAAS;AAC7B,cAAMkC,IAAaxC,EAAE,QAAQM,EAAK,EAAE;AACpC,YAAIkC,GAAY;AACZ,gBAAM,EAAE,GAAAF,GAAG,GAAAC,GAAG,OAAA3B,GAAO,QAAAC,GAAQ,eAAA4B,GAAe,gBAAAC,MAAmBF,EAAW,MACpEG,IAAWpD,IACXS,EAAE,YAAYM,EAAK,IAAI,OAAO,IAC9BN,EAAE,YAAYM,EAAK,EAAE;AAE3B,cADoBqC,EAAS,SAAS,GACrB;AACb,gBAAItB,IAAO,OAAUuB,IAAO,QACxBtB,IAAO,OAAUuB,IAAO;AAC5B,YAAAF,EAAS,QAAQ,CAACG,OAAU;AACxB,oBAAMC,KAAUD,GAAM,IAChBE,IAAYhD,EAAE,QAAQ+C,EAAO;AACnC,kBAAIC,KAAc,QAAwCA,EAAU,MAAM;AACtE,sBAAMC,IAASD,EAAU,KAAK,GACxBE,IAASF,EAAU,KAAK,GACxBG,IAAaH,EAAU,KAAK,iBAAiBA,EAAU,KAAK,SAAS,GACrEI,IAAcJ,EAAU,KAAK,kBAAkBA,EAAU,KAAK,UAAU;AAC9E,gBAAA3B,IAAO,KAAK,IAAIA,GAAM4B,IAASE,IAAa,CAAC,GAC7CP,IAAO,KAAK,IAAIA,GAAMK,IAASE,IAAa,CAAC,GAC7C7B,IAAO,KAAK,IAAIA,GAAM4B,IAASE,IAAc,CAAC,GAC9CP,IAAO,KAAK,IAAIA,GAAMK,IAASE,IAAc,CAAC;AAAA,cAClD;AAAA,YACJ,CAAC;AACD,kBAAMC,IAAU,IACVC,KAAcV,IAAOvB,KAAQ,KAAKgC,IAAU,GAC5CE,KAAeV,IAAOvB,KAAQ,KAAK+B,IAAU;AACnD,YAAA/C,EAAK,KAAKe,IAAOuB,KAAQ,GACzBtC,EAAK,KAAKgB,IAAOuB,KAAQ,GACzBvC,EAAK,OAAO,CAACgD,GAAYC,CAAW;AAAA,UACxC;AAEI,YAAAjD,EAAK,IAAIgC,GACThC,EAAK,IAAIiC,GACTjC,EAAK,OAAO,CAACmC,GAAeC,CAAc;AAAA,QAElD;AAAA,MACJ,CAAC,GACD,KAAK,MAAM,YAAY,CAAC1B,MAAS;AAC7B,cAAMwC,IAAaxD,EAAE,QAAQgB,EAAK,EAAE;AACpC,QAAIwC,KAAcA,EAAW,KAAK,kBAC9BxC,EAAK,SAASwC,EAAW,KAAK,cAAc,IAAIC,EAAU;AAAA,MAElE,CAAC;AAAA,IACL,CAAC;AAAA,EACL;AACJ;AAUA,MAAMpB,KAAmB,CAACqB,GAAQC,GAAYC,GAAYhC,GAAgBJ,GAAcK,GAAkBG,MAAqC;AAC3I,MAAI3C,KAAiBqE,KAAW,OAA4B,SAASA,EAAO,MAAM,GAAGA,EAAO,SAAS,CAAC,MAAM,CAAA;AAE5G,MAAIC,KAAcC,GAAY;AAC1B,QAAI,EAAE,GAAGC,GAAS,GAAGC,EAAO,IAAKH,EAAW,MACxC,EAAE,GAAGI,GAAS,GAAGC,EAAO,IAAKJ,EAAW;AAY5C,QAXIpC,MACAqC,IAAUF,EAAW,KAAK,GAC1BG,IAAUH,EAAW,KAAK,GAC1BI,IAAUH,EAAW,KAAK,GAC1BI,IAAUJ,EAAW,KAAK,IAO1BI,MAAYF,KAAWD,MAAYE,GAAS;AAC5C,YAAME,IAAcrC,EAAe,QAAQkC,CAAO,GAC5CI,IAAuBtC,EAAeqC,IAAc,CAAC;AAC3D,UAAIC,GAAsB;AACtB,cAAMC,IAAoB9E,EAAc,CAAC,GACnC+E,IAA2B5C,IAC3B;AAAA,UACE,IAAIsC,IAAUI,KAAwB;AAAA,UACtC,IAAIC,KAAsB,OAAuC,SAASA,EAAkB,MAAMJ;AAAA,QAC1H,IACsB;AAAA,UACE,IAAII,KAAsB,OAAuC,SAASA,EAAkB,MAAMJ;AAAA,UAClG,IAAID,IAAUI,KAAwB;AAAA,QAC9D;AAEgB,SAAI,CAACC,KACDtC,EAAiBsC,GAAmBC,CAAuB,MAC3D/E,EAAc,QAAQ+E,CAAuB;AAAA,MAErD;AACA,YAAMC,IAAczC,EAAe,QAAQoC,CAAO,GAC5CM,IAAY,KAAK,IAAID,IAAcJ,CAAW;AACpD,UAAIK,MAAc;AACd,QAAAjF,IAAgB2C,EAAiC3C,GAAesE,EAAW,MAAMC,EAAW,IAAI,GAE3FvE,EAAc,UACfA,EAAc,KAAMmC,IACd;AAAA,UACE,IAAIsC,IAAUE,KAAW;AAAA,UACzB,GAAGH;AAAA,QAC/B,IAC0B;AAAA,UACE,GAAGA;AAAA,UACH,IAAIC,IAAUE,KAAW;AAAA,QACrD,CAAyB;AAAA,eAGJM,IAAY,GAAG;AACpB,cAAMC,IAAuB3C,EAAeyC,IAAc,CAAC;AAC3D,YAAIE,GAAsB;AACtB,gBAAMC,IAAoBnF,EAAcA,EAAc,SAAS,CAAC,GAC1DoF,IAAyBjD,IACzB;AAAA,YACE,IAAIwC,IAAUO,KAAwB;AAAA,YACtC,IAAIC,KAAsB,OAAuC,SAASA,EAAkB,MAAMT;AAAA,UAC9H,IAC0B;AAAA,YACE,IAAIS,KAAsB,OAAuC,SAASA,EAAkB,MAAMX;AAAA,YAClG,IAAIG,IAAUO,KAAwB;AAAA,UAClE;AAEoB,WAAI,CAACC,KACD3C,EAAiB2C,GAAmBC,CAAqB,MACzDpF,EAAc,KAAKoF,CAAqB;AAAA,QAEhD;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AACA,SAAOpF;AACX;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/algorithm/antv-dagre/layout.js

@@ -0,0 +1,239 @@
+import { run as v, undo as x } from "./acyclic.js";
+import { addBorderSegments as y } from "./add-border-segments.js";
+import { adjust as w, undo as k } from "./coordinate-system.js";
+import { DagreGraph as A } from "./graph.js";
+import { run as L, cleanup as O } from "./nesting-graph.js";
+import { run as _, undo as R } from "./normalize.js";
+import { order as P } from "./order/index.js";
+import { initDataOrder as M } from "./order/init-data-order.js";
+import { parentDummyChains as C } from "./parent-dummy-chains.js";
+import { position as S } from "./position/index.js";
+import { rank as j } from "./rank/index.js";
+import { asNonCompoundGraph as D, removeEmptyRanks as T, normalizeRanks as B, addDummyNode as E, buildLayerMatrix as $, intersectRect as p } from "./util.js";
+import F from "../../node_modules/@antv/util/esm/lodash/is-nil.js";
+const ba = (a, t) => {
+  const { edgeLabelSpace: e, keepNodeOrder: o, prevGraph: d, rankdir: r, ranksep: s } = t;
+  !o && d && X(a, d);
+  const n = H(a);
+  e && (t.ranksep = J(n, {
+    rankdir: r,
+    ranksep: s
+  }));
+  let l;
+  try {
+    l = I(n, t);
+  } catch (i) {
+    if (i.message === "Not possible to find intersection inside of the rectangle") {
+      console.error(`The following error may be caused by improper layer setting, please make sure your manual layer setting does not violate the graph's structure:
+`, i);
+      return;
+    }
+    throw i;
+  }
+  return Y(a, n), l;
+}, I = (a, t) => {
+  const { ranker: e, rankdir: o = "tb", nodeOrder: d, keepNodeOrder: r, align: s, nodesep: n = 50, edgesep: l = 20, ranksep: i = 50 } = t;
+  da(a), v(a);
+  const { nestingRoot: c, nodeRankFactor: f } = L(a);
+  j(D(a), e), K(a), T(a, f), O(a, c), B(a), Q(a), U(a);
+  const h = [];
+  _(a, h), C(a, h), y(a), r && M(a, d), P(a, r), oa(a), w(a, o), S(a, {
+    align: s,
+    nodesep: n,
+    edgesep: l,
+    ranksep: i
+  }), ra(a), ea(a), R(a, h), aa(a), k(a, o);
+  const { width: m, height: b } = Z(a);
+  return G(a), ta(a), x(a), { width: m, height: b };
+}, X = (a, t) => {
+  a.getAllNodes().forEach((e) => {
+    const o = a.getNode(e.id);
+    if (t.hasNode(e.id)) {
+      const d = t.getNode(e.id);
+      o.data.fixorder = d.data._order, delete d.data._order;
+    } else
+      delete o.data.fixorder;
+  });
+}, Y = (a, t) => {
+  a.getAllNodes().forEach((e) => {
+    var o;
+    const d = a.getNode(e.id);
+    if (d) {
+      const r = t.getNode(e.id);
+      d.data.x = r.data.x, d.data.y = r.data.y, d.data._order = r.data.order, d.data._rank = r.data.rank, !((o = t.getChildren(e.id)) === null || o === void 0) && o.length && (d.data.width = r.data.width, d.data.height = r.data.height);
+    }
+  }), a.getAllEdges().forEach((e) => {
+    const o = a.getEdge(e.id), d = t.getEdge(e.id);
+    o.data.points = d ? d.data.points : [], d && d.data.hasOwnProperty("x") && (o.data.x = d.data.x, o.data.y = d.data.y);
+  });
+}, z = ["width", "height", "layer", "fixorder"], V = { width: 0, height: 0 }, W = ["minlen", "weight", "width", "height", "labeloffset"], q = {
+  minlen: 1,
+  weight: 1,
+  width: 0,
+  height: 0,
+  labeloffset: 10,
+  labelpos: "r"
+}, u = ["labelpos"], H = (a) => {
+  const t = new A({ tree: [] });
+  return a.getAllNodes().forEach((e) => {
+    const o = N(a.getNode(e.id).data), d = Object.assign(Object.assign({}, V), o), r = g(d, z);
+    t.hasNode(e.id) || t.addNode({
+      id: e.id,
+      data: Object.assign({}, r)
+    });
+    const s = a.hasTreeStructure("combo") ? a.getParent(e.id, "combo") : a.getParent(e.id);
+    F(s) || (t.hasNode(s.id) || t.addNode(Object.assign({}, s)), t.setParent(e.id, s.id));
+  }), a.getAllEdges().forEach((e) => {
+    const o = N(a.getEdge(e.id).data), d = {};
+    u == null || u.forEach((r) => {
+      o[r] !== void 0 && (d[r] = o[r]);
+    }), t.addEdge({
+      id: e.id,
+      source: e.source,
+      target: e.target,
+      data: Object.assign({}, q, g(o, W), d)
+    });
+  }), t;
+}, J = (a, t) => {
+  const { ranksep: e = 0, rankdir: o } = t;
+  return a.getAllNodes().forEach((d) => {
+    isNaN(d.data.layer) || d.data.layer || (d.data.layer = 0);
+  }), a.getAllEdges().forEach((d) => {
+    var r;
+    d.data.minlen *= 2, ((r = d.data.labelpos) === null || r === void 0 ? void 0 : r.toLowerCase()) !== "c" && (o === "TB" || o === "BT" ? d.data.width += d.data.labeloffset : d.data.height += d.data.labeloffset);
+  }), e / 2;
+}, K = (a) => {
+  a.getAllEdges().forEach((t) => {
+    if (t.data.width && t.data.height) {
+      const e = a.getNode(t.source), o = a.getNode(t.target), d = {
+        e: t,
+        rank: (o.data.rank - e.data.rank) / 2 + e.data.rank
+      };
+      E(a, "edge-proxy", d, "_ep");
+    }
+  });
+}, Q = (a) => {
+  let t = 0;
+  return a.getAllNodes().forEach((e) => {
+    var o, d;
+    e.data.borderTop && (e.data.minRank = (o = a.getNode(e.data.borderTop)) === null || o === void 0 ? void 0 : o.data.rank, e.data.maxRank = (d = a.getNode(e.data.borderBottom)) === null || d === void 0 ? void 0 : d.data.rank, t = Math.max(t, e.data.maxRank || -1 / 0));
+  }), t;
+}, U = (a) => {
+  a.getAllNodes().forEach((t) => {
+    t.data.dummy === "edge-proxy" && (a.getEdge(t.data.e.id).data.labelRank = t.data.rank, a.removeNode(t.id));
+  });
+}, Z = (a, t) => {
+  let e, o = 0, d, r = 0;
+  const { marginx: s = 0, marginy: n = 0 } = {}, l = (i) => {
+    if (!i.data)
+      return;
+    const c = i.data.x, f = i.data.y, h = i.data.width, m = i.data.height;
+    !isNaN(c) && !isNaN(h) && (e === void 0 && (e = c - h / 2), e = Math.min(e, c - h / 2), o = Math.max(o, c + h / 2)), !isNaN(f) && !isNaN(m) && (d === void 0 && (d = f - m / 2), d = Math.min(d, f - m / 2), r = Math.max(r, f + m / 2));
+  };
+  return a.getAllNodes().forEach((i) => {
+    l(i);
+  }), a.getAllEdges().forEach((i) => {
+    i != null && i.data.hasOwnProperty("x") && l(i);
+  }), e -= s, d -= n, a.getAllNodes().forEach((i) => {
+    i.data.x -= e, i.data.y -= d;
+  }), a.getAllEdges().forEach((i) => {
+    var c;
+    (c = i.data.points) === null || c === void 0 || c.forEach((f) => {
+      f.x -= e, f.y -= d;
+    }), i.data.hasOwnProperty("x") && (i.data.x -= e), i.data.hasOwnProperty("y") && (i.data.y -= d);
+  }), {
+    width: o - e + s,
+    height: r - d + n
+  };
+}, G = (a) => {
+  a.getAllEdges().forEach((t) => {
+    const e = a.getNode(t.source), o = a.getNode(t.target);
+    let d, r;
+    t.data.points ? (d = t.data.points[0], r = t.data.points[t.data.points.length - 1]) : (t.data.points = [], d = { x: o.data.x, y: o.data.y }, r = { x: e.data.x, y: e.data.y }), t.data.points.unshift(p(e.data, d)), t.data.points.push(p(o.data, r));
+  });
+}, aa = (a) => {
+  a.getAllEdges().forEach((t) => {
+    if (t.data.hasOwnProperty("x"))
+      switch ((t.data.labelpos === "l" || t.data.labelpos === "r") && (t.data.width -= t.data.labeloffset), t.data.labelpos) {
+        case "l":
+          t.data.x -= t.data.width / 2 + t.data.labeloffset;
+          break;
+        case "r":
+          t.data.x += t.data.width / 2 + t.data.labeloffset;
+          break;
+      }
+  });
+}, ta = (a) => {
+  a.getAllEdges().forEach((t) => {
+    var e;
+    t.data.reversed && ((e = t.data.points) === null || e === void 0 || e.reverse());
+  });
+}, ea = (a) => {
+  a.getAllNodes().forEach((t) => {
+    var e, o, d;
+    if (!((e = a.getChildren(t.id)) === null || e === void 0) && e.length) {
+      const r = a.getNode(t.id), s = a.getNode(r.data.borderTop), n = a.getNode(r.data.borderBottom), l = a.getNode(r.data.borderLeft[((o = r.data.borderLeft) === null || o === void 0 ? void 0 : o.length) - 1]), i = a.getNode(r.data.borderRight[((d = r.data.borderRight) === null || d === void 0 ? void 0 : d.length) - 1]);
+      r.data.width = Math.abs((i == null ? void 0 : i.data.x) - (l == null ? void 0 : l.data.x)) || 10, r.data.height = Math.abs((n == null ? void 0 : n.data.y) - (s == null ? void 0 : s.data.y)) || 10, r.data.x = ((l == null ? void 0 : l.data.x) || 0) + r.data.width / 2, r.data.y = ((s == null ? void 0 : s.data.y) || 0) + r.data.height / 2;
+    }
+  }), a.getAllNodes().forEach((t) => {
+    t.data.dummy === "border" && a.removeNode(t.id);
+  });
+}, da = (a) => {
+  a.getAllEdges().forEach((t) => {
+    if (t.source === t.target) {
+      const e = a.getNode(t.source);
+      e.data.selfEdges || (e.data.selfEdges = []), e.data.selfEdges.push(t), a.removeEdge(t.id);
+    }
+  });
+}, oa = (a) => {
+  const t = $(a);
+  t == null || t.forEach((e) => {
+    let o = 0;
+    e == null || e.forEach((d, r) => {
+      var s;
+      const n = a.getNode(d);
+      n.data.order = r + o, (s = n.data.selfEdges) === null || s === void 0 || s.forEach((l) => {
+        E(a, "selfedge", {
+          width: l.data.width,
+          height: l.data.height,
+          rank: n.data.rank,
+          order: r + ++o,
+          e: l
+        }, "_se");
+      }), delete n.data.selfEdges;
+    });
+  });
+}, ra = (a) => {
+  a.getAllNodes().forEach((t) => {
+    const e = a.getNode(t.id);
+    if (e.data.dummy === "selfedge") {
+      const o = a.getNode(e.data.e.source), d = o.data.x + o.data.width / 2, r = o.data.y, s = e.data.x - d, n = o.data.height / 2;
+      a.hasEdge(e.data.e.id) ? a.updateEdgeData(e.data.e.id, e.data.e.data) : a.addEdge({
+        id: e.data.e.id,
+        source: e.data.e.source,
+        target: e.data.e.target,
+        data: e.data.e.data
+      }), a.removeNode(t.id), e.data.e.data.points = [
+        { x: d + 2 * s / 3, y: r - n },
+        { x: d + 5 * s / 6, y: r - n },
+        { y: r, x: d + s },
+        { x: d + 5 * s / 6, y: r + n },
+        { x: d + 2 * s / 3, y: r + n }
+      ], e.data.e.data.x = e.data.x, e.data.e.data.y = e.data.y;
+    }
+  });
+}, g = (a, t) => {
+  const e = {};
+  return t == null || t.forEach((o) => {
+    a[o] !== void 0 && (e[o] = +a[o]);
+  }), e;
+}, N = (a = {}) => {
+  const t = {};
+  return Object.keys(a).forEach((e) => {
+    t[e.toLowerCase()] = a[e];
+  }), t;
+};
+export {
+  ba as layout
+};
+//# sourceMappingURL=layout.js.map

package/dist/node_modules/@antv/layout/lib/algorithm/antv-dagre/layout.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"layout.js","sources":["../../../../../../../node_modules/@antv/layout/lib/algorithm/antv-dagre/layout.js"],"sourcesContent":["import { run, undo as undo$2 } from './acyclic.js';\nimport { addBorderSegments } from './add-border-segments.js';\nimport { adjust, undo as undo$1 } from './coordinate-system.js';\nimport { DagreGraph } from './graph.js';\nimport { run as run$1, cleanup } from './nesting-graph.js';\nimport { run as run$2, undo } from './normalize.js';\nimport { order } from './order/index.js';\nimport { initDataOrder } from './order/init-data-order.js';\nimport { parentDummyChains } from './parent-dummy-chains.js';\nimport { position } from './position/index.js';\nimport { rank } from './rank/index.js';\nimport { asNonCompoundGraph, removeEmptyRanks, normalizeRanks, addDummyNode, buildLayerMatrix, intersectRect } from './util.js';\nimport isNil from '../../node_modules/@antv/util/esm/lodash/is-nil.js';\n\n// const graphNumAttrs = [\"nodesep\", \"edgesep\", \"ranksep\", \"marginx\", \"marginy\"];\n// const graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: \"tb\" };\n// const graphAttrs = [\"acyclicer\", \"ranker\", \"rankdir\", \"align\"];\nconst layout = (g, options) => {\n    const { edgeLabelSpace, keepNodeOrder, prevGraph, rankdir, ranksep } = options;\n    // 如果在原图基础上修改，继承原图的order结果\n    if (!keepNodeOrder && prevGraph) {\n        inheritOrder(g, prevGraph);\n    }\n    const layoutGraph = buildLayoutGraph(g);\n    // 控制是否为边的label留位置（这会影响是否在边中间添加dummy node）\n    if (!!edgeLabelSpace) {\n        options.ranksep = makeSpaceForEdgeLabels(layoutGraph, {\n            rankdir,\n            ranksep,\n        });\n    }\n    let dimension;\n    // TODO: 暂时处理层级设置不正确时的异常报错，提示设置正确的层级\n    try {\n        dimension = runLayout(layoutGraph, options);\n    }\n    catch (e) {\n        if (e.message === 'Not possible to find intersection inside of the rectangle') {\n            console.error(\"The following error may be caused by improper layer setting, please make sure your manual layer setting does not violate the graph's structure:\\n\", e);\n            return;\n        }\n        throw e;\n    }\n    updateInputGraph(g, layoutGraph);\n    return dimension;\n};\nconst runLayout = (g, options) => {\n    const { ranker, rankdir = 'tb', nodeOrder, keepNodeOrder, align, nodesep = 50, edgesep = 20, ranksep = 50, } = options;\n    removeSelfEdges(g);\n    run(g);\n    const { nestingRoot, nodeRankFactor } = run$1(g);\n    rank(asNonCompoundGraph(g), ranker);\n    injectEdgeLabelProxies(g);\n    removeEmptyRanks(g, nodeRankFactor);\n    cleanup(g, nestingRoot);\n    normalizeRanks(g);\n    assignRankMinMax(g);\n    removeEdgeLabelProxies(g);\n    const dummyChains = [];\n    run$2(g, dummyChains);\n    parentDummyChains(g, dummyChains);\n    addBorderSegments(g);\n    if (keepNodeOrder) {\n        initDataOrder(g, nodeOrder);\n    }\n    order(g, keepNodeOrder);\n    insertSelfEdges(g);\n    adjust(g, rankdir);\n    position(g, {\n        align,\n        nodesep,\n        edgesep,\n        ranksep,\n    });\n    positionSelfEdges(g);\n    removeBorderNodes(g);\n    undo(g, dummyChains);\n    fixupEdgeLabelCoords(g);\n    undo$1(g, rankdir);\n    const { width, height } = translateGraph(g);\n    assignNodeIntersects(g);\n    reversePointsForReversedEdges(g);\n    undo$2(g);\n    return { width, height };\n};\n/**\n * 继承上一个布局中的order，防止翻转\n * TODO: 暂时没有考虑涉及层级变动的布局，只保证原来布局层级和相对顺序不变\n */\nconst inheritOrder = (currG, prevG) => {\n    currG.getAllNodes().forEach((n) => {\n        const node = currG.getNode(n.id);\n        if (prevG.hasNode(n.id)) {\n            const prevNode = prevG.getNode(n.id);\n            node.data.fixorder = prevNode.data._order;\n            delete prevNode.data._order;\n        }\n        else {\n            delete node.data.fixorder;\n        }\n    });\n};\n/*\n * Copies final layout information from the layout graph back to the input\n * graph. This process only copies whitelisted attributes from the layout graph\n * to the input graph, so it serves as a good place to determine what\n * attributes can influence layout.\n */\nconst updateInputGraph = (inputGraph, layoutGraph) => {\n    inputGraph.getAllNodes().forEach((v) => {\n        var _a;\n        const inputLabel = inputGraph.getNode(v.id);\n        if (inputLabel) {\n            const layoutLabel = layoutGraph.getNode(v.id);\n            inputLabel.data.x = layoutLabel.data.x;\n            inputLabel.data.y = layoutLabel.data.y;\n            inputLabel.data._order = layoutLabel.data.order;\n            inputLabel.data._rank = layoutLabel.data.rank;\n            if ((_a = layoutGraph.getChildren(v.id)) === null || _a === void 0 ? void 0 : _a.length) {\n                inputLabel.data.width = layoutLabel.data.width;\n                inputLabel.data.height = layoutLabel.data.height;\n            }\n        }\n    });\n    inputGraph.getAllEdges().forEach((e) => {\n        const inputLabel = inputGraph.getEdge(e.id);\n        const layoutLabel = layoutGraph.getEdge(e.id);\n        inputLabel.data.points = layoutLabel ? layoutLabel.data.points : [];\n        if (layoutLabel && layoutLabel.data.hasOwnProperty('x')) {\n            inputLabel.data.x = layoutLabel.data.x;\n            inputLabel.data.y = layoutLabel.data.y;\n        }\n    });\n    // inputGraph.graph().width = layoutGraph.graph().width;\n    // inputGraph.graph().height = layoutGraph.graph().height;\n};\nconst nodeNumAttrs = ['width', 'height', 'layer', 'fixorder']; // 需要传入layer, fixOrder作为参数参考\nconst nodeDefaults = { width: 0, height: 0 };\nconst edgeNumAttrs = ['minlen', 'weight', 'width', 'height', 'labeloffset'];\nconst edgeDefaults = {\n    minlen: 1,\n    weight: 1,\n    width: 0,\n    height: 0,\n    labeloffset: 10,\n    labelpos: 'r',\n};\nconst edgeAttrs = ['labelpos'];\n/*\n * Constructs a new graph from the input graph, which can be used for layout.\n * This process copies only whitelisted attributes from the input graph to the\n * layout graph. Thus this function serves as a good place to determine what\n * attributes can influence layout.\n */\nconst buildLayoutGraph = (inputGraph) => {\n    const g = new DagreGraph({ tree: [] });\n    inputGraph.getAllNodes().forEach((v) => {\n        const node = canonicalize(inputGraph.getNode(v.id).data);\n        const defaultNode = Object.assign(Object.assign({}, nodeDefaults), node);\n        const defaultAttrs = selectNumberAttrs(defaultNode, nodeNumAttrs);\n        if (!g.hasNode(v.id)) {\n            g.addNode({\n                id: v.id,\n                data: Object.assign({}, defaultAttrs),\n            });\n        }\n        const parent = inputGraph.hasTreeStructure('combo')\n            ? inputGraph.getParent(v.id, 'combo')\n            : inputGraph.getParent(v.id);\n        if (!isNil(parent)) {\n            if (!g.hasNode(parent.id)) {\n                g.addNode(Object.assign({}, parent));\n            }\n            g.setParent(v.id, parent.id);\n        }\n    });\n    inputGraph.getAllEdges().forEach((e) => {\n        const edge = canonicalize(inputGraph.getEdge(e.id).data);\n        const pickedProperties = {};\n        edgeAttrs === null || edgeAttrs === void 0 ? void 0 : edgeAttrs.forEach((key) => {\n            if (edge[key] !== undefined)\n                pickedProperties[key] = edge[key];\n        });\n        g.addEdge({\n            id: e.id,\n            source: e.source,\n            target: e.target,\n            data: Object.assign({}, edgeDefaults, selectNumberAttrs(edge, edgeNumAttrs), pickedProperties),\n        });\n    });\n    return g;\n};\n/*\n * This idea comes from the Gansner paper: to account for edge labels in our\n * layout we split each rank in half by doubling minlen and halving ranksep.\n * Then we can place labels at these mid-points between nodes.\n *\n * We also add some minimal padding to the width to push the label for the edge\n * away from the edge itself a bit.\n */\nconst makeSpaceForEdgeLabels = (g, options) => {\n    const { ranksep = 0, rankdir } = options;\n    g.getAllNodes().forEach((node) => {\n        if (!isNaN(node.data.layer)) {\n            if (!node.data.layer)\n                node.data.layer = 0;\n        }\n    });\n    g.getAllEdges().forEach((edge) => {\n        var _a;\n        edge.data.minlen *= 2;\n        if (((_a = edge.data.labelpos) === null || _a === void 0 ? void 0 : _a.toLowerCase()) !== 'c') {\n            if (rankdir === 'TB' || rankdir === 'BT') {\n                edge.data.width += edge.data.labeloffset;\n            }\n            else {\n                edge.data.height += edge.data.labeloffset;\n            }\n        }\n    });\n    return ranksep / 2;\n};\n/*\n * Creates temporary dummy nodes that capture the rank in which each edge's\n * label is going to, if it has one of non-zero width and height. We do this\n * so that we can safely remove empty ranks while preserving balance for the\n * label's position.\n */\nconst injectEdgeLabelProxies = (g) => {\n    g.getAllEdges().forEach((e) => {\n        if (e.data.width && e.data.height) {\n            const v = g.getNode(e.source);\n            const w = g.getNode(e.target);\n            const label = {\n                e,\n                rank: (w.data.rank - v.data.rank) / 2 + v.data.rank,\n            };\n            addDummyNode(g, 'edge-proxy', label, '_ep');\n        }\n    });\n};\nconst assignRankMinMax = (g) => {\n    let maxRank = 0;\n    g.getAllNodes().forEach((node) => {\n        var _a, _b;\n        if (node.data.borderTop) {\n            node.data.minRank = (_a = g.getNode(node.data.borderTop)) === null || _a === void 0 ? void 0 : _a.data.rank;\n            node.data.maxRank = (_b = g.getNode(node.data.borderBottom)) === null || _b === void 0 ? void 0 : _b.data.rank;\n            maxRank = Math.max(maxRank, node.data.maxRank || -Infinity);\n        }\n    });\n    return maxRank;\n};\nconst removeEdgeLabelProxies = (g) => {\n    g.getAllNodes().forEach((node) => {\n        if (node.data.dummy === 'edge-proxy') {\n            g.getEdge(node.data.e.id).data.labelRank = node.data.rank;\n            g.removeNode(node.id);\n        }\n    });\n};\nconst translateGraph = (g, options) => {\n    let minX;\n    let maxX = 0;\n    let minY;\n    let maxY = 0;\n    const { marginx: marginX = 0, marginy: marginY = 0 } = {};\n    const getExtremes = (attrs) => {\n        if (!attrs.data)\n            return;\n        const x = attrs.data.x;\n        const y = attrs.data.y;\n        const w = attrs.data.width;\n        const h = attrs.data.height;\n        if (!isNaN(x) && !isNaN(w)) {\n            if (minX === undefined) {\n                minX = x - w / 2;\n            }\n            minX = Math.min(minX, x - w / 2);\n            maxX = Math.max(maxX, x + w / 2);\n        }\n        if (!isNaN(y) && !isNaN(h)) {\n            if (minY === undefined) {\n                minY = y - h / 2;\n            }\n            minY = Math.min(minY, y - h / 2);\n            maxY = Math.max(maxY, y + h / 2);\n        }\n    };\n    g.getAllNodes().forEach((v) => {\n        getExtremes(v);\n    });\n    g.getAllEdges().forEach((e) => {\n        if (e === null || e === void 0 ? void 0 : e.data.hasOwnProperty('x')) {\n            getExtremes(e);\n        }\n    });\n    minX -= marginX;\n    minY -= marginY;\n    g.getAllNodes().forEach((node) => {\n        node.data.x -= minX;\n        node.data.y -= minY;\n    });\n    g.getAllEdges().forEach((edge) => {\n        var _a;\n        (_a = edge.data.points) === null || _a === void 0 ? void 0 : _a.forEach((p) => {\n            p.x -= minX;\n            p.y -= minY;\n        });\n        if (edge.data.hasOwnProperty('x')) {\n            edge.data.x -= minX;\n        }\n        if (edge.data.hasOwnProperty('y')) {\n            edge.data.y -= minY;\n        }\n    });\n    return {\n        width: maxX - minX + marginX,\n        height: maxY - minY + marginY,\n    };\n};\nconst assignNodeIntersects = (g) => {\n    g.getAllEdges().forEach((e) => {\n        const nodeV = g.getNode(e.source);\n        const nodeW = g.getNode(e.target);\n        let p1;\n        let p2;\n        if (!e.data.points) {\n            e.data.points = [];\n            p1 = { x: nodeW.data.x, y: nodeW.data.y };\n            p2 = { x: nodeV.data.x, y: nodeV.data.y };\n        }\n        else {\n            p1 = e.data.points[0];\n            p2 = e.data.points[e.data.points.length - 1];\n        }\n        e.data.points.unshift(intersectRect(nodeV.data, p1));\n        e.data.points.push(intersectRect(nodeW.data, p2));\n    });\n};\nconst fixupEdgeLabelCoords = (g) => {\n    g.getAllEdges().forEach((edge) => {\n        if (edge.data.hasOwnProperty('x')) {\n            if (edge.data.labelpos === 'l' || edge.data.labelpos === 'r') {\n                edge.data.width -= edge.data.labeloffset;\n            }\n            switch (edge.data.labelpos) {\n                case 'l':\n                    edge.data.x -= edge.data.width / 2 + edge.data.labeloffset;\n                    break;\n                case 'r':\n                    edge.data.x += edge.data.width / 2 + edge.data.labeloffset;\n                    break;\n            }\n        }\n    });\n};\nconst reversePointsForReversedEdges = (g) => {\n    g.getAllEdges().forEach((edge) => {\n        var _a;\n        if (edge.data.reversed) {\n            (_a = edge.data.points) === null || _a === void 0 ? void 0 : _a.reverse();\n        }\n    });\n};\nconst removeBorderNodes = (g) => {\n    g.getAllNodes().forEach((v) => {\n        var _a, _b, _c;\n        if ((_a = g.getChildren(v.id)) === null || _a === void 0 ? void 0 : _a.length) {\n            const node = g.getNode(v.id);\n            const t = g.getNode(node.data.borderTop);\n            const b = g.getNode(node.data.borderBottom);\n            const l = g.getNode(node.data.borderLeft[((_b = node.data.borderLeft) === null || _b === void 0 ? void 0 : _b.length) - 1]);\n            const r = g.getNode(node.data.borderRight[((_c = node.data.borderRight) === null || _c === void 0 ? void 0 : _c.length) - 1]);\n            node.data.width = Math.abs((r === null || r === void 0 ? void 0 : r.data.x) - (l === null || l === void 0 ? void 0 : l.data.x)) || 10;\n            node.data.height = Math.abs((b === null || b === void 0 ? void 0 : b.data.y) - (t === null || t === void 0 ? void 0 : t.data.y)) || 10;\n            node.data.x = ((l === null || l === void 0 ? void 0 : l.data.x) || 0) + node.data.width / 2;\n            node.data.y = ((t === null || t === void 0 ? void 0 : t.data.y) || 0) + node.data.height / 2;\n        }\n    });\n    g.getAllNodes().forEach((n) => {\n        if (n.data.dummy === 'border') {\n            g.removeNode(n.id);\n        }\n    });\n};\nconst removeSelfEdges = (g) => {\n    g.getAllEdges().forEach((e) => {\n        if (e.source === e.target) {\n            const node = g.getNode(e.source);\n            if (!node.data.selfEdges) {\n                node.data.selfEdges = [];\n            }\n            node.data.selfEdges.push(e);\n            g.removeEdge(e.id);\n        }\n    });\n};\nconst insertSelfEdges = (g) => {\n    const layers = buildLayerMatrix(g);\n    layers === null || layers === void 0 ? void 0 : layers.forEach((layer) => {\n        let orderShift = 0;\n        layer === null || layer === void 0 ? void 0 : layer.forEach((v, i) => {\n            var _a;\n            const node = g.getNode(v);\n            node.data.order = i + orderShift;\n            (_a = node.data.selfEdges) === null || _a === void 0 ? void 0 : _a.forEach((selfEdge) => {\n                addDummyNode(g, 'selfedge', {\n                    width: selfEdge.data.width,\n                    height: selfEdge.data.height,\n                    rank: node.data.rank,\n                    order: i + ++orderShift,\n                    e: selfEdge,\n                }, '_se');\n            });\n            delete node.data.selfEdges;\n        });\n    });\n};\nconst positionSelfEdges = (g) => {\n    g.getAllNodes().forEach((v) => {\n        const node = g.getNode(v.id);\n        if (node.data.dummy === 'selfedge') {\n            const selfNode = g.getNode(node.data.e.source);\n            const x = selfNode.data.x + selfNode.data.width / 2;\n            const y = selfNode.data.y;\n            const dx = node.data.x - x;\n            const dy = selfNode.data.height / 2;\n            if (g.hasEdge(node.data.e.id)) {\n                g.updateEdgeData(node.data.e.id, node.data.e.data);\n            }\n            else {\n                g.addEdge({\n                    id: node.data.e.id,\n                    source: node.data.e.source,\n                    target: node.data.e.target,\n                    data: node.data.e.data,\n                });\n            }\n            g.removeNode(v.id);\n            node.data.e.data.points = [\n                { x: x + (2 * dx) / 3, y: y - dy },\n                { x: x + (5 * dx) / 6, y: y - dy },\n                { y, x: x + dx },\n                { x: x + (5 * dx) / 6, y: y + dy },\n                { x: x + (2 * dx) / 3, y: y + dy },\n            ];\n            node.data.e.data.x = node.data.x;\n            node.data.e.data.y = node.data.y;\n        }\n    });\n};\nconst selectNumberAttrs = (obj, attrs) => {\n    const pickedProperties = {};\n    attrs === null || attrs === void 0 ? void 0 : attrs.forEach((key) => {\n        if (obj[key] === undefined)\n            return;\n        pickedProperties[key] = +obj[key];\n    });\n    return pickedProperties;\n};\nconst canonicalize = (attrs = {}) => {\n    const newAttrs = {};\n    Object.keys(attrs).forEach((k) => {\n        newAttrs[k.toLowerCase()] = attrs[k];\n    });\n    return newAttrs;\n};\n\nexport { layout };\n//# sourceMappingURL=layout.js.map\n"],"names":["layout","g","options","edgeLabelSpace","keepNodeOrder","prevGraph","rankdir","ranksep","inheritOrder","layoutGraph","buildLayoutGraph","makeSpaceForEdgeLabels","dimension","runLayout","e","updateInputGraph","ranker","nodeOrder","align","nodesep","edgesep","removeSelfEdges","run","nestingRoot","nodeRankFactor","run$1","rank","asNonCompoundGraph","injectEdgeLabelProxies","removeEmptyRanks","cleanup","normalizeRanks","assignRankMinMax","removeEdgeLabelProxies","dummyChains","run$2","parentDummyChains","addBorderSegments","initDataOrder","order","insertSelfEdges","adjust","position","positionSelfEdges","removeBorderNodes","undo","fixupEdgeLabelCoords","undo$1","width","height","translateGraph","assignNodeIntersects","reversePointsForReversedEdges","undo$2","currG","prevG","n","node","prevNode","inputGraph","v","_a","inputLabel","layoutLabel","nodeNumAttrs","nodeDefaults","edgeNumAttrs","edgeDefaults","edgeAttrs","DagreGraph","canonicalize","defaultNode","defaultAttrs","selectNumberAttrs","parent","isNil","edge","pickedProperties","key","w","label","addDummyNode","maxRank","_b","minX","maxX","minY","maxY","marginX","marginY","getExtremes","attrs","x","y","h","p","nodeV","nodeW","p1","p2","intersectRect","_c","t","b","r","layers","buildLayerMatrix","layer","orderShift","i","selfEdge","selfNode","dx","dy","obj","newAttrs","k"],"mappings":";;;;;;;;;;;;;AAiBK,MAACA,KAAS,CAACC,GAAGC,MAAY;AAC3B,QAAM,EAAE,gBAAAC,GAAgB,eAAAC,GAAe,WAAAC,GAAW,SAAAC,GAAS,SAAAC,EAAO,IAAKL;AAEvE,EAAI,CAACE,KAAiBC,KAClBG,EAAaP,GAAGI,CAAS;AAE7B,QAAMI,IAAcC,EAAiBT,CAAC;AAEtC,EAAME,MACFD,EAAQ,UAAUS,EAAuBF,GAAa;AAAA,IAClD,SAAAH;AAAA,IACA,SAAAC;AAAA,EACZ,CAAS;AAEL,MAAIK;AAEJ,MAAI;AACA,IAAAA,IAAYC,EAAUJ,GAAaP,CAAO;AAAA,EAC9C,SACOY,GAAG;AACN,QAAIA,EAAE,YAAY,6DAA6D;AAC3E,cAAQ,MAAM;AAAA,GAAqJA,CAAC;AACpK;AAAA,IACJ;AACA,UAAMA;AAAA,EACV;AACA,SAAAC,EAAiBd,GAAGQ,CAAW,GACxBG;AACX,GACMC,IAAY,CAACZ,GAAGC,MAAY;AAC9B,QAAM,EAAE,QAAAc,GAAQ,SAAAV,IAAU,MAAM,WAAAW,GAAW,eAAAb,GAAe,OAAAc,GAAO,SAAAC,IAAU,IAAI,SAAAC,IAAU,IAAI,SAAAb,IAAU,GAAE,IAAML;AAC/G,EAAAmB,GAAgBpB,CAAC,GACjBqB,EAAIrB,CAAC;AACL,QAAM,EAAE,aAAAsB,GAAa,gBAAAC,MAAmBC,EAAMxB,CAAC;AAC/C,EAAAyB,EAAKC,EAAmB1B,CAAC,GAAGe,CAAM,GAClCY,EAAuB3B,CAAC,GACxB4B,EAAiB5B,GAAGuB,CAAc,GAClCM,EAAQ7B,GAAGsB,CAAW,GACtBQ,EAAe9B,CAAC,GAChB+B,EAAiB/B,CAAC,GAClBgC,EAAuBhC,CAAC;AACxB,QAAMiC,IAAc,CAAA;AACpBC,EAAAA,EAAMlC,GAAGiC,CAAW,GACpBE,EAAkBnC,GAAGiC,CAAW,GAChCG,EAAkBpC,CAAC,GACfG,KACAkC,EAAcrC,GAAGgB,CAAS,GAE9BsB,EAAMtC,GAAGG,CAAa,GACtBoC,GAAgBvC,CAAC,GACjBwC,EAAOxC,GAAGK,CAAO,GACjBoC,EAASzC,GAAG;AAAA,IACR,OAAAiB;AAAA,IACA,SAAAC;AAAA,IACA,SAAAC;AAAA,IACA,SAAAb;AAAA,EACR,CAAK,GACDoC,GAAkB1C,CAAC,GACnB2C,GAAkB3C,CAAC,GACnB4C,EAAK5C,GAAGiC,CAAW,GACnBY,GAAqB7C,CAAC,GACtB8C,EAAO9C,GAAGK,CAAO;AACjB,QAAM,EAAE,OAAA0C,GAAO,QAAAC,MAAWC,EAAejD,CAAC;AAC1C,SAAAkD,EAAqBlD,CAAC,GACtBmD,GAA8BnD,CAAC,GAC/BoD,EAAOpD,CAAC,GACD,EAAE,OAAA+C,GAAO,QAAAC,EAAM;AAC1B,GAKMzC,IAAe,CAAC8C,GAAOC,MAAU;AACnC,EAAAD,EAAM,YAAW,EAAG,QAAQ,CAACE,MAAM;AAC/B,UAAMC,IAAOH,EAAM,QAAQE,EAAE,EAAE;AAC/B,QAAID,EAAM,QAAQC,EAAE,EAAE,GAAG;AACrB,YAAME,IAAWH,EAAM,QAAQC,EAAE,EAAE;AACnC,MAAAC,EAAK,KAAK,WAAWC,EAAS,KAAK,QACnC,OAAOA,EAAS,KAAK;AAAA,IACzB;AAEI,aAAOD,EAAK,KAAK;AAAA,EAEzB,CAAC;AACL,GAOM1C,IAAmB,CAAC4C,GAAYlD,MAAgB;AAClD,EAAAkD,EAAW,YAAW,EAAG,QAAQ,CAACC,MAAM;AACpC,QAAIC;AACJ,UAAMC,IAAaH,EAAW,QAAQC,EAAE,EAAE;AAC1C,QAAIE,GAAY;AACZ,YAAMC,IAActD,EAAY,QAAQmD,EAAE,EAAE;AAC5C,MAAAE,EAAW,KAAK,IAAIC,EAAY,KAAK,GACrCD,EAAW,KAAK,IAAIC,EAAY,KAAK,GACrCD,EAAW,KAAK,SAASC,EAAY,KAAK,OAC1CD,EAAW,KAAK,QAAQC,EAAY,KAAK,MACpC,GAAAF,IAAKpD,EAAY,YAAYmD,EAAE,EAAE,OAAO,QAAQC,MAAO,WAAkBA,EAAG,WAC7EC,EAAW,KAAK,QAAQC,EAAY,KAAK,OACzCD,EAAW,KAAK,SAASC,EAAY,KAAK;AAAA,IAElD;AAAA,EACJ,CAAC,GACDJ,EAAW,YAAW,EAAG,QAAQ,CAAC,MAAM;AACpC,UAAMG,IAAaH,EAAW,QAAQ,EAAE,EAAE,GACpCI,IAActD,EAAY,QAAQ,EAAE,EAAE;AAC5C,IAAAqD,EAAW,KAAK,SAASC,IAAcA,EAAY,KAAK,SAAS,CAAA,GAC7DA,KAAeA,EAAY,KAAK,eAAe,GAAG,MAClDD,EAAW,KAAK,IAAIC,EAAY,KAAK,GACrCD,EAAW,KAAK,IAAIC,EAAY,KAAK;AAAA,EAE7C,CAAC;AAGL,GACMC,IAAe,CAAC,SAAS,UAAU,SAAS,UAAU,GACtDC,IAAe,EAAE,OAAO,GAAG,QAAQ,EAAC,GACpCC,IAAe,CAAC,UAAU,UAAU,SAAS,UAAU,aAAa,GACpEC,IAAe;AAAA,EACjB,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,aAAa;AAAA,EACb,UAAU;AACd,GACMC,IAAY,CAAC,UAAU,GAOvB1D,IAAmB,CAACiD,MAAe;AACrC,QAAM1D,IAAI,IAAIoE,EAAW,EAAE,MAAM,CAAA,EAAE,CAAE;AACrC,SAAAV,EAAW,YAAW,EAAG,QAAQ,CAACC,MAAM;AACpC,UAAMH,IAAOa,EAAaX,EAAW,QAAQC,EAAE,EAAE,EAAE,IAAI,GACjDW,IAAc,OAAO,OAAO,OAAO,OAAO,CAAA,GAAIN,CAAY,GAAGR,CAAI,GACjEe,IAAeC,EAAkBF,GAAaP,CAAY;AAChE,IAAK/D,EAAE,QAAQ2D,EAAE,EAAE,KACf3D,EAAE,QAAQ;AAAA,MACN,IAAI2D,EAAE;AAAA,MACN,MAAM,OAAO,OAAO,CAAA,GAAIY,CAAY;AAAA,IACpD,CAAa;AAEL,UAAME,IAASf,EAAW,iBAAiB,OAAO,IAC5CA,EAAW,UAAUC,EAAE,IAAI,OAAO,IAClCD,EAAW,UAAUC,EAAE,EAAE;AAC/B,IAAKe,EAAMD,CAAM,MACRzE,EAAE,QAAQyE,EAAO,EAAE,KACpBzE,EAAE,QAAQ,OAAO,OAAO,CAAA,GAAIyE,CAAM,CAAC,GAEvCzE,EAAE,UAAU2D,EAAE,IAAIc,EAAO,EAAE;AAAA,EAEnC,CAAC,GACDf,EAAW,YAAW,EAAG,QAAQ,CAAC,MAAM;AACpC,UAAMiB,IAAON,EAAaX,EAAW,QAAQ,EAAE,EAAE,EAAE,IAAI,GACjDkB,IAAmB,CAAA;AACzB,IAAAT,KAAc,QAAwCA,EAAU,QAAQ,CAACU,MAAQ;AAC7E,MAAIF,EAAKE,CAAG,MAAM,WACdD,EAAiBC,CAAG,IAAIF,EAAKE,CAAG;AAAA,IACxC,CAAC,GACD7E,EAAE,QAAQ;AAAA,MACN,IAAI,EAAE;AAAA,MACN,QAAQ,EAAE;AAAA,MACV,QAAQ,EAAE;AAAA,MACV,MAAM,OAAO,OAAO,IAAIkE,GAAcM,EAAkBG,GAAMV,CAAY,GAAGW,CAAgB;AAAA,IACzG,CAAS;AAAA,EACL,CAAC,GACM5E;AACX,GASMU,IAAyB,CAACV,GAAGC,MAAY;AAC3C,QAAM,EAAE,SAAAK,IAAU,GAAG,SAAAD,EAAO,IAAKJ;AACjC,SAAAD,EAAE,YAAW,EAAG,QAAQ,CAACwD,MAAS;AAC9B,IAAK,MAAMA,EAAK,KAAK,KAAK,KACjBA,EAAK,KAAK,UACXA,EAAK,KAAK,QAAQ;AAAA,EAE9B,CAAC,GACDxD,EAAE,YAAW,EAAG,QAAQ,CAAC2E,MAAS;AAC9B,QAAIf;AACJ,IAAAe,EAAK,KAAK,UAAU,KACdf,IAAKe,EAAK,KAAK,cAAc,QAAQf,MAAO,SAAS,SAASA,EAAG,YAAW,OAAQ,QAClFvD,MAAY,QAAQA,MAAY,OAChCsE,EAAK,KAAK,SAASA,EAAK,KAAK,cAG7BA,EAAK,KAAK,UAAUA,EAAK,KAAK;AAAA,EAG1C,CAAC,GACMrE,IAAU;AACrB,GAOMqB,IAAyB,CAAC3B,MAAM;AAClC,EAAAA,EAAE,YAAW,EAAG,QAAQ,CAACa,MAAM;AAC3B,QAAIA,EAAE,KAAK,SAASA,EAAE,KAAK,QAAQ;AAC/B,YAAM8C,IAAI3D,EAAE,QAAQa,EAAE,MAAM,GACtBiE,IAAI9E,EAAE,QAAQa,EAAE,MAAM,GACtBkE,IAAQ;AAAA,QACV,GAAAlE;AAAA,QACA,OAAOiE,EAAE,KAAK,OAAOnB,EAAE,KAAK,QAAQ,IAAIA,EAAE,KAAK;AAAA,MAC/D;AACY,MAAAqB,EAAahF,GAAG,cAAc+E,GAAO,KAAK;AAAA,IAC9C;AAAA,EACJ,CAAC;AACL,GACMhD,IAAmB,CAAC/B,MAAM;AAC5B,MAAIiF,IAAU;AACd,SAAAjF,EAAE,YAAW,EAAG,QAAQ,CAACwD,MAAS;AAC9B,QAAII,GAAIsB;AACR,IAAI1B,EAAK,KAAK,cACVA,EAAK,KAAK,WAAWI,IAAK5D,EAAE,QAAQwD,EAAK,KAAK,SAAS,OAAO,QAAQI,MAAO,SAAS,SAASA,EAAG,KAAK,MACvGJ,EAAK,KAAK,WAAW0B,IAAKlF,EAAE,QAAQwD,EAAK,KAAK,YAAY,OAAO,QAAQ0B,MAAO,SAAS,SAASA,EAAG,KAAK,MAC1GD,IAAU,KAAK,IAAIA,GAASzB,EAAK,KAAK,WAAW,MAAS;AAAA,EAElE,CAAC,GACMyB;AACX,GACMjD,IAAyB,CAAChC,MAAM;AAClC,EAAAA,EAAE,YAAW,EAAG,QAAQ,CAACwD,MAAS;AAC9B,IAAIA,EAAK,KAAK,UAAU,iBACpBxD,EAAE,QAAQwD,EAAK,KAAK,EAAE,EAAE,EAAE,KAAK,YAAYA,EAAK,KAAK,MACrDxD,EAAE,WAAWwD,EAAK,EAAE;AAAA,EAE5B,CAAC;AACL,GACMP,IAAiB,CAACjD,GAAGC,MAAY;AACnC,MAAIkF,GACAC,IAAO,GACPC,GACAC,IAAO;AACX,QAAM,EAAE,SAASC,IAAU,GAAG,SAASC,IAAU,EAAC,IAAK,CAAA,GACjDC,IAAc,CAACC,MAAU;AAC3B,QAAI,CAACA,EAAM;AACP;AACJ,UAAMC,IAAID,EAAM,KAAK,GACfE,IAAIF,EAAM,KAAK,GACfZ,IAAIY,EAAM,KAAK,OACfG,IAAIH,EAAM,KAAK;AACrB,IAAI,CAAC,MAAMC,CAAC,KAAK,CAAC,MAAMb,CAAC,MACjBK,MAAS,WACTA,IAAOQ,IAAIb,IAAI,IAEnBK,IAAO,KAAK,IAAIA,GAAMQ,IAAIb,IAAI,CAAC,GAC/BM,IAAO,KAAK,IAAIA,GAAMO,IAAIb,IAAI,CAAC,IAE/B,CAAC,MAAMc,CAAC,KAAK,CAAC,MAAMC,CAAC,MACjBR,MAAS,WACTA,IAAOO,IAAIC,IAAI,IAEnBR,IAAO,KAAK,IAAIA,GAAMO,IAAIC,IAAI,CAAC,GAC/BP,IAAO,KAAK,IAAIA,GAAMM,IAAIC,IAAI,CAAC;AAAA,EAEvC;AACA,SAAA7F,EAAE,YAAW,EAAG,QAAQ,CAAC2D,MAAM;AAC3B,IAAA8B,EAAY9B,CAAC;AAAA,EACjB,CAAC,GACD3D,EAAE,YAAW,EAAG,QAAQ,CAACa,MAAM;AAC3B,IAAIA,KAAM,QAAgCA,EAAE,KAAK,eAAe,GAAG,KAC/D4E,EAAY5E,CAAC;AAAA,EAErB,CAAC,GACDsE,KAAQI,GACRF,KAAQG,GACRxF,EAAE,YAAW,EAAG,QAAQ,CAACwD,MAAS;AAC9B,IAAAA,EAAK,KAAK,KAAK2B,GACf3B,EAAK,KAAK,KAAK6B;AAAA,EACnB,CAAC,GACDrF,EAAE,YAAW,EAAG,QAAQ,CAAC2E,MAAS;AAC9B,QAAIf;AACJ,KAACA,IAAKe,EAAK,KAAK,YAAY,QAAQf,MAAO,UAAkBA,EAAG,QAAQ,CAACkC,MAAM;AAC3E,MAAAA,EAAE,KAAKX,GACPW,EAAE,KAAKT;AAAA,IACX,CAAC,GACGV,EAAK,KAAK,eAAe,GAAG,MAC5BA,EAAK,KAAK,KAAKQ,IAEfR,EAAK,KAAK,eAAe,GAAG,MAC5BA,EAAK,KAAK,KAAKU;AAAA,EAEvB,CAAC,GACM;AAAA,IACH,OAAOD,IAAOD,IAAOI;AAAA,IACrB,QAAQD,IAAOD,IAAOG;AAAA,EAC9B;AACA,GACMtC,IAAuB,CAAClD,MAAM;AAChC,EAAAA,EAAE,YAAW,EAAG,QAAQ,CAACa,MAAM;AAC3B,UAAMkF,IAAQ/F,EAAE,QAAQa,EAAE,MAAM,GAC1BmF,IAAQhG,EAAE,QAAQa,EAAE,MAAM;AAChC,QAAIoF,GACAC;AACJ,IAAKrF,EAAE,KAAK,UAMRoF,IAAKpF,EAAE,KAAK,OAAO,CAAC,GACpBqF,IAAKrF,EAAE,KAAK,OAAOA,EAAE,KAAK,OAAO,SAAS,CAAC,MAN3CA,EAAE,KAAK,SAAS,CAAA,GAChBoF,IAAK,EAAE,GAAGD,EAAM,KAAK,GAAG,GAAGA,EAAM,KAAK,EAAC,GACvCE,IAAK,EAAE,GAAGH,EAAM,KAAK,GAAG,GAAGA,EAAM,KAAK,EAAC,IAM3ClF,EAAE,KAAK,OAAO,QAAQsF,EAAcJ,EAAM,MAAME,CAAE,CAAC,GACnDpF,EAAE,KAAK,OAAO,KAAKsF,EAAcH,EAAM,MAAME,CAAE,CAAC;AAAA,EACpD,CAAC;AACL,GACMrD,KAAuB,CAAC7C,MAAM;AAChC,EAAAA,EAAE,YAAW,EAAG,QAAQ,CAAC2E,MAAS;AAC9B,QAAIA,EAAK,KAAK,eAAe,GAAG;AAI5B,eAHIA,EAAK,KAAK,aAAa,OAAOA,EAAK,KAAK,aAAa,SACrDA,EAAK,KAAK,SAASA,EAAK,KAAK,cAEzBA,EAAK,KAAK,UAAQ;AAAA,QACtB,KAAK;AACD,UAAAA,EAAK,KAAK,KAAKA,EAAK,KAAK,QAAQ,IAAIA,EAAK,KAAK;AAC/C;AAAA,QACJ,KAAK;AACD,UAAAA,EAAK,KAAK,KAAKA,EAAK,KAAK,QAAQ,IAAIA,EAAK,KAAK;AAC/C;AAAA,MACpB;AAAA,EAEI,CAAC;AACL,GACMxB,KAAgC,CAACnD,MAAM;AACzC,EAAAA,EAAE,YAAW,EAAG,QAAQ,CAAC2E,MAAS;AAC9B,QAAIf;AACJ,IAAIe,EAAK,KAAK,cACTf,IAAKe,EAAK,KAAK,YAAY,QAAQf,MAAO,UAAkBA,EAAG,QAAO;AAAA,EAE/E,CAAC;AACL,GACMjB,KAAoB,CAAC3C,MAAM;AAC7B,EAAAA,EAAE,YAAW,EAAG,QAAQ,CAAC2D,MAAM;AAC3B,QAAIC,GAAIsB,GAAIkB;AACZ,QAAK,GAAAxC,IAAK5D,EAAE,YAAY2D,EAAE,EAAE,OAAO,QAAQC,MAAO,WAAkBA,EAAG,QAAQ;AAC3E,YAAMJ,IAAOxD,EAAE,QAAQ2D,EAAE,EAAE,GACrB0C,IAAIrG,EAAE,QAAQwD,EAAK,KAAK,SAAS,GACjC8C,IAAItG,EAAE,QAAQwD,EAAK,KAAK,YAAY,GACpC,IAAIxD,EAAE,QAAQwD,EAAK,KAAK,aAAa0B,IAAK1B,EAAK,KAAK,gBAAgB,QAAQ0B,MAAO,SAAS,SAASA,EAAG,UAAU,CAAC,CAAC,GACpHqB,IAAIvG,EAAE,QAAQwD,EAAK,KAAK,cAAc4C,IAAK5C,EAAK,KAAK,iBAAiB,QAAQ4C,MAAO,SAAS,SAASA,EAAG,UAAU,CAAC,CAAC;AAC5H,MAAA5C,EAAK,KAAK,QAAQ,KAAK,KAAK+C,KAAM,OAAuB,SAASA,EAAE,KAAK,MAAM,KAAM,OAAuB,SAAS,EAAE,KAAK,EAAE,KAAK,IACnI/C,EAAK,KAAK,SAAS,KAAK,KAAK8C,KAAM,OAAuB,SAASA,EAAE,KAAK,MAAMD,KAAM,OAAuB,SAASA,EAAE,KAAK,EAAE,KAAK,IACpI7C,EAAK,KAAK,MAAM,KAAM,OAAuB,SAAS,EAAE,KAAK,MAAM,KAAKA,EAAK,KAAK,QAAQ,GAC1FA,EAAK,KAAK,MAAM6C,KAAM,OAAuB,SAASA,EAAE,KAAK,MAAM,KAAK7C,EAAK,KAAK,SAAS;AAAA,IAC/F;AAAA,EACJ,CAAC,GACDxD,EAAE,YAAW,EAAG,QAAQ,CAACuD,MAAM;AAC3B,IAAIA,EAAE,KAAK,UAAU,YACjBvD,EAAE,WAAWuD,EAAE,EAAE;AAAA,EAEzB,CAAC;AACL,GACMnC,KAAkB,CAACpB,MAAM;AAC3B,EAAAA,EAAE,YAAW,EAAG,QAAQ,CAACa,MAAM;AAC3B,QAAIA,EAAE,WAAWA,EAAE,QAAQ;AACvB,YAAM2C,IAAOxD,EAAE,QAAQa,EAAE,MAAM;AAC/B,MAAK2C,EAAK,KAAK,cACXA,EAAK,KAAK,YAAY,CAAA,IAE1BA,EAAK,KAAK,UAAU,KAAK3C,CAAC,GAC1Bb,EAAE,WAAWa,EAAE,EAAE;AAAA,IACrB;AAAA,EACJ,CAAC;AACL,GACM0B,KAAkB,CAACvC,MAAM;AAC3B,QAAMwG,IAASC,EAAiBzG,CAAC;AACjC,EAAAwG,KAAW,QAAqCA,EAAO,QAAQ,CAACE,MAAU;AACtE,QAAIC,IAAa;AACjB,IAAAD,KAAU,QAAoCA,EAAM,QAAQ,CAAC/C,GAAGiD,MAAM;AAClE,UAAIhD;AACJ,YAAMJ,IAAOxD,EAAE,QAAQ2D,CAAC;AACxB,MAAAH,EAAK,KAAK,QAAQoD,IAAID,IACrB/C,IAAKJ,EAAK,KAAK,eAAe,QAAQI,MAAO,UAAkBA,EAAG,QAAQ,CAACiD,MAAa;AACrF,QAAA7B,EAAahF,GAAG,YAAY;AAAA,UACxB,OAAO6G,EAAS,KAAK;AAAA,UACrB,QAAQA,EAAS,KAAK;AAAA,UACtB,MAAMrD,EAAK,KAAK;AAAA,UAChB,OAAOoD,IAAI,EAAED;AAAA,UACb,GAAGE;AAAA,QACvB,GAAmB,KAAK;AAAA,MACZ,CAAC,GACD,OAAOrD,EAAK,KAAK;AAAA,IACrB,CAAC;AAAA,EACL,CAAC;AACL,GACMd,KAAoB,CAAC1C,MAAM;AAC7B,EAAAA,EAAE,YAAW,EAAG,QAAQ,CAAC2D,MAAM;AAC3B,UAAMH,IAAOxD,EAAE,QAAQ2D,EAAE,EAAE;AAC3B,QAAIH,EAAK,KAAK,UAAU,YAAY;AAChC,YAAMsD,IAAW9G,EAAE,QAAQwD,EAAK,KAAK,EAAE,MAAM,GACvCmC,IAAImB,EAAS,KAAK,IAAIA,EAAS,KAAK,QAAQ,GAC5ClB,IAAIkB,EAAS,KAAK,GAClBC,IAAKvD,EAAK,KAAK,IAAImC,GACnBqB,IAAKF,EAAS,KAAK,SAAS;AAClC,MAAI9G,EAAE,QAAQwD,EAAK,KAAK,EAAE,EAAE,IACxBxD,EAAE,eAAewD,EAAK,KAAK,EAAE,IAAIA,EAAK,KAAK,EAAE,IAAI,IAGjDxD,EAAE,QAAQ;AAAA,QACN,IAAIwD,EAAK,KAAK,EAAE;AAAA,QAChB,QAAQA,EAAK,KAAK,EAAE;AAAA,QACpB,QAAQA,EAAK,KAAK,EAAE;AAAA,QACpB,MAAMA,EAAK,KAAK,EAAE;AAAA,MACtC,CAAiB,GAELxD,EAAE,WAAW2D,EAAE,EAAE,GACjBH,EAAK,KAAK,EAAE,KAAK,SAAS;AAAA,QACtB,EAAE,GAAGmC,IAAK,IAAIoB,IAAM,GAAG,GAAGnB,IAAIoB,EAAE;AAAA,QAChC,EAAE,GAAGrB,IAAK,IAAIoB,IAAM,GAAG,GAAGnB,IAAIoB,EAAE;AAAA,QAChC,EAAE,GAAApB,GAAG,GAAGD,IAAIoB,EAAE;AAAA,QACd,EAAE,GAAGpB,IAAK,IAAIoB,IAAM,GAAG,GAAGnB,IAAIoB,EAAE;AAAA,QAChC,EAAE,GAAGrB,IAAK,IAAIoB,IAAM,GAAG,GAAGnB,IAAIoB,EAAE;AAAA,MAChD,GACYxD,EAAK,KAAK,EAAE,KAAK,IAAIA,EAAK,KAAK,GAC/BA,EAAK,KAAK,EAAE,KAAK,IAAIA,EAAK,KAAK;AAAA,IACnC;AAAA,EACJ,CAAC;AACL,GACMgB,IAAoB,CAACyC,GAAKvB,MAAU;AACtC,QAAMd,IAAmB,CAAA;AACzB,SAAAc,KAAU,QAAoCA,EAAM,QAAQ,CAACb,MAAQ;AACjE,IAAIoC,EAAIpC,CAAG,MAAM,WAEjBD,EAAiBC,CAAG,IAAI,CAACoC,EAAIpC,CAAG;AAAA,EACpC,CAAC,GACMD;AACX,GACMP,IAAe,CAACqB,IAAQ,OAAO;AACjC,QAAMwB,IAAW,CAAA;AACjB,gBAAO,KAAKxB,CAAK,EAAE,QAAQ,CAACyB,MAAM;AAC9B,IAAAD,EAASC,EAAE,YAAW,CAAE,IAAIzB,EAAMyB,CAAC;AAAA,EACvC,CAAC,GACMD;AACX;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/algorithm/antv-dagre/nesting-graph.js

@@ -0,0 +1,80 @@
+import { addDummyNode as p, addBorderNode as b } from "./util.js";
+const T = (t) => {
+  const e = p(t, "root", {}, "_root"), o = B(t);
+  let d = Math.max(...Object.values(o));
+  Math.abs(d) === 1 / 0 && (d = 1);
+  const s = d - 1, r = 2 * s + 1;
+  t.getAllEdges().forEach((n) => {
+    n.data.minlen *= r;
+  });
+  const a = M(t) + 1;
+  return t.getRoots().forEach((n) => {
+    g(t, e, r, a, s, o, n.id);
+  }), {
+    nestingRoot: e,
+    nodeRankFactor: r
+  };
+}, g = (t, e, o, d, s, r, a) => {
+  const n = t.getChildren(a);
+  if (!(n != null && n.length)) {
+    a !== e && t.addEdge({
+      id: `e${Math.random()}`,
+      source: e,
+      target: a,
+      data: { weight: 0, minlen: o }
+    });
+    return;
+  }
+  const c = b(t, "_bt"), l = b(t, "_bb"), m = t.getNode(a);
+  t.setParent(c, a), m.data.borderTop = c, t.setParent(l, a), m.data.borderBottom = l, n == null || n.forEach((i) => {
+    g(t, e, o, d, s, r, i.id);
+    const u = i.data.borderTop ? i.data.borderTop : i.id, h = i.data.borderBottom ? i.data.borderBottom : i.id, E = i.data.borderTop ? d : 2 * d, f = u !== h ? 1 : s - r[a] + 1;
+    t.addEdge({
+      id: `e${Math.random()}`,
+      source: c,
+      target: u,
+      data: {
+        minlen: f,
+        weight: E,
+        nestingEdge: !0
+      }
+    }), t.addEdge({
+      id: `e${Math.random()}`,
+      source: h,
+      target: l,
+      data: {
+        minlen: f,
+        weight: E,
+        nestingEdge: !0
+      }
+    });
+  }), t.getParent(a) || t.addEdge({
+    id: `e${Math.random()}`,
+    source: e,
+    target: c,
+    data: {
+      weight: 0,
+      minlen: s + r[a]
+    }
+  });
+}, B = (t) => {
+  const e = {}, o = (d, s) => {
+    const r = t.getChildren(d);
+    r == null || r.forEach((a) => o(a.id, s + 1)), e[d] = s;
+  };
+  return t.getRoots().forEach((d) => o(d.id, 1)), e;
+}, M = (t) => {
+  let e = 0;
+  return t.getAllEdges().forEach((o) => {
+    e += o.data.weight;
+  }), e;
+}, w = (t, e) => {
+  e && t.removeNode(e), t.getAllEdges().forEach((o) => {
+    o.data.nestingEdge && t.removeEdge(o.id);
+  });
+};
+export {
+  w as cleanup,
+  T as run
+};
+//# sourceMappingURL=nesting-graph.js.map