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

package/dist/node_modules/.pnpm/@antv_g6@5.1.0/node_modules/@antv/g6/esm/layouts/fishbone.cjs

@@ -0,0 +1,210 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const id = require("../utils/id.cjs");
+const size = require("../utils/size.cjs");
+const baseLayout = require("./base-layout.cjs");
+const isEmpty = require("../../../../../../@antv_util@3.3.11/node_modules/@antv/util/esm/lodash/is-empty.cjs");
+const memoize = require("../../../../../../@antv_util@3.3.11/node_modules/@antv/util/esm/lodash/memoize.cjs");
+var __awaiter = function(thisArg, _arguments, P, generator) {
+  function adopt(value) {
+    return value instanceof P ? value : new P(function(resolve) {
+      resolve(value);
+    });
+  }
+  return new (P || (P = Promise))(function(resolve, reject) {
+    function fulfilled(value) {
+      try {
+        step(generator.next(value));
+      } catch (e) {
+        reject(e);
+      }
+    }
+    function rejected(value) {
+      try {
+        step(generator["throw"](value));
+      } catch (e) {
+        reject(e);
+      }
+    }
+    function step(result) {
+      result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected);
+    }
+    step((generator = generator.apply(thisArg, _arguments || [])).next());
+  });
+};
+class FishboneLayout extends baseLayout.BaseLayout {
+  constructor() {
+    super(...arguments);
+    this.id = "fishbone";
+  }
+  getRoot() {
+    const roots = this.context.model.getRootsData();
+    if (isEmpty(roots) || roots.length > 2)
+      return;
+    return roots[0];
+  }
+  formatSize(nodeSize) {
+    const nodeSizeFunc = typeof nodeSize === "function" ? nodeSize : () => nodeSize;
+    return (node) => size.parseSize(nodeSizeFunc(node));
+  }
+  doLayout(root, options) {
+    const { hGap, getRibSep, vGap, nodeSize, height } = options;
+    const { model } = this.context;
+    const getSize = this.formatSize(nodeSize);
+    let ribX = getSize(root)[0] + getRibSep(root);
+    const getHorizontalOffset = (node, result2 = 0) => {
+      var _a;
+      result2 += hGap * ((node.children || []).length + 1);
+      (_a = node.children) === null || _a === void 0 ? void 0 : _a.forEach((childId) => {
+        var _a2;
+        const child = model.getNodeLikeDatum(childId);
+        (_a2 = child.children) === null || _a2 === void 0 ? void 0 : _a2.forEach((grandChildId) => {
+          const grandChild = model.getNodeLikeDatum(grandChildId);
+          result2 = getHorizontalOffset(grandChild, result2);
+        });
+      });
+      return result2;
+    };
+    const getAuxiliaryPoint = (node) => {
+      if (node.depth === 1)
+        return ribX;
+      const parent = model.getParentData(node.id, "tree");
+      if (isAtEvenDepth(node)) {
+        const ancestor = model.getParentData(parent.id, "tree");
+        const deltaY = calculateY(node) - calculateY(ancestor);
+        return getAuxiliaryPoint(parent) + deltaY * hGap / vGap;
+      } else {
+        const nodeIndex = (parent.children || []).indexOf(node.id);
+        const followingSiblingsIncludeSelf = model.getNodeData((parent.children || []).slice(nodeIndex));
+        return calculateX(parent) - followingSiblingsIncludeSelf.reduce((acc, sibling) => acc + getHorizontalOffset(sibling), 0) - getSize(parent)[0] / 2;
+      }
+    };
+    const calculateX = memoize((node) => {
+      if (isRoot(node))
+        return getSize(node)[0] / 2;
+      const parent = model.getParentData(node.id, "tree");
+      if (isAtEvenDepth(node)) {
+        return getAuxiliaryPoint(node) + getHorizontalOffset(node) + getSize(node)[0] / 2;
+      } else {
+        const deltaY = calculateY(node) - calculateY(parent);
+        const ratio = hGap / vGap;
+        return getAuxiliaryPoint(node) + deltaY * ratio;
+      }
+    }, (node) => node.id);
+    const getParentY = (nodeId) => calculateY(model.getParentData(nodeId, "tree"));
+    const calculateY = memoize((node) => {
+      if (isRoot(node))
+        return height / 2;
+      if (!isAtEvenDepth(node)) {
+        if (isEmpty(node.children))
+          return getParentY(node.id) + vGap;
+        const lastChild = model.getNodeLikeDatum(node.children.slice(-1)[0]);
+        if (isEmpty(lastChild.children))
+          return calculateY(lastChild) + vGap;
+        const lastDescendant = model.getDescendantsData(node.id).slice(-1)[0];
+        return (isAtEvenDepth(lastDescendant) ? getParentY(lastDescendant.id) : calculateY(lastDescendant)) + vGap;
+      } else {
+        const parent = model.getParentData(node.id, "tree");
+        const nodeIndex = parent.children.indexOf(node.id);
+        if (nodeIndex === 0)
+          return getParentY(parent.id) + vGap;
+        const prevSibling = model.getNodeLikeDatum(parent.children[nodeIndex - 1]);
+        if (isEmpty(prevSibling.children))
+          return calculateY(prevSibling) + vGap;
+        const descendants = model.getDescendantsData(prevSibling.id);
+        return Math.max(...descendants.map((descendant) => isAtEvenDepth(descendant) ? getParentY(descendant.id) : calculateY(descendant))) + vGap;
+      }
+    }, (node) => node.id);
+    let tmpRibX = 0;
+    const result = { nodes: [], edges: [] };
+    const layout = (node) => {
+      var _a;
+      (_a = node.children) === null || _a === void 0 ? void 0 : _a.forEach((childId) => layout(model.getNodeLikeDatum(childId)));
+      const y = calculateY(node);
+      const x = calculateX(node);
+      result.nodes.push({ id: node.id, x, y });
+      if (isRoot(node))
+        return;
+      const edge = model.getRelatedEdgesData(node.id, "in")[0];
+      const controlPoint = [getAuxiliaryPoint(node), isAtEvenDepth(node) ? y : getParentY(node.id)];
+      result.edges.push({ id: id.idOf(edge), controlPoints: [controlPoint], relatedNodeId: node.id });
+      tmpRibX = Math.max(tmpRibX, x + getRibSep(node));
+      if (node.depth === 1)
+        ribX = tmpRibX;
+    };
+    layout(root);
+    return result;
+  }
+  placeAlterative(result, root) {
+    const oddIndexedRibs = (root.children || []).filter((_, index) => index % 2 !== 0);
+    if (oddIndexedRibs.length === 0)
+      return result;
+    const { model } = this.context;
+    const rootY = result.nodes.find((node) => node.id === root.id).y;
+    const shouldFlip = (nodeId) => {
+      const ancestors = model.getAncestorsData(nodeId, "tree");
+      if (isEmpty(ancestors))
+        return false;
+      const ribId = ancestors.length === 1 ? nodeId : ancestors[ancestors.length - 2].id;
+      return oddIndexedRibs.includes(ribId);
+    };
+    result.nodes.forEach((node) => {
+      if (shouldFlip(node.id))
+        node.y = 2 * rootY - node.y;
+    });
+    result.edges.forEach((edge) => {
+      if (shouldFlip(edge.relatedNodeId)) {
+        edge.controlPoints = edge.controlPoints.map((point) => [point[0], 2 * rootY - point[1]]);
+      }
+    });
+  }
+  rightToLeft(result, options) {
+    result.nodes.forEach((node) => node.x = options.width - node.x);
+    result.edges.forEach((edge) => {
+      edge.controlPoints = edge.controlPoints.map((point) => [options.width - point[0], point[1]]);
+    });
+    return result;
+  }
+  execute(data, propOptions) {
+    return __awaiter(this, void 0, void 0, function* () {
+      const options = Object.assign(Object.assign(Object.assign({}, FishboneLayout.defaultOptions), this.options), propOptions);
+      const { direction, nodeSize } = options;
+      const root = this.getRoot();
+      if (!root)
+        return data;
+      const getSize = this.formatSize(nodeSize);
+      options.vGap || (options.vGap = Math.max(...(data.nodes || []).map((node) => getSize(node)[1])));
+      options.hGap || (options.hGap = Math.max(...(data.nodes || []).map((node) => getSize(node)[0])));
+      let result = this.doLayout(root, options);
+      this.placeAlterative(result, root);
+      if (direction === "RL") {
+        result = this.rightToLeft(result, options);
+      }
+      const { model } = this.context;
+      const nodes = [];
+      const edges = [];
+      result.nodes.forEach((node) => {
+        const { id: id2, x, y } = node;
+        const nodeData = model.getNodeLikeDatum(id2);
+        nodes.push(assignElementStyle(nodeData, { x, y }));
+      });
+      result.edges.forEach((edge) => {
+        const { id: id2, controlPoints } = edge;
+        const edgeData = model.getEdgeDatum(id2);
+        edges.push(assignElementStyle(edgeData, { controlPoints }));
+      });
+      return { nodes, edges };
+    });
+  }
+}
+FishboneLayout.defaultOptions = {
+  direction: "RL",
+  getRibSep: () => 60
+};
+const assignElementStyle = (element, style) => {
+  return Object.assign(Object.assign({}, element), { style: Object.assign(Object.assign({}, element.style || {}), style) });
+};
+const isRoot = (node) => node.depth === 0;
+const isAtEvenDepth = (node) => (node.depth || (node.depth = 0)) % 2 === 0;
+exports.FishboneLayout = FishboneLayout;
+//# sourceMappingURL=fishbone.cjs.map

package/dist/node_modules/.pnpm/@antv_g6@5.1.0/node_modules/@antv/g6/esm/layouts/fishbone.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"fishbone.cjs","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+g6@5.1.0/node_modules/@antv/g6/esm/layouts/fishbone.js"],"sourcesContent":["var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nimport { isEmpty, memoize } from '@antv/util';\nimport { idOf } from '../utils/id';\nimport { parseSize } from '../utils/size';\nimport { BaseLayout } from './base-layout';\n/**\n * <zh/> 鱼骨图布局\n *\n * <en/> Fishbone layout\n * @remarks\n * <zh/> [鱼骨图布局](https://en.wikipedia.org/wiki/Ishikawa_diagram)是一种专门用于表示层次结构数据的图形布局方式。它通过模拟鱼骨的形状，将数据节点按照层次结构排列，使得数据的层次关系更加清晰直观。鱼骨图布局特别适用于需要展示因果关系、层次结构或分类信息的数据集。\n *\n * <en/> [Fishbone layout](https://en.wikipedia.org/wiki/Ishikawa_diagram) is a graphical layout method specifically designed to represent hierarchical data. By simulating the shape of a fishbone, it arranges data nodes according to their hierarchical structure, making the hierarchical relationships of the data clearer and more intuitive. The fishbone diagram layout is particularly suitable for datasets that need to display causal relationships, hierarchical structures, or classification information.\n */\nexport class FishboneLayout extends BaseLayout {\n    constructor() {\n        super(...arguments);\n        this.id = 'fishbone';\n    }\n    getRoot() {\n        const roots = this.context.model.getRootsData();\n        if (isEmpty(roots) || roots.length > 2)\n            return;\n        return roots[0];\n    }\n    formatSize(nodeSize) {\n        const nodeSizeFunc = typeof nodeSize === 'function' ? nodeSize : () => nodeSize;\n        return (node) => parseSize(nodeSizeFunc(node));\n    }\n    doLayout(root, options) {\n        const { hGap, getRibSep, vGap, nodeSize, height } = options;\n        const { model } = this.context;\n        const getSize = this.formatSize(nodeSize);\n        let ribX = getSize(root)[0] + getRibSep(root);\n        const getHorizontalOffset = (node, result = 0) => {\n            var _a;\n            result += hGap * ((node.children || []).length + 1);\n            (_a = node.children) === null || _a === void 0 ? void 0 : _a.forEach((childId) => {\n                var _a;\n                const child = model.getNodeLikeDatum(childId);\n                (_a = child.children) === null || _a === void 0 ? void 0 : _a.forEach((grandChildId) => {\n                    const grandChild = model.getNodeLikeDatum(grandChildId);\n                    result = getHorizontalOffset(grandChild, result);\n                });\n            });\n            return result;\n        };\n        const getAuxiliaryPoint = (node) => {\n            if (node.depth === 1)\n                return ribX;\n            const parent = model.getParentData(node.id, 'tree');\n            if (isAtEvenDepth(node)) {\n                const ancestor = model.getParentData(parent.id, 'tree');\n                const deltaY = calculateY(node) - calculateY(ancestor);\n                return getAuxiliaryPoint(parent) + (deltaY * hGap) / vGap;\n            }\n            else {\n                const nodeIndex = (parent.children || []).indexOf(node.id);\n                const followingSiblingsIncludeSelf = model.getNodeData((parent.children || []).slice(nodeIndex));\n                return (calculateX(parent) -\n                    followingSiblingsIncludeSelf.reduce((acc, sibling) => acc + getHorizontalOffset(sibling), 0) -\n                    getSize(parent)[0] / 2);\n            }\n        };\n        const calculateX = memoize((node) => {\n            if (isRoot(node))\n                return getSize(node)[0] / 2;\n            const parent = model.getParentData(node.id, 'tree');\n            if (isAtEvenDepth(node)) {\n                return getAuxiliaryPoint(node) + getHorizontalOffset(node) + getSize(node)[0] / 2;\n            }\n            else {\n                const deltaY = calculateY(node) - calculateY(parent);\n                const ratio = hGap / vGap;\n                return getAuxiliaryPoint(node) + deltaY * ratio;\n            }\n        }, (node) => node.id);\n        const getParentY = (nodeId) => calculateY(model.getParentData(nodeId, 'tree'));\n        const calculateY = memoize((node) => {\n            if (isRoot(node))\n                return height / 2;\n            if (!isAtEvenDepth(node)) {\n                // If the node has no children, calculate Y based on the parent\n                if (isEmpty(node.children))\n                    return getParentY(node.id) + vGap;\n                // If the last child has no children, calculate Y based on the last child\n                const lastChild = model.getNodeLikeDatum(node.children.slice(-1)[0]);\n                if (isEmpty(lastChild.children))\n                    return calculateY(lastChild) + vGap;\n                // If the last child has children, calculate Y based on the last descendant of the last child\n                const lastDescendant = model.getDescendantsData(node.id).slice(-1)[0];\n                return (isAtEvenDepth(lastDescendant) ? getParentY(lastDescendant.id) : calculateY(lastDescendant)) + vGap;\n            }\n            else {\n                // depth > 0 && isAtEvenDepth(node)\n                const parent = model.getParentData(node.id, 'tree');\n                const nodeIndex = parent.children.indexOf(node.id);\n                // If the node is the first sibling, return Y based on parent\n                if (nodeIndex === 0)\n                    return getParentY(parent.id) + vGap;\n                // If the previous sibling has no children, calculate Y based on the previous sibling\n                const prevSibling = model.getNodeLikeDatum(parent.children[nodeIndex - 1]);\n                if (isEmpty(prevSibling.children))\n                    return calculateY(prevSibling) + vGap;\n                // If the previous sibling has children, calculate Y based on the last descendant of the previous sibling\n                const descendants = model.getDescendantsData(prevSibling.id);\n                return (Math.max(...descendants.map((descendant) => isAtEvenDepth(descendant) ? getParentY(descendant.id) : calculateY(descendant))) + vGap);\n            }\n        }, (node) => node.id);\n        let tmpRibX = 0;\n        const result = { nodes: [], edges: [] };\n        const layout = (node) => {\n            var _a;\n            (_a = node.children) === null || _a === void 0 ? void 0 : _a.forEach((childId) => layout(model.getNodeLikeDatum(childId)));\n            const y = calculateY(node);\n            const x = calculateX(node);\n            result.nodes.push({ id: node.id, x, y });\n            if (isRoot(node))\n                return;\n            const edge = model.getRelatedEdgesData(node.id, 'in')[0];\n            const controlPoint = [getAuxiliaryPoint(node), isAtEvenDepth(node) ? y : getParentY(node.id)];\n            result.edges.push({ id: idOf(edge), controlPoints: [controlPoint], relatedNodeId: node.id });\n            tmpRibX = Math.max(tmpRibX, x + getRibSep(node));\n            if (node.depth === 1)\n                ribX = tmpRibX;\n        };\n        layout(root);\n        return result;\n    }\n    placeAlterative(result, root) {\n        const oddIndexedRibs = (root.children || []).filter((_, index) => index % 2 !== 0);\n        if (oddIndexedRibs.length === 0)\n            return result;\n        const { model } = this.context;\n        const rootY = result.nodes.find((node) => node.id === root.id).y;\n        const shouldFlip = (nodeId) => {\n            const ancestors = model.getAncestorsData(nodeId, 'tree');\n            if (isEmpty(ancestors))\n                return false;\n            const ribId = ancestors.length === 1 ? nodeId : ancestors[ancestors.length - 2].id;\n            return oddIndexedRibs.includes(ribId);\n        };\n        result.nodes.forEach((node) => {\n            if (shouldFlip(node.id))\n                node.y = 2 * rootY - node.y;\n        });\n        result.edges.forEach((edge) => {\n            if (shouldFlip(edge.relatedNodeId)) {\n                edge.controlPoints = edge.controlPoints.map((point) => [point[0], 2 * rootY - point[1]]);\n            }\n        });\n    }\n    rightToLeft(result, options) {\n        result.nodes.forEach((node) => (node.x = options.width - node.x));\n        result.edges.forEach((edge) => {\n            edge.controlPoints = edge.controlPoints.map((point) => [options.width - point[0], point[1]]);\n        });\n        return result;\n    }\n    execute(data, propOptions) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const options = Object.assign(Object.assign(Object.assign({}, FishboneLayout.defaultOptions), this.options), propOptions);\n            const { direction, nodeSize } = options;\n            const root = this.getRoot();\n            if (!root)\n                return data;\n            const getSize = this.formatSize(nodeSize);\n            options.vGap || (options.vGap = Math.max(...(data.nodes || []).map((node) => getSize(node)[1])));\n            options.hGap || (options.hGap = Math.max(...(data.nodes || []).map((node) => getSize(node)[0])));\n            let result = this.doLayout(root, options);\n            this.placeAlterative(result, root);\n            if (direction === 'RL') {\n                result = this.rightToLeft(result, options);\n            }\n            const { model } = this.context;\n            const nodes = [];\n            const edges = [];\n            result.nodes.forEach((node) => {\n                const { id, x, y } = node;\n                const nodeData = model.getNodeLikeDatum(id);\n                nodes.push(assignElementStyle(nodeData, { x, y }));\n            });\n            result.edges.forEach((edge) => {\n                const { id, controlPoints } = edge;\n                const edgeData = model.getEdgeDatum(id);\n                edges.push(assignElementStyle(edgeData, { controlPoints }));\n            });\n            return { nodes, edges };\n        });\n    }\n}\nFishboneLayout.defaultOptions = {\n    direction: 'RL',\n    getRibSep: () => 60,\n};\nconst assignElementStyle = (element, style) => {\n    return Object.assign(Object.assign({}, element), { style: Object.assign(Object.assign({}, (element.style || {})), style) });\n};\nconst isRoot = (node) => node.depth === 0;\nconst isAtEvenDepth = (node) => (node.depth || (node.depth = 0)) % 2 === 0;\n//# sourceMappingURL=fishbone.js.map"],"names":["BaseLayout","parseSize","result","_a","idOf","id"],"mappings":";;;;;;;AAAA,IAAI,YAAwC,SAAU,SAAS,YAAY,GAAG,WAAW;AACrF,WAAS,MAAM,OAAO;AAAE,WAAO,iBAAiB,IAAI,QAAQ,IAAI,EAAE,SAAU,SAAS;AAAE,cAAQ,KAAK;AAAA,IAAG,CAAC;AAAA,EAAG;AAC3G,SAAO,KAAK,MAAM,IAAI,UAAU,SAAU,SAAS,QAAQ;AACvD,aAAS,UAAU,OAAO;AAAE,UAAI;AAAE,aAAK,UAAU,KAAK,KAAK,CAAC;AAAA,MAAG,SAAS,GAAG;AAAE,eAAO,CAAC;AAAA,MAAG;AAAA,IAAE;AAC1F,aAAS,SAAS,OAAO;AAAE,UAAI;AAAE,aAAK,UAAU,OAAO,EAAE,KAAK,CAAC;AAAA,MAAG,SAAS,GAAG;AAAE,eAAO,CAAC;AAAA,MAAG;AAAA,IAAE;AAC7F,aAAS,KAAK,QAAQ;AAAE,aAAO,OAAO,QAAQ,OAAO,KAAK,IAAI,MAAM,OAAO,KAAK,EAAE,KAAK,WAAW,QAAQ;AAAA,IAAG;AAC7G,UAAM,YAAY,UAAU,MAAM,SAAS,cAAc,CAAA,CAAE,GAAG,MAAM;AAAA,EACxE,CAAC;AACL;AAcO,MAAM,uBAAuBA,WAAAA,WAAW;AAAA,EAC3C,cAAc;AACV,UAAM,GAAG,SAAS;AAClB,SAAK,KAAK;AAAA,EACd;AAAA,EACA,UAAU;AACN,UAAM,QAAQ,KAAK,QAAQ,MAAM,aAAY;AAC7C,QAAI,QAAQ,KAAK,KAAK,MAAM,SAAS;AACjC;AACJ,WAAO,MAAM,CAAC;AAAA,EAClB;AAAA,EACA,WAAW,UAAU;AACjB,UAAM,eAAe,OAAO,aAAa,aAAa,WAAW,MAAM;AACvE,WAAO,CAAC,SAASC,KAAAA,UAAU,aAAa,IAAI,CAAC;AAAA,EACjD;AAAA,EACA,SAAS,MAAM,SAAS;AACpB,UAAM,EAAE,MAAM,WAAW,MAAM,UAAU,OAAM,IAAK;AACpD,UAAM,EAAE,UAAU,KAAK;AACvB,UAAM,UAAU,KAAK,WAAW,QAAQ;AACxC,QAAI,OAAO,QAAQ,IAAI,EAAE,CAAC,IAAI,UAAU,IAAI;AAC5C,UAAM,sBAAsB,CAAC,MAAMC,UAAS,MAAM;AAC9C,UAAI;AACJ,MAAAA,WAAU,SAAS,KAAK,YAAY,CAAA,GAAI,SAAS;AACjD,OAAC,KAAK,KAAK,cAAc,QAAQ,OAAO,SAAS,SAAS,GAAG,QAAQ,CAAC,YAAY;AAC9E,YAAIC;AACJ,cAAM,QAAQ,MAAM,iBAAiB,OAAO;AAC5C,SAACA,MAAK,MAAM,cAAc,QAAQA,QAAO,SAAS,SAASA,IAAG,QAAQ,CAAC,iBAAiB;AACpF,gBAAM,aAAa,MAAM,iBAAiB,YAAY;AACtD,UAAAD,UAAS,oBAAoB,YAAYA,OAAM;AAAA,QACnD,CAAC;AAAA,MACL,CAAC;AACD,aAAOA;AAAA,IACX;AACA,UAAM,oBAAoB,CAAC,SAAS;AAChC,UAAI,KAAK,UAAU;AACf,eAAO;AACX,YAAM,SAAS,MAAM,cAAc,KAAK,IAAI,MAAM;AAClD,UAAI,cAAc,IAAI,GAAG;AACrB,cAAM,WAAW,MAAM,cAAc,OAAO,IAAI,MAAM;AACtD,cAAM,SAAS,WAAW,IAAI,IAAI,WAAW,QAAQ;AACrD,eAAO,kBAAkB,MAAM,IAAK,SAAS,OAAQ;AAAA,MACzD,OACK;AACD,cAAM,aAAa,OAAO,YAAY,CAAA,GAAI,QAAQ,KAAK,EAAE;AACzD,cAAM,+BAA+B,MAAM,aAAa,OAAO,YAAY,CAAA,GAAI,MAAM,SAAS,CAAC;AAC/F,eAAQ,WAAW,MAAM,IACrB,6BAA6B,OAAO,CAAC,KAAK,YAAY,MAAM,oBAAoB,OAAO,GAAG,CAAC,IAC3F,QAAQ,MAAM,EAAE,CAAC,IAAI;AAAA,MAC7B;AAAA,IACJ;AACA,UAAM,aAAa,QAAQ,CAAC,SAAS;AACjC,UAAI,OAAO,IAAI;AACX,eAAO,QAAQ,IAAI,EAAE,CAAC,IAAI;AAC9B,YAAM,SAAS,MAAM,cAAc,KAAK,IAAI,MAAM;AAClD,UAAI,cAAc,IAAI,GAAG;AACrB,eAAO,kBAAkB,IAAI,IAAI,oBAAoB,IAAI,IAAI,QAAQ,IAAI,EAAE,CAAC,IAAI;AAAA,MACpF,OACK;AACD,cAAM,SAAS,WAAW,IAAI,IAAI,WAAW,MAAM;AACnD,cAAM,QAAQ,OAAO;AACrB,eAAO,kBAAkB,IAAI,IAAI,SAAS;AAAA,MAC9C;AAAA,IACJ,GAAG,CAAC,SAAS,KAAK,EAAE;AACpB,UAAM,aAAa,CAAC,WAAW,WAAW,MAAM,cAAc,QAAQ,MAAM,CAAC;AAC7E,UAAM,aAAa,QAAQ,CAAC,SAAS;AACjC,UAAI,OAAO,IAAI;AACX,eAAO,SAAS;AACpB,UAAI,CAAC,cAAc,IAAI,GAAG;AAEtB,YAAI,QAAQ,KAAK,QAAQ;AACrB,iBAAO,WAAW,KAAK,EAAE,IAAI;AAEjC,cAAM,YAAY,MAAM,iBAAiB,KAAK,SAAS,MAAM,EAAE,EAAE,CAAC,CAAC;AACnE,YAAI,QAAQ,UAAU,QAAQ;AAC1B,iBAAO,WAAW,SAAS,IAAI;AAEnC,cAAM,iBAAiB,MAAM,mBAAmB,KAAK,EAAE,EAAE,MAAM,EAAE,EAAE,CAAC;AACpE,gBAAQ,cAAc,cAAc,IAAI,WAAW,eAAe,EAAE,IAAI,WAAW,cAAc,KAAK;AAAA,MAC1G,OACK;AAED,cAAM,SAAS,MAAM,cAAc,KAAK,IAAI,MAAM;AAClD,cAAM,YAAY,OAAO,SAAS,QAAQ,KAAK,EAAE;AAEjD,YAAI,cAAc;AACd,iBAAO,WAAW,OAAO,EAAE,IAAI;AAEnC,cAAM,cAAc,MAAM,iBAAiB,OAAO,SAAS,YAAY,CAAC,CAAC;AACzE,YAAI,QAAQ,YAAY,QAAQ;AAC5B,iBAAO,WAAW,WAAW,IAAI;AAErC,cAAM,cAAc,MAAM,mBAAmB,YAAY,EAAE;AAC3D,eAAQ,KAAK,IAAI,GAAG,YAAY,IAAI,CAAC,eAAe,cAAc,UAAU,IAAI,WAAW,WAAW,EAAE,IAAI,WAAW,UAAU,CAAC,CAAC,IAAI;AAAA,MAC3I;AAAA,IACJ,GAAG,CAAC,SAAS,KAAK,EAAE;AACpB,QAAI,UAAU;AACd,UAAM,SAAS,EAAE,OAAO,CAAA,GAAI,OAAO,CAAA,EAAE;AACrC,UAAM,SAAS,CAAC,SAAS;AACrB,UAAI;AACJ,OAAC,KAAK,KAAK,cAAc,QAAQ,OAAO,SAAS,SAAS,GAAG,QAAQ,CAAC,YAAY,OAAO,MAAM,iBAAiB,OAAO,CAAC,CAAC;AACzH,YAAM,IAAI,WAAW,IAAI;AACzB,YAAM,IAAI,WAAW,IAAI;AACzB,aAAO,MAAM,KAAK,EAAE,IAAI,KAAK,IAAI,GAAG,GAAG;AACvC,UAAI,OAAO,IAAI;AACX;AACJ,YAAM,OAAO,MAAM,oBAAoB,KAAK,IAAI,IAAI,EAAE,CAAC;AACvD,YAAM,eAAe,CAAC,kBAAkB,IAAI,GAAG,cAAc,IAAI,IAAI,IAAI,WAAW,KAAK,EAAE,CAAC;AAC5F,aAAO,MAAM,KAAK,EAAE,IAAIE,GAAAA,KAAK,IAAI,GAAG,eAAe,CAAC,YAAY,GAAG,eAAe,KAAK,GAAE,CAAE;AAC3F,gBAAU,KAAK,IAAI,SAAS,IAAI,UAAU,IAAI,CAAC;AAC/C,UAAI,KAAK,UAAU;AACf,eAAO;AAAA,IACf;AACA,WAAO,IAAI;AACX,WAAO;AAAA,EACX;AAAA,EACA,gBAAgB,QAAQ,MAAM;AAC1B,UAAM,kBAAkB,KAAK,YAAY,CAAA,GAAI,OAAO,CAAC,GAAG,UAAU,QAAQ,MAAM,CAAC;AACjF,QAAI,eAAe,WAAW;AAC1B,aAAO;AACX,UAAM,EAAE,UAAU,KAAK;AACvB,UAAM,QAAQ,OAAO,MAAM,KAAK,CAAC,SAAS,KAAK,OAAO,KAAK,EAAE,EAAE;AAC/D,UAAM,aAAa,CAAC,WAAW;AAC3B,YAAM,YAAY,MAAM,iBAAiB,QAAQ,MAAM;AACvD,UAAI,QAAQ,SAAS;AACjB,eAAO;AACX,YAAM,QAAQ,UAAU,WAAW,IAAI,SAAS,UAAU,UAAU,SAAS,CAAC,EAAE;AAChF,aAAO,eAAe,SAAS,KAAK;AAAA,IACxC;AACA,WAAO,MAAM,QAAQ,CAAC,SAAS;AAC3B,UAAI,WAAW,KAAK,EAAE;AAClB,aAAK,IAAI,IAAI,QAAQ,KAAK;AAAA,IAClC,CAAC;AACD,WAAO,MAAM,QAAQ,CAAC,SAAS;AAC3B,UAAI,WAAW,KAAK,aAAa,GAAG;AAChC,aAAK,gBAAgB,KAAK,cAAc,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,IAAI,QAAQ,MAAM,CAAC,CAAC,CAAC;AAAA,MAC3F;AAAA,IACJ,CAAC;AAAA,EACL;AAAA,EACA,YAAY,QAAQ,SAAS;AACzB,WAAO,MAAM,QAAQ,CAAC,SAAU,KAAK,IAAI,QAAQ,QAAQ,KAAK,CAAE;AAChE,WAAO,MAAM,QAAQ,CAAC,SAAS;AAC3B,WAAK,gBAAgB,KAAK,cAAc,IAAI,CAAC,UAAU,CAAC,QAAQ,QAAQ,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;AAAA,IAC/F,CAAC;AACD,WAAO;AAAA,EACX;AAAA,EACA,QAAQ,MAAM,aAAa;AACvB,WAAO,UAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,YAAM,UAAU,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO,CAAA,GAAI,eAAe,cAAc,GAAG,KAAK,OAAO,GAAG,WAAW;AACxH,YAAM,EAAE,WAAW,SAAQ,IAAK;AAChC,YAAM,OAAO,KAAK,QAAO;AACzB,UAAI,CAAC;AACD,eAAO;AACX,YAAM,UAAU,KAAK,WAAW,QAAQ;AACxC,cAAQ,SAAS,QAAQ,OAAO,KAAK,IAAI,IAAI,KAAK,SAAS,CAAA,GAAI,IAAI,CAAC,SAAS,QAAQ,IAAI,EAAE,CAAC,CAAC,CAAC;AAC9F,cAAQ,SAAS,QAAQ,OAAO,KAAK,IAAI,IAAI,KAAK,SAAS,CAAA,GAAI,IAAI,CAAC,SAAS,QAAQ,IAAI,EAAE,CAAC,CAAC,CAAC;AAC9F,UAAI,SAAS,KAAK,SAAS,MAAM,OAAO;AACxC,WAAK,gBAAgB,QAAQ,IAAI;AACjC,UAAI,cAAc,MAAM;AACpB,iBAAS,KAAK,YAAY,QAAQ,OAAO;AAAA,MAC7C;AACA,YAAM,EAAE,UAAU,KAAK;AACvB,YAAM,QAAQ,CAAA;AACd,YAAM,QAAQ,CAAA;AACd,aAAO,MAAM,QAAQ,CAAC,SAAS;AAC3B,cAAM,EAAE,IAAAC,KAAI,GAAG,EAAC,IAAK;AACrB,cAAM,WAAW,MAAM,iBAAiBA,GAAE;AAC1C,cAAM,KAAK,mBAAmB,UAAU,EAAE,GAAG,EAAC,CAAE,CAAC;AAAA,MACrD,CAAC;AACD,aAAO,MAAM,QAAQ,CAAC,SAAS;AAC3B,cAAM,EAAE,IAAAA,KAAI,cAAa,IAAK;AAC9B,cAAM,WAAW,MAAM,aAAaA,GAAE;AACtC,cAAM,KAAK,mBAAmB,UAAU,EAAE,cAAa,CAAE,CAAC;AAAA,MAC9D,CAAC;AACD,aAAO,EAAE,OAAO,MAAK;AAAA,IACzB,CAAC;AAAA,EACL;AACJ;AACA,eAAe,iBAAiB;AAAA,EAC5B,WAAW;AAAA,EACX,WAAW,MAAM;AACrB;AACA,MAAM,qBAAqB,CAAC,SAAS,UAAU;AAC3C,SAAO,OAAO,OAAO,OAAO,OAAO,CAAA,GAAI,OAAO,GAAG,EAAE,OAAO,OAAO,OAAO,OAAO,OAAO,IAAK,QAAQ,SAAS,CAAA,CAAE,GAAI,KAAK,GAAG;AAC9H;AACA,MAAM,SAAS,CAAC,SAAS,KAAK,UAAU;AACxC,MAAM,gBAAgB,CAAC,UAAU,KAAK,UAAU,KAAK,QAAQ,MAAM,MAAM;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_g6@5.1.0/node_modules/@antv/g6/esm/layouts/fishbone.js

@@ -0,0 +1,210 @@
+import { idOf } from "../utils/id.js";
+import { parseSize } from "../utils/size.js";
+import { BaseLayout } from "./base-layout.js";
+import isEmpty from "../../../../../../@antv_util@3.3.11/node_modules/@antv/util/esm/lodash/is-empty.js";
+import memoize from "../../../../../../@antv_util@3.3.11/node_modules/@antv/util/esm/lodash/memoize.js";
+var __awaiter = function(thisArg, _arguments, P, generator) {
+  function adopt(value) {
+    return value instanceof P ? value : new P(function(resolve) {
+      resolve(value);
+    });
+  }
+  return new (P || (P = Promise))(function(resolve, reject) {
+    function fulfilled(value) {
+      try {
+        step(generator.next(value));
+      } catch (e) {
+        reject(e);
+      }
+    }
+    function rejected(value) {
+      try {
+        step(generator["throw"](value));
+      } catch (e) {
+        reject(e);
+      }
+    }
+    function step(result) {
+      result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected);
+    }
+    step((generator = generator.apply(thisArg, _arguments || [])).next());
+  });
+};
+class FishboneLayout extends BaseLayout {
+  constructor() {
+    super(...arguments);
+    this.id = "fishbone";
+  }
+  getRoot() {
+    const roots = this.context.model.getRootsData();
+    if (isEmpty(roots) || roots.length > 2)
+      return;
+    return roots[0];
+  }
+  formatSize(nodeSize) {
+    const nodeSizeFunc = typeof nodeSize === "function" ? nodeSize : () => nodeSize;
+    return (node) => parseSize(nodeSizeFunc(node));
+  }
+  doLayout(root, options) {
+    const { hGap, getRibSep, vGap, nodeSize, height } = options;
+    const { model } = this.context;
+    const getSize = this.formatSize(nodeSize);
+    let ribX = getSize(root)[0] + getRibSep(root);
+    const getHorizontalOffset = (node, result2 = 0) => {
+      var _a;
+      result2 += hGap * ((node.children || []).length + 1);
+      (_a = node.children) === null || _a === void 0 ? void 0 : _a.forEach((childId) => {
+        var _a2;
+        const child = model.getNodeLikeDatum(childId);
+        (_a2 = child.children) === null || _a2 === void 0 ? void 0 : _a2.forEach((grandChildId) => {
+          const grandChild = model.getNodeLikeDatum(grandChildId);
+          result2 = getHorizontalOffset(grandChild, result2);
+        });
+      });
+      return result2;
+    };
+    const getAuxiliaryPoint = (node) => {
+      if (node.depth === 1)
+        return ribX;
+      const parent = model.getParentData(node.id, "tree");
+      if (isAtEvenDepth(node)) {
+        const ancestor = model.getParentData(parent.id, "tree");
+        const deltaY = calculateY(node) - calculateY(ancestor);
+        return getAuxiliaryPoint(parent) + deltaY * hGap / vGap;
+      } else {
+        const nodeIndex = (parent.children || []).indexOf(node.id);
+        const followingSiblingsIncludeSelf = model.getNodeData((parent.children || []).slice(nodeIndex));
+        return calculateX(parent) - followingSiblingsIncludeSelf.reduce((acc, sibling) => acc + getHorizontalOffset(sibling), 0) - getSize(parent)[0] / 2;
+      }
+    };
+    const calculateX = memoize((node) => {
+      if (isRoot(node))
+        return getSize(node)[0] / 2;
+      const parent = model.getParentData(node.id, "tree");
+      if (isAtEvenDepth(node)) {
+        return getAuxiliaryPoint(node) + getHorizontalOffset(node) + getSize(node)[0] / 2;
+      } else {
+        const deltaY = calculateY(node) - calculateY(parent);
+        const ratio = hGap / vGap;
+        return getAuxiliaryPoint(node) + deltaY * ratio;
+      }
+    }, (node) => node.id);
+    const getParentY = (nodeId) => calculateY(model.getParentData(nodeId, "tree"));
+    const calculateY = memoize((node) => {
+      if (isRoot(node))
+        return height / 2;
+      if (!isAtEvenDepth(node)) {
+        if (isEmpty(node.children))
+          return getParentY(node.id) + vGap;
+        const lastChild = model.getNodeLikeDatum(node.children.slice(-1)[0]);
+        if (isEmpty(lastChild.children))
+          return calculateY(lastChild) + vGap;
+        const lastDescendant = model.getDescendantsData(node.id).slice(-1)[0];
+        return (isAtEvenDepth(lastDescendant) ? getParentY(lastDescendant.id) : calculateY(lastDescendant)) + vGap;
+      } else {
+        const parent = model.getParentData(node.id, "tree");
+        const nodeIndex = parent.children.indexOf(node.id);
+        if (nodeIndex === 0)
+          return getParentY(parent.id) + vGap;
+        const prevSibling = model.getNodeLikeDatum(parent.children[nodeIndex - 1]);
+        if (isEmpty(prevSibling.children))
+          return calculateY(prevSibling) + vGap;
+        const descendants = model.getDescendantsData(prevSibling.id);
+        return Math.max(...descendants.map((descendant) => isAtEvenDepth(descendant) ? getParentY(descendant.id) : calculateY(descendant))) + vGap;
+      }
+    }, (node) => node.id);
+    let tmpRibX = 0;
+    const result = { nodes: [], edges: [] };
+    const layout = (node) => {
+      var _a;
+      (_a = node.children) === null || _a === void 0 ? void 0 : _a.forEach((childId) => layout(model.getNodeLikeDatum(childId)));
+      const y = calculateY(node);
+      const x = calculateX(node);
+      result.nodes.push({ id: node.id, x, y });
+      if (isRoot(node))
+        return;
+      const edge = model.getRelatedEdgesData(node.id, "in")[0];
+      const controlPoint = [getAuxiliaryPoint(node), isAtEvenDepth(node) ? y : getParentY(node.id)];
+      result.edges.push({ id: idOf(edge), controlPoints: [controlPoint], relatedNodeId: node.id });
+      tmpRibX = Math.max(tmpRibX, x + getRibSep(node));
+      if (node.depth === 1)
+        ribX = tmpRibX;
+    };
+    layout(root);
+    return result;
+  }
+  placeAlterative(result, root) {
+    const oddIndexedRibs = (root.children || []).filter((_, index) => index % 2 !== 0);
+    if (oddIndexedRibs.length === 0)
+      return result;
+    const { model } = this.context;
+    const rootY = result.nodes.find((node) => node.id === root.id).y;
+    const shouldFlip = (nodeId) => {
+      const ancestors = model.getAncestorsData(nodeId, "tree");
+      if (isEmpty(ancestors))
+        return false;
+      const ribId = ancestors.length === 1 ? nodeId : ancestors[ancestors.length - 2].id;
+      return oddIndexedRibs.includes(ribId);
+    };
+    result.nodes.forEach((node) => {
+      if (shouldFlip(node.id))
+        node.y = 2 * rootY - node.y;
+    });
+    result.edges.forEach((edge) => {
+      if (shouldFlip(edge.relatedNodeId)) {
+        edge.controlPoints = edge.controlPoints.map((point) => [point[0], 2 * rootY - point[1]]);
+      }
+    });
+  }
+  rightToLeft(result, options) {
+    result.nodes.forEach((node) => node.x = options.width - node.x);
+    result.edges.forEach((edge) => {
+      edge.controlPoints = edge.controlPoints.map((point) => [options.width - point[0], point[1]]);
+    });
+    return result;
+  }
+  execute(data, propOptions) {
+    return __awaiter(this, void 0, void 0, function* () {
+      const options = Object.assign(Object.assign(Object.assign({}, FishboneLayout.defaultOptions), this.options), propOptions);
+      const { direction, nodeSize } = options;
+      const root = this.getRoot();
+      if (!root)
+        return data;
+      const getSize = this.formatSize(nodeSize);
+      options.vGap || (options.vGap = Math.max(...(data.nodes || []).map((node) => getSize(node)[1])));
+      options.hGap || (options.hGap = Math.max(...(data.nodes || []).map((node) => getSize(node)[0])));
+      let result = this.doLayout(root, options);
+      this.placeAlterative(result, root);
+      if (direction === "RL") {
+        result = this.rightToLeft(result, options);
+      }
+      const { model } = this.context;
+      const nodes = [];
+      const edges = [];
+      result.nodes.forEach((node) => {
+        const { id, x, y } = node;
+        const nodeData = model.getNodeLikeDatum(id);
+        nodes.push(assignElementStyle(nodeData, { x, y }));
+      });
+      result.edges.forEach((edge) => {
+        const { id, controlPoints } = edge;
+        const edgeData = model.getEdgeDatum(id);
+        edges.push(assignElementStyle(edgeData, { controlPoints }));
+      });
+      return { nodes, edges };
+    });
+  }
+}
+FishboneLayout.defaultOptions = {
+  direction: "RL",
+  getRibSep: () => 60
+};
+const assignElementStyle = (element, style) => {
+  return Object.assign(Object.assign({}, element), { style: Object.assign(Object.assign({}, element.style || {}), style) });
+};
+const isRoot = (node) => node.depth === 0;
+const isAtEvenDepth = (node) => (node.depth || (node.depth = 0)) % 2 === 0;
+export {
+  FishboneLayout
+};
+//# sourceMappingURL=fishbone.js.map

package/dist/node_modules/.pnpm/@antv_g6@5.1.0/node_modules/@antv/g6/esm/layouts/fishbone.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fishbone.js","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+g6@5.1.0/node_modules/@antv/g6/esm/layouts/fishbone.js"],"sourcesContent":["var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nimport { isEmpty, memoize } from '@antv/util';\nimport { idOf } from '../utils/id';\nimport { parseSize } from '../utils/size';\nimport { BaseLayout } from './base-layout';\n/**\n * <zh/> 鱼骨图布局\n *\n * <en/> Fishbone layout\n * @remarks\n * <zh/> [鱼骨图布局](https://en.wikipedia.org/wiki/Ishikawa_diagram)是一种专门用于表示层次结构数据的图形布局方式。它通过模拟鱼骨的形状，将数据节点按照层次结构排列，使得数据的层次关系更加清晰直观。鱼骨图布局特别适用于需要展示因果关系、层次结构或分类信息的数据集。\n *\n * <en/> [Fishbone layout](https://en.wikipedia.org/wiki/Ishikawa_diagram) is a graphical layout method specifically designed to represent hierarchical data. By simulating the shape of a fishbone, it arranges data nodes according to their hierarchical structure, making the hierarchical relationships of the data clearer and more intuitive. The fishbone diagram layout is particularly suitable for datasets that need to display causal relationships, hierarchical structures, or classification information.\n */\nexport class FishboneLayout extends BaseLayout {\n    constructor() {\n        super(...arguments);\n        this.id = 'fishbone';\n    }\n    getRoot() {\n        const roots = this.context.model.getRootsData();\n        if (isEmpty(roots) || roots.length > 2)\n            return;\n        return roots[0];\n    }\n    formatSize(nodeSize) {\n        const nodeSizeFunc = typeof nodeSize === 'function' ? nodeSize : () => nodeSize;\n        return (node) => parseSize(nodeSizeFunc(node));\n    }\n    doLayout(root, options) {\n        const { hGap, getRibSep, vGap, nodeSize, height } = options;\n        const { model } = this.context;\n        const getSize = this.formatSize(nodeSize);\n        let ribX = getSize(root)[0] + getRibSep(root);\n        const getHorizontalOffset = (node, result = 0) => {\n            var _a;\n            result += hGap * ((node.children || []).length + 1);\n            (_a = node.children) === null || _a === void 0 ? void 0 : _a.forEach((childId) => {\n                var _a;\n                const child = model.getNodeLikeDatum(childId);\n                (_a = child.children) === null || _a === void 0 ? void 0 : _a.forEach((grandChildId) => {\n                    const grandChild = model.getNodeLikeDatum(grandChildId);\n                    result = getHorizontalOffset(grandChild, result);\n                });\n            });\n            return result;\n        };\n        const getAuxiliaryPoint = (node) => {\n            if (node.depth === 1)\n                return ribX;\n            const parent = model.getParentData(node.id, 'tree');\n            if (isAtEvenDepth(node)) {\n                const ancestor = model.getParentData(parent.id, 'tree');\n                const deltaY = calculateY(node) - calculateY(ancestor);\n                return getAuxiliaryPoint(parent) + (deltaY * hGap) / vGap;\n            }\n            else {\n                const nodeIndex = (parent.children || []).indexOf(node.id);\n                const followingSiblingsIncludeSelf = model.getNodeData((parent.children || []).slice(nodeIndex));\n                return (calculateX(parent) -\n                    followingSiblingsIncludeSelf.reduce((acc, sibling) => acc + getHorizontalOffset(sibling), 0) -\n                    getSize(parent)[0] / 2);\n            }\n        };\n        const calculateX = memoize((node) => {\n            if (isRoot(node))\n                return getSize(node)[0] / 2;\n            const parent = model.getParentData(node.id, 'tree');\n            if (isAtEvenDepth(node)) {\n                return getAuxiliaryPoint(node) + getHorizontalOffset(node) + getSize(node)[0] / 2;\n            }\n            else {\n                const deltaY = calculateY(node) - calculateY(parent);\n                const ratio = hGap / vGap;\n                return getAuxiliaryPoint(node) + deltaY * ratio;\n            }\n        }, (node) => node.id);\n        const getParentY = (nodeId) => calculateY(model.getParentData(nodeId, 'tree'));\n        const calculateY = memoize((node) => {\n            if (isRoot(node))\n                return height / 2;\n            if (!isAtEvenDepth(node)) {\n                // If the node has no children, calculate Y based on the parent\n                if (isEmpty(node.children))\n                    return getParentY(node.id) + vGap;\n                // If the last child has no children, calculate Y based on the last child\n                const lastChild = model.getNodeLikeDatum(node.children.slice(-1)[0]);\n                if (isEmpty(lastChild.children))\n                    return calculateY(lastChild) + vGap;\n                // If the last child has children, calculate Y based on the last descendant of the last child\n                const lastDescendant = model.getDescendantsData(node.id).slice(-1)[0];\n                return (isAtEvenDepth(lastDescendant) ? getParentY(lastDescendant.id) : calculateY(lastDescendant)) + vGap;\n            }\n            else {\n                // depth > 0 && isAtEvenDepth(node)\n                const parent = model.getParentData(node.id, 'tree');\n                const nodeIndex = parent.children.indexOf(node.id);\n                // If the node is the first sibling, return Y based on parent\n                if (nodeIndex === 0)\n                    return getParentY(parent.id) + vGap;\n                // If the previous sibling has no children, calculate Y based on the previous sibling\n                const prevSibling = model.getNodeLikeDatum(parent.children[nodeIndex - 1]);\n                if (isEmpty(prevSibling.children))\n                    return calculateY(prevSibling) + vGap;\n                // If the previous sibling has children, calculate Y based on the last descendant of the previous sibling\n                const descendants = model.getDescendantsData(prevSibling.id);\n                return (Math.max(...descendants.map((descendant) => isAtEvenDepth(descendant) ? getParentY(descendant.id) : calculateY(descendant))) + vGap);\n            }\n        }, (node) => node.id);\n        let tmpRibX = 0;\n        const result = { nodes: [], edges: [] };\n        const layout = (node) => {\n            var _a;\n            (_a = node.children) === null || _a === void 0 ? void 0 : _a.forEach((childId) => layout(model.getNodeLikeDatum(childId)));\n            const y = calculateY(node);\n            const x = calculateX(node);\n            result.nodes.push({ id: node.id, x, y });\n            if (isRoot(node))\n                return;\n            const edge = model.getRelatedEdgesData(node.id, 'in')[0];\n            const controlPoint = [getAuxiliaryPoint(node), isAtEvenDepth(node) ? y : getParentY(node.id)];\n            result.edges.push({ id: idOf(edge), controlPoints: [controlPoint], relatedNodeId: node.id });\n            tmpRibX = Math.max(tmpRibX, x + getRibSep(node));\n            if (node.depth === 1)\n                ribX = tmpRibX;\n        };\n        layout(root);\n        return result;\n    }\n    placeAlterative(result, root) {\n        const oddIndexedRibs = (root.children || []).filter((_, index) => index % 2 !== 0);\n        if (oddIndexedRibs.length === 0)\n            return result;\n        const { model } = this.context;\n        const rootY = result.nodes.find((node) => node.id === root.id).y;\n        const shouldFlip = (nodeId) => {\n            const ancestors = model.getAncestorsData(nodeId, 'tree');\n            if (isEmpty(ancestors))\n                return false;\n            const ribId = ancestors.length === 1 ? nodeId : ancestors[ancestors.length - 2].id;\n            return oddIndexedRibs.includes(ribId);\n        };\n        result.nodes.forEach((node) => {\n            if (shouldFlip(node.id))\n                node.y = 2 * rootY - node.y;\n        });\n        result.edges.forEach((edge) => {\n            if (shouldFlip(edge.relatedNodeId)) {\n                edge.controlPoints = edge.controlPoints.map((point) => [point[0], 2 * rootY - point[1]]);\n            }\n        });\n    }\n    rightToLeft(result, options) {\n        result.nodes.forEach((node) => (node.x = options.width - node.x));\n        result.edges.forEach((edge) => {\n            edge.controlPoints = edge.controlPoints.map((point) => [options.width - point[0], point[1]]);\n        });\n        return result;\n    }\n    execute(data, propOptions) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const options = Object.assign(Object.assign(Object.assign({}, FishboneLayout.defaultOptions), this.options), propOptions);\n            const { direction, nodeSize } = options;\n            const root = this.getRoot();\n            if (!root)\n                return data;\n            const getSize = this.formatSize(nodeSize);\n            options.vGap || (options.vGap = Math.max(...(data.nodes || []).map((node) => getSize(node)[1])));\n            options.hGap || (options.hGap = Math.max(...(data.nodes || []).map((node) => getSize(node)[0])));\n            let result = this.doLayout(root, options);\n            this.placeAlterative(result, root);\n            if (direction === 'RL') {\n                result = this.rightToLeft(result, options);\n            }\n            const { model } = this.context;\n            const nodes = [];\n            const edges = [];\n            result.nodes.forEach((node) => {\n                const { id, x, y } = node;\n                const nodeData = model.getNodeLikeDatum(id);\n                nodes.push(assignElementStyle(nodeData, { x, y }));\n            });\n            result.edges.forEach((edge) => {\n                const { id, controlPoints } = edge;\n                const edgeData = model.getEdgeDatum(id);\n                edges.push(assignElementStyle(edgeData, { controlPoints }));\n            });\n            return { nodes, edges };\n        });\n    }\n}\nFishboneLayout.defaultOptions = {\n    direction: 'RL',\n    getRibSep: () => 60,\n};\nconst assignElementStyle = (element, style) => {\n    return Object.assign(Object.assign({}, element), { style: Object.assign(Object.assign({}, (element.style || {})), style) });\n};\nconst isRoot = (node) => node.depth === 0;\nconst isAtEvenDepth = (node) => (node.depth || (node.depth = 0)) % 2 === 0;\n//# sourceMappingURL=fishbone.js.map"],"names":["result","_a"],"mappings":";;;;;AAAA,IAAI,YAAwC,SAAU,SAAS,YAAY,GAAG,WAAW;AACrF,WAAS,MAAM,OAAO;AAAE,WAAO,iBAAiB,IAAI,QAAQ,IAAI,EAAE,SAAU,SAAS;AAAE,cAAQ,KAAK;AAAA,IAAG,CAAC;AAAA,EAAG;AAC3G,SAAO,KAAK,MAAM,IAAI,UAAU,SAAU,SAAS,QAAQ;AACvD,aAAS,UAAU,OAAO;AAAE,UAAI;AAAE,aAAK,UAAU,KAAK,KAAK,CAAC;AAAA,MAAG,SAAS,GAAG;AAAE,eAAO,CAAC;AAAA,MAAG;AAAA,IAAE;AAC1F,aAAS,SAAS,OAAO;AAAE,UAAI;AAAE,aAAK,UAAU,OAAO,EAAE,KAAK,CAAC;AAAA,MAAG,SAAS,GAAG;AAAE,eAAO,CAAC;AAAA,MAAG;AAAA,IAAE;AAC7F,aAAS,KAAK,QAAQ;AAAE,aAAO,OAAO,QAAQ,OAAO,KAAK,IAAI,MAAM,OAAO,KAAK,EAAE,KAAK,WAAW,QAAQ;AAAA,IAAG;AAC7G,UAAM,YAAY,UAAU,MAAM,SAAS,cAAc,CAAA,CAAE,GAAG,MAAM;AAAA,EACxE,CAAC;AACL;AAcO,MAAM,uBAAuB,WAAW;AAAA,EAC3C,cAAc;AACV,UAAM,GAAG,SAAS;AAClB,SAAK,KAAK;AAAA,EACd;AAAA,EACA,UAAU;AACN,UAAM,QAAQ,KAAK,QAAQ,MAAM,aAAY;AAC7C,QAAI,QAAQ,KAAK,KAAK,MAAM,SAAS;AACjC;AACJ,WAAO,MAAM,CAAC;AAAA,EAClB;AAAA,EACA,WAAW,UAAU;AACjB,UAAM,eAAe,OAAO,aAAa,aAAa,WAAW,MAAM;AACvE,WAAO,CAAC,SAAS,UAAU,aAAa,IAAI,CAAC;AAAA,EACjD;AAAA,EACA,SAAS,MAAM,SAAS;AACpB,UAAM,EAAE,MAAM,WAAW,MAAM,UAAU,OAAM,IAAK;AACpD,UAAM,EAAE,UAAU,KAAK;AACvB,UAAM,UAAU,KAAK,WAAW,QAAQ;AACxC,QAAI,OAAO,QAAQ,IAAI,EAAE,CAAC,IAAI,UAAU,IAAI;AAC5C,UAAM,sBAAsB,CAAC,MAAMA,UAAS,MAAM;AAC9C,UAAI;AACJ,MAAAA,WAAU,SAAS,KAAK,YAAY,CAAA,GAAI,SAAS;AACjD,OAAC,KAAK,KAAK,cAAc,QAAQ,OAAO,SAAS,SAAS,GAAG,QAAQ,CAAC,YAAY;AAC9E,YAAIC;AACJ,cAAM,QAAQ,MAAM,iBAAiB,OAAO;AAC5C,SAACA,MAAK,MAAM,cAAc,QAAQA,QAAO,SAAS,SAASA,IAAG,QAAQ,CAAC,iBAAiB;AACpF,gBAAM,aAAa,MAAM,iBAAiB,YAAY;AACtD,UAAAD,UAAS,oBAAoB,YAAYA,OAAM;AAAA,QACnD,CAAC;AAAA,MACL,CAAC;AACD,aAAOA;AAAA,IACX;AACA,UAAM,oBAAoB,CAAC,SAAS;AAChC,UAAI,KAAK,UAAU;AACf,eAAO;AACX,YAAM,SAAS,MAAM,cAAc,KAAK,IAAI,MAAM;AAClD,UAAI,cAAc,IAAI,GAAG;AACrB,cAAM,WAAW,MAAM,cAAc,OAAO,IAAI,MAAM;AACtD,cAAM,SAAS,WAAW,IAAI,IAAI,WAAW,QAAQ;AACrD,eAAO,kBAAkB,MAAM,IAAK,SAAS,OAAQ;AAAA,MACzD,OACK;AACD,cAAM,aAAa,OAAO,YAAY,CAAA,GAAI,QAAQ,KAAK,EAAE;AACzD,cAAM,+BAA+B,MAAM,aAAa,OAAO,YAAY,CAAA,GAAI,MAAM,SAAS,CAAC;AAC/F,eAAQ,WAAW,MAAM,IACrB,6BAA6B,OAAO,CAAC,KAAK,YAAY,MAAM,oBAAoB,OAAO,GAAG,CAAC,IAC3F,QAAQ,MAAM,EAAE,CAAC,IAAI;AAAA,MAC7B;AAAA,IACJ;AACA,UAAM,aAAa,QAAQ,CAAC,SAAS;AACjC,UAAI,OAAO,IAAI;AACX,eAAO,QAAQ,IAAI,EAAE,CAAC,IAAI;AAC9B,YAAM,SAAS,MAAM,cAAc,KAAK,IAAI,MAAM;AAClD,UAAI,cAAc,IAAI,GAAG;AACrB,eAAO,kBAAkB,IAAI,IAAI,oBAAoB,IAAI,IAAI,QAAQ,IAAI,EAAE,CAAC,IAAI;AAAA,MACpF,OACK;AACD,cAAM,SAAS,WAAW,IAAI,IAAI,WAAW,MAAM;AACnD,cAAM,QAAQ,OAAO;AACrB,eAAO,kBAAkB,IAAI,IAAI,SAAS;AAAA,MAC9C;AAAA,IACJ,GAAG,CAAC,SAAS,KAAK,EAAE;AACpB,UAAM,aAAa,CAAC,WAAW,WAAW,MAAM,cAAc,QAAQ,MAAM,CAAC;AAC7E,UAAM,aAAa,QAAQ,CAAC,SAAS;AACjC,UAAI,OAAO,IAAI;AACX,eAAO,SAAS;AACpB,UAAI,CAAC,cAAc,IAAI,GAAG;AAEtB,YAAI,QAAQ,KAAK,QAAQ;AACrB,iBAAO,WAAW,KAAK,EAAE,IAAI;AAEjC,cAAM,YAAY,MAAM,iBAAiB,KAAK,SAAS,MAAM,EAAE,EAAE,CAAC,CAAC;AACnE,YAAI,QAAQ,UAAU,QAAQ;AAC1B,iBAAO,WAAW,SAAS,IAAI;AAEnC,cAAM,iBAAiB,MAAM,mBAAmB,KAAK,EAAE,EAAE,MAAM,EAAE,EAAE,CAAC;AACpE,gBAAQ,cAAc,cAAc,IAAI,WAAW,eAAe,EAAE,IAAI,WAAW,cAAc,KAAK;AAAA,MAC1G,OACK;AAED,cAAM,SAAS,MAAM,cAAc,KAAK,IAAI,MAAM;AAClD,cAAM,YAAY,OAAO,SAAS,QAAQ,KAAK,EAAE;AAEjD,YAAI,cAAc;AACd,iBAAO,WAAW,OAAO,EAAE,IAAI;AAEnC,cAAM,cAAc,MAAM,iBAAiB,OAAO,SAAS,YAAY,CAAC,CAAC;AACzE,YAAI,QAAQ,YAAY,QAAQ;AAC5B,iBAAO,WAAW,WAAW,IAAI;AAErC,cAAM,cAAc,MAAM,mBAAmB,YAAY,EAAE;AAC3D,eAAQ,KAAK,IAAI,GAAG,YAAY,IAAI,CAAC,eAAe,cAAc,UAAU,IAAI,WAAW,WAAW,EAAE,IAAI,WAAW,UAAU,CAAC,CAAC,IAAI;AAAA,MAC3I;AAAA,IACJ,GAAG,CAAC,SAAS,KAAK,EAAE;AACpB,QAAI,UAAU;AACd,UAAM,SAAS,EAAE,OAAO,CAAA,GAAI,OAAO,CAAA,EAAE;AACrC,UAAM,SAAS,CAAC,SAAS;AACrB,UAAI;AACJ,OAAC,KAAK,KAAK,cAAc,QAAQ,OAAO,SAAS,SAAS,GAAG,QAAQ,CAAC,YAAY,OAAO,MAAM,iBAAiB,OAAO,CAAC,CAAC;AACzH,YAAM,IAAI,WAAW,IAAI;AACzB,YAAM,IAAI,WAAW,IAAI;AACzB,aAAO,MAAM,KAAK,EAAE,IAAI,KAAK,IAAI,GAAG,GAAG;AACvC,UAAI,OAAO,IAAI;AACX;AACJ,YAAM,OAAO,MAAM,oBAAoB,KAAK,IAAI,IAAI,EAAE,CAAC;AACvD,YAAM,eAAe,CAAC,kBAAkB,IAAI,GAAG,cAAc,IAAI,IAAI,IAAI,WAAW,KAAK,EAAE,CAAC;AAC5F,aAAO,MAAM,KAAK,EAAE,IAAI,KAAK,IAAI,GAAG,eAAe,CAAC,YAAY,GAAG,eAAe,KAAK,GAAE,CAAE;AAC3F,gBAAU,KAAK,IAAI,SAAS,IAAI,UAAU,IAAI,CAAC;AAC/C,UAAI,KAAK,UAAU;AACf,eAAO;AAAA,IACf;AACA,WAAO,IAAI;AACX,WAAO;AAAA,EACX;AAAA,EACA,gBAAgB,QAAQ,MAAM;AAC1B,UAAM,kBAAkB,KAAK,YAAY,CAAA,GAAI,OAAO,CAAC,GAAG,UAAU,QAAQ,MAAM,CAAC;AACjF,QAAI,eAAe,WAAW;AAC1B,aAAO;AACX,UAAM,EAAE,UAAU,KAAK;AACvB,UAAM,QAAQ,OAAO,MAAM,KAAK,CAAC,SAAS,KAAK,OAAO,KAAK,EAAE,EAAE;AAC/D,UAAM,aAAa,CAAC,WAAW;AAC3B,YAAM,YAAY,MAAM,iBAAiB,QAAQ,MAAM;AACvD,UAAI,QAAQ,SAAS;AACjB,eAAO;AACX,YAAM,QAAQ,UAAU,WAAW,IAAI,SAAS,UAAU,UAAU,SAAS,CAAC,EAAE;AAChF,aAAO,eAAe,SAAS,KAAK;AAAA,IACxC;AACA,WAAO,MAAM,QAAQ,CAAC,SAAS;AAC3B,UAAI,WAAW,KAAK,EAAE;AAClB,aAAK,IAAI,IAAI,QAAQ,KAAK;AAAA,IAClC,CAAC;AACD,WAAO,MAAM,QAAQ,CAAC,SAAS;AAC3B,UAAI,WAAW,KAAK,aAAa,GAAG;AAChC,aAAK,gBAAgB,KAAK,cAAc,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,IAAI,QAAQ,MAAM,CAAC,CAAC,CAAC;AAAA,MAC3F;AAAA,IACJ,CAAC;AAAA,EACL;AAAA,EACA,YAAY,QAAQ,SAAS;AACzB,WAAO,MAAM,QAAQ,CAAC,SAAU,KAAK,IAAI,QAAQ,QAAQ,KAAK,CAAE;AAChE,WAAO,MAAM,QAAQ,CAAC,SAAS;AAC3B,WAAK,gBAAgB,KAAK,cAAc,IAAI,CAAC,UAAU,CAAC,QAAQ,QAAQ,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;AAAA,IAC/F,CAAC;AACD,WAAO;AAAA,EACX;AAAA,EACA,QAAQ,MAAM,aAAa;AACvB,WAAO,UAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,YAAM,UAAU,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO,CAAA,GAAI,eAAe,cAAc,GAAG,KAAK,OAAO,GAAG,WAAW;AACxH,YAAM,EAAE,WAAW,SAAQ,IAAK;AAChC,YAAM,OAAO,KAAK,QAAO;AACzB,UAAI,CAAC;AACD,eAAO;AACX,YAAM,UAAU,KAAK,WAAW,QAAQ;AACxC,cAAQ,SAAS,QAAQ,OAAO,KAAK,IAAI,IAAI,KAAK,SAAS,CAAA,GAAI,IAAI,CAAC,SAAS,QAAQ,IAAI,EAAE,CAAC,CAAC,CAAC;AAC9F,cAAQ,SAAS,QAAQ,OAAO,KAAK,IAAI,IAAI,KAAK,SAAS,CAAA,GAAI,IAAI,CAAC,SAAS,QAAQ,IAAI,EAAE,CAAC,CAAC,CAAC;AAC9F,UAAI,SAAS,KAAK,SAAS,MAAM,OAAO;AACxC,WAAK,gBAAgB,QAAQ,IAAI;AACjC,UAAI,cAAc,MAAM;AACpB,iBAAS,KAAK,YAAY,QAAQ,OAAO;AAAA,MAC7C;AACA,YAAM,EAAE,UAAU,KAAK;AACvB,YAAM,QAAQ,CAAA;AACd,YAAM,QAAQ,CAAA;AACd,aAAO,MAAM,QAAQ,CAAC,SAAS;AAC3B,cAAM,EAAE,IAAI,GAAG,EAAC,IAAK;AACrB,cAAM,WAAW,MAAM,iBAAiB,EAAE;AAC1C,cAAM,KAAK,mBAAmB,UAAU,EAAE,GAAG,EAAC,CAAE,CAAC;AAAA,MACrD,CAAC;AACD,aAAO,MAAM,QAAQ,CAAC,SAAS;AAC3B,cAAM,EAAE,IAAI,cAAa,IAAK;AAC9B,cAAM,WAAW,MAAM,aAAa,EAAE;AACtC,cAAM,KAAK,mBAAmB,UAAU,EAAE,cAAa,CAAE,CAAC;AAAA,MAC9D,CAAC;AACD,aAAO,EAAE,OAAO,MAAK;AAAA,IACzB,CAAC;AAAA,EACL;AACJ;AACA,eAAe,iBAAiB;AAAA,EAC5B,WAAW;AAAA,EACX,WAAW,MAAM;AACrB;AACA,MAAM,qBAAqB,CAAC,SAAS,UAAU;AAC3C,SAAO,OAAO,OAAO,OAAO,OAAO,CAAA,GAAI,OAAO,GAAG,EAAE,OAAO,OAAO,OAAO,OAAO,OAAO,IAAK,QAAQ,SAAS,CAAA,CAAE,GAAI,KAAK,GAAG;AAC9H;AACA,MAAM,SAAS,CAAC,SAAS,KAAK,UAAU;AACxC,MAAM,gBAAgB,CAAC,UAAU,KAAK,UAAU,KAAK,QAAQ,MAAM,MAAM;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_g6@5.1.0/node_modules/@antv/g6/esm/layouts/snake.cjs

@@ -0,0 +1,153 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const padding = require("../utils/padding.cjs");
+const size = require("../utils/size.cjs");
+const baseLayout = require("./base-layout.cjs");
+var __awaiter = function(thisArg, _arguments, P, generator) {
+  function adopt(value) {
+    return value instanceof P ? value : new P(function(resolve) {
+      resolve(value);
+    });
+  }
+  return new (P || (P = Promise))(function(resolve, reject) {
+    function fulfilled(value) {
+      try {
+        step(generator.next(value));
+      } catch (e) {
+        reject(e);
+      }
+    }
+    function rejected(value) {
+      try {
+        step(generator["throw"](value));
+      } catch (e) {
+        reject(e);
+      }
+    }
+    function step(result) {
+      result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected);
+    }
+    step((generator = generator.apply(thisArg, _arguments || [])).next());
+  });
+};
+class SnakeLayout extends baseLayout.BaseLayout {
+  constructor() {
+    super(...arguments);
+    this.id = "snake";
+  }
+  formatSize(nodes, size$1) {
+    const sizeFn = typeof size$1 === "function" ? size$1 : (() => size$1);
+    return nodes.reduce((acc, node) => {
+      const [w, h] = size.parseSize(sizeFn(node)) || [0, 0];
+      return [Math.max(acc[0], w), Math.max(acc[1], h)];
+    }, [0, 0]);
+  }
+  /**
+   * Validates the graph data to ensure it meets the requirements for linear arrangement.
+   * @param data - Graph data
+   * @returns false if the graph is not connected, has more than one source or sink node, or contains cycles.
+   */
+  validate(data) {
+    const { nodes = [], edges = [] } = data;
+    const inDegree = {};
+    const outDegree = {};
+    const adjList = {};
+    nodes.forEach((node) => {
+      inDegree[node.id] = 0;
+      outDegree[node.id] = 0;
+      adjList[node.id] = [];
+    });
+    edges.forEach((edge) => {
+      inDegree[edge.target]++;
+      outDegree[edge.source]++;
+      adjList[edge.source].push(edge.target);
+    });
+    const visited = /* @__PURE__ */ new Set();
+    const dfs = (nodeId) => {
+      if (visited.has(nodeId))
+        return;
+      visited.add(nodeId);
+      adjList[nodeId].forEach(dfs);
+    };
+    dfs(nodes[0].id);
+    if (visited.size !== nodes.length)
+      return false;
+    const sourceNodes = nodes.filter((node) => inDegree[node.id] === 0);
+    const sinkNodes = nodes.filter((node) => outDegree[node.id] === 0);
+    if (sourceNodes.length !== 1 || sinkNodes.length !== 1)
+      return false;
+    const middleNodes = nodes.filter((node) => inDegree[node.id] === 1 && outDegree[node.id] === 1);
+    if (middleNodes.length !== nodes.length - 2)
+      return false;
+    return true;
+  }
+  execute(model, options) {
+    return __awaiter(this, void 0, void 0, function* () {
+      var _a;
+      if (!this.validate(model))
+        return model;
+      const { nodeSize: propNodeSize, padding: propPadding, sortBy, cols, colGap: propColSep, rowGap: propRowSep, clockwise, width, height } = Object.assign({}, SnakeLayout.defaultOptions, this.options, options);
+      const [top, right, bottom, left] = padding.parsePadding(propPadding);
+      const nodeSize = this.formatSize(model.nodes || [], propNodeSize);
+      const rows = Math.ceil((model.nodes || []).length / cols);
+      let colSep = propColSep ? propColSep : (width - left - right - cols * nodeSize[0]) / (cols - 1);
+      let rowSep = propRowSep ? propRowSep : (height - top - bottom - rows * nodeSize[1]) / (rows - 1);
+      if (rowSep === Infinity || rowSep < 0)
+        rowSep = 0;
+      if (colSep === Infinity || colSep < 0)
+        colSep = 0;
+      const sortedNodes = sortBy ? (_a = model.nodes) === null || _a === void 0 ? void 0 : _a.sort(sortBy) : topologicalSort(model);
+      const nodes = (sortedNodes || []).map((node, index) => {
+        const rowIndex = Math.floor(index / cols);
+        const colIndex = index % cols;
+        const actualColIndex = clockwise ? rowIndex % 2 === 0 ? colIndex : cols - 1 - colIndex : rowIndex % 2 === 0 ? cols - 1 - colIndex : colIndex;
+        const x = left + actualColIndex * (nodeSize[0] + colSep) + nodeSize[0] / 2;
+        const y = top + rowIndex * (nodeSize[1] + rowSep) + nodeSize[1] / 2;
+        return {
+          id: node.id,
+          style: { x, y }
+        };
+      });
+      return { nodes };
+    });
+  }
+}
+SnakeLayout.defaultOptions = {
+  padding: 0,
+  cols: 5,
+  clockwise: true
+};
+function topologicalSort(data) {
+  const { nodes = [], edges = [] } = data;
+  const inDegree = {};
+  const adjList = {};
+  nodes.forEach((node) => {
+    inDegree[node.id] = 0;
+    adjList[node.id] = [];
+  });
+  edges.forEach((edge) => {
+    inDegree[edge.target]++;
+    adjList[edge.source].push(edge.target);
+  });
+  const queue = [];
+  const sortedNodes = [];
+  nodes.forEach((node) => {
+    if (inDegree[node.id] === 0) {
+      queue.push(node.id);
+    }
+  });
+  while (queue.length > 0) {
+    const nodeId = queue.shift();
+    const node = nodes.find((n) => n.id === nodeId);
+    sortedNodes.push(node);
+    adjList[nodeId].forEach((neighbor) => {
+      inDegree[neighbor]--;
+      if (inDegree[neighbor] === 0) {
+        queue.push(neighbor);
+      }
+    });
+  }
+  return sortedNodes;
+}
+exports.SnakeLayout = SnakeLayout;
+//# sourceMappingURL=snake.cjs.map