@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/utils/centrality.cjs

@@ -0,0 +1,134 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+require("../../../../../../@antv_algorithm@0.1.26/node_modules/@antv/algorithm/es/structs/linked-list.cjs");
+require("../../../../../../@antv_util@2.0.17/node_modules/@antv/util/esm/measure-text-width.cjs");
+const findPath = require("../../../../../../@antv_algorithm@0.1.26/node_modules/@antv/algorithm/es/find-path.cjs");
+require("../../../../../../@antv_algorithm@0.1.26/node_modules/@antv/algorithm/es/types.cjs");
+const pageRank = require("../../../../../../@antv_algorithm@0.1.26/node_modules/@antv/algorithm/es/pageRank.cjs");
+require("../../../../../../@antv_algorithm@0.1.26/node_modules/@antv/algorithm/es/structs/stack.cjs");
+const id = require("./id.cjs");
+const getNodeCentralities = (graphData, getRelatedEdgesData, centrality) => {
+  var _a;
+  switch (centrality.type) {
+    case "degree": {
+      const centralityResult = /* @__PURE__ */ new Map();
+      (_a = graphData.nodes) === null || _a === void 0 ? void 0 : _a.forEach((node) => {
+        const degree = getRelatedEdgesData(id.idOf(node), centrality.direction).length;
+        centralityResult.set(id.idOf(node), degree);
+      });
+      return centralityResult;
+    }
+    case "betweenness":
+      return computeNodeBetweennessCentrality(graphData, centrality.directed, centrality.weightPropertyName);
+    case "closeness":
+      return computeNodeClosenessCentrality(graphData, centrality.directed, centrality.weightPropertyName);
+    case "eigenvector":
+      return computeNodeEigenvectorCentrality(graphData, centrality.directed);
+    case "pagerank":
+      return computeNodePageRankCentrality(graphData, centrality.epsilon, centrality.linkProb);
+    default:
+      return initCentralityResult(graphData);
+  }
+};
+const initCentralityResult = (graphData) => {
+  var _a;
+  const centralityResult = /* @__PURE__ */ new Map();
+  (_a = graphData.nodes) === null || _a === void 0 ? void 0 : _a.forEach((node) => {
+    centralityResult.set(id.idOf(node), 0);
+  });
+  return centralityResult;
+};
+const computeNodeBetweennessCentrality = (graphData, directed, weightPropertyName) => {
+  const centralityResult = initCentralityResult(graphData);
+  const { nodes = [] } = graphData;
+  nodes.forEach((source) => {
+    nodes.forEach((target) => {
+      if (source !== target) {
+        const { allPath } = findPath.findShortestPath(graphData, id.idOf(source), id.idOf(target), directed, weightPropertyName);
+        const pathCount = allPath.length;
+        allPath.flat().forEach((nodeId) => {
+          if (nodeId !== id.idOf(source) && nodeId !== id.idOf(target)) {
+            centralityResult.set(nodeId, centralityResult.get(nodeId) + 1 / pathCount);
+          }
+        });
+      }
+    });
+  });
+  return centralityResult;
+};
+const computeNodeClosenessCentrality = (graphData, directed, weightPropertyName) => {
+  const centralityResult = /* @__PURE__ */ new Map();
+  const { nodes = [] } = graphData;
+  nodes.forEach((source) => {
+    const totalLength = nodes.reduce((acc, target) => {
+      if (source !== target) {
+        const { length } = findPath.findShortestPath(graphData, id.idOf(source), id.idOf(target), directed, weightPropertyName);
+        acc += length;
+      }
+      return acc;
+    }, 0);
+    centralityResult.set(id.idOf(source), 1 / totalLength);
+  });
+  return centralityResult;
+};
+const computeNodePageRankCentrality = (graphData, epsilon, linkProb) => {
+  var _a;
+  const centralityResult = /* @__PURE__ */ new Map();
+  const data = pageRank(graphData, epsilon, linkProb);
+  (_a = graphData.nodes) === null || _a === void 0 ? void 0 : _a.forEach((node) => {
+    centralityResult.set(id.idOf(node), data[id.idOf(node)]);
+  });
+  return centralityResult;
+};
+const computeNodeEigenvectorCentrality = (graphData, directed) => {
+  const { nodes = [] } = graphData;
+  const adjacencyMatrix = createAdjacencyMatrix(graphData, directed);
+  const eigenvector = powerIteration(adjacencyMatrix, nodes.length);
+  const centralityResult = /* @__PURE__ */ new Map();
+  nodes.forEach((node, index) => {
+    centralityResult.set(id.idOf(node), eigenvector[index]);
+  });
+  return centralityResult;
+};
+const createAdjacencyMatrix = (graphData, directed) => {
+  const { nodes = [], edges = [] } = graphData;
+  const matrix = Array(nodes.length).fill(null).map(() => Array(nodes.length).fill(0));
+  edges.forEach(({ source, target }) => {
+    const uIndex = nodes.findIndex((node) => id.idOf(node) === source);
+    const vIndex = nodes.findIndex((node) => id.idOf(node) === target);
+    if (directed) {
+      matrix[uIndex][vIndex] = 1;
+    } else {
+      matrix[uIndex][vIndex] = 1;
+      matrix[vIndex][uIndex] = 1;
+    }
+  });
+  return matrix;
+};
+const powerIteration = (matrix, numNodes, maxIterations = 100, tolerance = 1e-6) => {
+  let eigenvector = Array(numNodes).fill(1);
+  let diff = Infinity;
+  for (let iter = 0; iter < maxIterations && diff > tolerance; iter++) {
+    const newEigenvector = Array(numNodes).fill(0);
+    for (let i = 0; i < numNodes; i++) {
+      for (let j = 0; j < numNodes; j++) {
+        newEigenvector[i] += matrix[i][j] * eigenvector[j];
+      }
+    }
+    const norm = Math.sqrt(newEigenvector.reduce((sum, val) => sum + val * val, 0));
+    for (let i = 0; i < numNodes; i++) {
+      newEigenvector[i] /= norm;
+    }
+    diff = Math.sqrt(newEigenvector.reduce((sum, val, index) => sum + (val - eigenvector[index]) * val, 0));
+    eigenvector = newEigenvector;
+  }
+  return eigenvector;
+};
+exports.computeNodeBetweennessCentrality = computeNodeBetweennessCentrality;
+exports.computeNodeClosenessCentrality = computeNodeClosenessCentrality;
+exports.computeNodeEigenvectorCentrality = computeNodeEigenvectorCentrality;
+exports.computeNodePageRankCentrality = computeNodePageRankCentrality;
+exports.createAdjacencyMatrix = createAdjacencyMatrix;
+exports.getNodeCentralities = getNodeCentralities;
+exports.initCentralityResult = initCentralityResult;
+//# sourceMappingURL=centrality.cjs.map

package/dist/node_modules/.pnpm/@antv_g6@5.1.0/node_modules/@antv/g6/esm/utils/centrality.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"centrality.cjs","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+g6@5.1.0/node_modules/@antv/g6/esm/utils/centrality.js"],"sourcesContent":["import { findShortestPath, pageRank } from '@antv/algorithm';\nimport { idOf } from './id';\nexport const getNodeCentralities = (graphData, getRelatedEdgesData, centrality) => {\n    var _a;\n    switch (centrality.type) {\n        case 'degree': {\n            const centralityResult = new Map();\n            (_a = graphData.nodes) === null || _a === void 0 ? void 0 : _a.forEach((node) => {\n                const degree = getRelatedEdgesData(idOf(node), centrality.direction).length;\n                centralityResult.set(idOf(node), degree);\n            });\n            return centralityResult;\n        }\n        case 'betweenness':\n            return computeNodeBetweennessCentrality(graphData, centrality.directed, centrality.weightPropertyName);\n        case 'closeness':\n            return computeNodeClosenessCentrality(graphData, centrality.directed, centrality.weightPropertyName);\n        case 'eigenvector':\n            return computeNodeEigenvectorCentrality(graphData, centrality.directed);\n        case 'pagerank':\n            return computeNodePageRankCentrality(graphData, centrality.epsilon, centrality.linkProb);\n        default:\n            return initCentralityResult(graphData);\n    }\n};\nexport const initCentralityResult = (graphData) => {\n    var _a;\n    const centralityResult = new Map();\n    (_a = graphData.nodes) === null || _a === void 0 ? void 0 : _a.forEach((node) => {\n        centralityResult.set(idOf(node), 0);\n    });\n    return centralityResult;\n};\n/**\n * <zh/> 计算图中每个节点的中介中心性\n *\n * <en/> Calculate the betweenness centrality for each node in the graph\n * @param graphData - <zh/> 图数据 | <en/>Graph data\n * @param directed - <zh/> 是否为有向图 | <en/>Whether the graph is directed\n * @param weightPropertyName - <zh/> 边的权重属性名 | <en/>The weight property name of the edge\n * @returns <zh/> 每个节点的中介中心性值 | <en/>The betweenness centrality for each node\n */\nexport const computeNodeBetweennessCentrality = (graphData, directed, weightPropertyName) => {\n    const centralityResult = initCentralityResult(graphData);\n    const { nodes = [] } = graphData;\n    nodes.forEach((source) => {\n        nodes.forEach((target) => {\n            if (source !== target) {\n                const { allPath } = findShortestPath(graphData, idOf(source), idOf(target), directed, weightPropertyName);\n                const pathCount = allPath.length;\n                allPath.flat().forEach((nodeId) => {\n                    if (nodeId !== idOf(source) && nodeId !== idOf(target)) {\n                        centralityResult.set(nodeId, centralityResult.get(nodeId) + 1 / pathCount);\n                    }\n                });\n            }\n        });\n    });\n    return centralityResult;\n};\n/**\n * <zh/> 计算图中每个节点的接近中心性\n *\n * <en/> Calculate the closeness centrality for each node in the graph\n * @param graphData - <zh/> 图数据 | <en/>Graph data\n * @param directed - <zh/> 是否为有向图 | <en/>Whether the graph is directed\n * @param weightPropertyName - <zh/> 边的权重属性名 | <en/>The weight property name of the edge\n * @returns <zh/> 每个节点的接近中心性值 | <en/>The closeness centrality for each node\n */\nexport const computeNodeClosenessCentrality = (graphData, directed, weightPropertyName) => {\n    const centralityResult = new Map();\n    const { nodes = [] } = graphData;\n    nodes.forEach((source) => {\n        const totalLength = nodes.reduce((acc, target) => {\n            if (source !== target) {\n                const { length } = findShortestPath(graphData, idOf(source), idOf(target), directed, weightPropertyName);\n                acc += length;\n            }\n            return acc;\n        }, 0);\n        centralityResult.set(idOf(source), 1 / totalLength);\n    });\n    return centralityResult;\n};\n/**\n * <zh/> 计算图中每个节点的 PageRank 中心性\n *\n * <en/> Calculate the PageRank centrality for each node in the graph\n * @param graphData - <zh/> 图数据 | <en/>Graph data\n * @param epsilon - <zh/> PageRank 算法的收敛容差 | <en/>The convergence tolerance of the PageRank algorithm\n * @param linkProb - <zh/> PageRank 算法的阻尼系数，指任意时刻，用户访问到某节点后继续访问该节点链接的下一个节点的概率，经验值 0.85 | <en/>The damping factor of the PageRank algorithm, which refers to the probability that a user will continue to visit the next node linked to a node at any time, with an empirical value of 0.85\n * @returns <zh/> 每个节点的 PageRank 中心性值 | <en/>The PageRank centrality for each node\n */\nexport const computeNodePageRankCentrality = (graphData, epsilon, linkProb) => {\n    var _a;\n    const centralityResult = new Map();\n    const data = pageRank(graphData, epsilon, linkProb);\n    (_a = graphData.nodes) === null || _a === void 0 ? void 0 : _a.forEach((node) => {\n        centralityResult.set(idOf(node), data[idOf(node)]);\n    });\n    return centralityResult;\n};\n/**\n * <zh/> 计算图中每个节点的特征向量中心性\n *\n * <en/> Calculate the eigenvector centrality for each node in the graph.\n * @param graphData - <zh/> 图数据 | <en/>Graph data\n * @param directed - <zh/> 是否为有向图 | <en/>Whether the graph is directed\n * @returns 每个节点的特征向量中心性值 The eigenvector centrality for each node.\n */\nexport const computeNodeEigenvectorCentrality = (graphData, directed) => {\n    const { nodes = [] } = graphData;\n    const adjacencyMatrix = createAdjacencyMatrix(graphData, directed);\n    const eigenvector = powerIteration(adjacencyMatrix, nodes.length);\n    const centralityResult = new Map();\n    nodes.forEach((node, index) => {\n        centralityResult.set(idOf(node), eigenvector[index]);\n    });\n    return centralityResult;\n};\n/**\n * <zh/> 创建图的邻接矩阵\n *\n * <en/> Create the adjacency matrix for the graph.\n * @param graphData - <zh/> 图数据 | <en/>Graph data\n * @param directed - <zh/> 是否为有向图 | <en/>Whether the graph is directed\n * @returns <zh/> 邻接矩阵 | <en/>The adjacency matrix\n */\nexport const createAdjacencyMatrix = (graphData, directed) => {\n    const { nodes = [], edges = [] } = graphData;\n    const matrix = Array(nodes.length)\n        .fill(null)\n        .map(() => Array(nodes.length).fill(0));\n    edges.forEach(({ source, target }) => {\n        const uIndex = nodes.findIndex((node) => idOf(node) === source);\n        const vIndex = nodes.findIndex((node) => idOf(node) === target);\n        if (directed) {\n            matrix[uIndex][vIndex] = 1;\n        }\n        else {\n            matrix[uIndex][vIndex] = 1;\n            matrix[vIndex][uIndex] = 1;\n        }\n    });\n    return matrix;\n};\n/**\n * <zh/> 使用幂迭代法计算主特征向量\n *\n * <en/> Calculate the principal eigenvector using the power iteration method\n * @see https://en.wikipedia.org/wiki/Eigenvalues_and_eigenvectors\n * @param matrix - <zh/> 邻接矩阵 | <en/> The adjacency matrix\n * @param numNodes - <zh/> 节点数量 | <en/> The number of nodes\n * @param maxIterations - <zh/> 最大迭代次数 | <en/> The maximum number of iterations\n * @param tolerance - <zh/> 收敛容差 | <en/> The convergence tolerance\n * @returns <zh/> 主特征向量 | <en/> The principal eigenvector\n */\nconst powerIteration = (matrix, numNodes, maxIterations = 100, tolerance = 1e-6) => {\n    let eigenvector = Array(numNodes).fill(1);\n    let diff = Infinity;\n    for (let iter = 0; iter < maxIterations && diff > tolerance; iter++) {\n        const newEigenvector = Array(numNodes).fill(0);\n        for (let i = 0; i < numNodes; i++) {\n            for (let j = 0; j < numNodes; j++) {\n                newEigenvector[i] += matrix[i][j] * eigenvector[j];\n            }\n        }\n        const norm = Math.sqrt(newEigenvector.reduce((sum, val) => sum + val * val, 0));\n        for (let i = 0; i < numNodes; i++) {\n            newEigenvector[i] /= norm;\n        }\n        diff = Math.sqrt(newEigenvector.reduce((sum, val, index) => sum + (val - eigenvector[index]) * val, 0));\n        eigenvector = newEigenvector;\n    }\n    return eigenvector;\n};\n//# sourceMappingURL=centrality.js.map"],"names":["idOf","findShortestPath"],"mappings":";;;;;;;;;AAEY,MAAC,sBAAsB,CAAC,WAAW,qBAAqB,eAAe;AAC/E,MAAI;AACJ,UAAQ,WAAW,MAAI;AAAA,IACnB,KAAK,UAAU;AACX,YAAM,mBAAmB,oBAAI,IAAG;AAChC,OAAC,KAAK,UAAU,WAAW,QAAQ,OAAO,SAAS,SAAS,GAAG,QAAQ,CAAC,SAAS;AAC7E,cAAM,SAAS,oBAAoBA,GAAAA,KAAK,IAAI,GAAG,WAAW,SAAS,EAAE;AACrE,yBAAiB,IAAIA,GAAAA,KAAK,IAAI,GAAG,MAAM;AAAA,MAC3C,CAAC;AACD,aAAO;AAAA,IACX;AAAA,IACA,KAAK;AACD,aAAO,iCAAiC,WAAW,WAAW,UAAU,WAAW,kBAAkB;AAAA,IACzG,KAAK;AACD,aAAO,+BAA+B,WAAW,WAAW,UAAU,WAAW,kBAAkB;AAAA,IACvG,KAAK;AACD,aAAO,iCAAiC,WAAW,WAAW,QAAQ;AAAA,IAC1E,KAAK;AACD,aAAO,8BAA8B,WAAW,WAAW,SAAS,WAAW,QAAQ;AAAA,IAC3F;AACI,aAAO,qBAAqB,SAAS;AAAA,EACjD;AACA;AACY,MAAC,uBAAuB,CAAC,cAAc;AAC/C,MAAI;AACJ,QAAM,mBAAmB,oBAAI,IAAG;AAChC,GAAC,KAAK,UAAU,WAAW,QAAQ,OAAO,SAAS,SAAS,GAAG,QAAQ,CAAC,SAAS;AAC7E,qBAAiB,IAAIA,GAAAA,KAAK,IAAI,GAAG,CAAC;AAAA,EACtC,CAAC;AACD,SAAO;AACX;AAUY,MAAC,mCAAmC,CAAC,WAAW,UAAU,uBAAuB;AACzF,QAAM,mBAAmB,qBAAqB,SAAS;AACvD,QAAM,EAAE,QAAQ,CAAA,EAAE,IAAK;AACvB,QAAM,QAAQ,CAAC,WAAW;AACtB,UAAM,QAAQ,CAAC,WAAW;AACtB,UAAI,WAAW,QAAQ;AACnB,cAAM,EAAE,QAAO,IAAKC,SAAAA,iBAAiB,WAAWD,GAAAA,KAAK,MAAM,GAAGA,QAAK,MAAM,GAAG,UAAU,kBAAkB;AACxG,cAAM,YAAY,QAAQ;AAC1B,gBAAQ,KAAI,EAAG,QAAQ,CAAC,WAAW;AAC/B,cAAI,WAAWA,GAAAA,KAAK,MAAM,KAAK,WAAWA,GAAAA,KAAK,MAAM,GAAG;AACpD,6BAAiB,IAAI,QAAQ,iBAAiB,IAAI,MAAM,IAAI,IAAI,SAAS;AAAA,UAC7E;AAAA,QACJ,CAAC;AAAA,MACL;AAAA,IACJ,CAAC;AAAA,EACL,CAAC;AACD,SAAO;AACX;AAUY,MAAC,iCAAiC,CAAC,WAAW,UAAU,uBAAuB;AACvF,QAAM,mBAAmB,oBAAI,IAAG;AAChC,QAAM,EAAE,QAAQ,CAAA,EAAE,IAAK;AACvB,QAAM,QAAQ,CAAC,WAAW;AACtB,UAAM,cAAc,MAAM,OAAO,CAAC,KAAK,WAAW;AAC9C,UAAI,WAAW,QAAQ;AACnB,cAAM,EAAE,OAAM,IAAKC,SAAAA,iBAAiB,WAAWD,GAAAA,KAAK,MAAM,GAAGA,QAAK,MAAM,GAAG,UAAU,kBAAkB;AACvG,eAAO;AAAA,MACX;AACA,aAAO;AAAA,IACX,GAAG,CAAC;AACJ,qBAAiB,IAAIA,GAAAA,KAAK,MAAM,GAAG,IAAI,WAAW;AAAA,EACtD,CAAC;AACD,SAAO;AACX;AAUY,MAAC,gCAAgC,CAAC,WAAW,SAAS,aAAa;AAC3E,MAAI;AACJ,QAAM,mBAAmB,oBAAI,IAAG;AAChC,QAAM,OAAO,SAAS,WAAW,SAAS,QAAQ;AAClD,GAAC,KAAK,UAAU,WAAW,QAAQ,OAAO,SAAS,SAAS,GAAG,QAAQ,CAAC,SAAS;AAC7E,qBAAiB,IAAIA,GAAAA,KAAK,IAAI,GAAG,KAAKA,GAAAA,KAAK,IAAI,CAAC,CAAC;AAAA,EACrD,CAAC;AACD,SAAO;AACX;AASY,MAAC,mCAAmC,CAAC,WAAW,aAAa;AACrE,QAAM,EAAE,QAAQ,CAAA,EAAE,IAAK;AACvB,QAAM,kBAAkB,sBAAsB,WAAW,QAAQ;AACjE,QAAM,cAAc,eAAe,iBAAiB,MAAM,MAAM;AAChE,QAAM,mBAAmB,oBAAI,IAAG;AAChC,QAAM,QAAQ,CAAC,MAAM,UAAU;AAC3B,qBAAiB,IAAIA,GAAAA,KAAK,IAAI,GAAG,YAAY,KAAK,CAAC;AAAA,EACvD,CAAC;AACD,SAAO;AACX;AASY,MAAC,wBAAwB,CAAC,WAAW,aAAa;AAC1D,QAAM,EAAE,QAAQ,CAAA,GAAI,QAAQ,CAAA,EAAE,IAAK;AACnC,QAAM,SAAS,MAAM,MAAM,MAAM,EAC5B,KAAK,IAAI,EACT,IAAI,MAAM,MAAM,MAAM,MAAM,EAAE,KAAK,CAAC,CAAC;AAC1C,QAAM,QAAQ,CAAC,EAAE,QAAQ,OAAM,MAAO;AAClC,UAAM,SAAS,MAAM,UAAU,CAAC,SAASA,QAAK,IAAI,MAAM,MAAM;AAC9D,UAAM,SAAS,MAAM,UAAU,CAAC,SAASA,QAAK,IAAI,MAAM,MAAM;AAC9D,QAAI,UAAU;AACV,aAAO,MAAM,EAAE,MAAM,IAAI;AAAA,IAC7B,OACK;AACD,aAAO,MAAM,EAAE,MAAM,IAAI;AACzB,aAAO,MAAM,EAAE,MAAM,IAAI;AAAA,IAC7B;AAAA,EACJ,CAAC;AACD,SAAO;AACX;AAYA,MAAM,iBAAiB,CAAC,QAAQ,UAAU,gBAAgB,KAAK,YAAY,SAAS;AAChF,MAAI,cAAc,MAAM,QAAQ,EAAE,KAAK,CAAC;AACxC,MAAI,OAAO;AACX,WAAS,OAAO,GAAG,OAAO,iBAAiB,OAAO,WAAW,QAAQ;AACjE,UAAM,iBAAiB,MAAM,QAAQ,EAAE,KAAK,CAAC;AAC7C,aAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AAC/B,eAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AAC/B,uBAAe,CAAC,KAAK,OAAO,CAAC,EAAE,CAAC,IAAI,YAAY,CAAC;AAAA,MACrD;AAAA,IACJ;AACA,UAAM,OAAO,KAAK,KAAK,eAAe,OAAO,CAAC,KAAK,QAAQ,MAAM,MAAM,KAAK,CAAC,CAAC;AAC9E,aAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AAC/B,qBAAe,CAAC,KAAK;AAAA,IACzB;AACA,WAAO,KAAK,KAAK,eAAe,OAAO,CAAC,KAAK,KAAK,UAAU,OAAO,MAAM,YAAY,KAAK,KAAK,KAAK,CAAC,CAAC;AACtG,kBAAc;AAAA,EAClB;AACA,SAAO;AACX;;;;;;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_g6@5.1.0/node_modules/@antv/g6/esm/utils/centrality.js

@@ -0,0 +1,134 @@
+import "../../../../../../@antv_algorithm@0.1.26/node_modules/@antv/algorithm/es/structs/linked-list.js";
+import "../../../../../../@antv_util@2.0.17/node_modules/@antv/util/esm/measure-text-width.js";
+import { findShortestPath } from "../../../../../../@antv_algorithm@0.1.26/node_modules/@antv/algorithm/es/find-path.js";
+import "../../../../../../@antv_algorithm@0.1.26/node_modules/@antv/algorithm/es/types.js";
+import pageRank from "../../../../../../@antv_algorithm@0.1.26/node_modules/@antv/algorithm/es/pageRank.js";
+import "../../../../../../@antv_algorithm@0.1.26/node_modules/@antv/algorithm/es/structs/stack.js";
+import { idOf } from "./id.js";
+const getNodeCentralities = (graphData, getRelatedEdgesData, centrality) => {
+  var _a;
+  switch (centrality.type) {
+    case "degree": {
+      const centralityResult = /* @__PURE__ */ new Map();
+      (_a = graphData.nodes) === null || _a === void 0 ? void 0 : _a.forEach((node) => {
+        const degree = getRelatedEdgesData(idOf(node), centrality.direction).length;
+        centralityResult.set(idOf(node), degree);
+      });
+      return centralityResult;
+    }
+    case "betweenness":
+      return computeNodeBetweennessCentrality(graphData, centrality.directed, centrality.weightPropertyName);
+    case "closeness":
+      return computeNodeClosenessCentrality(graphData, centrality.directed, centrality.weightPropertyName);
+    case "eigenvector":
+      return computeNodeEigenvectorCentrality(graphData, centrality.directed);
+    case "pagerank":
+      return computeNodePageRankCentrality(graphData, centrality.epsilon, centrality.linkProb);
+    default:
+      return initCentralityResult(graphData);
+  }
+};
+const initCentralityResult = (graphData) => {
+  var _a;
+  const centralityResult = /* @__PURE__ */ new Map();
+  (_a = graphData.nodes) === null || _a === void 0 ? void 0 : _a.forEach((node) => {
+    centralityResult.set(idOf(node), 0);
+  });
+  return centralityResult;
+};
+const computeNodeBetweennessCentrality = (graphData, directed, weightPropertyName) => {
+  const centralityResult = initCentralityResult(graphData);
+  const { nodes = [] } = graphData;
+  nodes.forEach((source) => {
+    nodes.forEach((target) => {
+      if (source !== target) {
+        const { allPath } = findShortestPath(graphData, idOf(source), idOf(target), directed, weightPropertyName);
+        const pathCount = allPath.length;
+        allPath.flat().forEach((nodeId) => {
+          if (nodeId !== idOf(source) && nodeId !== idOf(target)) {
+            centralityResult.set(nodeId, centralityResult.get(nodeId) + 1 / pathCount);
+          }
+        });
+      }
+    });
+  });
+  return centralityResult;
+};
+const computeNodeClosenessCentrality = (graphData, directed, weightPropertyName) => {
+  const centralityResult = /* @__PURE__ */ new Map();
+  const { nodes = [] } = graphData;
+  nodes.forEach((source) => {
+    const totalLength = nodes.reduce((acc, target) => {
+      if (source !== target) {
+        const { length } = findShortestPath(graphData, idOf(source), idOf(target), directed, weightPropertyName);
+        acc += length;
+      }
+      return acc;
+    }, 0);
+    centralityResult.set(idOf(source), 1 / totalLength);
+  });
+  return centralityResult;
+};
+const computeNodePageRankCentrality = (graphData, epsilon, linkProb) => {
+  var _a;
+  const centralityResult = /* @__PURE__ */ new Map();
+  const data = pageRank(graphData, epsilon, linkProb);
+  (_a = graphData.nodes) === null || _a === void 0 ? void 0 : _a.forEach((node) => {
+    centralityResult.set(idOf(node), data[idOf(node)]);
+  });
+  return centralityResult;
+};
+const computeNodeEigenvectorCentrality = (graphData, directed) => {
+  const { nodes = [] } = graphData;
+  const adjacencyMatrix = createAdjacencyMatrix(graphData, directed);
+  const eigenvector = powerIteration(adjacencyMatrix, nodes.length);
+  const centralityResult = /* @__PURE__ */ new Map();
+  nodes.forEach((node, index) => {
+    centralityResult.set(idOf(node), eigenvector[index]);
+  });
+  return centralityResult;
+};
+const createAdjacencyMatrix = (graphData, directed) => {
+  const { nodes = [], edges = [] } = graphData;
+  const matrix = Array(nodes.length).fill(null).map(() => Array(nodes.length).fill(0));
+  edges.forEach(({ source, target }) => {
+    const uIndex = nodes.findIndex((node) => idOf(node) === source);
+    const vIndex = nodes.findIndex((node) => idOf(node) === target);
+    if (directed) {
+      matrix[uIndex][vIndex] = 1;
+    } else {
+      matrix[uIndex][vIndex] = 1;
+      matrix[vIndex][uIndex] = 1;
+    }
+  });
+  return matrix;
+};
+const powerIteration = (matrix, numNodes, maxIterations = 100, tolerance = 1e-6) => {
+  let eigenvector = Array(numNodes).fill(1);
+  let diff = Infinity;
+  for (let iter = 0; iter < maxIterations && diff > tolerance; iter++) {
+    const newEigenvector = Array(numNodes).fill(0);
+    for (let i = 0; i < numNodes; i++) {
+      for (let j = 0; j < numNodes; j++) {
+        newEigenvector[i] += matrix[i][j] * eigenvector[j];
+      }
+    }
+    const norm = Math.sqrt(newEigenvector.reduce((sum, val) => sum + val * val, 0));
+    for (let i = 0; i < numNodes; i++) {
+      newEigenvector[i] /= norm;
+    }
+    diff = Math.sqrt(newEigenvector.reduce((sum, val, index) => sum + (val - eigenvector[index]) * val, 0));
+    eigenvector = newEigenvector;
+  }
+  return eigenvector;
+};
+export {
+  computeNodeBetweennessCentrality,
+  computeNodeClosenessCentrality,
+  computeNodeEigenvectorCentrality,
+  computeNodePageRankCentrality,
+  createAdjacencyMatrix,
+  getNodeCentralities,
+  initCentralityResult
+};
+//# sourceMappingURL=centrality.js.map

package/dist/node_modules/.pnpm/@antv_g6@5.1.0/node_modules/@antv/g6/esm/utils/centrality.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"centrality.js","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+g6@5.1.0/node_modules/@antv/g6/esm/utils/centrality.js"],"sourcesContent":["import { findShortestPath, pageRank } from '@antv/algorithm';\nimport { idOf } from './id';\nexport const getNodeCentralities = (graphData, getRelatedEdgesData, centrality) => {\n    var _a;\n    switch (centrality.type) {\n        case 'degree': {\n            const centralityResult = new Map();\n            (_a = graphData.nodes) === null || _a === void 0 ? void 0 : _a.forEach((node) => {\n                const degree = getRelatedEdgesData(idOf(node), centrality.direction).length;\n                centralityResult.set(idOf(node), degree);\n            });\n            return centralityResult;\n        }\n        case 'betweenness':\n            return computeNodeBetweennessCentrality(graphData, centrality.directed, centrality.weightPropertyName);\n        case 'closeness':\n            return computeNodeClosenessCentrality(graphData, centrality.directed, centrality.weightPropertyName);\n        case 'eigenvector':\n            return computeNodeEigenvectorCentrality(graphData, centrality.directed);\n        case 'pagerank':\n            return computeNodePageRankCentrality(graphData, centrality.epsilon, centrality.linkProb);\n        default:\n            return initCentralityResult(graphData);\n    }\n};\nexport const initCentralityResult = (graphData) => {\n    var _a;\n    const centralityResult = new Map();\n    (_a = graphData.nodes) === null || _a === void 0 ? void 0 : _a.forEach((node) => {\n        centralityResult.set(idOf(node), 0);\n    });\n    return centralityResult;\n};\n/**\n * <zh/> 计算图中每个节点的中介中心性\n *\n * <en/> Calculate the betweenness centrality for each node in the graph\n * @param graphData - <zh/> 图数据 | <en/>Graph data\n * @param directed - <zh/> 是否为有向图 | <en/>Whether the graph is directed\n * @param weightPropertyName - <zh/> 边的权重属性名 | <en/>The weight property name of the edge\n * @returns <zh/> 每个节点的中介中心性值 | <en/>The betweenness centrality for each node\n */\nexport const computeNodeBetweennessCentrality = (graphData, directed, weightPropertyName) => {\n    const centralityResult = initCentralityResult(graphData);\n    const { nodes = [] } = graphData;\n    nodes.forEach((source) => {\n        nodes.forEach((target) => {\n            if (source !== target) {\n                const { allPath } = findShortestPath(graphData, idOf(source), idOf(target), directed, weightPropertyName);\n                const pathCount = allPath.length;\n                allPath.flat().forEach((nodeId) => {\n                    if (nodeId !== idOf(source) && nodeId !== idOf(target)) {\n                        centralityResult.set(nodeId, centralityResult.get(nodeId) + 1 / pathCount);\n                    }\n                });\n            }\n        });\n    });\n    return centralityResult;\n};\n/**\n * <zh/> 计算图中每个节点的接近中心性\n *\n * <en/> Calculate the closeness centrality for each node in the graph\n * @param graphData - <zh/> 图数据 | <en/>Graph data\n * @param directed - <zh/> 是否为有向图 | <en/>Whether the graph is directed\n * @param weightPropertyName - <zh/> 边的权重属性名 | <en/>The weight property name of the edge\n * @returns <zh/> 每个节点的接近中心性值 | <en/>The closeness centrality for each node\n */\nexport const computeNodeClosenessCentrality = (graphData, directed, weightPropertyName) => {\n    const centralityResult = new Map();\n    const { nodes = [] } = graphData;\n    nodes.forEach((source) => {\n        const totalLength = nodes.reduce((acc, target) => {\n            if (source !== target) {\n                const { length } = findShortestPath(graphData, idOf(source), idOf(target), directed, weightPropertyName);\n                acc += length;\n            }\n            return acc;\n        }, 0);\n        centralityResult.set(idOf(source), 1 / totalLength);\n    });\n    return centralityResult;\n};\n/**\n * <zh/> 计算图中每个节点的 PageRank 中心性\n *\n * <en/> Calculate the PageRank centrality for each node in the graph\n * @param graphData - <zh/> 图数据 | <en/>Graph data\n * @param epsilon - <zh/> PageRank 算法的收敛容差 | <en/>The convergence tolerance of the PageRank algorithm\n * @param linkProb - <zh/> PageRank 算法的阻尼系数，指任意时刻，用户访问到某节点后继续访问该节点链接的下一个节点的概率，经验值 0.85 | <en/>The damping factor of the PageRank algorithm, which refers to the probability that a user will continue to visit the next node linked to a node at any time, with an empirical value of 0.85\n * @returns <zh/> 每个节点的 PageRank 中心性值 | <en/>The PageRank centrality for each node\n */\nexport const computeNodePageRankCentrality = (graphData, epsilon, linkProb) => {\n    var _a;\n    const centralityResult = new Map();\n    const data = pageRank(graphData, epsilon, linkProb);\n    (_a = graphData.nodes) === null || _a === void 0 ? void 0 : _a.forEach((node) => {\n        centralityResult.set(idOf(node), data[idOf(node)]);\n    });\n    return centralityResult;\n};\n/**\n * <zh/> 计算图中每个节点的特征向量中心性\n *\n * <en/> Calculate the eigenvector centrality for each node in the graph.\n * @param graphData - <zh/> 图数据 | <en/>Graph data\n * @param directed - <zh/> 是否为有向图 | <en/>Whether the graph is directed\n * @returns 每个节点的特征向量中心性值 The eigenvector centrality for each node.\n */\nexport const computeNodeEigenvectorCentrality = (graphData, directed) => {\n    const { nodes = [] } = graphData;\n    const adjacencyMatrix = createAdjacencyMatrix(graphData, directed);\n    const eigenvector = powerIteration(adjacencyMatrix, nodes.length);\n    const centralityResult = new Map();\n    nodes.forEach((node, index) => {\n        centralityResult.set(idOf(node), eigenvector[index]);\n    });\n    return centralityResult;\n};\n/**\n * <zh/> 创建图的邻接矩阵\n *\n * <en/> Create the adjacency matrix for the graph.\n * @param graphData - <zh/> 图数据 | <en/>Graph data\n * @param directed - <zh/> 是否为有向图 | <en/>Whether the graph is directed\n * @returns <zh/> 邻接矩阵 | <en/>The adjacency matrix\n */\nexport const createAdjacencyMatrix = (graphData, directed) => {\n    const { nodes = [], edges = [] } = graphData;\n    const matrix = Array(nodes.length)\n        .fill(null)\n        .map(() => Array(nodes.length).fill(0));\n    edges.forEach(({ source, target }) => {\n        const uIndex = nodes.findIndex((node) => idOf(node) === source);\n        const vIndex = nodes.findIndex((node) => idOf(node) === target);\n        if (directed) {\n            matrix[uIndex][vIndex] = 1;\n        }\n        else {\n            matrix[uIndex][vIndex] = 1;\n            matrix[vIndex][uIndex] = 1;\n        }\n    });\n    return matrix;\n};\n/**\n * <zh/> 使用幂迭代法计算主特征向量\n *\n * <en/> Calculate the principal eigenvector using the power iteration method\n * @see https://en.wikipedia.org/wiki/Eigenvalues_and_eigenvectors\n * @param matrix - <zh/> 邻接矩阵 | <en/> The adjacency matrix\n * @param numNodes - <zh/> 节点数量 | <en/> The number of nodes\n * @param maxIterations - <zh/> 最大迭代次数 | <en/> The maximum number of iterations\n * @param tolerance - <zh/> 收敛容差 | <en/> The convergence tolerance\n * @returns <zh/> 主特征向量 | <en/> The principal eigenvector\n */\nconst powerIteration = (matrix, numNodes, maxIterations = 100, tolerance = 1e-6) => {\n    let eigenvector = Array(numNodes).fill(1);\n    let diff = Infinity;\n    for (let iter = 0; iter < maxIterations && diff > tolerance; iter++) {\n        const newEigenvector = Array(numNodes).fill(0);\n        for (let i = 0; i < numNodes; i++) {\n            for (let j = 0; j < numNodes; j++) {\n                newEigenvector[i] += matrix[i][j] * eigenvector[j];\n            }\n        }\n        const norm = Math.sqrt(newEigenvector.reduce((sum, val) => sum + val * val, 0));\n        for (let i = 0; i < numNodes; i++) {\n            newEigenvector[i] /= norm;\n        }\n        diff = Math.sqrt(newEigenvector.reduce((sum, val, index) => sum + (val - eigenvector[index]) * val, 0));\n        eigenvector = newEigenvector;\n    }\n    return eigenvector;\n};\n//# sourceMappingURL=centrality.js.map"],"names":[],"mappings":";;;;;;;AAEY,MAAC,sBAAsB,CAAC,WAAW,qBAAqB,eAAe;AAC/E,MAAI;AACJ,UAAQ,WAAW,MAAI;AAAA,IACnB,KAAK,UAAU;AACX,YAAM,mBAAmB,oBAAI,IAAG;AAChC,OAAC,KAAK,UAAU,WAAW,QAAQ,OAAO,SAAS,SAAS,GAAG,QAAQ,CAAC,SAAS;AAC7E,cAAM,SAAS,oBAAoB,KAAK,IAAI,GAAG,WAAW,SAAS,EAAE;AACrE,yBAAiB,IAAI,KAAK,IAAI,GAAG,MAAM;AAAA,MAC3C,CAAC;AACD,aAAO;AAAA,IACX;AAAA,IACA,KAAK;AACD,aAAO,iCAAiC,WAAW,WAAW,UAAU,WAAW,kBAAkB;AAAA,IACzG,KAAK;AACD,aAAO,+BAA+B,WAAW,WAAW,UAAU,WAAW,kBAAkB;AAAA,IACvG,KAAK;AACD,aAAO,iCAAiC,WAAW,WAAW,QAAQ;AAAA,IAC1E,KAAK;AACD,aAAO,8BAA8B,WAAW,WAAW,SAAS,WAAW,QAAQ;AAAA,IAC3F;AACI,aAAO,qBAAqB,SAAS;AAAA,EACjD;AACA;AACY,MAAC,uBAAuB,CAAC,cAAc;AAC/C,MAAI;AACJ,QAAM,mBAAmB,oBAAI,IAAG;AAChC,GAAC,KAAK,UAAU,WAAW,QAAQ,OAAO,SAAS,SAAS,GAAG,QAAQ,CAAC,SAAS;AAC7E,qBAAiB,IAAI,KAAK,IAAI,GAAG,CAAC;AAAA,EACtC,CAAC;AACD,SAAO;AACX;AAUY,MAAC,mCAAmC,CAAC,WAAW,UAAU,uBAAuB;AACzF,QAAM,mBAAmB,qBAAqB,SAAS;AACvD,QAAM,EAAE,QAAQ,CAAA,EAAE,IAAK;AACvB,QAAM,QAAQ,CAAC,WAAW;AACtB,UAAM,QAAQ,CAAC,WAAW;AACtB,UAAI,WAAW,QAAQ;AACnB,cAAM,EAAE,QAAO,IAAK,iBAAiB,WAAW,KAAK,MAAM,GAAG,KAAK,MAAM,GAAG,UAAU,kBAAkB;AACxG,cAAM,YAAY,QAAQ;AAC1B,gBAAQ,KAAI,EAAG,QAAQ,CAAC,WAAW;AAC/B,cAAI,WAAW,KAAK,MAAM,KAAK,WAAW,KAAK,MAAM,GAAG;AACpD,6BAAiB,IAAI,QAAQ,iBAAiB,IAAI,MAAM,IAAI,IAAI,SAAS;AAAA,UAC7E;AAAA,QACJ,CAAC;AAAA,MACL;AAAA,IACJ,CAAC;AAAA,EACL,CAAC;AACD,SAAO;AACX;AAUY,MAAC,iCAAiC,CAAC,WAAW,UAAU,uBAAuB;AACvF,QAAM,mBAAmB,oBAAI,IAAG;AAChC,QAAM,EAAE,QAAQ,CAAA,EAAE,IAAK;AACvB,QAAM,QAAQ,CAAC,WAAW;AACtB,UAAM,cAAc,MAAM,OAAO,CAAC,KAAK,WAAW;AAC9C,UAAI,WAAW,QAAQ;AACnB,cAAM,EAAE,OAAM,IAAK,iBAAiB,WAAW,KAAK,MAAM,GAAG,KAAK,MAAM,GAAG,UAAU,kBAAkB;AACvG,eAAO;AAAA,MACX;AACA,aAAO;AAAA,IACX,GAAG,CAAC;AACJ,qBAAiB,IAAI,KAAK,MAAM,GAAG,IAAI,WAAW;AAAA,EACtD,CAAC;AACD,SAAO;AACX;AAUY,MAAC,gCAAgC,CAAC,WAAW,SAAS,aAAa;AAC3E,MAAI;AACJ,QAAM,mBAAmB,oBAAI,IAAG;AAChC,QAAM,OAAO,SAAS,WAAW,SAAS,QAAQ;AAClD,GAAC,KAAK,UAAU,WAAW,QAAQ,OAAO,SAAS,SAAS,GAAG,QAAQ,CAAC,SAAS;AAC7E,qBAAiB,IAAI,KAAK,IAAI,GAAG,KAAK,KAAK,IAAI,CAAC,CAAC;AAAA,EACrD,CAAC;AACD,SAAO;AACX;AASY,MAAC,mCAAmC,CAAC,WAAW,aAAa;AACrE,QAAM,EAAE,QAAQ,CAAA,EAAE,IAAK;AACvB,QAAM,kBAAkB,sBAAsB,WAAW,QAAQ;AACjE,QAAM,cAAc,eAAe,iBAAiB,MAAM,MAAM;AAChE,QAAM,mBAAmB,oBAAI,IAAG;AAChC,QAAM,QAAQ,CAAC,MAAM,UAAU;AAC3B,qBAAiB,IAAI,KAAK,IAAI,GAAG,YAAY,KAAK,CAAC;AAAA,EACvD,CAAC;AACD,SAAO;AACX;AASY,MAAC,wBAAwB,CAAC,WAAW,aAAa;AAC1D,QAAM,EAAE,QAAQ,CAAA,GAAI,QAAQ,CAAA,EAAE,IAAK;AACnC,QAAM,SAAS,MAAM,MAAM,MAAM,EAC5B,KAAK,IAAI,EACT,IAAI,MAAM,MAAM,MAAM,MAAM,EAAE,KAAK,CAAC,CAAC;AAC1C,QAAM,QAAQ,CAAC,EAAE,QAAQ,OAAM,MAAO;AAClC,UAAM,SAAS,MAAM,UAAU,CAAC,SAAS,KAAK,IAAI,MAAM,MAAM;AAC9D,UAAM,SAAS,MAAM,UAAU,CAAC,SAAS,KAAK,IAAI,MAAM,MAAM;AAC9D,QAAI,UAAU;AACV,aAAO,MAAM,EAAE,MAAM,IAAI;AAAA,IAC7B,OACK;AACD,aAAO,MAAM,EAAE,MAAM,IAAI;AACzB,aAAO,MAAM,EAAE,MAAM,IAAI;AAAA,IAC7B;AAAA,EACJ,CAAC;AACD,SAAO;AACX;AAYA,MAAM,iBAAiB,CAAC,QAAQ,UAAU,gBAAgB,KAAK,YAAY,SAAS;AAChF,MAAI,cAAc,MAAM,QAAQ,EAAE,KAAK,CAAC;AACxC,MAAI,OAAO;AACX,WAAS,OAAO,GAAG,OAAO,iBAAiB,OAAO,WAAW,QAAQ;AACjE,UAAM,iBAAiB,MAAM,QAAQ,EAAE,KAAK,CAAC;AAC7C,aAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AAC/B,eAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AAC/B,uBAAe,CAAC,KAAK,OAAO,CAAC,EAAE,CAAC,IAAI,YAAY,CAAC;AAAA,MACrD;AAAA,IACJ;AACA,UAAM,OAAO,KAAK,KAAK,eAAe,OAAO,CAAC,KAAK,QAAQ,MAAM,MAAM,KAAK,CAAC,CAAC;AAC9E,aAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AAC/B,qBAAe,CAAC,KAAK;AAAA,IACzB;AACA,WAAO,KAAK,KAAK,eAAe,OAAO,CAAC,KAAK,KAAK,UAAU,OAAO,MAAM,YAAY,KAAK,KAAK,KAAK,CAAC,CAAC;AACtG,kBAAc;AAAA,EAClB;AACA,SAAO;AACX;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_g6@5.1.0/node_modules/@antv/g6/esm/utils/change.cjs

@@ -0,0 +1,64 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const id = require("./id.cjs");
+const groupBy = require("../../../../../../@antv_util@3.3.11/node_modules/@antv/util/esm/lodash/group-by.cjs");
+function reduceDataChanges(changes) {
+  const results = {
+    Added: /* @__PURE__ */ new Map(),
+    Updated: /* @__PURE__ */ new Map(),
+    Removed: /* @__PURE__ */ new Map()
+  };
+  changes.forEach((change) => {
+    const { type, value } = change;
+    const id$1 = id.idOf(value);
+    if (type === "NodeAdded" || type === "EdgeAdded" || type === "ComboAdded") {
+      results.Added.set(id$1, change);
+    } else if (type === "NodeUpdated" || type === "EdgeUpdated" || type === "ComboUpdated") {
+      if (results.Added.has(id$1)) {
+        results.Added.set(id$1, { type: type.replace("Updated", "Added"), value });
+      } else if (results.Updated.has(id$1)) {
+        const { original } = results.Updated.get(id$1);
+        results.Updated.set(id$1, { type, value, original });
+      } else if (results.Removed.has(id$1)) ;
+      else
+        results.Updated.set(id$1, change);
+    } else if (type === "NodeRemoved" || type === "EdgeRemoved" || type === "ComboRemoved") {
+      if (results.Added.has(id$1)) {
+        results.Added.delete(id$1);
+      } else if (results.Updated.has(id$1)) {
+        results.Updated.delete(id$1);
+        results.Removed.set(id$1, change);
+      } else {
+        results.Removed.set(id$1, change);
+      }
+    }
+  });
+  return [
+    ...Array.from(results.Added.values()),
+    ...Array.from(results.Updated.values()),
+    ...Array.from(results.Removed.values())
+  ];
+}
+function groupByChangeType(changes) {
+  const { NodeAdded = [], NodeUpdated = [], NodeRemoved = [], EdgeAdded = [], EdgeUpdated = [], EdgeRemoved = [], ComboAdded = [], ComboUpdated = [], ComboRemoved = [] } = groupBy(changes, (change) => change.type);
+  return {
+    add: {
+      nodes: NodeAdded,
+      edges: EdgeAdded,
+      combos: ComboAdded
+    },
+    update: {
+      nodes: NodeUpdated,
+      edges: EdgeUpdated,
+      combos: ComboUpdated
+    },
+    remove: {
+      nodes: NodeRemoved,
+      edges: EdgeRemoved,
+      combos: ComboRemoved
+    }
+  };
+}
+exports.groupByChangeType = groupByChangeType;
+exports.reduceDataChanges = reduceDataChanges;
+//# sourceMappingURL=change.cjs.map

package/dist/node_modules/.pnpm/@antv_g6@5.1.0/node_modules/@antv/g6/esm/utils/change.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"change.cjs","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+g6@5.1.0/node_modules/@antv/g6/esm/utils/change.js"],"sourcesContent":["import { groupBy } from '@antv/util';\nimport { idOf } from './id';\n/**\n * <zh/> 对数据操作进行约简\n *\n * <en/> Reduce data changes\n * @param changes - <zh/> 数据操作 | <en/> data changes\n * @returns <zh/> 约简后的数据操作 | <en/> reduced data changes\n */\nexport function reduceDataChanges(changes) {\n    const results = {\n        Added: new Map(),\n        Updated: new Map(),\n        Removed: new Map(),\n    };\n    changes.forEach((change) => {\n        const { type, value } = change;\n        const id = idOf(value);\n        if (type === 'NodeAdded' || type === 'EdgeAdded' || type === 'ComboAdded') {\n            results.Added.set(id, change);\n        }\n        else if (type === 'NodeUpdated' || type === 'EdgeUpdated' || type === 'ComboUpdated') {\n            // 如果存在 Added，将当前操作置为 Added 操作\n            // If there is an Added operation, set the current operation to Added\n            if (results.Added.has(id)) {\n                results.Added.set(id, { type: type.replace('Updated', 'Added'), value });\n            }\n            // 如果存在 Updated，将当前操作置为 Updated 操作，但使用更早版本的 original\n            // If there is an Updated operation, set the current operation to Updated, but use an earlier version of original\n            else if (results.Updated.has(id)) {\n                const { original } = results.Updated.get(id);\n                results.Updated.set(id, { type, value, original });\n            }\n            else if (results.Removed.has(id)) {\n                // 如果存在 Removed，不做任何操作\n                // If there is a Removed operation, do nothing\n            }\n            else\n                results.Updated.set(id, change);\n        }\n        else if (type === 'NodeRemoved' || type === 'EdgeRemoved' || type === 'ComboRemoved') {\n            // 如果存在 Added 或者 Updated 的操作，删除 Removed 操作\n            // If there is an Added or Updated operation, delete the Removed operation\n            if (results.Added.has(id)) {\n                results.Added.delete(id);\n            }\n            else if (results.Updated.has(id)) {\n                results.Updated.delete(id);\n                results.Removed.set(id, change);\n            }\n            else {\n                results.Removed.set(id, change);\n            }\n        }\n    });\n    // 顺序并不重要\n    // The order is not important\n    return [\n        ...Array.from(results.Added.values()),\n        ...Array.from(results.Updated.values()),\n        ...Array.from(results.Removed.values()),\n    ];\n}\n/**\n * <zh/> 对数据操作进行分类\n *\n * <en/> Classify data changes\n * @param changes - <zh/> 数据操作 | <en/> data changes\n * @returns <zh/> 分类后的数据操作 | <en/> classified data changes\n */\nexport function groupByChangeType(changes) {\n    const { NodeAdded = [], NodeUpdated = [], NodeRemoved = [], EdgeAdded = [], EdgeUpdated = [], EdgeRemoved = [], ComboAdded = [], ComboUpdated = [], ComboRemoved = [], } = groupBy(changes, (change) => change.type);\n    return {\n        add: {\n            nodes: NodeAdded,\n            edges: EdgeAdded,\n            combos: ComboAdded,\n        },\n        update: {\n            nodes: NodeUpdated,\n            edges: EdgeUpdated,\n            combos: ComboUpdated,\n        },\n        remove: {\n            nodes: NodeRemoved,\n            edges: EdgeRemoved,\n            combos: ComboRemoved,\n        },\n    };\n}\n//# sourceMappingURL=change.js.map"],"names":["id","idOf"],"mappings":";;;;AASO,SAAS,kBAAkB,SAAS;AACvC,QAAM,UAAU;AAAA,IACZ,OAAO,oBAAI,IAAG;AAAA,IACd,SAAS,oBAAI,IAAG;AAAA,IAChB,SAAS,oBAAI,IAAG;AAAA,EACxB;AACI,UAAQ,QAAQ,CAAC,WAAW;AACxB,UAAM,EAAE,MAAM,MAAK,IAAK;AACxB,UAAMA,OAAKC,GAAAA,KAAK,KAAK;AACrB,QAAI,SAAS,eAAe,SAAS,eAAe,SAAS,cAAc;AACvE,cAAQ,MAAM,IAAID,MAAI,MAAM;AAAA,IAChC,WACS,SAAS,iBAAiB,SAAS,iBAAiB,SAAS,gBAAgB;AAGlF,UAAI,QAAQ,MAAM,IAAIA,IAAE,GAAG;AACvB,gBAAQ,MAAM,IAAIA,MAAI,EAAE,MAAM,KAAK,QAAQ,WAAW,OAAO,GAAG,MAAK,CAAE;AAAA,MAC3E,WAGS,QAAQ,QAAQ,IAAIA,IAAE,GAAG;AAC9B,cAAM,EAAE,SAAQ,IAAK,QAAQ,QAAQ,IAAIA,IAAE;AAC3C,gBAAQ,QAAQ,IAAIA,MAAI,EAAE,MAAM,OAAO,UAAU;AAAA,MACrD,WACS,QAAQ,QAAQ,IAAIA,IAAE,EAAG;AAAA;AAK9B,gBAAQ,QAAQ,IAAIA,MAAI,MAAM;AAAA,IACtC,WACS,SAAS,iBAAiB,SAAS,iBAAiB,SAAS,gBAAgB;AAGlF,UAAI,QAAQ,MAAM,IAAIA,IAAE,GAAG;AACvB,gBAAQ,MAAM,OAAOA,IAAE;AAAA,MAC3B,WACS,QAAQ,QAAQ,IAAIA,IAAE,GAAG;AAC9B,gBAAQ,QAAQ,OAAOA,IAAE;AACzB,gBAAQ,QAAQ,IAAIA,MAAI,MAAM;AAAA,MAClC,OACK;AACD,gBAAQ,QAAQ,IAAIA,MAAI,MAAM;AAAA,MAClC;AAAA,IACJ;AAAA,EACJ,CAAC;AAGD,SAAO;AAAA,IACH,GAAG,MAAM,KAAK,QAAQ,MAAM,OAAM,CAAE;AAAA,IACpC,GAAG,MAAM,KAAK,QAAQ,QAAQ,OAAM,CAAE;AAAA,IACtC,GAAG,MAAM,KAAK,QAAQ,QAAQ,OAAM,CAAE;AAAA,EAC9C;AACA;AAQO,SAAS,kBAAkB,SAAS;AACvC,QAAM,EAAE,YAAY,IAAI,cAAc,CAAA,GAAI,cAAc,CAAA,GAAI,YAAY,CAAA,GAAI,cAAc,CAAA,GAAI,cAAc,IAAI,aAAa,CAAA,GAAI,eAAe,CAAA,GAAI,eAAe,CAAA,MAAQ,QAAQ,SAAS,CAAC,WAAW,OAAO,IAAI;AACnN,SAAO;AAAA,IACH,KAAK;AAAA,MACD,OAAO;AAAA,MACP,OAAO;AAAA,MACP,QAAQ;AAAA,IACpB;AAAA,IACQ,QAAQ;AAAA,MACJ,OAAO;AAAA,MACP,OAAO;AAAA,MACP,QAAQ;AAAA,IACpB;AAAA,IACQ,QAAQ;AAAA,MACJ,OAAO;AAAA,MACP,OAAO;AAAA,MACP,QAAQ;AAAA,IACpB;AAAA,EACA;AACA;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_g6@5.1.0/node_modules/@antv/g6/esm/utils/change.js

@@ -0,0 +1,64 @@
+import { idOf } from "./id.js";
+import groupBy from "../../../../../../@antv_util@3.3.11/node_modules/@antv/util/esm/lodash/group-by.js";
+function reduceDataChanges(changes) {
+  const results = {
+    Added: /* @__PURE__ */ new Map(),
+    Updated: /* @__PURE__ */ new Map(),
+    Removed: /* @__PURE__ */ new Map()
+  };
+  changes.forEach((change) => {
+    const { type, value } = change;
+    const id = idOf(value);
+    if (type === "NodeAdded" || type === "EdgeAdded" || type === "ComboAdded") {
+      results.Added.set(id, change);
+    } else if (type === "NodeUpdated" || type === "EdgeUpdated" || type === "ComboUpdated") {
+      if (results.Added.has(id)) {
+        results.Added.set(id, { type: type.replace("Updated", "Added"), value });
+      } else if (results.Updated.has(id)) {
+        const { original } = results.Updated.get(id);
+        results.Updated.set(id, { type, value, original });
+      } else if (results.Removed.has(id)) ;
+      else
+        results.Updated.set(id, change);
+    } else if (type === "NodeRemoved" || type === "EdgeRemoved" || type === "ComboRemoved") {
+      if (results.Added.has(id)) {
+        results.Added.delete(id);
+      } else if (results.Updated.has(id)) {
+        results.Updated.delete(id);
+        results.Removed.set(id, change);
+      } else {
+        results.Removed.set(id, change);
+      }
+    }
+  });
+  return [
+    ...Array.from(results.Added.values()),
+    ...Array.from(results.Updated.values()),
+    ...Array.from(results.Removed.values())
+  ];
+}
+function groupByChangeType(changes) {
+  const { NodeAdded = [], NodeUpdated = [], NodeRemoved = [], EdgeAdded = [], EdgeUpdated = [], EdgeRemoved = [], ComboAdded = [], ComboUpdated = [], ComboRemoved = [] } = groupBy(changes, (change) => change.type);
+  return {
+    add: {
+      nodes: NodeAdded,
+      edges: EdgeAdded,
+      combos: ComboAdded
+    },
+    update: {
+      nodes: NodeUpdated,
+      edges: EdgeUpdated,
+      combos: ComboUpdated
+    },
+    remove: {
+      nodes: NodeRemoved,
+      edges: EdgeRemoved,
+      combos: ComboRemoved
+    }
+  };
+}
+export {
+  groupByChangeType,
+  reduceDataChanges
+};
+//# sourceMappingURL=change.js.map

package/dist/node_modules/.pnpm/@antv_g6@5.1.0/node_modules/@antv/g6/esm/utils/change.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"change.js","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+g6@5.1.0/node_modules/@antv/g6/esm/utils/change.js"],"sourcesContent":["import { groupBy } from '@antv/util';\nimport { idOf } from './id';\n/**\n * <zh/> 对数据操作进行约简\n *\n * <en/> Reduce data changes\n * @param changes - <zh/> 数据操作 | <en/> data changes\n * @returns <zh/> 约简后的数据操作 | <en/> reduced data changes\n */\nexport function reduceDataChanges(changes) {\n    const results = {\n        Added: new Map(),\n        Updated: new Map(),\n        Removed: new Map(),\n    };\n    changes.forEach((change) => {\n        const { type, value } = change;\n        const id = idOf(value);\n        if (type === 'NodeAdded' || type === 'EdgeAdded' || type === 'ComboAdded') {\n            results.Added.set(id, change);\n        }\n        else if (type === 'NodeUpdated' || type === 'EdgeUpdated' || type === 'ComboUpdated') {\n            // 如果存在 Added，将当前操作置为 Added 操作\n            // If there is an Added operation, set the current operation to Added\n            if (results.Added.has(id)) {\n                results.Added.set(id, { type: type.replace('Updated', 'Added'), value });\n            }\n            // 如果存在 Updated，将当前操作置为 Updated 操作，但使用更早版本的 original\n            // If there is an Updated operation, set the current operation to Updated, but use an earlier version of original\n            else if (results.Updated.has(id)) {\n                const { original } = results.Updated.get(id);\n                results.Updated.set(id, { type, value, original });\n            }\n            else if (results.Removed.has(id)) {\n                // 如果存在 Removed，不做任何操作\n                // If there is a Removed operation, do nothing\n            }\n            else\n                results.Updated.set(id, change);\n        }\n        else if (type === 'NodeRemoved' || type === 'EdgeRemoved' || type === 'ComboRemoved') {\n            // 如果存在 Added 或者 Updated 的操作，删除 Removed 操作\n            // If there is an Added or Updated operation, delete the Removed operation\n            if (results.Added.has(id)) {\n                results.Added.delete(id);\n            }\n            else if (results.Updated.has(id)) {\n                results.Updated.delete(id);\n                results.Removed.set(id, change);\n            }\n            else {\n                results.Removed.set(id, change);\n            }\n        }\n    });\n    // 顺序并不重要\n    // The order is not important\n    return [\n        ...Array.from(results.Added.values()),\n        ...Array.from(results.Updated.values()),\n        ...Array.from(results.Removed.values()),\n    ];\n}\n/**\n * <zh/> 对数据操作进行分类\n *\n * <en/> Classify data changes\n * @param changes - <zh/> 数据操作 | <en/> data changes\n * @returns <zh/> 分类后的数据操作 | <en/> classified data changes\n */\nexport function groupByChangeType(changes) {\n    const { NodeAdded = [], NodeUpdated = [], NodeRemoved = [], EdgeAdded = [], EdgeUpdated = [], EdgeRemoved = [], ComboAdded = [], ComboUpdated = [], ComboRemoved = [], } = groupBy(changes, (change) => change.type);\n    return {\n        add: {\n            nodes: NodeAdded,\n            edges: EdgeAdded,\n            combos: ComboAdded,\n        },\n        update: {\n            nodes: NodeUpdated,\n            edges: EdgeUpdated,\n            combos: ComboUpdated,\n        },\n        remove: {\n            nodes: NodeRemoved,\n            edges: EdgeRemoved,\n            combos: ComboRemoved,\n        },\n    };\n}\n//# sourceMappingURL=change.js.map"],"names":[],"mappings":";;AASO,SAAS,kBAAkB,SAAS;AACvC,QAAM,UAAU;AAAA,IACZ,OAAO,oBAAI,IAAG;AAAA,IACd,SAAS,oBAAI,IAAG;AAAA,IAChB,SAAS,oBAAI,IAAG;AAAA,EACxB;AACI,UAAQ,QAAQ,CAAC,WAAW;AACxB,UAAM,EAAE,MAAM,MAAK,IAAK;AACxB,UAAM,KAAK,KAAK,KAAK;AACrB,QAAI,SAAS,eAAe,SAAS,eAAe,SAAS,cAAc;AACvE,cAAQ,MAAM,IAAI,IAAI,MAAM;AAAA,IAChC,WACS,SAAS,iBAAiB,SAAS,iBAAiB,SAAS,gBAAgB;AAGlF,UAAI,QAAQ,MAAM,IAAI,EAAE,GAAG;AACvB,gBAAQ,MAAM,IAAI,IAAI,EAAE,MAAM,KAAK,QAAQ,WAAW,OAAO,GAAG,MAAK,CAAE;AAAA,MAC3E,WAGS,QAAQ,QAAQ,IAAI,EAAE,GAAG;AAC9B,cAAM,EAAE,SAAQ,IAAK,QAAQ,QAAQ,IAAI,EAAE;AAC3C,gBAAQ,QAAQ,IAAI,IAAI,EAAE,MAAM,OAAO,UAAU;AAAA,MACrD,WACS,QAAQ,QAAQ,IAAI,EAAE,EAAG;AAAA;AAK9B,gBAAQ,QAAQ,IAAI,IAAI,MAAM;AAAA,IACtC,WACS,SAAS,iBAAiB,SAAS,iBAAiB,SAAS,gBAAgB;AAGlF,UAAI,QAAQ,MAAM,IAAI,EAAE,GAAG;AACvB,gBAAQ,MAAM,OAAO,EAAE;AAAA,MAC3B,WACS,QAAQ,QAAQ,IAAI,EAAE,GAAG;AAC9B,gBAAQ,QAAQ,OAAO,EAAE;AACzB,gBAAQ,QAAQ,IAAI,IAAI,MAAM;AAAA,MAClC,OACK;AACD,gBAAQ,QAAQ,IAAI,IAAI,MAAM;AAAA,MAClC;AAAA,IACJ;AAAA,EACJ,CAAC;AAGD,SAAO;AAAA,IACH,GAAG,MAAM,KAAK,QAAQ,MAAM,OAAM,CAAE;AAAA,IACpC,GAAG,MAAM,KAAK,QAAQ,QAAQ,OAAM,CAAE;AAAA,IACtC,GAAG,MAAM,KAAK,QAAQ,QAAQ,OAAM,CAAE;AAAA,EAC9C;AACA;AAQO,SAAS,kBAAkB,SAAS;AACvC,QAAM,EAAE,YAAY,IAAI,cAAc,CAAA,GAAI,cAAc,CAAA,GAAI,YAAY,CAAA,GAAI,cAAc,CAAA,GAAI,cAAc,IAAI,aAAa,CAAA,GAAI,eAAe,CAAA,GAAI,eAAe,CAAA,MAAQ,QAAQ,SAAS,CAAC,WAAW,OAAO,IAAI;AACnN,SAAO;AAAA,IACH,KAAK;AAAA,MACD,OAAO;AAAA,MACP,OAAO;AAAA,MACP,QAAQ;AAAA,IACpB;AAAA,IACQ,QAAQ;AAAA,MACJ,OAAO;AAAA,MACP,OAAO;AAAA,MACP,QAAQ;AAAA,IACpB;AAAA,IACQ,QAAQ;AAAA,MACJ,OAAO;AAAA,MACP,OAAO;AAAA,MACP,QAAQ;AAAA,IACpB;AAAA,EACA;AACA;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_g6@5.1.0/node_modules/@antv/g6/esm/utils/collapsibility.cjs

@@ -0,0 +1,8 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+function isCollapsed(nodeLike) {
+  var _a;
+  return !!((_a = nodeLike.style) === null || _a === void 0 ? void 0 : _a.collapsed);
+}
+exports.isCollapsed = isCollapsed;
+//# sourceMappingURL=collapsibility.cjs.map

package/dist/node_modules/.pnpm/@antv_g6@5.1.0/node_modules/@antv/g6/esm/utils/collapsibility.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"collapsibility.cjs","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+g6@5.1.0/node_modules/@antv/g6/esm/utils/collapsibility.js"],"sourcesContent":["/**\n * <zh/> 判断节点/组合是否收起\n *\n * <en/> Determine whether the node/combo is collapsed\n * @param nodeLike - <zh/>节点/组合数据 | <en/>Node/Combo data\n * @returns <zh/>是否收起 | <en/>Whether it is collapsed\n */\nexport function isCollapsed(nodeLike) {\n    var _a;\n    return !!((_a = nodeLike.style) === null || _a === void 0 ? void 0 : _a.collapsed);\n}\n//# sourceMappingURL=collapsibility.js.map"],"names":[],"mappings":";;AAOO,SAAS,YAAY,UAAU;AAClC,MAAI;AACJ,SAAO,CAAC,GAAG,KAAK,SAAS,WAAW,QAAQ,OAAO,SAAS,SAAS,GAAG;AAC5E;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_g6@5.1.0/node_modules/@antv/g6/esm/utils/collapsibility.js

@@ -0,0 +1,8 @@
+function isCollapsed(nodeLike) {
+  var _a;
+  return !!((_a = nodeLike.style) === null || _a === void 0 ? void 0 : _a.collapsed);
+}
+export {
+  isCollapsed
+};
+//# sourceMappingURL=collapsibility.js.map

package/dist/node_modules/.pnpm/@antv_g6@5.1.0/node_modules/@antv/g6/esm/utils/collapsibility.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"collapsibility.js","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+g6@5.1.0/node_modules/@antv/g6/esm/utils/collapsibility.js"],"sourcesContent":["/**\n * <zh/> 判断节点/组合是否收起\n *\n * <en/> Determine whether the node/combo is collapsed\n * @param nodeLike - <zh/>节点/组合数据 | <en/>Node/Combo data\n * @returns <zh/>是否收起 | <en/>Whether it is collapsed\n */\nexport function isCollapsed(nodeLike) {\n    var _a;\n    return !!((_a = nodeLike.style) === null || _a === void 0 ? void 0 : _a.collapsed);\n}\n//# sourceMappingURL=collapsibility.js.map"],"names":[],"mappings":"AAOO,SAAS,YAAY,UAAU;AAClC,MAAI;AACJ,SAAO,CAAC,GAAG,KAAK,SAAS,WAAW,QAAQ,OAAO,SAAS,SAAS,GAAG;AAC5E;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_g6@5.1.0/node_modules/@antv/g6/esm/utils/data.cjs

@@ -0,0 +1,71 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+var __rest = function(s, e) {
+  var t = {};
+  for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)
+    t[p] = s[p];
+  if (s != null && typeof Object.getOwnPropertySymbols === "function")
+    for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {
+      if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))
+        t[p[i]] = s[p[i]];
+    }
+  return t;
+};
+function mergeElementsData(original, modified) {
+  const { data: originalData, style: originalStyle } = original, originalAttrs = __rest(original, ["data", "style"]);
+  const { data: modifiedData, style: modifiedStyle } = modified, modifiedAttrs = __rest(modified, ["data", "style"]);
+  const result = Object.assign(Object.assign({}, originalAttrs), modifiedAttrs);
+  if (originalData || modifiedData) {
+    Object.assign(result, { data: Object.assign(Object.assign({}, originalData), modifiedData) });
+  }
+  if (originalStyle || modifiedStyle) {
+    Object.assign(result, { style: Object.assign(Object.assign({}, originalStyle), modifiedStyle) });
+  }
+  return result;
+}
+function cloneElementData(data) {
+  const { data: customData, style } = data, restAttrs = __rest(data, ["data", "style"]);
+  const clonedData = restAttrs;
+  if (customData)
+    clonedData.data = Object.assign({}, customData);
+  if (style)
+    clonedData.style = Object.assign({}, style);
+  return clonedData;
+}
+function isElementDataEqual(original = {}, modified = {}) {
+  const { states: originalStates = [], data: originalData = {}, style: originalStyle = {}, children: originalChildren = [] } = original, originalAttrs = __rest(original, ["states", "data", "style", "children"]);
+  const { states: modifiedStates = [], data: modifiedData = {}, style: modifiedStyle = {}, children: modifiedChildren = [] } = modified, modifiedAttrs = __rest(modified, ["states", "data", "style", "children"]);
+  const isArrayEqual = (arr1, arr2) => {
+    if (arr1.length !== arr2.length)
+      return false;
+    return arr1.every((item, index) => item === arr2[index]);
+  };
+  const isObjectEqual = (obj1, obj2) => {
+    const keys1 = Object.keys(obj1);
+    const keys2 = Object.keys(obj2);
+    if (keys1.length !== keys2.length)
+      return false;
+    return keys1.every((key) => obj1[key] === obj2[key]);
+  };
+  if (!isObjectEqual(originalAttrs, modifiedAttrs))
+    return false;
+  if (!isArrayEqual(originalChildren, modifiedChildren))
+    return false;
+  if (!isArrayEqual(originalStates, modifiedStates))
+    return false;
+  if (!isObjectEqual(originalData, modifiedData))
+    return false;
+  if (!isObjectEqual(originalStyle, modifiedStyle))
+    return false;
+  return true;
+}
+const OVERRIDE_KEY = "__internal_override__";
+function isOverridable(datum) {
+  return datum[OVERRIDE_KEY] !== false;
+}
+exports.OVERRIDE_KEY = OVERRIDE_KEY;
+exports.cloneElementData = cloneElementData;
+exports.isElementDataEqual = isElementDataEqual;
+exports.isOverridable = isOverridable;
+exports.mergeElementsData = mergeElementsData;
+//# sourceMappingURL=data.cjs.map

package/dist/node_modules/.pnpm/@antv_g6@5.1.0/node_modules/@antv/g6/esm/utils/data.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"data.cjs","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+g6@5.1.0/node_modules/@antv/g6/esm/utils/data.js"],"sourcesContent":["var __rest = (this && this.__rest) || function (s, e) {\n    var t = {};\n    for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\n        t[p] = s[p];\n    if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\n        for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\n            if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\n                t[p[i]] = s[p[i]];\n        }\n    return t;\n};\nimport { get } from '@antv/util';\n/**\n * <zh/> 合并两个 节点/边/Combo 的数据\n *\n * <en/> Merge the data of two nodes/edges/combos\n * @param original - <zh/> 原始数据 | <en/> original data\n * @param modified - <zh/> 待合并的数据 | <en/> data to be merged\n * @returns <zh/> 合并后的数据 | <en/> merged data\n * @remarks\n * <zh/> 只会合并第一层的数据，data、style 下的二级数据会被覆盖\n *\n * <en/> Only the first level of data will be merged, the second level of data under data and style will be overwritten\n */\nexport function mergeElementsData(original, modified) {\n    const { data: originalData, style: originalStyle } = original, originalAttrs = __rest(original, [\"data\", \"style\"]);\n    const { data: modifiedData, style: modifiedStyle } = modified, modifiedAttrs = __rest(modified, [\"data\", \"style\"]);\n    const result = Object.assign(Object.assign({}, originalAttrs), modifiedAttrs);\n    if (originalData || modifiedData) {\n        Object.assign(result, { data: Object.assign(Object.assign({}, originalData), modifiedData) });\n    }\n    if (originalStyle || modifiedStyle) {\n        Object.assign(result, { style: Object.assign(Object.assign({}, originalStyle), modifiedStyle) });\n    }\n    return result;\n}\n/**\n * <zh/> 克隆元素数据\n *\n * <en/> Clone clement data\n * @param data - <zh/> 待克隆的数据 | <en/> data to be cloned\n * @returns <zh/> 克隆后的数据 | <en/> cloned data\n * @remarks\n * <zh/> 只会克隆到第二层（data、style）\n *\n * <en/> Only clone to the second level (data, style)\n */\nexport function cloneElementData(data) {\n    const { data: customData, style } = data, restAttrs = __rest(data, [\"data\", \"style\"]);\n    const clonedData = restAttrs;\n    if (customData)\n        clonedData.data = Object.assign({}, customData);\n    if (style)\n        clonedData.style = Object.assign({}, style);\n    return clonedData;\n}\n/**\n * <zh/> 判断数据是否为空\n *\n * <en/> Determine if the data is empty\n * @param data - <zh/> 图数据 | <en/> graph data\n * @returns <zh/> 是否为空 | <en/> is empty\n */\nexport function isEmptyData(data) {\n    return !get(data, ['nodes', 'length']) && !get(data, ['edges', 'length']) && !get(data, ['combos', 'length']);\n}\n/**\n * <zh/> 判断两个元素数据是否相等\n *\n * <en/> Determine if two element data are equal\n * @param original - <zh/> 原始数据 | <en/> original data\n * @param modified - <zh/> 修改后的数据 | <en/> modified data\n * @returns <zh/> 是否相等 | <en/> is equal\n * @remarks\n * <zh/> 相比于 isEqual，这个方法不会比较更下层的数据\n *\n * <en/> Compared to isEqual, this method does not compare data at a lower level\n */\nexport function isElementDataEqual(original = {}, modified = {}) {\n    const { states: originalStates = [], data: originalData = {}, style: originalStyle = {}, children: originalChildren = [] } = original, originalAttrs = __rest(original, [\"states\", \"data\", \"style\", \"children\"]);\n    const { states: modifiedStates = [], data: modifiedData = {}, style: modifiedStyle = {}, children: modifiedChildren = [] } = modified, modifiedAttrs = __rest(modified, [\"states\", \"data\", \"style\", \"children\"]);\n    const isArrayEqual = (arr1, arr2) => {\n        if (arr1.length !== arr2.length)\n            return false;\n        return arr1.every((item, index) => item === arr2[index]);\n    };\n    const isObjectEqual = (obj1, obj2) => {\n        const keys1 = Object.keys(obj1);\n        const keys2 = Object.keys(obj2);\n        if (keys1.length !== keys2.length)\n            return false;\n        return keys1.every((key) => obj1[key] === obj2[key]);\n    };\n    if (!isObjectEqual(originalAttrs, modifiedAttrs))\n        return false;\n    if (!isArrayEqual(originalChildren, modifiedChildren))\n        return false;\n    if (!isArrayEqual(originalStates, modifiedStates))\n        return false;\n    if (!isObjectEqual(originalData, modifiedData))\n        return false;\n    if (!isObjectEqual(originalStyle, modifiedStyle))\n        return false;\n    return true;\n}\nexport const OVERRIDE_KEY = '__internal_override__';\n/**\n * <zh/> 判断元素数据是否允许被覆盖\n *\n * <en/> Determine whether the element data can be overridden\n * @param datum - <zh/> 元素数据 | <en/> element data\n * @returns <zh/> 是否允许被覆盖 | <en/> is overridable\n */\nexport function isOverridable(datum) {\n    return datum[OVERRIDE_KEY] !== false;\n}\n//# sourceMappingURL=data.js.map"],"names":[],"mappings":";;AAAA,IAAI,SAAkC,SAAU,GAAG,GAAG;AAClD,MAAI,IAAI,CAAA;AACR,WAAS,KAAK,EAAG,KAAI,OAAO,UAAU,eAAe,KAAK,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI;AAC9E,MAAE,CAAC,IAAI,EAAE,CAAC;AACd,MAAI,KAAK,QAAQ,OAAO,OAAO,0BAA0B;AACrD,aAAS,IAAI,GAAG,IAAI,OAAO,sBAAsB,CAAC,GAAG,IAAI,EAAE,QAAQ,KAAK;AACpE,UAAI,EAAE,QAAQ,EAAE,CAAC,CAAC,IAAI,KAAK,OAAO,UAAU,qBAAqB,KAAK,GAAG,EAAE,CAAC,CAAC;AACzE,UAAE,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;AAAA,IACxB;AACJ,SAAO;AACX;AAcO,SAAS,kBAAkB,UAAU,UAAU;AAClD,QAAM,EAAE,MAAM,cAAc,OAAO,cAAa,IAAK,UAAU,gBAAgB,OAAO,UAAU,CAAC,QAAQ,OAAO,CAAC;AACjH,QAAM,EAAE,MAAM,cAAc,OAAO,cAAa,IAAK,UAAU,gBAAgB,OAAO,UAAU,CAAC,QAAQ,OAAO,CAAC;AACjH,QAAM,SAAS,OAAO,OAAO,OAAO,OAAO,CAAA,GAAI,aAAa,GAAG,aAAa;AAC5E,MAAI,gBAAgB,cAAc;AAC9B,WAAO,OAAO,QAAQ,EAAE,MAAM,OAAO,OAAO,OAAO,OAAO,CAAA,GAAI,YAAY,GAAG,YAAY,EAAC,CAAE;AAAA,EAChG;AACA,MAAI,iBAAiB,eAAe;AAChC,WAAO,OAAO,QAAQ,EAAE,OAAO,OAAO,OAAO,OAAO,OAAO,CAAA,GAAI,aAAa,GAAG,aAAa,EAAC,CAAE;AAAA,EACnG;AACA,SAAO;AACX;AAYO,SAAS,iBAAiB,MAAM;AACnC,QAAM,EAAE,MAAM,YAAY,MAAK,IAAK,MAAM,YAAY,OAAO,MAAM,CAAC,QAAQ,OAAO,CAAC;AACpF,QAAM,aAAa;AACnB,MAAI;AACA,eAAW,OAAO,OAAO,OAAO,CAAA,GAAI,UAAU;AAClD,MAAI;AACA,eAAW,QAAQ,OAAO,OAAO,CAAA,GAAI,KAAK;AAC9C,SAAO;AACX;AAuBO,SAAS,mBAAmB,WAAW,IAAI,WAAW,CAAA,GAAI;AAC7D,QAAM,EAAE,QAAQ,iBAAiB,CAAA,GAAI,MAAM,eAAe,CAAA,GAAI,OAAO,gBAAgB,CAAA,GAAI,UAAU,mBAAmB,CAAA,MAAO,UAAU,gBAAgB,OAAO,UAAU,CAAC,UAAU,QAAQ,SAAS,UAAU,CAAC;AAC/M,QAAM,EAAE,QAAQ,iBAAiB,CAAA,GAAI,MAAM,eAAe,CAAA,GAAI,OAAO,gBAAgB,CAAA,GAAI,UAAU,mBAAmB,CAAA,MAAO,UAAU,gBAAgB,OAAO,UAAU,CAAC,UAAU,QAAQ,SAAS,UAAU,CAAC;AAC/M,QAAM,eAAe,CAAC,MAAM,SAAS;AACjC,QAAI,KAAK,WAAW,KAAK;AACrB,aAAO;AACX,WAAO,KAAK,MAAM,CAAC,MAAM,UAAU,SAAS,KAAK,KAAK,CAAC;AAAA,EAC3D;AACA,QAAM,gBAAgB,CAAC,MAAM,SAAS;AAClC,UAAM,QAAQ,OAAO,KAAK,IAAI;AAC9B,UAAM,QAAQ,OAAO,KAAK,IAAI;AAC9B,QAAI,MAAM,WAAW,MAAM;AACvB,aAAO;AACX,WAAO,MAAM,MAAM,CAAC,QAAQ,KAAK,GAAG,MAAM,KAAK,GAAG,CAAC;AAAA,EACvD;AACA,MAAI,CAAC,cAAc,eAAe,aAAa;AAC3C,WAAO;AACX,MAAI,CAAC,aAAa,kBAAkB,gBAAgB;AAChD,WAAO;AACX,MAAI,CAAC,aAAa,gBAAgB,cAAc;AAC5C,WAAO;AACX,MAAI,CAAC,cAAc,cAAc,YAAY;AACzC,WAAO;AACX,MAAI,CAAC,cAAc,eAAe,aAAa;AAC3C,WAAO;AACX,SAAO;AACX;AACY,MAAC,eAAe;AAQrB,SAAS,cAAc,OAAO;AACjC,SAAO,MAAM,YAAY,MAAM;AACnC;;;;;;","x_google_ignoreList":[0]}