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

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

@@ -0,0 +1,330 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const graph = require("../graph.cjs");
+const util = require("../util.cjs");
+const findType1Conflicts = (g, layering) => {
+  const conflicts = {};
+  const visitLayer = (prevLayer, layer) => {
+    let k0 = 0;
+    let scanPos = 0;
+    const prevLayerLength = prevLayer.length;
+    const lastNode = layer === null || layer === void 0 ? void 0 : layer[(layer === null || layer === void 0 ? void 0 : layer.length) - 1];
+    layer === null || layer === void 0 ? void 0 : layer.forEach((v, i) => {
+      var _a;
+      const w = findOtherInnerSegmentNode(g, v);
+      const k1 = w ? g.getNode(w.id).data.order : prevLayerLength;
+      if (w || v === lastNode) {
+        (_a = layer.slice(scanPos, i + 1)) === null || _a === void 0 ? void 0 : _a.forEach((scanNode) => {
+          var _a2;
+          (_a2 = g.getPredecessors(scanNode)) === null || _a2 === void 0 ? void 0 : _a2.forEach((u) => {
+            var _a3;
+            const uLabel = g.getNode(u.id);
+            const uPos = uLabel.data.order;
+            if ((uPos < k0 || k1 < uPos) && !(uLabel.data.dummy && ((_a3 = g.getNode(scanNode)) === null || _a3 === void 0 ? void 0 : _a3.data.dummy))) {
+              addConflict(conflicts, u.id, scanNode);
+            }
+          });
+        });
+        scanPos = i + 1;
+        k0 = k1;
+      }
+    });
+    return layer;
+  };
+  if (layering === null || layering === void 0 ? void 0 : layering.length) {
+    layering.reduce(visitLayer);
+  }
+  return conflicts;
+};
+const findType2Conflicts = (g, layering) => {
+  const conflicts = {};
+  function scan(south, southPos, southEnd, prevNorthBorder, nextNorthBorder) {
+    var _a, _b;
+    let v;
+    for (let i = southPos; i < southEnd; i++) {
+      v = south[i];
+      if ((_a = g.getNode(v)) === null || _a === void 0 ? void 0 : _a.data.dummy) {
+        (_b = g.getPredecessors(v)) === null || _b === void 0 ? void 0 : _b.forEach((u) => {
+          const uNode = g.getNode(u.id);
+          if (uNode.data.dummy && (uNode.data.order < prevNorthBorder || uNode.data.order > nextNorthBorder)) {
+            addConflict(conflicts, u.id, v);
+          }
+        });
+      }
+    }
+  }
+  function getScannedKey(params) {
+    return JSON.stringify(params.slice(1));
+  }
+  function scanIfNeeded(params, scanCache) {
+    const cacheKey = getScannedKey(params);
+    if (scanCache.get(cacheKey))
+      return;
+    scan(...params);
+    scanCache.set(cacheKey, true);
+  }
+  const visitLayer = (north, south) => {
+    let prevNorthPos = -1;
+    let nextNorthPos;
+    let southPos = 0;
+    const scanned = /* @__PURE__ */ new Map();
+    south === null || south === void 0 ? void 0 : south.forEach((v, southLookahead) => {
+      var _a;
+      if (((_a = g.getNode(v)) === null || _a === void 0 ? void 0 : _a.data.dummy) === "border") {
+        const predecessors = g.getPredecessors(v) || [];
+        if (predecessors.length) {
+          nextNorthPos = g.getNode(predecessors[0].id).data.order;
+          scanIfNeeded([south, southPos, southLookahead, prevNorthPos, nextNorthPos], scanned);
+          southPos = southLookahead;
+          prevNorthPos = nextNorthPos;
+        }
+      }
+      scanIfNeeded([south, southPos, south.length, nextNorthPos, north.length], scanned);
+    });
+    return south;
+  };
+  if (layering === null || layering === void 0 ? void 0 : layering.length) {
+    layering.reduce(visitLayer);
+  }
+  return conflicts;
+};
+const findOtherInnerSegmentNode = (g, v) => {
+  var _a, _b;
+  if ((_a = g.getNode(v)) === null || _a === void 0 ? void 0 : _a.data.dummy) {
+    return (_b = g.getPredecessors(v)) === null || _b === void 0 ? void 0 : _b.find((u) => g.getNode(u.id).data.dummy);
+  }
+};
+const addConflict = (conflicts, v, w) => {
+  let vv = v;
+  let ww = w;
+  if (vv > ww) {
+    const tmp = vv;
+    vv = ww;
+    ww = tmp;
+  }
+  let conflictsV = conflicts[vv];
+  if (!conflictsV) {
+    conflicts[vv] = conflictsV = {};
+  }
+  conflictsV[ww] = true;
+};
+const hasConflict = (conflicts, v, w) => {
+  let vv = v;
+  let ww = w;
+  if (vv > ww) {
+    const tmp = v;
+    vv = ww;
+    ww = tmp;
+  }
+  return !!conflicts[vv];
+};
+const verticalAlignment = (g, layering, conflicts, neighborFn) => {
+  const root = {};
+  const align = {};
+  const pos = {};
+  layering === null || layering === void 0 ? void 0 : layering.forEach((layer) => {
+    layer === null || layer === void 0 ? void 0 : layer.forEach((v, order) => {
+      root[v] = v;
+      align[v] = v;
+      pos[v] = order;
+    });
+  });
+  layering === null || layering === void 0 ? void 0 : layering.forEach((layer) => {
+    let prevIdx = -1;
+    layer === null || layer === void 0 ? void 0 : layer.forEach((v) => {
+      let ws = neighborFn(v).map((n) => n.id);
+      if (ws.length) {
+        ws = ws.sort((a, b) => pos[a] - pos[b]);
+        const mp = (ws.length - 1) / 2;
+        for (let i = Math.floor(mp), il = Math.ceil(mp); i <= il; ++i) {
+          const w = ws[i];
+          if (align[v] === v && prevIdx < pos[w] && !hasConflict(conflicts, v, w)) {
+            align[w] = v;
+            align[v] = root[v] = root[w];
+            prevIdx = pos[w];
+          }
+        }
+      }
+    });
+  });
+  return { root, align };
+};
+const horizontalCompaction = (g, layering, root, align, nodesep, edgesep, reverseSep) => {
+  var _a;
+  const xs = {};
+  const blockG = buildBlockGraph(g, layering, root, nodesep, edgesep, reverseSep);
+  const borderType = reverseSep ? "borderLeft" : "borderRight";
+  const iterate = (setXsFunc, nextNodesFunc) => {
+    let stack = blockG.getAllNodes();
+    let elem = stack.pop();
+    const visited = {};
+    while (elem) {
+      if (visited[elem.id]) {
+        setXsFunc(elem.id);
+      } else {
+        visited[elem.id] = true;
+        stack.push(elem);
+        stack = stack.concat(nextNodesFunc(elem.id));
+      }
+      elem = stack.pop();
+    }
+  };
+  const pass1 = (elem) => {
+    xs[elem] = (blockG.getRelatedEdges(elem, "in") || []).reduce((acc, e) => {
+      return Math.max(acc, (xs[e.source] || 0) + e.data.weight);
+    }, 0);
+  };
+  const pass2 = (elem) => {
+    const min = (blockG.getRelatedEdges(elem, "out") || []).reduce((acc, e) => {
+      return Math.min(acc, (xs[e.target] || 0) - e.data.weight);
+    }, Number.POSITIVE_INFINITY);
+    const node = g.getNode(elem);
+    if (min !== Number.POSITIVE_INFINITY && node.data.borderType !== borderType) {
+      xs[elem] = Math.max(xs[elem], min);
+    }
+  };
+  iterate(pass1, blockG.getPredecessors.bind(blockG));
+  iterate(pass2, blockG.getSuccessors.bind(blockG));
+  (_a = Object.values(align)) === null || _a === void 0 ? void 0 : _a.forEach((v) => {
+    xs[v] = xs[root[v]];
+  });
+  return xs;
+};
+const buildBlockGraph = (g, layering, root, nodesep, edgesep, reverseSep) => {
+  const blockGraph = new graph.DagreGraph();
+  const sepFn = sep(nodesep, edgesep, reverseSep);
+  layering === null || layering === void 0 ? void 0 : layering.forEach((layer) => {
+    let u;
+    layer === null || layer === void 0 ? void 0 : layer.forEach((v) => {
+      const vRoot = root[v];
+      if (!blockGraph.hasNode(vRoot)) {
+        blockGraph.addNode({
+          id: vRoot,
+          data: {}
+        });
+      }
+      if (u) {
+        const uRoot = root[u];
+        const edge = blockGraph.getRelatedEdges(uRoot, "out").find((edge2) => edge2.target === vRoot);
+        if (!edge) {
+          blockGraph.addEdge({
+            id: `e${Math.random()}`,
+            source: uRoot,
+            target: vRoot,
+            data: {
+              weight: Math.max(sepFn(g, v, u), 0)
+            }
+          });
+        } else {
+          blockGraph.updateEdgeData(edge.id, Object.assign(Object.assign({}, edge.data), { weight: Math.max(sepFn(g, v, u), edge.data.weight || 0) }));
+        }
+      }
+      u = v;
+    });
+  });
+  return blockGraph;
+};
+const findSmallestWidthAlignment = (g, xss) => {
+  return util.minBy(Object.values(xss), (xs) => {
+    var _a;
+    let max = Number.NEGATIVE_INFINITY;
+    let min = Number.POSITIVE_INFINITY;
+    (_a = Object.keys(xs)) === null || _a === void 0 ? void 0 : _a.forEach((v) => {
+      const x = xs[v];
+      const halfWidth = width(g, v) / 2;
+      max = Math.max(x + halfWidth, max);
+      min = Math.min(x - halfWidth, min);
+    });
+    return max - min;
+  });
+};
+function alignCoordinates(xss, alignTo) {
+  const alignToVals = Object.values(alignTo);
+  const alignToMin = Math.min(...alignToVals);
+  const alignToMax = Math.max(...alignToVals);
+  ["u", "d"].forEach((vert) => {
+    ["l", "r"].forEach((horiz) => {
+      const alignment = vert + horiz;
+      const xs = xss[alignment];
+      let delta;
+      if (xs === alignTo)
+        return;
+      const xsVals = Object.values(xs);
+      delta = horiz === "l" ? alignToMin - Math.min(...xsVals) : alignToMax - Math.max(...xsVals);
+      if (delta) {
+        xss[alignment] = {};
+        Object.keys(xs).forEach((key) => {
+          xss[alignment][key] = xs[key] + delta;
+        });
+      }
+    });
+  });
+}
+const balance = (xss, align) => {
+  const result = {};
+  Object.keys(xss.ul).forEach((key) => {
+    if (align) {
+      result[key] = xss[align.toLowerCase()][key];
+    } else {
+      const values = Object.values(xss).map((x) => x[key]);
+      result[key] = (values[0] + values[1]) / 2;
+    }
+  });
+  return result;
+};
+const sep = (nodeSep, edgeSep, reverseSep) => {
+  return (g, v, w) => {
+    const vLabel = g.getNode(v);
+    const wLabel = g.getNode(w);
+    let sum = 0;
+    let delta = 0;
+    sum += vLabel.data.width / 2;
+    if (vLabel.data.hasOwnProperty("labelpos")) {
+      switch ((vLabel.data.labelpos || "").toLowerCase()) {
+        case "l":
+          delta = -vLabel.data.width / 2;
+          break;
+        case "r":
+          delta = vLabel.data.width / 2;
+          break;
+      }
+    }
+    if (delta) {
+      sum += reverseSep ? delta : -delta;
+    }
+    delta = 0;
+    sum += (vLabel.data.dummy ? edgeSep : nodeSep) / 2;
+    sum += (wLabel.data.dummy ? edgeSep : nodeSep) / 2;
+    sum += wLabel.data.width / 2;
+    if (wLabel.data.labelpos) {
+      switch ((wLabel.data.labelpos || "").toLowerCase()) {
+        case "l":
+          delta = wLabel.data.width / 2;
+          break;
+        case "r":
+          delta = -wLabel.data.width / 2;
+          break;
+      }
+    }
+    if (delta) {
+      sum += reverseSep ? delta : -delta;
+    }
+    delta = 0;
+    return sum;
+  };
+};
+const width = (g, v) => g.getNode(v).data.width || 0;
+exports.addConflict = addConflict;
+exports.alignCoordinates = alignCoordinates;
+exports.balance = balance;
+exports.buildBlockGraph = buildBlockGraph;
+exports.findOtherInnerSegmentNode = findOtherInnerSegmentNode;
+exports.findSmallestWidthAlignment = findSmallestWidthAlignment;
+exports.findType1Conflicts = findType1Conflicts;
+exports.findType2Conflicts = findType2Conflicts;
+exports.hasConflict = hasConflict;
+exports.horizontalCompaction = horizontalCompaction;
+exports.sep = sep;
+exports.verticalAlignment = verticalAlignment;
+exports.width = width;
+//# sourceMappingURL=bk.cjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"bk.cjs","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/algorithm/antv-dagre/position/bk.js"],"sourcesContent":["import { DagreGraph } from '../graph.js';\nimport { minBy } from '../util.js';\n\nconst findType1Conflicts = (g, layering) => {\n    const conflicts = {};\n    const visitLayer = (prevLayer, layer) => {\n        // last visited node in the previous layer that is incident on an inner\n        // segment.\n        let k0 = 0;\n        // Tracks the last node in this layer scanned for crossings with a type-1\n        // segment.\n        let scanPos = 0;\n        const prevLayerLength = prevLayer.length;\n        const lastNode = layer === null || layer === void 0 ? void 0 : layer[(layer === null || layer === void 0 ? void 0 : layer.length) - 1];\n        layer === null || layer === void 0 ? void 0 : layer.forEach((v, i) => {\n            var _a;\n            const w = findOtherInnerSegmentNode(g, v);\n            const k1 = w ? g.getNode(w.id).data.order : prevLayerLength;\n            if (w || v === lastNode) {\n                (_a = layer.slice(scanPos, i + 1)) === null || _a === void 0 ? void 0 : _a.forEach((scanNode) => {\n                    var _a;\n                    (_a = g.getPredecessors(scanNode)) === null || _a === void 0 ? void 0 : _a.forEach((u) => {\n                        var _a;\n                        const uLabel = g.getNode(u.id);\n                        const uPos = uLabel.data.order;\n                        if ((uPos < k0 || k1 < uPos) &&\n                            !(uLabel.data.dummy && ((_a = g.getNode(scanNode)) === null || _a === void 0 ? void 0 : _a.data.dummy))) {\n                            addConflict(conflicts, u.id, scanNode);\n                        }\n                    });\n                });\n                scanPos = i + 1;\n                k0 = k1;\n            }\n        });\n        return layer;\n    };\n    if (layering === null || layering === void 0 ? void 0 : layering.length) {\n        layering.reduce(visitLayer);\n    }\n    return conflicts;\n};\nconst findType2Conflicts = (g, layering) => {\n    const conflicts = {};\n    function scan(south, southPos, southEnd, prevNorthBorder, nextNorthBorder) {\n        var _a, _b;\n        let v;\n        for (let i = southPos; i < southEnd; i++) {\n            v = south[i];\n            if ((_a = g.getNode(v)) === null || _a === void 0 ? void 0 : _a.data.dummy) {\n                (_b = g.getPredecessors(v)) === null || _b === void 0 ? void 0 : _b.forEach((u) => {\n                    const uNode = g.getNode(u.id);\n                    if (uNode.data.dummy &&\n                        (uNode.data.order < prevNorthBorder ||\n                            uNode.data.order > nextNorthBorder)) {\n                        addConflict(conflicts, u.id, v);\n                    }\n                });\n            }\n        }\n    }\n    function getScannedKey(params) {\n        // south数组可能很大，不适合做key\n        return JSON.stringify(params.slice(1));\n    }\n    function scanIfNeeded(params, scanCache) {\n        const cacheKey = getScannedKey(params);\n        if (scanCache.get(cacheKey))\n            return;\n        scan(...params);\n        scanCache.set(cacheKey, true);\n    }\n    const visitLayer = (north, south) => {\n        let prevNorthPos = -1;\n        let nextNorthPos;\n        let southPos = 0;\n        const scanned = new Map();\n        south === null || south === void 0 ? void 0 : south.forEach((v, southLookahead) => {\n            var _a;\n            if (((_a = g.getNode(v)) === null || _a === void 0 ? void 0 : _a.data.dummy) === 'border') {\n                const predecessors = g.getPredecessors(v) || [];\n                if (predecessors.length) {\n                    nextNorthPos = g.getNode(predecessors[0].id).data.order;\n                    scanIfNeeded([south, southPos, southLookahead, prevNorthPos, nextNorthPos], scanned);\n                    southPos = southLookahead;\n                    prevNorthPos = nextNorthPos;\n                }\n            }\n            scanIfNeeded([south, southPos, south.length, nextNorthPos, north.length], scanned);\n        });\n        return south;\n    };\n    if (layering === null || layering === void 0 ? void 0 : layering.length) {\n        layering.reduce(visitLayer);\n    }\n    return conflicts;\n};\nconst findOtherInnerSegmentNode = (g, v) => {\n    var _a, _b;\n    if ((_a = g.getNode(v)) === null || _a === void 0 ? void 0 : _a.data.dummy) {\n        return (_b = g.getPredecessors(v)) === null || _b === void 0 ? void 0 : _b.find((u) => g.getNode(u.id).data.dummy);\n    }\n};\nconst addConflict = (conflicts, v, w) => {\n    let vv = v;\n    let ww = w;\n    if (vv > ww) {\n        const tmp = vv;\n        vv = ww;\n        ww = tmp;\n    }\n    let conflictsV = conflicts[vv];\n    if (!conflictsV) {\n        conflicts[vv] = conflictsV = {};\n    }\n    conflictsV[ww] = true;\n};\nconst hasConflict = (conflicts, v, w) => {\n    let vv = v;\n    let ww = w;\n    if (vv > ww) {\n        const tmp = v;\n        vv = ww;\n        ww = tmp;\n    }\n    return !!conflicts[vv];\n};\n/*\n * Try to align nodes into vertical \"blocks\" where possible. This algorithm\n * attempts to align a node with one of its median neighbors. If the edge\n * connecting a neighbor is a type-1 conflict then we ignore that possibility.\n * If a previous node has already formed a block with a node after the node\n * we're trying to form a block with, we also ignore that possibility - our\n * blocks would be split in that scenario.\n */\nconst verticalAlignment = (g, layering, conflicts, neighborFn) => {\n    const root = {};\n    const align = {};\n    const pos = {};\n    // We cache the position here based on the layering because the graph and\n    // layering may be out of sync. The layering matrix is manipulated to\n    // generate different extreme alignments.\n    layering === null || layering === void 0 ? void 0 : layering.forEach((layer) => {\n        layer === null || layer === void 0 ? void 0 : layer.forEach((v, order) => {\n            root[v] = v;\n            align[v] = v;\n            pos[v] = order;\n        });\n    });\n    layering === null || layering === void 0 ? void 0 : layering.forEach((layer) => {\n        let prevIdx = -1;\n        layer === null || layer === void 0 ? void 0 : layer.forEach((v) => {\n            let ws = neighborFn(v).map((n) => n.id);\n            if (ws.length) {\n                ws = ws.sort((a, b) => pos[a] - pos[b]);\n                const mp = (ws.length - 1) / 2;\n                for (let i = Math.floor(mp), il = Math.ceil(mp); i <= il; ++i) {\n                    const w = ws[i];\n                    if (align[v] === v &&\n                        prevIdx < pos[w] &&\n                        !hasConflict(conflicts, v, w)) {\n                        align[w] = v;\n                        align[v] = root[v] = root[w];\n                        prevIdx = pos[w];\n                    }\n                }\n            }\n        });\n    });\n    return { root, align };\n};\nconst horizontalCompaction = (g, layering, root, align, nodesep, edgesep, reverseSep) => {\n    var _a;\n    // This portion of the algorithm differs from BK due to a number of problems.\n    // Instead of their algorithm we construct a new block graph and do two\n    // sweeps. The first sweep places blocks with the smallest possible\n    // coordinates. The second sweep removes unused space by moving blocks to the\n    // greatest coordinates without violating separation.\n    const xs = {};\n    const blockG = buildBlockGraph(g, layering, root, nodesep, edgesep, reverseSep);\n    const borderType = reverseSep ? 'borderLeft' : 'borderRight';\n    const iterate = (setXsFunc, nextNodesFunc) => {\n        let stack = blockG.getAllNodes();\n        let elem = stack.pop();\n        const visited = {};\n        while (elem) {\n            if (visited[elem.id]) {\n                setXsFunc(elem.id);\n            }\n            else {\n                visited[elem.id] = true;\n                stack.push(elem);\n                stack = stack.concat(nextNodesFunc(elem.id));\n            }\n            elem = stack.pop();\n        }\n    };\n    // First pass, assign smallest coordinates\n    const pass1 = (elem) => {\n        xs[elem] = (blockG.getRelatedEdges(elem, 'in') || []).reduce((acc, e) => {\n            return Math.max(acc, (xs[e.source] || 0) + e.data.weight);\n        }, 0);\n    };\n    // Second pass, assign greatest coordinates\n    const pass2 = (elem) => {\n        const min = (blockG.getRelatedEdges(elem, 'out') || []).reduce((acc, e) => {\n            return Math.min(acc, (xs[e.target] || 0) - e.data.weight);\n        }, Number.POSITIVE_INFINITY);\n        const node = g.getNode(elem);\n        if (min !== Number.POSITIVE_INFINITY &&\n            node.data.borderType !== borderType) {\n            xs[elem] = Math.max(xs[elem], min);\n        }\n    };\n    iterate(pass1, blockG.getPredecessors.bind(blockG));\n    iterate(pass2, blockG.getSuccessors.bind(blockG));\n    // Assign x coordinates to all nodes\n    (_a = Object.values(align)) === null || _a === void 0 ? void 0 : _a.forEach((v) => {\n        xs[v] = xs[root[v]];\n    });\n    return xs;\n};\nconst buildBlockGraph = (g, layering, root, nodesep, edgesep, reverseSep) => {\n    const blockGraph = new DagreGraph();\n    const sepFn = sep(nodesep, edgesep, reverseSep);\n    layering === null || layering === void 0 ? void 0 : layering.forEach((layer) => {\n        let u;\n        layer === null || layer === void 0 ? void 0 : layer.forEach((v) => {\n            const vRoot = root[v];\n            if (!blockGraph.hasNode(vRoot)) {\n                blockGraph.addNode({\n                    id: vRoot,\n                    data: {},\n                });\n            }\n            if (u) {\n                const uRoot = root[u];\n                const edge = blockGraph\n                    .getRelatedEdges(uRoot, 'out')\n                    .find((edge) => edge.target === vRoot);\n                if (!edge) {\n                    blockGraph.addEdge({\n                        id: `e${Math.random()}`,\n                        source: uRoot,\n                        target: vRoot,\n                        data: {\n                            weight: Math.max(sepFn(g, v, u), 0),\n                        },\n                    });\n                }\n                else {\n                    blockGraph.updateEdgeData(edge.id, Object.assign(Object.assign({}, edge.data), { weight: Math.max(sepFn(g, v, u), edge.data.weight || 0) }));\n                }\n            }\n            u = v;\n        });\n    });\n    return blockGraph;\n};\n/*\n * Returns the alignment that has the smallest width of the given alignments.\n */\nconst findSmallestWidthAlignment = (g, xss) => {\n    return minBy(Object.values(xss), (xs) => {\n        var _a;\n        let max = Number.NEGATIVE_INFINITY;\n        let min = Number.POSITIVE_INFINITY;\n        (_a = Object.keys(xs)) === null || _a === void 0 ? void 0 : _a.forEach((v) => {\n            const x = xs[v];\n            const halfWidth = width(g, v) / 2;\n            max = Math.max(x + halfWidth, max);\n            min = Math.min(x - halfWidth, min);\n        });\n        return max - min;\n    });\n};\n/*\n * Align the coordinates of each of the layout alignments such that\n * left-biased alignments have their minimum coordinate at the same point as\n * the minimum coordinate of the smallest width alignment and right-biased\n * alignments have their maximum coordinate at the same point as the maximum\n * coordinate of the smallest width alignment.\n */\nfunction alignCoordinates(xss, alignTo) {\n    const alignToVals = Object.values(alignTo);\n    const alignToMin = Math.min(...alignToVals);\n    const alignToMax = Math.max(...alignToVals);\n    ['u', 'd'].forEach((vert) => {\n        ['l', 'r'].forEach((horiz) => {\n            const alignment = vert + horiz;\n            const xs = xss[alignment];\n            let delta;\n            if (xs === alignTo)\n                return;\n            const xsVals = Object.values(xs);\n            delta =\n                horiz === 'l'\n                    ? alignToMin - Math.min(...xsVals)\n                    : alignToMax - Math.max(...xsVals);\n            if (delta) {\n                xss[alignment] = {};\n                Object.keys(xs).forEach((key) => {\n                    xss[alignment][key] = xs[key] + delta;\n                });\n            }\n        });\n    });\n}\nconst balance = (xss, align) => {\n    const result = {};\n    Object.keys(xss.ul).forEach((key) => {\n        if (align) {\n            result[key] = xss[align.toLowerCase()][key];\n        }\n        else {\n            const values = Object.values(xss).map((x) => x[key]);\n            result[key] = (values[0] + values[1]) / 2; // (ur + ul) / 2\n        }\n    });\n    return result;\n};\nconst sep = (nodeSep, edgeSep, reverseSep) => {\n    return (g, v, w) => {\n        const vLabel = g.getNode(v);\n        const wLabel = g.getNode(w);\n        let sum = 0;\n        let delta = 0;\n        sum += vLabel.data.width / 2;\n        if (vLabel.data.hasOwnProperty('labelpos')) {\n            switch ((vLabel.data.labelpos || '').toLowerCase()) {\n                case 'l':\n                    delta = -vLabel.data.width / 2;\n                    break;\n                case 'r':\n                    delta = vLabel.data.width / 2;\n                    break;\n            }\n        }\n        if (delta) {\n            sum += reverseSep ? delta : -delta;\n        }\n        delta = 0;\n        sum += (vLabel.data.dummy ? edgeSep : nodeSep) / 2;\n        sum += (wLabel.data.dummy ? edgeSep : nodeSep) / 2;\n        sum += wLabel.data.width / 2;\n        if (wLabel.data.labelpos) {\n            switch ((wLabel.data.labelpos || '').toLowerCase()) {\n                case 'l':\n                    delta = wLabel.data.width / 2;\n                    break;\n                case 'r':\n                    delta = -wLabel.data.width / 2;\n                    break;\n            }\n        }\n        if (delta) {\n            sum += reverseSep ? delta : -delta;\n        }\n        delta = 0;\n        return sum;\n    };\n};\nconst width = (g, v) => g.getNode(v).data.width || 0;\n\nexport { addConflict, alignCoordinates, balance, buildBlockGraph, findOtherInnerSegmentNode, findSmallestWidthAlignment, findType1Conflicts, findType2Conflicts, hasConflict, horizontalCompaction, sep, verticalAlignment, width };\n//# sourceMappingURL=bk.js.map\n"],"names":["_a","DagreGraph","edge","minBy"],"mappings":";;;;AAGK,MAAC,qBAAqB,CAAC,GAAG,aAAa;AACxC,QAAM,YAAY,CAAA;AAClB,QAAM,aAAa,CAAC,WAAW,UAAU;AAGrC,QAAI,KAAK;AAGT,QAAI,UAAU;AACd,UAAM,kBAAkB,UAAU;AAClC,UAAM,WAAW,UAAU,QAAQ,UAAU,SAAS,SAAS,OAAO,UAAU,QAAQ,UAAU,SAAS,SAAS,MAAM,UAAU,CAAC;AACrI,cAAU,QAAQ,UAAU,SAAS,SAAS,MAAM,QAAQ,CAAC,GAAG,MAAM;AAClE,UAAI;AACJ,YAAM,IAAI,0BAA0B,GAAG,CAAC;AACxC,YAAM,KAAK,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,QAAQ;AAC5C,UAAI,KAAK,MAAM,UAAU;AACrB,SAAC,KAAK,MAAM,MAAM,SAAS,IAAI,CAAC,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,QAAQ,CAAC,aAAa;AAC7F,cAAIA;AACJ,WAACA,MAAK,EAAE,gBAAgB,QAAQ,OAAO,QAAQA,QAAO,SAAS,SAASA,IAAG,QAAQ,CAAC,MAAM;AACtF,gBAAIA;AACJ,kBAAM,SAAS,EAAE,QAAQ,EAAE,EAAE;AAC7B,kBAAM,OAAO,OAAO,KAAK;AACzB,iBAAK,OAAO,MAAM,KAAK,SACnB,EAAE,OAAO,KAAK,WAAWA,MAAK,EAAE,QAAQ,QAAQ,OAAO,QAAQA,QAAO,SAAS,SAASA,IAAG,KAAK,SAAS;AACzG,0BAAY,WAAW,EAAE,IAAI,QAAQ;AAAA,YACzC;AAAA,UACJ,CAAC;AAAA,QACL,CAAC;AACD,kBAAU,IAAI;AACd,aAAK;AAAA,MACT;AAAA,IACJ,CAAC;AACD,WAAO;AAAA,EACX;AACA,MAAI,aAAa,QAAQ,aAAa,SAAS,SAAS,SAAS,QAAQ;AACrE,aAAS,OAAO,UAAU;AAAA,EAC9B;AACA,SAAO;AACX;AACK,MAAC,qBAAqB,CAAC,GAAG,aAAa;AACxC,QAAM,YAAY,CAAA;AAClB,WAAS,KAAK,OAAO,UAAU,UAAU,iBAAiB,iBAAiB;AACvE,QAAI,IAAI;AACR,QAAI;AACJ,aAAS,IAAI,UAAU,IAAI,UAAU,KAAK;AACtC,UAAI,MAAM,CAAC;AACX,WAAK,KAAK,EAAE,QAAQ,CAAC,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,KAAK,OAAO;AACxE,SAAC,KAAK,EAAE,gBAAgB,CAAC,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,QAAQ,CAAC,MAAM;AAC/E,gBAAM,QAAQ,EAAE,QAAQ,EAAE,EAAE;AAC5B,cAAI,MAAM,KAAK,UACV,MAAM,KAAK,QAAQ,mBAChB,MAAM,KAAK,QAAQ,kBAAkB;AACzC,wBAAY,WAAW,EAAE,IAAI,CAAC;AAAA,UAClC;AAAA,QACJ,CAAC;AAAA,MACL;AAAA,IACJ;AAAA,EACJ;AACA,WAAS,cAAc,QAAQ;AAE3B,WAAO,KAAK,UAAU,OAAO,MAAM,CAAC,CAAC;AAAA,EACzC;AACA,WAAS,aAAa,QAAQ,WAAW;AACrC,UAAM,WAAW,cAAc,MAAM;AACrC,QAAI,UAAU,IAAI,QAAQ;AACtB;AACJ,SAAK,GAAG,MAAM;AACd,cAAU,IAAI,UAAU,IAAI;AAAA,EAChC;AACA,QAAM,aAAa,CAAC,OAAO,UAAU;AACjC,QAAI,eAAe;AACnB,QAAI;AACJ,QAAI,WAAW;AACf,UAAM,UAAU,oBAAI,IAAG;AACvB,cAAU,QAAQ,UAAU,SAAS,SAAS,MAAM,QAAQ,CAAC,GAAG,mBAAmB;AAC/E,UAAI;AACJ,YAAM,KAAK,EAAE,QAAQ,CAAC,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,KAAK,WAAW,UAAU;AACvF,cAAM,eAAe,EAAE,gBAAgB,CAAC,KAAK,CAAA;AAC7C,YAAI,aAAa,QAAQ;AACrB,yBAAe,EAAE,QAAQ,aAAa,CAAC,EAAE,EAAE,EAAE,KAAK;AAClD,uBAAa,CAAC,OAAO,UAAU,gBAAgB,cAAc,YAAY,GAAG,OAAO;AACnF,qBAAW;AACX,yBAAe;AAAA,QACnB;AAAA,MACJ;AACA,mBAAa,CAAC,OAAO,UAAU,MAAM,QAAQ,cAAc,MAAM,MAAM,GAAG,OAAO;AAAA,IACrF,CAAC;AACD,WAAO;AAAA,EACX;AACA,MAAI,aAAa,QAAQ,aAAa,SAAS,SAAS,SAAS,QAAQ;AACrE,aAAS,OAAO,UAAU;AAAA,EAC9B;AACA,SAAO;AACX;AACK,MAAC,4BAA4B,CAAC,GAAG,MAAM;AACxC,MAAI,IAAI;AACR,OAAK,KAAK,EAAE,QAAQ,CAAC,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,KAAK,OAAO;AACxE,YAAQ,KAAK,EAAE,gBAAgB,CAAC,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,KAAK,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,KAAK;AAAA,EACrH;AACJ;AACK,MAAC,cAAc,CAAC,WAAW,GAAG,MAAM;AACrC,MAAI,KAAK;AACT,MAAI,KAAK;AACT,MAAI,KAAK,IAAI;AACT,UAAM,MAAM;AACZ,SAAK;AACL,SAAK;AAAA,EACT;AACA,MAAI,aAAa,UAAU,EAAE;AAC7B,MAAI,CAAC,YAAY;AACb,cAAU,EAAE,IAAI,aAAa,CAAA;AAAA,EACjC;AACA,aAAW,EAAE,IAAI;AACrB;AACK,MAAC,cAAc,CAAC,WAAW,GAAG,MAAM;AACrC,MAAI,KAAK;AACT,MAAI,KAAK;AACT,MAAI,KAAK,IAAI;AACT,UAAM,MAAM;AACZ,SAAK;AACL,SAAK;AAAA,EACT;AACA,SAAO,CAAC,CAAC,UAAU,EAAE;AACzB;AASK,MAAC,oBAAoB,CAAC,GAAG,UAAU,WAAW,eAAe;AAC9D,QAAM,OAAO,CAAA;AACb,QAAM,QAAQ,CAAA;AACd,QAAM,MAAM,CAAA;AAIZ,eAAa,QAAQ,aAAa,SAAS,SAAS,SAAS,QAAQ,CAAC,UAAU;AAC5E,cAAU,QAAQ,UAAU,SAAS,SAAS,MAAM,QAAQ,CAAC,GAAG,UAAU;AACtE,WAAK,CAAC,IAAI;AACV,YAAM,CAAC,IAAI;AACX,UAAI,CAAC,IAAI;AAAA,IACb,CAAC;AAAA,EACL,CAAC;AACD,eAAa,QAAQ,aAAa,SAAS,SAAS,SAAS,QAAQ,CAAC,UAAU;AAC5E,QAAI,UAAU;AACd,cAAU,QAAQ,UAAU,SAAS,SAAS,MAAM,QAAQ,CAAC,MAAM;AAC/D,UAAI,KAAK,WAAW,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE;AACtC,UAAI,GAAG,QAAQ;AACX,aAAK,GAAG,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC;AACtC,cAAM,MAAM,GAAG,SAAS,KAAK;AAC7B,iBAAS,IAAI,KAAK,MAAM,EAAE,GAAG,KAAK,KAAK,KAAK,EAAE,GAAG,KAAK,IAAI,EAAE,GAAG;AAC3D,gBAAM,IAAI,GAAG,CAAC;AACd,cAAI,MAAM,CAAC,MAAM,KACb,UAAU,IAAI,CAAC,KACf,CAAC,YAAY,WAAW,GAAG,CAAC,GAAG;AAC/B,kBAAM,CAAC,IAAI;AACX,kBAAM,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;AAC3B,sBAAU,IAAI,CAAC;AAAA,UACnB;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ,CAAC;AAAA,EACL,CAAC;AACD,SAAO,EAAE,MAAM,MAAK;AACxB;AACK,MAAC,uBAAuB,CAAC,GAAG,UAAU,MAAM,OAAO,SAAS,SAAS,eAAe;AACrF,MAAI;AAMJ,QAAM,KAAK,CAAA;AACX,QAAM,SAAS,gBAAgB,GAAG,UAAU,MAAM,SAAS,SAAS,UAAU;AAC9E,QAAM,aAAa,aAAa,eAAe;AAC/C,QAAM,UAAU,CAAC,WAAW,kBAAkB;AAC1C,QAAI,QAAQ,OAAO,YAAW;AAC9B,QAAI,OAAO,MAAM,IAAG;AACpB,UAAM,UAAU,CAAA;AAChB,WAAO,MAAM;AACT,UAAI,QAAQ,KAAK,EAAE,GAAG;AAClB,kBAAU,KAAK,EAAE;AAAA,MACrB,OACK;AACD,gBAAQ,KAAK,EAAE,IAAI;AACnB,cAAM,KAAK,IAAI;AACf,gBAAQ,MAAM,OAAO,cAAc,KAAK,EAAE,CAAC;AAAA,MAC/C;AACA,aAAO,MAAM,IAAG;AAAA,IACpB;AAAA,EACJ;AAEA,QAAM,QAAQ,CAAC,SAAS;AACpB,OAAG,IAAI,KAAK,OAAO,gBAAgB,MAAM,IAAI,KAAK,CAAA,GAAI,OAAO,CAAC,KAAK,MAAM;AACrE,aAAO,KAAK,IAAI,MAAM,GAAG,EAAE,MAAM,KAAK,KAAK,EAAE,KAAK,MAAM;AAAA,IAC5D,GAAG,CAAC;AAAA,EACR;AAEA,QAAM,QAAQ,CAAC,SAAS;AACpB,UAAM,OAAO,OAAO,gBAAgB,MAAM,KAAK,KAAK,IAAI,OAAO,CAAC,KAAK,MAAM;AACvE,aAAO,KAAK,IAAI,MAAM,GAAG,EAAE,MAAM,KAAK,KAAK,EAAE,KAAK,MAAM;AAAA,IAC5D,GAAG,OAAO,iBAAiB;AAC3B,UAAM,OAAO,EAAE,QAAQ,IAAI;AAC3B,QAAI,QAAQ,OAAO,qBACf,KAAK,KAAK,eAAe,YAAY;AACrC,SAAG,IAAI,IAAI,KAAK,IAAI,GAAG,IAAI,GAAG,GAAG;AAAA,IACrC;AAAA,EACJ;AACA,UAAQ,OAAO,OAAO,gBAAgB,KAAK,MAAM,CAAC;AAClD,UAAQ,OAAO,OAAO,cAAc,KAAK,MAAM,CAAC;AAEhD,GAAC,KAAK,OAAO,OAAO,KAAK,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,QAAQ,CAAC,MAAM;AAC/E,OAAG,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC;AAAA,EACtB,CAAC;AACD,SAAO;AACX;AACK,MAAC,kBAAkB,CAAC,GAAG,UAAU,MAAM,SAAS,SAAS,eAAe;AACzE,QAAM,aAAa,IAAIC,iBAAU;AACjC,QAAM,QAAQ,IAAI,SAAS,SAAS,UAAU;AAC9C,eAAa,QAAQ,aAAa,SAAS,SAAS,SAAS,QAAQ,CAAC,UAAU;AAC5E,QAAI;AACJ,cAAU,QAAQ,UAAU,SAAS,SAAS,MAAM,QAAQ,CAAC,MAAM;AAC/D,YAAM,QAAQ,KAAK,CAAC;AACpB,UAAI,CAAC,WAAW,QAAQ,KAAK,GAAG;AAC5B,mBAAW,QAAQ;AAAA,UACf,IAAI;AAAA,UACJ,MAAM,CAAA;AAAA,QAC1B,CAAiB;AAAA,MACL;AACA,UAAI,GAAG;AACH,cAAM,QAAQ,KAAK,CAAC;AACpB,cAAM,OAAO,WACR,gBAAgB,OAAO,KAAK,EAC5B,KAAK,CAACC,UAASA,MAAK,WAAW,KAAK;AACzC,YAAI,CAAC,MAAM;AACP,qBAAW,QAAQ;AAAA,YACf,IAAI,IAAI,KAAK,OAAM,CAAE;AAAA,YACrB,QAAQ;AAAA,YACR,QAAQ;AAAA,YACR,MAAM;AAAA,cACF,QAAQ,KAAK,IAAI,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC;AAAA,YAC9D;AAAA,UACA,CAAqB;AAAA,QACL,OACK;AACD,qBAAW,eAAe,KAAK,IAAI,OAAO,OAAO,OAAO,OAAO,CAAA,GAAI,KAAK,IAAI,GAAG,EAAE,QAAQ,KAAK,IAAI,MAAM,GAAG,GAAG,CAAC,GAAG,KAAK,KAAK,UAAU,CAAC,EAAC,CAAE,CAAC;AAAA,QAC/I;AAAA,MACJ;AACA,UAAI;AAAA,IACR,CAAC;AAAA,EACL,CAAC;AACD,SAAO;AACX;AAIK,MAAC,6BAA6B,CAAC,GAAG,QAAQ;AAC3C,SAAOC,KAAAA,MAAM,OAAO,OAAO,GAAG,GAAG,CAAC,OAAO;AACrC,QAAI;AACJ,QAAI,MAAM,OAAO;AACjB,QAAI,MAAM,OAAO;AACjB,KAAC,KAAK,OAAO,KAAK,EAAE,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,QAAQ,CAAC,MAAM;AAC1E,YAAM,IAAI,GAAG,CAAC;AACd,YAAM,YAAY,MAAM,GAAG,CAAC,IAAI;AAChC,YAAM,KAAK,IAAI,IAAI,WAAW,GAAG;AACjC,YAAM,KAAK,IAAI,IAAI,WAAW,GAAG;AAAA,IACrC,CAAC;AACD,WAAO,MAAM;AAAA,EACjB,CAAC;AACL;AAQA,SAAS,iBAAiB,KAAK,SAAS;AACpC,QAAM,cAAc,OAAO,OAAO,OAAO;AACzC,QAAM,aAAa,KAAK,IAAI,GAAG,WAAW;AAC1C,QAAM,aAAa,KAAK,IAAI,GAAG,WAAW;AAC1C,GAAC,KAAK,GAAG,EAAE,QAAQ,CAAC,SAAS;AACzB,KAAC,KAAK,GAAG,EAAE,QAAQ,CAAC,UAAU;AAC1B,YAAM,YAAY,OAAO;AACzB,YAAM,KAAK,IAAI,SAAS;AACxB,UAAI;AACJ,UAAI,OAAO;AACP;AACJ,YAAM,SAAS,OAAO,OAAO,EAAE;AAC/B,cACI,UAAU,MACJ,aAAa,KAAK,IAAI,GAAG,MAAM,IAC/B,aAAa,KAAK,IAAI,GAAG,MAAM;AACzC,UAAI,OAAO;AACP,YAAI,SAAS,IAAI,CAAA;AACjB,eAAO,KAAK,EAAE,EAAE,QAAQ,CAAC,QAAQ;AAC7B,cAAI,SAAS,EAAE,GAAG,IAAI,GAAG,GAAG,IAAI;AAAA,QACpC,CAAC;AAAA,MACL;AAAA,IACJ,CAAC;AAAA,EACL,CAAC;AACL;AACK,MAAC,UAAU,CAAC,KAAK,UAAU;AAC5B,QAAM,SAAS,CAAA;AACf,SAAO,KAAK,IAAI,EAAE,EAAE,QAAQ,CAAC,QAAQ;AACjC,QAAI,OAAO;AACP,aAAO,GAAG,IAAI,IAAI,MAAM,YAAW,CAAE,EAAE,GAAG;AAAA,IAC9C,OACK;AACD,YAAM,SAAS,OAAO,OAAO,GAAG,EAAE,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC;AACnD,aAAO,GAAG,KAAK,OAAO,CAAC,IAAI,OAAO,CAAC,KAAK;AAAA,IAC5C;AAAA,EACJ,CAAC;AACD,SAAO;AACX;AACK,MAAC,MAAM,CAAC,SAAS,SAAS,eAAe;AAC1C,SAAO,CAAC,GAAG,GAAG,MAAM;AAChB,UAAM,SAAS,EAAE,QAAQ,CAAC;AAC1B,UAAM,SAAS,EAAE,QAAQ,CAAC;AAC1B,QAAI,MAAM;AACV,QAAI,QAAQ;AACZ,WAAO,OAAO,KAAK,QAAQ;AAC3B,QAAI,OAAO,KAAK,eAAe,UAAU,GAAG;AACxC,eAAS,OAAO,KAAK,YAAY,IAAI,YAAW,GAAE;AAAA,QAC9C,KAAK;AACD,kBAAQ,CAAC,OAAO,KAAK,QAAQ;AAC7B;AAAA,QACJ,KAAK;AACD,kBAAQ,OAAO,KAAK,QAAQ;AAC5B;AAAA,MACpB;AAAA,IACQ;AACA,QAAI,OAAO;AACP,aAAO,aAAa,QAAQ,CAAC;AAAA,IACjC;AACA,YAAQ;AACR,YAAQ,OAAO,KAAK,QAAQ,UAAU,WAAW;AACjD,YAAQ,OAAO,KAAK,QAAQ,UAAU,WAAW;AACjD,WAAO,OAAO,KAAK,QAAQ;AAC3B,QAAI,OAAO,KAAK,UAAU;AACtB,eAAS,OAAO,KAAK,YAAY,IAAI,YAAW,GAAE;AAAA,QAC9C,KAAK;AACD,kBAAQ,OAAO,KAAK,QAAQ;AAC5B;AAAA,QACJ,KAAK;AACD,kBAAQ,CAAC,OAAO,KAAK,QAAQ;AAC7B;AAAA,MACpB;AAAA,IACQ;AACA,QAAI,OAAO;AACP,aAAO,aAAa,QAAQ,CAAC;AAAA,IACjC;AACA,YAAQ;AACR,WAAO;AAAA,EACX;AACJ;AACK,MAAC,QAAQ,CAAC,GAAG,MAAM,EAAE,QAAQ,CAAC,EAAE,KAAK,SAAS;;;;;;;;;;;;;;","x_google_ignoreList":[0]}