@seed-ship/mcp-ui-solid 5.6.0 → 6.0.0

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

@@ -0,0 +1,426 @@
+import { run as run$2, undo as undo$2 } from "./acyclic.js";
+import { addBorderSegments } from "./add-border-segments.js";
+import { adjust, undo as undo$1 } from "./coordinate-system.js";
+import { DagreGraph } from "./graph.js";
+import { run as run$1, cleanup } from "./nesting-graph.js";
+import { run, undo } from "./normalize.js";
+import { order } from "./order/index.js";
+import { initDataOrder } from "./order/init-data-order.js";
+import { parentDummyChains } from "./parent-dummy-chains.js";
+import { position } from "./position/index.js";
+import { rank } from "./rank/index.js";
+import { asNonCompoundGraph, removeEmptyRanks, normalizeRanks, addDummyNode, buildLayerMatrix, intersectRect } from "./util.js";
+import isNil from "../../node_modules/@antv/util/esm/lodash/is-nil.js";
+const layout = (g, options) => {
+  const { edgeLabelSpace, keepNodeOrder, prevGraph, rankdir, ranksep } = options;
+  if (!keepNodeOrder && prevGraph) {
+    inheritOrder(g, prevGraph);
+  }
+  const layoutGraph = buildLayoutGraph(g);
+  if (!!edgeLabelSpace) {
+    options.ranksep = makeSpaceForEdgeLabels(layoutGraph, {
+      rankdir,
+      ranksep
+    });
+  }
+  let dimension;
+  try {
+    dimension = runLayout(layoutGraph, options);
+  } catch (e) {
+    if (e.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:\n", e);
+      return;
+    }
+    throw e;
+  }
+  updateInputGraph(g, layoutGraph);
+  return dimension;
+};
+const runLayout = (g, options) => {
+  const { ranker, rankdir = "tb", nodeOrder, keepNodeOrder, align, nodesep = 50, edgesep = 20, ranksep = 50 } = options;
+  removeSelfEdges(g);
+  run$2(g);
+  const { nestingRoot, nodeRankFactor } = run$1(g);
+  rank(asNonCompoundGraph(g), ranker);
+  injectEdgeLabelProxies(g);
+  removeEmptyRanks(g, nodeRankFactor);
+  cleanup(g, nestingRoot);
+  normalizeRanks(g);
+  assignRankMinMax(g);
+  removeEdgeLabelProxies(g);
+  const dummyChains = [];
+  run(g, dummyChains);
+  parentDummyChains(g, dummyChains);
+  addBorderSegments(g);
+  if (keepNodeOrder) {
+    initDataOrder(g, nodeOrder);
+  }
+  order(g, keepNodeOrder);
+  insertSelfEdges(g);
+  adjust(g, rankdir);
+  position(g, {
+    align,
+    nodesep,
+    edgesep,
+    ranksep
+  });
+  positionSelfEdges(g);
+  removeBorderNodes(g);
+  undo(g, dummyChains);
+  fixupEdgeLabelCoords(g);
+  undo$1(g, rankdir);
+  const { width, height } = translateGraph(g);
+  assignNodeIntersects(g);
+  reversePointsForReversedEdges(g);
+  undo$2(g);
+  return { width, height };
+};
+const inheritOrder = (currG, prevG) => {
+  currG.getAllNodes().forEach((n) => {
+    const node = currG.getNode(n.id);
+    if (prevG.hasNode(n.id)) {
+      const prevNode = prevG.getNode(n.id);
+      node.data.fixorder = prevNode.data._order;
+      delete prevNode.data._order;
+    } else {
+      delete node.data.fixorder;
+    }
+  });
+};
+const updateInputGraph = (inputGraph, layoutGraph) => {
+  inputGraph.getAllNodes().forEach((v) => {
+    var _a;
+    const inputLabel = inputGraph.getNode(v.id);
+    if (inputLabel) {
+      const layoutLabel = layoutGraph.getNode(v.id);
+      inputLabel.data.x = layoutLabel.data.x;
+      inputLabel.data.y = layoutLabel.data.y;
+      inputLabel.data._order = layoutLabel.data.order;
+      inputLabel.data._rank = layoutLabel.data.rank;
+      if ((_a = layoutGraph.getChildren(v.id)) === null || _a === void 0 ? void 0 : _a.length) {
+        inputLabel.data.width = layoutLabel.data.width;
+        inputLabel.data.height = layoutLabel.data.height;
+      }
+    }
+  });
+  inputGraph.getAllEdges().forEach((e) => {
+    const inputLabel = inputGraph.getEdge(e.id);
+    const layoutLabel = layoutGraph.getEdge(e.id);
+    inputLabel.data.points = layoutLabel ? layoutLabel.data.points : [];
+    if (layoutLabel && layoutLabel.data.hasOwnProperty("x")) {
+      inputLabel.data.x = layoutLabel.data.x;
+      inputLabel.data.y = layoutLabel.data.y;
+    }
+  });
+};
+const nodeNumAttrs = ["width", "height", "layer", "fixorder"];
+const nodeDefaults = { width: 0, height: 0 };
+const edgeNumAttrs = ["minlen", "weight", "width", "height", "labeloffset"];
+const edgeDefaults = {
+  minlen: 1,
+  weight: 1,
+  width: 0,
+  height: 0,
+  labeloffset: 10,
+  labelpos: "r"
+};
+const edgeAttrs = ["labelpos"];
+const buildLayoutGraph = (inputGraph) => {
+  const g = new DagreGraph({ tree: [] });
+  inputGraph.getAllNodes().forEach((v) => {
+    const node = canonicalize(inputGraph.getNode(v.id).data);
+    const defaultNode = Object.assign(Object.assign({}, nodeDefaults), node);
+    const defaultAttrs = selectNumberAttrs(defaultNode, nodeNumAttrs);
+    if (!g.hasNode(v.id)) {
+      g.addNode({
+        id: v.id,
+        data: Object.assign({}, defaultAttrs)
+      });
+    }
+    const parent = inputGraph.hasTreeStructure("combo") ? inputGraph.getParent(v.id, "combo") : inputGraph.getParent(v.id);
+    if (!isNil(parent)) {
+      if (!g.hasNode(parent.id)) {
+        g.addNode(Object.assign({}, parent));
+      }
+      g.setParent(v.id, parent.id);
+    }
+  });
+  inputGraph.getAllEdges().forEach((e) => {
+    const edge = canonicalize(inputGraph.getEdge(e.id).data);
+    const pickedProperties = {};
+    edgeAttrs === null || edgeAttrs === void 0 ? void 0 : edgeAttrs.forEach((key) => {
+      if (edge[key] !== void 0)
+        pickedProperties[key] = edge[key];
+    });
+    g.addEdge({
+      id: e.id,
+      source: e.source,
+      target: e.target,
+      data: Object.assign({}, edgeDefaults, selectNumberAttrs(edge, edgeNumAttrs), pickedProperties)
+    });
+  });
+  return g;
+};
+const makeSpaceForEdgeLabels = (g, options) => {
+  const { ranksep = 0, rankdir } = options;
+  g.getAllNodes().forEach((node) => {
+    if (!isNaN(node.data.layer)) {
+      if (!node.data.layer)
+        node.data.layer = 0;
+    }
+  });
+  g.getAllEdges().forEach((edge) => {
+    var _a;
+    edge.data.minlen *= 2;
+    if (((_a = edge.data.labelpos) === null || _a === void 0 ? void 0 : _a.toLowerCase()) !== "c") {
+      if (rankdir === "TB" || rankdir === "BT") {
+        edge.data.width += edge.data.labeloffset;
+      } else {
+        edge.data.height += edge.data.labeloffset;
+      }
+    }
+  });
+  return ranksep / 2;
+};
+const injectEdgeLabelProxies = (g) => {
+  g.getAllEdges().forEach((e) => {
+    if (e.data.width && e.data.height) {
+      const v = g.getNode(e.source);
+      const w = g.getNode(e.target);
+      const label = {
+        e,
+        rank: (w.data.rank - v.data.rank) / 2 + v.data.rank
+      };
+      addDummyNode(g, "edge-proxy", label, "_ep");
+    }
+  });
+};
+const assignRankMinMax = (g) => {
+  let maxRank = 0;
+  g.getAllNodes().forEach((node) => {
+    var _a, _b;
+    if (node.data.borderTop) {
+      node.data.minRank = (_a = g.getNode(node.data.borderTop)) === null || _a === void 0 ? void 0 : _a.data.rank;
+      node.data.maxRank = (_b = g.getNode(node.data.borderBottom)) === null || _b === void 0 ? void 0 : _b.data.rank;
+      maxRank = Math.max(maxRank, node.data.maxRank || -Infinity);
+    }
+  });
+  return maxRank;
+};
+const removeEdgeLabelProxies = (g) => {
+  g.getAllNodes().forEach((node) => {
+    if (node.data.dummy === "edge-proxy") {
+      g.getEdge(node.data.e.id).data.labelRank = node.data.rank;
+      g.removeNode(node.id);
+    }
+  });
+};
+const translateGraph = (g, options) => {
+  let minX;
+  let maxX = 0;
+  let minY;
+  let maxY = 0;
+  const { marginx: marginX = 0, marginy: marginY = 0 } = {};
+  const getExtremes = (attrs) => {
+    if (!attrs.data)
+      return;
+    const x = attrs.data.x;
+    const y = attrs.data.y;
+    const w = attrs.data.width;
+    const h = attrs.data.height;
+    if (!isNaN(x) && !isNaN(w)) {
+      if (minX === void 0) {
+        minX = x - w / 2;
+      }
+      minX = Math.min(minX, x - w / 2);
+      maxX = Math.max(maxX, x + w / 2);
+    }
+    if (!isNaN(y) && !isNaN(h)) {
+      if (minY === void 0) {
+        minY = y - h / 2;
+      }
+      minY = Math.min(minY, y - h / 2);
+      maxY = Math.max(maxY, y + h / 2);
+    }
+  };
+  g.getAllNodes().forEach((v) => {
+    getExtremes(v);
+  });
+  g.getAllEdges().forEach((e) => {
+    if (e === null || e === void 0 ? void 0 : e.data.hasOwnProperty("x")) {
+      getExtremes(e);
+    }
+  });
+  minX -= marginX;
+  minY -= marginY;
+  g.getAllNodes().forEach((node) => {
+    node.data.x -= minX;
+    node.data.y -= minY;
+  });
+  g.getAllEdges().forEach((edge) => {
+    var _a;
+    (_a = edge.data.points) === null || _a === void 0 ? void 0 : _a.forEach((p) => {
+      p.x -= minX;
+      p.y -= minY;
+    });
+    if (edge.data.hasOwnProperty("x")) {
+      edge.data.x -= minX;
+    }
+    if (edge.data.hasOwnProperty("y")) {
+      edge.data.y -= minY;
+    }
+  });
+  return {
+    width: maxX - minX + marginX,
+    height: maxY - minY + marginY
+  };
+};
+const assignNodeIntersects = (g) => {
+  g.getAllEdges().forEach((e) => {
+    const nodeV = g.getNode(e.source);
+    const nodeW = g.getNode(e.target);
+    let p1;
+    let p2;
+    if (!e.data.points) {
+      e.data.points = [];
+      p1 = { x: nodeW.data.x, y: nodeW.data.y };
+      p2 = { x: nodeV.data.x, y: nodeV.data.y };
+    } else {
+      p1 = e.data.points[0];
+      p2 = e.data.points[e.data.points.length - 1];
+    }
+    e.data.points.unshift(intersectRect(nodeV.data, p1));
+    e.data.points.push(intersectRect(nodeW.data, p2));
+  });
+};
+const fixupEdgeLabelCoords = (g) => {
+  g.getAllEdges().forEach((edge) => {
+    if (edge.data.hasOwnProperty("x")) {
+      if (edge.data.labelpos === "l" || edge.data.labelpos === "r") {
+        edge.data.width -= edge.data.labeloffset;
+      }
+      switch (edge.data.labelpos) {
+        case "l":
+          edge.data.x -= edge.data.width / 2 + edge.data.labeloffset;
+          break;
+        case "r":
+          edge.data.x += edge.data.width / 2 + edge.data.labeloffset;
+          break;
+      }
+    }
+  });
+};
+const reversePointsForReversedEdges = (g) => {
+  g.getAllEdges().forEach((edge) => {
+    var _a;
+    if (edge.data.reversed) {
+      (_a = edge.data.points) === null || _a === void 0 ? void 0 : _a.reverse();
+    }
+  });
+};
+const removeBorderNodes = (g) => {
+  g.getAllNodes().forEach((v) => {
+    var _a, _b, _c;
+    if ((_a = g.getChildren(v.id)) === null || _a === void 0 ? void 0 : _a.length) {
+      const node = g.getNode(v.id);
+      const t = g.getNode(node.data.borderTop);
+      const b = g.getNode(node.data.borderBottom);
+      const l = g.getNode(node.data.borderLeft[((_b = node.data.borderLeft) === null || _b === void 0 ? void 0 : _b.length) - 1]);
+      const r = g.getNode(node.data.borderRight[((_c = node.data.borderRight) === null || _c === void 0 ? void 0 : _c.length) - 1]);
+      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;
+      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;
+      node.data.x = ((l === null || l === void 0 ? void 0 : l.data.x) || 0) + node.data.width / 2;
+      node.data.y = ((t === null || t === void 0 ? void 0 : t.data.y) || 0) + node.data.height / 2;
+    }
+  });
+  g.getAllNodes().forEach((n) => {
+    if (n.data.dummy === "border") {
+      g.removeNode(n.id);
+    }
+  });
+};
+const removeSelfEdges = (g) => {
+  g.getAllEdges().forEach((e) => {
+    if (e.source === e.target) {
+      const node = g.getNode(e.source);
+      if (!node.data.selfEdges) {
+        node.data.selfEdges = [];
+      }
+      node.data.selfEdges.push(e);
+      g.removeEdge(e.id);
+    }
+  });
+};
+const insertSelfEdges = (g) => {
+  const layers = buildLayerMatrix(g);
+  layers === null || layers === void 0 ? void 0 : layers.forEach((layer) => {
+    let orderShift = 0;
+    layer === null || layer === void 0 ? void 0 : layer.forEach((v, i) => {
+      var _a;
+      const node = g.getNode(v);
+      node.data.order = i + orderShift;
+      (_a = node.data.selfEdges) === null || _a === void 0 ? void 0 : _a.forEach((selfEdge) => {
+        addDummyNode(g, "selfedge", {
+          width: selfEdge.data.width,
+          height: selfEdge.data.height,
+          rank: node.data.rank,
+          order: i + ++orderShift,
+          e: selfEdge
+        }, "_se");
+      });
+      delete node.data.selfEdges;
+    });
+  });
+};
+const positionSelfEdges = (g) => {
+  g.getAllNodes().forEach((v) => {
+    const node = g.getNode(v.id);
+    if (node.data.dummy === "selfedge") {
+      const selfNode = g.getNode(node.data.e.source);
+      const x = selfNode.data.x + selfNode.data.width / 2;
+      const y = selfNode.data.y;
+      const dx = node.data.x - x;
+      const dy = selfNode.data.height / 2;
+      if (g.hasEdge(node.data.e.id)) {
+        g.updateEdgeData(node.data.e.id, node.data.e.data);
+      } else {
+        g.addEdge({
+          id: node.data.e.id,
+          source: node.data.e.source,
+          target: node.data.e.target,
+          data: node.data.e.data
+        });
+      }
+      g.removeNode(v.id);
+      node.data.e.data.points = [
+        { x: x + 2 * dx / 3, y: y - dy },
+        { x: x + 5 * dx / 6, y: y - dy },
+        { y, x: x + dx },
+        { x: x + 5 * dx / 6, y: y + dy },
+        { x: x + 2 * dx / 3, y: y + dy }
+      ];
+      node.data.e.data.x = node.data.x;
+      node.data.e.data.y = node.data.y;
+    }
+  });
+};
+const selectNumberAttrs = (obj, attrs) => {
+  const pickedProperties = {};
+  attrs === null || attrs === void 0 ? void 0 : attrs.forEach((key) => {
+    if (obj[key] === void 0)
+      return;
+    pickedProperties[key] = +obj[key];
+  });
+  return pickedProperties;
+};
+const canonicalize = (attrs = {}) => {
+  const newAttrs = {};
+  Object.keys(attrs).forEach((k) => {
+    newAttrs[k.toLowerCase()] = attrs[k];
+  });
+  return newAttrs;
+};
+export {
+  layout
+};
+//# sourceMappingURL=layout.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"layout.js","sources":["../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/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":["run","run$2"],"mappings":";;;;;;;;;;;;;AAiBK,MAAC,SAAS,CAAC,GAAG,YAAY;AAC3B,QAAM,EAAE,gBAAgB,eAAe,WAAW,SAAS,QAAO,IAAK;AAEvE,MAAI,CAAC,iBAAiB,WAAW;AAC7B,iBAAa,GAAG,SAAS;AAAA,EAC7B;AACA,QAAM,cAAc,iBAAiB,CAAC;AAEtC,MAAI,CAAC,CAAC,gBAAgB;AAClB,YAAQ,UAAU,uBAAuB,aAAa;AAAA,MAClD;AAAA,MACA;AAAA,IACZ,CAAS;AAAA,EACL;AACA,MAAI;AAEJ,MAAI;AACA,gBAAY,UAAU,aAAa,OAAO;AAAA,EAC9C,SACO,GAAG;AACN,QAAI,EAAE,YAAY,6DAA6D;AAC3E,cAAQ,MAAM,qJAAqJ,CAAC;AACpK;AAAA,IACJ;AACA,UAAM;AAAA,EACV;AACA,mBAAiB,GAAG,WAAW;AAC/B,SAAO;AACX;AACA,MAAM,YAAY,CAAC,GAAG,YAAY;AAC9B,QAAM,EAAE,QAAQ,UAAU,MAAM,WAAW,eAAe,OAAO,UAAU,IAAI,UAAU,IAAI,UAAU,GAAE,IAAM;AAC/G,kBAAgB,CAAC;AACjBA,QAAI,CAAC;AACL,QAAM,EAAE,aAAa,mBAAmB,MAAM,CAAC;AAC/C,OAAK,mBAAmB,CAAC,GAAG,MAAM;AAClC,yBAAuB,CAAC;AACxB,mBAAiB,GAAG,cAAc;AAClC,UAAQ,GAAG,WAAW;AACtB,iBAAe,CAAC;AAChB,mBAAiB,CAAC;AAClB,yBAAuB,CAAC;AACxB,QAAM,cAAc,CAAA;AACpBC,MAAM,GAAG,WAAW;AACpB,oBAAkB,GAAG,WAAW;AAChC,oBAAkB,CAAC;AACnB,MAAI,eAAe;AACf,kBAAc,GAAG,SAAS;AAAA,EAC9B;AACA,QAAM,GAAG,aAAa;AACtB,kBAAgB,CAAC;AACjB,SAAO,GAAG,OAAO;AACjB,WAAS,GAAG;AAAA,IACR;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACR,CAAK;AACD,oBAAkB,CAAC;AACnB,oBAAkB,CAAC;AACnB,OAAK,GAAG,WAAW;AACnB,uBAAqB,CAAC;AACtB,SAAO,GAAG,OAAO;AACjB,QAAM,EAAE,OAAO,WAAW,eAAe,CAAC;AAC1C,uBAAqB,CAAC;AACtB,gCAA8B,CAAC;AAC/B,SAAO,CAAC;AACR,SAAO,EAAE,OAAO,OAAM;AAC1B;AAKA,MAAM,eAAe,CAAC,OAAO,UAAU;AACnC,QAAM,YAAW,EAAG,QAAQ,CAAC,MAAM;AAC/B,UAAM,OAAO,MAAM,QAAQ,EAAE,EAAE;AAC/B,QAAI,MAAM,QAAQ,EAAE,EAAE,GAAG;AACrB,YAAM,WAAW,MAAM,QAAQ,EAAE,EAAE;AACnC,WAAK,KAAK,WAAW,SAAS,KAAK;AACnC,aAAO,SAAS,KAAK;AAAA,IACzB,OACK;AACD,aAAO,KAAK,KAAK;AAAA,IACrB;AAAA,EACJ,CAAC;AACL;AAOA,MAAM,mBAAmB,CAAC,YAAY,gBAAgB;AAClD,aAAW,YAAW,EAAG,QAAQ,CAAC,MAAM;AACpC,QAAI;AACJ,UAAM,aAAa,WAAW,QAAQ,EAAE,EAAE;AAC1C,QAAI,YAAY;AACZ,YAAM,cAAc,YAAY,QAAQ,EAAE,EAAE;AAC5C,iBAAW,KAAK,IAAI,YAAY,KAAK;AACrC,iBAAW,KAAK,IAAI,YAAY,KAAK;AACrC,iBAAW,KAAK,SAAS,YAAY,KAAK;AAC1C,iBAAW,KAAK,QAAQ,YAAY,KAAK;AACzC,WAAK,KAAK,YAAY,YAAY,EAAE,EAAE,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,QAAQ;AACrF,mBAAW,KAAK,QAAQ,YAAY,KAAK;AACzC,mBAAW,KAAK,SAAS,YAAY,KAAK;AAAA,MAC9C;AAAA,IACJ;AAAA,EACJ,CAAC;AACD,aAAW,YAAW,EAAG,QAAQ,CAAC,MAAM;AACpC,UAAM,aAAa,WAAW,QAAQ,EAAE,EAAE;AAC1C,UAAM,cAAc,YAAY,QAAQ,EAAE,EAAE;AAC5C,eAAW,KAAK,SAAS,cAAc,YAAY,KAAK,SAAS,CAAA;AACjE,QAAI,eAAe,YAAY,KAAK,eAAe,GAAG,GAAG;AACrD,iBAAW,KAAK,IAAI,YAAY,KAAK;AACrC,iBAAW,KAAK,IAAI,YAAY,KAAK;AAAA,IACzC;AAAA,EACJ,CAAC;AAGL;AACA,MAAM,eAAe,CAAC,SAAS,UAAU,SAAS,UAAU;AAC5D,MAAM,eAAe,EAAE,OAAO,GAAG,QAAQ,EAAC;AAC1C,MAAM,eAAe,CAAC,UAAU,UAAU,SAAS,UAAU,aAAa;AAC1E,MAAM,eAAe;AAAA,EACjB,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,aAAa;AAAA,EACb,UAAU;AACd;AACA,MAAM,YAAY,CAAC,UAAU;AAO7B,MAAM,mBAAmB,CAAC,eAAe;AACrC,QAAM,IAAI,IAAI,WAAW,EAAE,MAAM,CAAA,EAAE,CAAE;AACrC,aAAW,YAAW,EAAG,QAAQ,CAAC,MAAM;AACpC,UAAM,OAAO,aAAa,WAAW,QAAQ,EAAE,EAAE,EAAE,IAAI;AACvD,UAAM,cAAc,OAAO,OAAO,OAAO,OAAO,CAAA,GAAI,YAAY,GAAG,IAAI;AACvE,UAAM,eAAe,kBAAkB,aAAa,YAAY;AAChE,QAAI,CAAC,EAAE,QAAQ,EAAE,EAAE,GAAG;AAClB,QAAE,QAAQ;AAAA,QACN,IAAI,EAAE;AAAA,QACN,MAAM,OAAO,OAAO,CAAA,GAAI,YAAY;AAAA,MACpD,CAAa;AAAA,IACL;AACA,UAAM,SAAS,WAAW,iBAAiB,OAAO,IAC5C,WAAW,UAAU,EAAE,IAAI,OAAO,IAClC,WAAW,UAAU,EAAE,EAAE;AAC/B,QAAI,CAAC,MAAM,MAAM,GAAG;AAChB,UAAI,CAAC,EAAE,QAAQ,OAAO,EAAE,GAAG;AACvB,UAAE,QAAQ,OAAO,OAAO,CAAA,GAAI,MAAM,CAAC;AAAA,MACvC;AACA,QAAE,UAAU,EAAE,IAAI,OAAO,EAAE;AAAA,IAC/B;AAAA,EACJ,CAAC;AACD,aAAW,YAAW,EAAG,QAAQ,CAAC,MAAM;AACpC,UAAM,OAAO,aAAa,WAAW,QAAQ,EAAE,EAAE,EAAE,IAAI;AACvD,UAAM,mBAAmB,CAAA;AACzB,kBAAc,QAAQ,cAAc,SAAS,SAAS,UAAU,QAAQ,CAAC,QAAQ;AAC7E,UAAI,KAAK,GAAG,MAAM;AACd,yBAAiB,GAAG,IAAI,KAAK,GAAG;AAAA,IACxC,CAAC;AACD,MAAE,QAAQ;AAAA,MACN,IAAI,EAAE;AAAA,MACN,QAAQ,EAAE;AAAA,MACV,QAAQ,EAAE;AAAA,MACV,MAAM,OAAO,OAAO,IAAI,cAAc,kBAAkB,MAAM,YAAY,GAAG,gBAAgB;AAAA,IACzG,CAAS;AAAA,EACL,CAAC;AACD,SAAO;AACX;AASA,MAAM,yBAAyB,CAAC,GAAG,YAAY;AAC3C,QAAM,EAAE,UAAU,GAAG,QAAO,IAAK;AACjC,IAAE,YAAW,EAAG,QAAQ,CAAC,SAAS;AAC9B,QAAI,CAAC,MAAM,KAAK,KAAK,KAAK,GAAG;AACzB,UAAI,CAAC,KAAK,KAAK;AACX,aAAK,KAAK,QAAQ;AAAA,IAC1B;AAAA,EACJ,CAAC;AACD,IAAE,YAAW,EAAG,QAAQ,CAAC,SAAS;AAC9B,QAAI;AACJ,SAAK,KAAK,UAAU;AACpB,UAAM,KAAK,KAAK,KAAK,cAAc,QAAQ,OAAO,SAAS,SAAS,GAAG,YAAW,OAAQ,KAAK;AAC3F,UAAI,YAAY,QAAQ,YAAY,MAAM;AACtC,aAAK,KAAK,SAAS,KAAK,KAAK;AAAA,MACjC,OACK;AACD,aAAK,KAAK,UAAU,KAAK,KAAK;AAAA,MAClC;AAAA,IACJ;AAAA,EACJ,CAAC;AACD,SAAO,UAAU;AACrB;AAOA,MAAM,yBAAyB,CAAC,MAAM;AAClC,IAAE,YAAW,EAAG,QAAQ,CAAC,MAAM;AAC3B,QAAI,EAAE,KAAK,SAAS,EAAE,KAAK,QAAQ;AAC/B,YAAM,IAAI,EAAE,QAAQ,EAAE,MAAM;AAC5B,YAAM,IAAI,EAAE,QAAQ,EAAE,MAAM;AAC5B,YAAM,QAAQ;AAAA,QACV;AAAA,QACA,OAAO,EAAE,KAAK,OAAO,EAAE,KAAK,QAAQ,IAAI,EAAE,KAAK;AAAA,MAC/D;AACY,mBAAa,GAAG,cAAc,OAAO,KAAK;AAAA,IAC9C;AAAA,EACJ,CAAC;AACL;AACA,MAAM,mBAAmB,CAAC,MAAM;AAC5B,MAAI,UAAU;AACd,IAAE,YAAW,EAAG,QAAQ,CAAC,SAAS;AAC9B,QAAI,IAAI;AACR,QAAI,KAAK,KAAK,WAAW;AACrB,WAAK,KAAK,WAAW,KAAK,EAAE,QAAQ,KAAK,KAAK,SAAS,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,KAAK;AACvG,WAAK,KAAK,WAAW,KAAK,EAAE,QAAQ,KAAK,KAAK,YAAY,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,KAAK;AAC1G,gBAAU,KAAK,IAAI,SAAS,KAAK,KAAK,WAAW,SAAS;AAAA,IAC9D;AAAA,EACJ,CAAC;AACD,SAAO;AACX;AACA,MAAM,yBAAyB,CAAC,MAAM;AAClC,IAAE,YAAW,EAAG,QAAQ,CAAC,SAAS;AAC9B,QAAI,KAAK,KAAK,UAAU,cAAc;AAClC,QAAE,QAAQ,KAAK,KAAK,EAAE,EAAE,EAAE,KAAK,YAAY,KAAK,KAAK;AACrD,QAAE,WAAW,KAAK,EAAE;AAAA,IACxB;AAAA,EACJ,CAAC;AACL;AACA,MAAM,iBAAiB,CAAC,GAAG,YAAY;AACnC,MAAI;AACJ,MAAI,OAAO;AACX,MAAI;AACJ,MAAI,OAAO;AACX,QAAM,EAAE,SAAS,UAAU,GAAG,SAAS,UAAU,EAAC,IAAK,CAAA;AACvD,QAAM,cAAc,CAAC,UAAU;AAC3B,QAAI,CAAC,MAAM;AACP;AACJ,UAAM,IAAI,MAAM,KAAK;AACrB,UAAM,IAAI,MAAM,KAAK;AACrB,UAAM,IAAI,MAAM,KAAK;AACrB,UAAM,IAAI,MAAM,KAAK;AACrB,QAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG;AACxB,UAAI,SAAS,QAAW;AACpB,eAAO,IAAI,IAAI;AAAA,MACnB;AACA,aAAO,KAAK,IAAI,MAAM,IAAI,IAAI,CAAC;AAC/B,aAAO,KAAK,IAAI,MAAM,IAAI,IAAI,CAAC;AAAA,IACnC;AACA,QAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG;AACxB,UAAI,SAAS,QAAW;AACpB,eAAO,IAAI,IAAI;AAAA,MACnB;AACA,aAAO,KAAK,IAAI,MAAM,IAAI,IAAI,CAAC;AAC/B,aAAO,KAAK,IAAI,MAAM,IAAI,IAAI,CAAC;AAAA,IACnC;AAAA,EACJ;AACA,IAAE,YAAW,EAAG,QAAQ,CAAC,MAAM;AAC3B,gBAAY,CAAC;AAAA,EACjB,CAAC;AACD,IAAE,YAAW,EAAG,QAAQ,CAAC,MAAM;AAC3B,QAAI,MAAM,QAAQ,MAAM,SAAS,SAAS,EAAE,KAAK,eAAe,GAAG,GAAG;AAClE,kBAAY,CAAC;AAAA,IACjB;AAAA,EACJ,CAAC;AACD,UAAQ;AACR,UAAQ;AACR,IAAE,YAAW,EAAG,QAAQ,CAAC,SAAS;AAC9B,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AAAA,EACnB,CAAC;AACD,IAAE,YAAW,EAAG,QAAQ,CAAC,SAAS;AAC9B,QAAI;AACJ,KAAC,KAAK,KAAK,KAAK,YAAY,QAAQ,OAAO,SAAS,SAAS,GAAG,QAAQ,CAAC,MAAM;AAC3E,QAAE,KAAK;AACP,QAAE,KAAK;AAAA,IACX,CAAC;AACD,QAAI,KAAK,KAAK,eAAe,GAAG,GAAG;AAC/B,WAAK,KAAK,KAAK;AAAA,IACnB;AACA,QAAI,KAAK,KAAK,eAAe,GAAG,GAAG;AAC/B,WAAK,KAAK,KAAK;AAAA,IACnB;AAAA,EACJ,CAAC;AACD,SAAO;AAAA,IACH,OAAO,OAAO,OAAO;AAAA,IACrB,QAAQ,OAAO,OAAO;AAAA,EAC9B;AACA;AACA,MAAM,uBAAuB,CAAC,MAAM;AAChC,IAAE,YAAW,EAAG,QAAQ,CAAC,MAAM;AAC3B,UAAM,QAAQ,EAAE,QAAQ,EAAE,MAAM;AAChC,UAAM,QAAQ,EAAE,QAAQ,EAAE,MAAM;AAChC,QAAI;AACJ,QAAI;AACJ,QAAI,CAAC,EAAE,KAAK,QAAQ;AAChB,QAAE,KAAK,SAAS,CAAA;AAChB,WAAK,EAAE,GAAG,MAAM,KAAK,GAAG,GAAG,MAAM,KAAK,EAAC;AACvC,WAAK,EAAE,GAAG,MAAM,KAAK,GAAG,GAAG,MAAM,KAAK,EAAC;AAAA,IAC3C,OACK;AACD,WAAK,EAAE,KAAK,OAAO,CAAC;AACpB,WAAK,EAAE,KAAK,OAAO,EAAE,KAAK,OAAO,SAAS,CAAC;AAAA,IAC/C;AACA,MAAE,KAAK,OAAO,QAAQ,cAAc,MAAM,MAAM,EAAE,CAAC;AACnD,MAAE,KAAK,OAAO,KAAK,cAAc,MAAM,MAAM,EAAE,CAAC;AAAA,EACpD,CAAC;AACL;AACA,MAAM,uBAAuB,CAAC,MAAM;AAChC,IAAE,YAAW,EAAG,QAAQ,CAAC,SAAS;AAC9B,QAAI,KAAK,KAAK,eAAe,GAAG,GAAG;AAC/B,UAAI,KAAK,KAAK,aAAa,OAAO,KAAK,KAAK,aAAa,KAAK;AAC1D,aAAK,KAAK,SAAS,KAAK,KAAK;AAAA,MACjC;AACA,cAAQ,KAAK,KAAK,UAAQ;AAAA,QACtB,KAAK;AACD,eAAK,KAAK,KAAK,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK;AAC/C;AAAA,QACJ,KAAK;AACD,eAAK,KAAK,KAAK,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK;AAC/C;AAAA,MACpB;AAAA,IACQ;AAAA,EACJ,CAAC;AACL;AACA,MAAM,gCAAgC,CAAC,MAAM;AACzC,IAAE,YAAW,EAAG,QAAQ,CAAC,SAAS;AAC9B,QAAI;AACJ,QAAI,KAAK,KAAK,UAAU;AACpB,OAAC,KAAK,KAAK,KAAK,YAAY,QAAQ,OAAO,SAAS,SAAS,GAAG,QAAO;AAAA,IAC3E;AAAA,EACJ,CAAC;AACL;AACA,MAAM,oBAAoB,CAAC,MAAM;AAC7B,IAAE,YAAW,EAAG,QAAQ,CAAC,MAAM;AAC3B,QAAI,IAAI,IAAI;AACZ,SAAK,KAAK,EAAE,YAAY,EAAE,EAAE,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,QAAQ;AAC3E,YAAM,OAAO,EAAE,QAAQ,EAAE,EAAE;AAC3B,YAAM,IAAI,EAAE,QAAQ,KAAK,KAAK,SAAS;AACvC,YAAM,IAAI,EAAE,QAAQ,KAAK,KAAK,YAAY;AAC1C,YAAM,IAAI,EAAE,QAAQ,KAAK,KAAK,aAAa,KAAK,KAAK,KAAK,gBAAgB,QAAQ,OAAO,SAAS,SAAS,GAAG,UAAU,CAAC,CAAC;AAC1H,YAAM,IAAI,EAAE,QAAQ,KAAK,KAAK,cAAc,KAAK,KAAK,KAAK,iBAAiB,QAAQ,OAAO,SAAS,SAAS,GAAG,UAAU,CAAC,CAAC;AAC5H,WAAK,KAAK,QAAQ,KAAK,KAAK,MAAM,QAAQ,MAAM,SAAS,SAAS,EAAE,KAAK,MAAM,MAAM,QAAQ,MAAM,SAAS,SAAS,EAAE,KAAK,EAAE,KAAK;AACnI,WAAK,KAAK,SAAS,KAAK,KAAK,MAAM,QAAQ,MAAM,SAAS,SAAS,EAAE,KAAK,MAAM,MAAM,QAAQ,MAAM,SAAS,SAAS,EAAE,KAAK,EAAE,KAAK;AACpI,WAAK,KAAK,MAAM,MAAM,QAAQ,MAAM,SAAS,SAAS,EAAE,KAAK,MAAM,KAAK,KAAK,KAAK,QAAQ;AAC1F,WAAK,KAAK,MAAM,MAAM,QAAQ,MAAM,SAAS,SAAS,EAAE,KAAK,MAAM,KAAK,KAAK,KAAK,SAAS;AAAA,IAC/F;AAAA,EACJ,CAAC;AACD,IAAE,YAAW,EAAG,QAAQ,CAAC,MAAM;AAC3B,QAAI,EAAE,KAAK,UAAU,UAAU;AAC3B,QAAE,WAAW,EAAE,EAAE;AAAA,IACrB;AAAA,EACJ,CAAC;AACL;AACA,MAAM,kBAAkB,CAAC,MAAM;AAC3B,IAAE,YAAW,EAAG,QAAQ,CAAC,MAAM;AAC3B,QAAI,EAAE,WAAW,EAAE,QAAQ;AACvB,YAAM,OAAO,EAAE,QAAQ,EAAE,MAAM;AAC/B,UAAI,CAAC,KAAK,KAAK,WAAW;AACtB,aAAK,KAAK,YAAY,CAAA;AAAA,MAC1B;AACA,WAAK,KAAK,UAAU,KAAK,CAAC;AAC1B,QAAE,WAAW,EAAE,EAAE;AAAA,IACrB;AAAA,EACJ,CAAC;AACL;AACA,MAAM,kBAAkB,CAAC,MAAM;AAC3B,QAAM,SAAS,iBAAiB,CAAC;AACjC,aAAW,QAAQ,WAAW,SAAS,SAAS,OAAO,QAAQ,CAAC,UAAU;AACtE,QAAI,aAAa;AACjB,cAAU,QAAQ,UAAU,SAAS,SAAS,MAAM,QAAQ,CAAC,GAAG,MAAM;AAClE,UAAI;AACJ,YAAM,OAAO,EAAE,QAAQ,CAAC;AACxB,WAAK,KAAK,QAAQ,IAAI;AACtB,OAAC,KAAK,KAAK,KAAK,eAAe,QAAQ,OAAO,SAAS,SAAS,GAAG,QAAQ,CAAC,aAAa;AACrF,qBAAa,GAAG,YAAY;AAAA,UACxB,OAAO,SAAS,KAAK;AAAA,UACrB,QAAQ,SAAS,KAAK;AAAA,UACtB,MAAM,KAAK,KAAK;AAAA,UAChB,OAAO,IAAI,EAAE;AAAA,UACb,GAAG;AAAA,QACvB,GAAmB,KAAK;AAAA,MACZ,CAAC;AACD,aAAO,KAAK,KAAK;AAAA,IACrB,CAAC;AAAA,EACL,CAAC;AACL;AACA,MAAM,oBAAoB,CAAC,MAAM;AAC7B,IAAE,YAAW,EAAG,QAAQ,CAAC,MAAM;AAC3B,UAAM,OAAO,EAAE,QAAQ,EAAE,EAAE;AAC3B,QAAI,KAAK,KAAK,UAAU,YAAY;AAChC,YAAM,WAAW,EAAE,QAAQ,KAAK,KAAK,EAAE,MAAM;AAC7C,YAAM,IAAI,SAAS,KAAK,IAAI,SAAS,KAAK,QAAQ;AAClD,YAAM,IAAI,SAAS,KAAK;AACxB,YAAM,KAAK,KAAK,KAAK,IAAI;AACzB,YAAM,KAAK,SAAS,KAAK,SAAS;AAClC,UAAI,EAAE,QAAQ,KAAK,KAAK,EAAE,EAAE,GAAG;AAC3B,UAAE,eAAe,KAAK,KAAK,EAAE,IAAI,KAAK,KAAK,EAAE,IAAI;AAAA,MACrD,OACK;AACD,UAAE,QAAQ;AAAA,UACN,IAAI,KAAK,KAAK,EAAE;AAAA,UAChB,QAAQ,KAAK,KAAK,EAAE;AAAA,UACpB,QAAQ,KAAK,KAAK,EAAE;AAAA,UACpB,MAAM,KAAK,KAAK,EAAE;AAAA,QACtC,CAAiB;AAAA,MACL;AACA,QAAE,WAAW,EAAE,EAAE;AACjB,WAAK,KAAK,EAAE,KAAK,SAAS;AAAA,QACtB,EAAE,GAAG,IAAK,IAAI,KAAM,GAAG,GAAG,IAAI,GAAE;AAAA,QAChC,EAAE,GAAG,IAAK,IAAI,KAAM,GAAG,GAAG,IAAI,GAAE;AAAA,QAChC,EAAE,GAAG,GAAG,IAAI,GAAE;AAAA,QACd,EAAE,GAAG,IAAK,IAAI,KAAM,GAAG,GAAG,IAAI,GAAE;AAAA,QAChC,EAAE,GAAG,IAAK,IAAI,KAAM,GAAG,GAAG,IAAI,GAAE;AAAA,MAChD;AACY,WAAK,KAAK,EAAE,KAAK,IAAI,KAAK,KAAK;AAC/B,WAAK,KAAK,EAAE,KAAK,IAAI,KAAK,KAAK;AAAA,IACnC;AAAA,EACJ,CAAC;AACL;AACA,MAAM,oBAAoB,CAAC,KAAK,UAAU;AACtC,QAAM,mBAAmB,CAAA;AACzB,YAAU,QAAQ,UAAU,SAAS,SAAS,MAAM,QAAQ,CAAC,QAAQ;AACjE,QAAI,IAAI,GAAG,MAAM;AACb;AACJ,qBAAiB,GAAG,IAAI,CAAC,IAAI,GAAG;AAAA,EACpC,CAAC;AACD,SAAO;AACX;AACA,MAAM,eAAe,CAAC,QAAQ,OAAO;AACjC,QAAM,WAAW,CAAA;AACjB,SAAO,KAAK,KAAK,EAAE,QAAQ,CAAC,MAAM;AAC9B,aAAS,EAAE,YAAW,CAAE,IAAI,MAAM,CAAC;AAAA,EACvC,CAAC;AACD,SAAO;AACX;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/algorithm/antv-dagre/nesting-graph.cjs

@@ -0,0 +1,113 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const util = require("./util.cjs");
+const run$1 = (g) => {
+  const root = util.addDummyNode(g, "root", {}, "_root");
+  const depths = treeDepths(g);
+  let maxDepth = Math.max(...Object.values(depths));
+  if (Math.abs(maxDepth) === Infinity) {
+    maxDepth = 1;
+  }
+  const height = maxDepth - 1;
+  const nodeSep = 2 * height + 1;
+  g.getAllEdges().forEach((e) => {
+    e.data.minlen *= nodeSep;
+  });
+  const weight = sumWeights(g) + 1;
+  g.getRoots().forEach((child) => {
+    dfs(g, root, nodeSep, weight, height, depths, child.id);
+  });
+  return {
+    nestingRoot: root,
+    nodeRankFactor: nodeSep
+  };
+};
+const dfs = (g, root, nodeSep, weight, height, depths, v) => {
+  const children = g.getChildren(v);
+  if (!(children === null || children === void 0 ? void 0 : children.length)) {
+    if (v !== root) {
+      g.addEdge({
+        id: `e${Math.random()}`,
+        source: root,
+        target: v,
+        data: { weight: 0, minlen: nodeSep }
+      });
+    }
+    return;
+  }
+  const top = util.addBorderNode(g, "_bt");
+  const bottom = util.addBorderNode(g, "_bb");
+  const label = g.getNode(v);
+  g.setParent(top, v);
+  label.data.borderTop = top;
+  g.setParent(bottom, v);
+  label.data.borderBottom = bottom;
+  children === null || children === void 0 ? void 0 : children.forEach((childNode) => {
+    dfs(g, root, nodeSep, weight, height, depths, childNode.id);
+    const childTop = childNode.data.borderTop ? childNode.data.borderTop : childNode.id;
+    const childBottom = childNode.data.borderBottom ? childNode.data.borderBottom : childNode.id;
+    const thisWeight = childNode.data.borderTop ? weight : 2 * weight;
+    const minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;
+    g.addEdge({
+      id: `e${Math.random()}`,
+      source: top,
+      target: childTop,
+      data: {
+        minlen,
+        weight: thisWeight,
+        nestingEdge: true
+      }
+    });
+    g.addEdge({
+      id: `e${Math.random()}`,
+      source: childBottom,
+      target: bottom,
+      data: {
+        minlen,
+        weight: thisWeight,
+        nestingEdge: true
+      }
+    });
+  });
+  if (!g.getParent(v)) {
+    g.addEdge({
+      id: `e${Math.random()}`,
+      source: root,
+      target: top,
+      data: {
+        weight: 0,
+        minlen: height + depths[v]
+      }
+    });
+  }
+};
+const treeDepths = (g) => {
+  const depths = {};
+  const dfs2 = (v, depth) => {
+    const children = g.getChildren(v);
+    children === null || children === void 0 ? void 0 : children.forEach((child) => dfs2(child.id, depth + 1));
+    depths[v] = depth;
+  };
+  g.getRoots().forEach((v) => dfs2(v.id, 1));
+  return depths;
+};
+const sumWeights = (g) => {
+  let result = 0;
+  g.getAllEdges().forEach((e) => {
+    result += e.data.weight;
+  });
+  return result;
+};
+const cleanup = (g, nestingRoot) => {
+  if (nestingRoot) {
+    g.removeNode(nestingRoot);
+  }
+  g.getAllEdges().forEach((e) => {
+    if (e.data.nestingEdge) {
+      g.removeEdge(e.id);
+    }
+  });
+};
+exports.cleanup = cleanup;
+exports.run = run$1;
+//# sourceMappingURL=nesting-graph.cjs.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/algorithm/antv-dagre/nesting-graph.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"nesting-graph.cjs","sources":["../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/algorithm/antv-dagre/nesting-graph.js"],"sourcesContent":["import { addDummyNode, addBorderNode } from './util.js';\n\n/*\n * A nesting graph creates dummy nodes for the tops and bottoms of subgraphs,\n * adds appropriate edges to ensure that all cluster nodes are placed between\n * these boundries, and ensures that the graph is connected.\n *\n * In addition we ensure, through the use of the minlen property, that nodes\n * and subgraph border nodes to not end up on the same rank.\n *\n * Preconditions:\n *\n *    1. Input graph is a DAG\n *    2. Nodes in the input graph has a minlen attribute\n *\n * Postconditions:\n *\n *    1. Input graph is connected.\n *    2. Dummy nodes are added for the tops and bottoms of subgraphs.\n *    3. The minlen attribute for nodes is adjusted to ensure nodes do not\n *       get placed on the same rank as subgraph border nodes.\n *\n * The nesting graph idea comes from Sander, \"Layout of Compound Directed\n * Graphs.\"\n */\nconst run$1 = (g) => {\n    const root = addDummyNode(g, 'root', {}, '_root');\n    const depths = treeDepths(g);\n    let maxDepth = Math.max(...Object.values(depths));\n    if (Math.abs(maxDepth) === Infinity) {\n        maxDepth = 1;\n    }\n    const height = maxDepth - 1; // Note: depths is an Object not an array\n    const nodeSep = 2 * height + 1;\n    // g.graph().nestingRoot = root;\n    // Multiply minlen by nodeSep to align nodes on non-border ranks.\n    g.getAllEdges().forEach((e) => {\n        e.data.minlen *= nodeSep;\n    });\n    // Calculate a weight that is sufficient to keep subgraphs vertically compact\n    const weight = sumWeights(g) + 1;\n    // Create border nodes and link them up\n    // g.children()?.forEach((child) => {\n    //   dfs(g, root, nodeSep, weight, height, depths, child);\n    // });\n    g.getRoots().forEach((child) => {\n        dfs(g, root, nodeSep, weight, height, depths, child.id);\n    });\n    // Save the multiplier for node layers for later removal of empty border\n    // layers.\n    // g.graph().nodeRankFactor = nodeSep;\n    return {\n        nestingRoot: root,\n        nodeRankFactor: nodeSep,\n    };\n};\nconst dfs = (g, root, nodeSep, weight, height, depths, v) => {\n    const children = g.getChildren(v);\n    if (!(children === null || children === void 0 ? void 0 : children.length)) {\n        if (v !== root) {\n            // g.setEdge(root, v, { weight: 0, minlen: nodeSep });\n            g.addEdge({\n                id: `e${Math.random()}`,\n                source: root,\n                target: v,\n                data: { weight: 0, minlen: nodeSep },\n            });\n        }\n        return;\n    }\n    const top = addBorderNode(g, '_bt');\n    const bottom = addBorderNode(g, '_bb');\n    const label = g.getNode(v);\n    g.setParent(top, v);\n    label.data.borderTop = top;\n    g.setParent(bottom, v);\n    label.data.borderBottom = bottom;\n    children === null || children === void 0 ? void 0 : children.forEach((childNode) => {\n        dfs(g, root, nodeSep, weight, height, depths, childNode.id);\n        const childTop = childNode.data.borderTop\n            ? childNode.data.borderTop\n            : childNode.id;\n        const childBottom = childNode.data.borderBottom\n            ? childNode.data.borderBottom\n            : childNode.id;\n        const thisWeight = childNode.data.borderTop ? weight : 2 * weight;\n        const minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;\n        g.addEdge({\n            id: `e${Math.random()}`,\n            source: top,\n            target: childTop,\n            data: {\n                minlen,\n                weight: thisWeight,\n                nestingEdge: true,\n            },\n        });\n        g.addEdge({\n            id: `e${Math.random()}`,\n            source: childBottom,\n            target: bottom,\n            data: {\n                minlen,\n                weight: thisWeight,\n                nestingEdge: true,\n            },\n        });\n    });\n    if (!g.getParent(v)) {\n        g.addEdge({\n            id: `e${Math.random()}`,\n            source: root,\n            target: top,\n            data: {\n                weight: 0,\n                minlen: height + depths[v],\n            },\n        });\n    }\n};\nconst treeDepths = (g) => {\n    const depths = {};\n    const dfs = (v, depth) => {\n        const children = g.getChildren(v);\n        children === null || children === void 0 ? void 0 : children.forEach((child) => dfs(child.id, depth + 1));\n        depths[v] = depth;\n    };\n    // g.children()?.forEach((v) => dfs(v, 1));\n    g.getRoots().forEach((v) => dfs(v.id, 1));\n    return depths;\n};\nconst sumWeights = (g) => {\n    let result = 0;\n    g.getAllEdges().forEach((e) => {\n        result += e.data.weight;\n    });\n    return result;\n};\nconst cleanup = (g, nestingRoot) => {\n    // const graphLabel = g.graph();\n    // graphLabel.nestingRoot && g.removeNode(graphLabel.nestingRoot);\n    // delete graphLabel.nestingRoot;\n    if (nestingRoot) {\n        g.removeNode(nestingRoot);\n    }\n    g.getAllEdges().forEach((e) => {\n        if (e.data.nestingEdge) {\n            g.removeEdge(e.id);\n        }\n    });\n};\n\nexport { cleanup, run$1 as run };\n//# sourceMappingURL=nesting-graph.js.map\n"],"names":["addDummyNode","addBorderNode","dfs"],"mappings":";;;AAyBK,MAAC,QAAQ,CAAC,MAAM;AACjB,QAAM,OAAOA,KAAAA,aAAa,GAAG,QAAQ,CAAA,GAAI,OAAO;AAChD,QAAM,SAAS,WAAW,CAAC;AAC3B,MAAI,WAAW,KAAK,IAAI,GAAG,OAAO,OAAO,MAAM,CAAC;AAChD,MAAI,KAAK,IAAI,QAAQ,MAAM,UAAU;AACjC,eAAW;AAAA,EACf;AACA,QAAM,SAAS,WAAW;AAC1B,QAAM,UAAU,IAAI,SAAS;AAG7B,IAAE,YAAW,EAAG,QAAQ,CAAC,MAAM;AAC3B,MAAE,KAAK,UAAU;AAAA,EACrB,CAAC;AAED,QAAM,SAAS,WAAW,CAAC,IAAI;AAK/B,IAAE,SAAQ,EAAG,QAAQ,CAAC,UAAU;AAC5B,QAAI,GAAG,MAAM,SAAS,QAAQ,QAAQ,QAAQ,MAAM,EAAE;AAAA,EAC1D,CAAC;AAID,SAAO;AAAA,IACH,aAAa;AAAA,IACb,gBAAgB;AAAA,EACxB;AACA;AACA,MAAM,MAAM,CAAC,GAAG,MAAM,SAAS,QAAQ,QAAQ,QAAQ,MAAM;AACzD,QAAM,WAAW,EAAE,YAAY,CAAC;AAChC,MAAI,EAAE,aAAa,QAAQ,aAAa,SAAS,SAAS,SAAS,SAAS;AACxE,QAAI,MAAM,MAAM;AAEZ,QAAE,QAAQ;AAAA,QACN,IAAI,IAAI,KAAK,OAAM,CAAE;AAAA,QACrB,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,MAAM,EAAE,QAAQ,GAAG,QAAQ,QAAO;AAAA,MAClD,CAAa;AAAA,IACL;AACA;AAAA,EACJ;AACA,QAAM,MAAMC,KAAAA,cAAc,GAAG,KAAK;AAClC,QAAM,SAASA,KAAAA,cAAc,GAAG,KAAK;AACrC,QAAM,QAAQ,EAAE,QAAQ,CAAC;AACzB,IAAE,UAAU,KAAK,CAAC;AAClB,QAAM,KAAK,YAAY;AACvB,IAAE,UAAU,QAAQ,CAAC;AACrB,QAAM,KAAK,eAAe;AAC1B,eAAa,QAAQ,aAAa,SAAS,SAAS,SAAS,QAAQ,CAAC,cAAc;AAChF,QAAI,GAAG,MAAM,SAAS,QAAQ,QAAQ,QAAQ,UAAU,EAAE;AAC1D,UAAM,WAAW,UAAU,KAAK,YAC1B,UAAU,KAAK,YACf,UAAU;AAChB,UAAM,cAAc,UAAU,KAAK,eAC7B,UAAU,KAAK,eACf,UAAU;AAChB,UAAM,aAAa,UAAU,KAAK,YAAY,SAAS,IAAI;AAC3D,UAAM,SAAS,aAAa,cAAc,IAAI,SAAS,OAAO,CAAC,IAAI;AACnE,MAAE,QAAQ;AAAA,MACN,IAAI,IAAI,KAAK,OAAM,CAAE;AAAA,MACrB,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,MAAM;AAAA,QACF;AAAA,QACA,QAAQ;AAAA,QACR,aAAa;AAAA,MAC7B;AAAA,IACA,CAAS;AACD,MAAE,QAAQ;AAAA,MACN,IAAI,IAAI,KAAK,OAAM,CAAE;AAAA,MACrB,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,MAAM;AAAA,QACF;AAAA,QACA,QAAQ;AAAA,QACR,aAAa;AAAA,MAC7B;AAAA,IACA,CAAS;AAAA,EACL,CAAC;AACD,MAAI,CAAC,EAAE,UAAU,CAAC,GAAG;AACjB,MAAE,QAAQ;AAAA,MACN,IAAI,IAAI,KAAK,OAAM,CAAE;AAAA,MACrB,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,MAAM;AAAA,QACF,QAAQ;AAAA,QACR,QAAQ,SAAS,OAAO,CAAC;AAAA,MACzC;AAAA,IACA,CAAS;AAAA,EACL;AACJ;AACA,MAAM,aAAa,CAAC,MAAM;AACtB,QAAM,SAAS,CAAA;AACf,QAAMC,OAAM,CAAC,GAAG,UAAU;AACtB,UAAM,WAAW,EAAE,YAAY,CAAC;AAChC,iBAAa,QAAQ,aAAa,SAAS,SAAS,SAAS,QAAQ,CAAC,UAAUA,KAAI,MAAM,IAAI,QAAQ,CAAC,CAAC;AACxG,WAAO,CAAC,IAAI;AAAA,EAChB;AAEA,IAAE,WAAW,QAAQ,CAAC,MAAMA,KAAI,EAAE,IAAI,CAAC,CAAC;AACxC,SAAO;AACX;AACA,MAAM,aAAa,CAAC,MAAM;AACtB,MAAI,SAAS;AACb,IAAE,YAAW,EAAG,QAAQ,CAAC,MAAM;AAC3B,cAAU,EAAE,KAAK;AAAA,EACrB,CAAC;AACD,SAAO;AACX;AACK,MAAC,UAAU,CAAC,GAAG,gBAAgB;AAIhC,MAAI,aAAa;AACb,MAAE,WAAW,WAAW;AAAA,EAC5B;AACA,IAAE,YAAW,EAAG,QAAQ,CAAC,MAAM;AAC3B,QAAI,EAAE,KAAK,aAAa;AACpB,QAAE,WAAW,EAAE,EAAE;AAAA,IACrB;AAAA,EACJ,CAAC;AACL;;;","x_google_ignoreList":[0]}