@hkyhy/marsun-components-core 0.1.113 → 0.1.114

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

@@ -0,0 +1,99 @@
+import "../../../algorithm/es/structs/linked-list.js";
+import "../../../algorithm/node_modules/@antv/util/esm/measure-text-width.js";
+import { findShortestPath as a } from "../../../algorithm/es/find-path.js";
+import "../../../algorithm/es/types.js";
+import m from "../../../algorithm/es/pageRank.js";
+import "../../../algorithm/es/structs/stack.js";
+import { idOf as f } from "./id.js";
+const I = (t, s, e) => {
+  var r;
+  switch (e.type) {
+    case "degree": {
+      const n = /* @__PURE__ */ new Map();
+      return (r = t.nodes) === null || r === void 0 || r.forEach((c) => {
+        const i = s(f(c), e.direction).length;
+        n.set(f(c), i);
+      }), n;
+    }
+    case "betweenness":
+      return v(t, e.directed, e.weightPropertyName);
+    case "closeness":
+      return y(t, e.directed, e.weightPropertyName);
+    case "eigenvector":
+      return E(t, e.directed);
+    case "pagerank":
+      return w(t, e.epsilon, e.linkProb);
+    default:
+      return p(t);
+  }
+}, p = (t) => {
+  var s;
+  const e = /* @__PURE__ */ new Map();
+  return (s = t.nodes) === null || s === void 0 || s.forEach((r) => {
+    e.set(f(r), 0);
+  }), e;
+}, v = (t, s, e) => {
+  const r = p(t), { nodes: n = [] } = t;
+  return n.forEach((c) => {
+    n.forEach((i) => {
+      if (c !== i) {
+        const { allPath: l } = a(t, f(c), f(i), s, e), d = l.length;
+        l.flat().forEach((o) => {
+          o !== f(c) && o !== f(i) && r.set(o, r.get(o) + 1 / d);
+        });
+      }
+    });
+  }), r;
+}, y = (t, s, e) => {
+  const r = /* @__PURE__ */ new Map(), { nodes: n = [] } = t;
+  return n.forEach((c) => {
+    const i = n.reduce((l, d) => {
+      if (c !== d) {
+        const { length: o } = a(t, f(c), f(d), s, e);
+        l += o;
+      }
+      return l;
+    }, 0);
+    r.set(f(c), 1 / i);
+  }), r;
+}, w = (t, s, e) => {
+  var r;
+  const n = /* @__PURE__ */ new Map(), c = m(t, s, e);
+  return (r = t.nodes) === null || r === void 0 || r.forEach((i) => {
+    n.set(f(i), c[f(i)]);
+  }), n;
+}, E = (t, s) => {
+  const { nodes: e = [] } = t, r = g(t, s), n = M(r, e.length), c = /* @__PURE__ */ new Map();
+  return e.forEach((i, l) => {
+    c.set(f(i), n[l]);
+  }), c;
+}, g = (t, s) => {
+  const { nodes: e = [], edges: r = [] } = t, n = Array(e.length).fill(null).map(() => Array(e.length).fill(0));
+  return r.forEach(({ source: c, target: i }) => {
+    const l = e.findIndex((o) => f(o) === c), d = e.findIndex((o) => f(o) === i);
+    s ? n[l][d] = 1 : (n[l][d] = 1, n[d][l] = 1);
+  }), n;
+}, M = (t, s, e = 100, r = 1e-6) => {
+  let n = Array(s).fill(1), c = 1 / 0;
+  for (let i = 0; i < e && c > r; i++) {
+    const l = Array(s).fill(0);
+    for (let o = 0; o < s; o++)
+      for (let u = 0; u < s; u++)
+        l[o] += t[o][u] * n[u];
+    const d = Math.sqrt(l.reduce((o, u) => o + u * u, 0));
+    for (let o = 0; o < s; o++)
+      l[o] /= d;
+    c = Math.sqrt(l.reduce((o, u, h) => o + (u - n[h]) * u, 0)), n = l;
+  }
+  return n;
+};
+export {
+  v as computeNodeBetweennessCentrality,
+  y as computeNodeClosenessCentrality,
+  E as computeNodeEigenvectorCentrality,
+  w as computeNodePageRankCentrality,
+  g as createAdjacencyMatrix,
+  I as getNodeCentralities,
+  p as initCentralityResult
+};
+//# sourceMappingURL=centrality.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"centrality.js","sources":["../../../../../../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":["getNodeCentralities","graphData","getRelatedEdgesData","centrality","_a","centralityResult","node","degree","idOf","computeNodeBetweennessCentrality","computeNodeClosenessCentrality","computeNodeEigenvectorCentrality","computeNodePageRankCentrality","initCentralityResult","directed","weightPropertyName","nodes","source","target","allPath","findShortestPath","pathCount","nodeId","totalLength","acc","length","epsilon","linkProb","data","pageRank","adjacencyMatrix","createAdjacencyMatrix","eigenvector","powerIteration","index","edges","matrix","uIndex","vIndex","numNodes","maxIterations","tolerance","diff","iter","newEigenvector","i","j","norm","sum","val"],"mappings":";;;;;;;AAEY,MAACA,IAAsB,CAACC,GAAWC,GAAqBC,MAAe;AAC/E,MAAIC;AACJ,UAAQD,EAAW,MAAI;AAAA,IACnB,KAAK,UAAU;AACX,YAAME,IAAmB,oBAAI,IAAG;AAChC,cAACD,IAAKH,EAAU,WAAW,QAAQG,MAAO,UAAkBA,EAAG,QAAQ,CAACE,MAAS;AAC7E,cAAMC,IAASL,EAAoBM,EAAKF,CAAI,GAAGH,EAAW,SAAS,EAAE;AACrE,QAAAE,EAAiB,IAAIG,EAAKF,CAAI,GAAGC,CAAM;AAAA,MAC3C,CAAC,GACMF;AAAA,IACX;AAAA,IACA,KAAK;AACD,aAAOI,EAAiCR,GAAWE,EAAW,UAAUA,EAAW,kBAAkB;AAAA,IACzG,KAAK;AACD,aAAOO,EAA+BT,GAAWE,EAAW,UAAUA,EAAW,kBAAkB;AAAA,IACvG,KAAK;AACD,aAAOQ,EAAiCV,GAAWE,EAAW,QAAQ;AAAA,IAC1E,KAAK;AACD,aAAOS,EAA8BX,GAAWE,EAAW,SAASA,EAAW,QAAQ;AAAA,IAC3F;AACI,aAAOU,EAAqBZ,CAAS;AAAA,EACjD;AACA,GACaY,IAAuB,CAACZ,MAAc;AAC/C,MAAIG;AACJ,QAAMC,IAAmB,oBAAI,IAAG;AAChC,UAACD,IAAKH,EAAU,WAAW,QAAQG,MAAO,UAAkBA,EAAG,QAAQ,CAACE,MAAS;AAC7E,IAAAD,EAAiB,IAAIG,EAAKF,CAAI,GAAG,CAAC;AAAA,EACtC,CAAC,GACMD;AACX,GAUaI,IAAmC,CAACR,GAAWa,GAAUC,MAAuB;AACzF,QAAMV,IAAmBQ,EAAqBZ,CAAS,GACjD,EAAE,OAAAe,IAAQ,CAAA,EAAE,IAAKf;AACvB,SAAAe,EAAM,QAAQ,CAACC,MAAW;AACtB,IAAAD,EAAM,QAAQ,CAACE,MAAW;AACtB,UAAID,MAAWC,GAAQ;AACnB,cAAM,EAAE,SAAAC,EAAO,IAAKC,EAAiBnB,GAAWO,EAAKS,CAAM,GAAGT,EAAKU,CAAM,GAAGJ,GAAUC,CAAkB,GAClGM,IAAYF,EAAQ;AAC1B,QAAAA,EAAQ,KAAI,EAAG,QAAQ,CAACG,MAAW;AAC/B,UAAIA,MAAWd,EAAKS,CAAM,KAAKK,MAAWd,EAAKU,CAAM,KACjDb,EAAiB,IAAIiB,GAAQjB,EAAiB,IAAIiB,CAAM,IAAI,IAAID,CAAS;AAAA,QAEjF,CAAC;AAAA,MACL;AAAA,IACJ,CAAC;AAAA,EACL,CAAC,GACMhB;AACX,GAUaK,IAAiC,CAACT,GAAWa,GAAUC,MAAuB;AACvF,QAAMV,IAAmB,oBAAI,IAAG,GAC1B,EAAE,OAAAW,IAAQ,CAAA,EAAE,IAAKf;AACvB,SAAAe,EAAM,QAAQ,CAACC,MAAW;AACtB,UAAMM,IAAcP,EAAM,OAAO,CAACQ,GAAKN,MAAW;AAC9C,UAAID,MAAWC,GAAQ;AACnB,cAAM,EAAE,QAAAO,EAAM,IAAKL,EAAiBnB,GAAWO,EAAKS,CAAM,GAAGT,EAAKU,CAAM,GAAGJ,GAAUC,CAAkB;AACvG,QAAAS,KAAOC;AAAA,MACX;AACA,aAAOD;AAAA,IACX,GAAG,CAAC;AACJ,IAAAnB,EAAiB,IAAIG,EAAKS,CAAM,GAAG,IAAIM,CAAW;AAAA,EACtD,CAAC,GACMlB;AACX,GAUaO,IAAgC,CAACX,GAAWyB,GAASC,MAAa;AAC3E,MAAIvB;AACJ,QAAMC,IAAmB,oBAAI,IAAG,GAC1BuB,IAAOC,EAAS5B,GAAWyB,GAASC,CAAQ;AAClD,UAACvB,IAAKH,EAAU,WAAW,QAAQG,MAAO,UAAkBA,EAAG,QAAQ,CAACE,MAAS;AAC7E,IAAAD,EAAiB,IAAIG,EAAKF,CAAI,GAAGsB,EAAKpB,EAAKF,CAAI,CAAC,CAAC;AAAA,EACrD,CAAC,GACMD;AACX,GASaM,IAAmC,CAACV,GAAWa,MAAa;AACrE,QAAM,EAAE,OAAAE,IAAQ,CAAA,EAAE,IAAKf,GACjB6B,IAAkBC,EAAsB9B,GAAWa,CAAQ,GAC3DkB,IAAcC,EAAeH,GAAiBd,EAAM,MAAM,GAC1DX,IAAmB,oBAAI,IAAG;AAChC,SAAAW,EAAM,QAAQ,CAACV,GAAM4B,MAAU;AAC3B,IAAA7B,EAAiB,IAAIG,EAAKF,CAAI,GAAG0B,EAAYE,CAAK,CAAC;AAAA,EACvD,CAAC,GACM7B;AACX,GASa0B,IAAwB,CAAC9B,GAAWa,MAAa;AAC1D,QAAM,EAAE,OAAAE,IAAQ,CAAA,GAAI,OAAAmB,IAAQ,CAAA,EAAE,IAAKlC,GAC7BmC,IAAS,MAAMpB,EAAM,MAAM,EAC5B,KAAK,IAAI,EACT,IAAI,MAAM,MAAMA,EAAM,MAAM,EAAE,KAAK,CAAC,CAAC;AAC1C,SAAAmB,EAAM,QAAQ,CAAC,EAAE,QAAAlB,GAAQ,QAAAC,EAAM,MAAO;AAClC,UAAMmB,IAASrB,EAAM,UAAU,CAACV,MAASE,EAAKF,CAAI,MAAMW,CAAM,GACxDqB,IAAStB,EAAM,UAAU,CAACV,MAASE,EAAKF,CAAI,MAAMY,CAAM;AAC9D,IAAIJ,IACAsB,EAAOC,CAAM,EAAEC,CAAM,IAAI,KAGzBF,EAAOC,CAAM,EAAEC,CAAM,IAAI,GACzBF,EAAOE,CAAM,EAAED,CAAM,IAAI;AAAA,EAEjC,CAAC,GACMD;AACX,GAYMH,IAAiB,CAACG,GAAQG,GAAUC,IAAgB,KAAKC,IAAY,SAAS;AAChF,MAAIT,IAAc,MAAMO,CAAQ,EAAE,KAAK,CAAC,GACpCG,IAAO;AACX,WAASC,IAAO,GAAGA,IAAOH,KAAiBE,IAAOD,GAAWE,KAAQ;AACjE,UAAMC,IAAiB,MAAML,CAAQ,EAAE,KAAK,CAAC;AAC7C,aAASM,IAAI,GAAGA,IAAIN,GAAUM;AAC1B,eAASC,IAAI,GAAGA,IAAIP,GAAUO;AAC1B,QAAAF,EAAeC,CAAC,KAAKT,EAAOS,CAAC,EAAEC,CAAC,IAAId,EAAYc,CAAC;AAGzD,UAAMC,IAAO,KAAK,KAAKH,EAAe,OAAO,CAACI,GAAKC,MAAQD,IAAMC,IAAMA,GAAK,CAAC,CAAC;AAC9E,aAASJ,IAAI,GAAGA,IAAIN,GAAUM;AAC1B,MAAAD,EAAeC,CAAC,KAAKE;AAEzB,IAAAL,IAAO,KAAK,KAAKE,EAAe,OAAO,CAACI,GAAKC,GAAKf,MAAUc,KAAOC,IAAMjB,EAAYE,CAAK,KAAKe,GAAK,CAAC,CAAC,GACtGjB,IAAcY;AAAA,EAClB;AACA,SAAOZ;AACX;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,51 @@
+import { idOf as i } from "./id.js";
+import l from "../../../util/esm/lodash/group-by.js";
+function U(a) {
+  const e = {
+    Added: /* @__PURE__ */ new Map(),
+    Updated: /* @__PURE__ */ new Map(),
+    Removed: /* @__PURE__ */ new Map()
+  };
+  return a.forEach((t) => {
+    const { type: o, value: s } = t, d = i(s);
+    if (o === "NodeAdded" || o === "EdgeAdded" || o === "ComboAdded")
+      e.Added.set(d, t);
+    else if (o === "NodeUpdated" || o === "EdgeUpdated" || o === "ComboUpdated")
+      if (e.Added.has(d))
+        e.Added.set(d, { type: o.replace("Updated", "Added"), value: s });
+      else if (e.Updated.has(d)) {
+        const { original: p } = e.Updated.get(d);
+        e.Updated.set(d, { type: o, value: s, original: p });
+      } else e.Removed.has(d) || e.Updated.set(d, t);
+    else (o === "NodeRemoved" || o === "EdgeRemoved" || o === "ComboRemoved") && (e.Added.has(d) ? e.Added.delete(d) : (e.Updated.has(d) && e.Updated.delete(d), e.Removed.set(d, t)));
+  }), [
+    ...Array.from(e.Added.values()),
+    ...Array.from(e.Updated.values()),
+    ...Array.from(e.Removed.values())
+  ];
+}
+function u(a) {
+  const { NodeAdded: e = [], NodeUpdated: t = [], NodeRemoved: o = [], EdgeAdded: s = [], EdgeUpdated: d = [], EdgeRemoved: p = [], ComboAdded: m = [], ComboUpdated: r = [], ComboRemoved: f = [] } = l(a, (A) => A.type);
+  return {
+    add: {
+      nodes: e,
+      edges: s,
+      combos: m
+    },
+    update: {
+      nodes: t,
+      edges: d,
+      combos: r
+    },
+    remove: {
+      nodes: o,
+      edges: p,
+      combos: f
+    }
+  };
+}
+export {
+  u as groupByChangeType,
+  U as reduceDataChanges
+};
+//# sourceMappingURL=change.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"change.js","sources":["../../../../../../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":["reduceDataChanges","changes","results","change","type","value","id","idOf","original","groupByChangeType","NodeAdded","NodeUpdated","NodeRemoved","EdgeAdded","EdgeUpdated","EdgeRemoved","ComboAdded","ComboUpdated","ComboRemoved","groupBy"],"mappings":";;AASO,SAASA,EAAkBC,GAAS;AACvC,QAAMC,IAAU;AAAA,IACZ,OAAO,oBAAI,IAAG;AAAA,IACd,SAAS,oBAAI,IAAG;AAAA,IAChB,SAAS,oBAAI,IAAG;AAAA,EACxB;AACI,SAAAD,EAAQ,QAAQ,CAACE,MAAW;AACxB,UAAM,EAAE,MAAAC,GAAM,OAAAC,EAAK,IAAKF,GAClBG,IAAKC,EAAKF,CAAK;AACrB,QAAID,MAAS,eAAeA,MAAS,eAAeA,MAAS;AACzD,MAAAF,EAAQ,MAAM,IAAII,GAAIH,CAAM;AAAA,aAEvBC,MAAS,iBAAiBA,MAAS,iBAAiBA,MAAS;AAGlE,UAAIF,EAAQ,MAAM,IAAII,CAAE;AACpB,QAAAJ,EAAQ,MAAM,IAAII,GAAI,EAAE,MAAMF,EAAK,QAAQ,WAAW,OAAO,GAAG,OAAAC,EAAK,CAAE;AAAA,eAIlEH,EAAQ,QAAQ,IAAII,CAAE,GAAG;AAC9B,cAAM,EAAE,UAAAE,EAAQ,IAAKN,EAAQ,QAAQ,IAAII,CAAE;AAC3C,QAAAJ,EAAQ,QAAQ,IAAII,GAAI,EAAE,MAAAF,GAAM,OAAAC,GAAO,UAAAG,GAAU;AAAA,MACrD,MACK,CAAIN,EAAQ,QAAQ,IAAII,CAAE,KAK3BJ,EAAQ,QAAQ,IAAII,GAAIH,CAAM;AAAA,QAEjC,EAAIC,MAAS,iBAAiBA,MAAS,iBAAiBA,MAAS,oBAG9DF,EAAQ,MAAM,IAAII,CAAE,IACpBJ,EAAQ,MAAM,OAAOI,CAAE,KAElBJ,EAAQ,QAAQ,IAAII,CAAE,KAC3BJ,EAAQ,QAAQ,OAAOI,CAAE,GACzBJ,EAAQ,QAAQ,IAAII,GAAIH,CAAM;AAAA,EAM1C,CAAC,GAGM;AAAA,IACH,GAAG,MAAM,KAAKD,EAAQ,MAAM,OAAM,CAAE;AAAA,IACpC,GAAG,MAAM,KAAKA,EAAQ,QAAQ,OAAM,CAAE;AAAA,IACtC,GAAG,MAAM,KAAKA,EAAQ,QAAQ,OAAM,CAAE;AAAA,EAC9C;AACA;AAQO,SAASO,EAAkBR,GAAS;AACvC,QAAM,EAAE,WAAAS,IAAY,IAAI,aAAAC,IAAc,CAAA,GAAI,aAAAC,IAAc,CAAA,GAAI,WAAAC,IAAY,CAAA,GAAI,aAAAC,IAAc,CAAA,GAAI,aAAAC,IAAc,IAAI,YAAAC,IAAa,CAAA,GAAI,cAAAC,IAAe,CAAA,GAAI,cAAAC,IAAe,CAAA,MAAQC,EAAQlB,GAAS,CAACE,MAAWA,EAAO,IAAI;AACnN,SAAO;AAAA,IACH,KAAK;AAAA,MACD,OAAOO;AAAA,MACP,OAAOG;AAAA,MACP,QAAQG;AAAA,IACpB;AAAA,IACQ,QAAQ;AAAA,MACJ,OAAOL;AAAA,MACP,OAAOG;AAAA,MACP,QAAQG;AAAA,IACpB;AAAA,IACQ,QAAQ;AAAA,MACJ,OAAOL;AAAA,MACP,OAAOG;AAAA,MACP,QAAQG;AAAA,IACpB;AAAA,EACA;AACA;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,8 @@
+function e(o) {
+  var l;
+  return !!(!((l = o.style) === null || l === void 0) && l.collapsed);
+}
+export {
+  e as isCollapsed
+};
+//# sourceMappingURL=collapsibility.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"collapsibility.js","sources":["../../../../../../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":["isCollapsed","nodeLike","_a"],"mappings":"AAOO,SAASA,EAAYC,GAAU;AAClC,MAAIC;AACJ,SAAO,CAAC,EAAG,GAAAA,IAAKD,EAAS,WAAW,QAAQC,MAAO,WAAkBA,EAAG;AAC5E;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/g6/esm/utils/data.js

@@ -0,0 +1,35 @@
+var o = function(t, a) {
+  var s = {};
+  for (var e in t) Object.prototype.hasOwnProperty.call(t, e) && a.indexOf(e) < 0 && (s[e] = t[e]);
+  if (t != null && typeof Object.getOwnPropertySymbols == "function")
+    for (var n = 0, e = Object.getOwnPropertySymbols(t); n < e.length; n++)
+      a.indexOf(e[n]) < 0 && Object.prototype.propertyIsEnumerable.call(t, e[n]) && (s[e[n]] = t[e[n]]);
+  return s;
+};
+function E(t, a) {
+  const { data: s, style: e } = t, n = o(t, ["data", "style"]), { data: c, style: f } = a, y = o(a, ["data", "style"]), r = Object.assign(Object.assign({}, n), y);
+  return (s || c) && Object.assign(r, { data: Object.assign(Object.assign({}, s), c) }), (e || f) && Object.assign(r, { style: Object.assign(Object.assign({}, e), f) }), r;
+}
+function _(t) {
+  const { data: a, style: s } = t, n = o(t, ["data", "style"]);
+  return a && (n.data = Object.assign({}, a)), s && (n.style = Object.assign({}, s)), n;
+}
+function p(t = {}, a = {}) {
+  const { states: s = [], data: e = {}, style: n = {}, children: c = [] } = t, f = o(t, ["states", "data", "style", "children"]), { states: y = [], data: r = {}, style: j = {}, children: m = [] } = a, h = o(a, ["states", "data", "style", "children"]), O = (i, l) => i.length !== l.length ? !1 : i.every((d, g) => d === l[g]), u = (i, l) => {
+    const d = Object.keys(i), g = Object.keys(l);
+    return d.length !== g.length ? !1 : d.every((b) => i[b] === l[b]);
+  };
+  return !(!u(f, h) || !O(c, m) || !O(s, y) || !u(e, r) || !u(n, j));
+}
+const D = "__internal_override__";
+function v(t) {
+  return t[D] !== !1;
+}
+export {
+  D as OVERRIDE_KEY,
+  _ as cloneElementData,
+  p as isElementDataEqual,
+  v as isOverridable,
+  E as mergeElementsData
+};
+//# sourceMappingURL=data.js.map

package/dist/node_modules/@antv/g6/esm/utils/data.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"data.js","sources":["../../../../../../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":["__rest","s","e","t","p","i","mergeElementsData","original","modified","originalData","originalStyle","originalAttrs","modifiedData","modifiedStyle","modifiedAttrs","result","cloneElementData","data","customData","style","clonedData","isElementDataEqual","originalStates","originalChildren","modifiedStates","modifiedChildren","isArrayEqual","arr1","arr2","item","index","isObjectEqual","obj1","obj2","keys1","keys2","key","OVERRIDE_KEY","isOverridable","datum"],"mappings":"AAAA,IAAIA,IAAkC,SAAUC,GAAGC,GAAG;AAClD,MAAIC,IAAI,CAAA;AACR,WAASC,KAAKH,EAAG,CAAI,OAAO,UAAU,eAAe,KAAKA,GAAGG,CAAC,KAAKF,EAAE,QAAQE,CAAC,IAAI,MAC9ED,EAAEC,CAAC,IAAIH,EAAEG,CAAC;AACd,MAAIH,KAAK,QAAQ,OAAO,OAAO,yBAA0B;AACrD,aAASI,IAAI,GAAGD,IAAI,OAAO,sBAAsBH,CAAC,GAAGI,IAAID,EAAE,QAAQC;AAC/D,MAAIH,EAAE,QAAQE,EAAEC,CAAC,CAAC,IAAI,KAAK,OAAO,UAAU,qBAAqB,KAAKJ,GAAGG,EAAEC,CAAC,CAAC,MACzEF,EAAEC,EAAEC,CAAC,CAAC,IAAIJ,EAAEG,EAAEC,CAAC,CAAC;AAE5B,SAAOF;AACX;AAcO,SAASG,EAAkBC,GAAUC,GAAU;AAClD,QAAM,EAAE,MAAMC,GAAc,OAAOC,EAAa,IAAKH,GAAUI,IAAgBX,EAAOO,GAAU,CAAC,QAAQ,OAAO,CAAC,GAC3G,EAAE,MAAMK,GAAc,OAAOC,EAAa,IAAKL,GAAUM,IAAgBd,EAAOQ,GAAU,CAAC,QAAQ,OAAO,CAAC,GAC3GO,IAAS,OAAO,OAAO,OAAO,OAAO,CAAA,GAAIJ,CAAa,GAAGG,CAAa;AAC5E,UAAIL,KAAgBG,MAChB,OAAO,OAAOG,GAAQ,EAAE,MAAM,OAAO,OAAO,OAAO,OAAO,CAAA,GAAIN,CAAY,GAAGG,CAAY,EAAC,CAAE,IAE5FF,KAAiBG,MACjB,OAAO,OAAOE,GAAQ,EAAE,OAAO,OAAO,OAAO,OAAO,OAAO,CAAA,GAAIL,CAAa,GAAGG,CAAa,EAAC,CAAE,GAE5FE;AACX;AAYO,SAASC,EAAiBC,GAAM;AACnC,QAAM,EAAE,MAAMC,GAAY,OAAAC,EAAK,IAAKF,GAC9BG,IADgDpB,EAAOiB,GAAM,CAAC,QAAQ,OAAO,CAAC;AAEpF,SAAIC,MACAE,EAAW,OAAO,OAAO,OAAO,CAAA,GAAIF,CAAU,IAC9CC,MACAC,EAAW,QAAQ,OAAO,OAAO,CAAA,GAAID,CAAK,IACvCC;AACX;AAuBO,SAASC,EAAmBd,IAAW,IAAIC,IAAW,CAAA,GAAI;AAC7D,QAAM,EAAE,QAAQc,IAAiB,CAAA,GAAI,MAAMb,IAAe,CAAA,GAAI,OAAOC,IAAgB,CAAA,GAAI,UAAUa,IAAmB,CAAA,MAAOhB,GAAUI,IAAgBX,EAAOO,GAAU,CAAC,UAAU,QAAQ,SAAS,UAAU,CAAC,GACzM,EAAE,QAAQiB,IAAiB,CAAA,GAAI,MAAMZ,IAAe,CAAA,GAAI,OAAOC,IAAgB,CAAA,GAAI,UAAUY,IAAmB,CAAA,MAAOjB,GAAUM,IAAgBd,EAAOQ,GAAU,CAAC,UAAU,QAAQ,SAAS,UAAU,CAAC,GACzMkB,IAAe,CAACC,GAAMC,MACpBD,EAAK,WAAWC,EAAK,SACd,KACJD,EAAK,MAAM,CAACE,GAAMC,MAAUD,MAASD,EAAKE,CAAK,CAAC,GAErDC,IAAgB,CAACC,GAAMC,MAAS;AAClC,UAAMC,IAAQ,OAAO,KAAKF,CAAI,GACxBG,IAAQ,OAAO,KAAKF,CAAI;AAC9B,WAAIC,EAAM,WAAWC,EAAM,SAChB,KACJD,EAAM,MAAM,CAACE,MAAQJ,EAAKI,CAAG,MAAMH,EAAKG,CAAG,CAAC;AAAA,EACvD;AASA,SARI,GAACL,EAAcpB,GAAeG,CAAa,KAE3C,CAACY,EAAaH,GAAkBE,CAAgB,KAEhD,CAACC,EAAaJ,GAAgBE,CAAc,KAE5C,CAACO,EAActB,GAAcG,CAAY,KAEzC,CAACmB,EAAcrB,GAAeG,CAAa;AAGnD;AACY,MAACwB,IAAe;AAQrB,SAASC,EAAcC,GAAO;AACjC,SAAOA,EAAMF,CAAY,MAAM;AACnC;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/g6/esm/utils/diff.js

@@ -0,0 +1,13 @@
+import u from "../../../util/esm/lodash/is-equal.js";
+function l(f, g, n, h = u) {
+  const s = new Map(f.map((t) => [n(t), t])), e = new Map(g.map((t) => [n(t), t])), o = new Set(s.keys()), a = new Set(e.keys()), i = [], p = [], r = [], c = [];
+  return a.forEach((t) => {
+    o.has(t) ? h(s.get(t), e.get(t)) ? c.push(e.get(t)) : p.push(e.get(t)) : i.push(e.get(t));
+  }), o.forEach((t) => {
+    a.has(t) || r.push(s.get(t));
+  }), { enter: i, exit: r, keep: c, update: p };
+}
+export {
+  l as arrayDiff
+};
+//# sourceMappingURL=diff.js.map

package/dist/node_modules/@antv/g6/esm/utils/diff.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"diff.js","sources":["../../../../../../node_modules/@antv/g6/esm/utils/diff.js"],"sourcesContent":["import { isEqual } from '@antv/util';\n/**\n * <zh/> 比较两个数组的差异\n *\n * <en/> compare the difference between two arrays\n * @param original - <zh/> 原始数组 | <en/> original array\n * @param modified - <zh/> 修改后的数组 | <en/> modified array\n * @param key - <zh/> 比较的 key | <en/> key to compare\n * @param comparator - <zh/> 比较函数 | <en/> compare function\n * @returns <zh/> 数组差异 | <en/> array diff\n */\nexport function arrayDiff(original, modified, key, comparator = isEqual) {\n    const originalMap = new Map(original.map((d) => [key(d), d]));\n    const modifiedMap = new Map(modified.map((d) => [key(d), d]));\n    const originalSet = new Set(originalMap.keys());\n    const modifiedSet = new Set(modifiedMap.keys());\n    const enter = [];\n    const update = [];\n    const exit = [];\n    const keep = [];\n    modifiedSet.forEach((key) => {\n        if (originalSet.has(key)) {\n            if (!comparator(originalMap.get(key), modifiedMap.get(key))) {\n                update.push(modifiedMap.get(key));\n            }\n            else {\n                keep.push(modifiedMap.get(key));\n            }\n        }\n        else {\n            enter.push(modifiedMap.get(key));\n        }\n    });\n    originalSet.forEach((key) => {\n        if (!modifiedSet.has(key)) {\n            exit.push(originalMap.get(key));\n        }\n    });\n    return { enter, exit, keep, update };\n}\n//# sourceMappingURL=diff.js.map"],"names":["arrayDiff","original","modified","key","comparator","isEqual","originalMap","d","modifiedMap","originalSet","modifiedSet","enter","update","exit","keep"],"mappings":";AAWO,SAASA,EAAUC,GAAUC,GAAUC,GAAKC,IAAaC,GAAS;AACrE,QAAMC,IAAc,IAAI,IAAIL,EAAS,IAAI,CAACM,MAAM,CAACJ,EAAII,CAAC,GAAGA,CAAC,CAAC,CAAC,GACtDC,IAAc,IAAI,IAAIN,EAAS,IAAI,CAACK,MAAM,CAACJ,EAAII,CAAC,GAAGA,CAAC,CAAC,CAAC,GACtDE,IAAc,IAAI,IAAIH,EAAY,KAAI,CAAE,GACxCI,IAAc,IAAI,IAAIF,EAAY,KAAI,CAAE,GACxCG,IAAQ,CAAA,GACRC,IAAS,CAAA,GACTC,IAAO,CAAA,GACPC,IAAO,CAAA;AACb,SAAAJ,EAAY,QAAQ,CAACP,MAAQ;AACzB,IAAIM,EAAY,IAAIN,CAAG,IACdC,EAAWE,EAAY,IAAIH,CAAG,GAAGK,EAAY,IAAIL,CAAG,CAAC,IAItDW,EAAK,KAAKN,EAAY,IAAIL,CAAG,CAAC,IAH9BS,EAAO,KAAKJ,EAAY,IAAIL,CAAG,CAAC,IAOpCQ,EAAM,KAAKH,EAAY,IAAIL,CAAG,CAAC;AAAA,EAEvC,CAAC,GACDM,EAAY,QAAQ,CAACN,MAAQ;AACzB,IAAKO,EAAY,IAAIP,CAAG,KACpBU,EAAK,KAAKP,EAAY,IAAIH,CAAG,CAAC;AAAA,EAEtC,CAAC,GACM,EAAE,OAAAQ,GAAO,MAAAE,GAAM,MAAAC,GAAM,QAAAF,EAAM;AACtC;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/g6/esm/utils/dom.js

@@ -0,0 +1,22 @@
+import g from "../../../util/esm/lodash/is-number.js";
+const n = (e) => e ? parseInt(e) : 0;
+function a(e) {
+  const t = getComputedStyle(e), i = e.clientWidth || n(t.width), o = e.clientHeight || n(t.height), h = n(t.paddingLeft) + n(t.paddingRight), d = n(t.paddingTop) + n(t.paddingBottom);
+  return [i - h, o - d];
+}
+function p(e) {
+  if (!e)
+    return [0, 0];
+  let t = 640, i = 480;
+  const [o, h] = a(e);
+  t = o || t, i = h || i;
+  const d = 1, r = 1;
+  return [
+    Math.max(g(t) ? t : d, d),
+    Math.max(g(i) ? i : r, r)
+  ];
+}
+export {
+  p as sizeOf
+};
+//# sourceMappingURL=dom.js.map

package/dist/node_modules/@antv/g6/esm/utils/dom.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dom.js","sources":["../../../../../../node_modules/@antv/g6/esm/utils/dom.js"],"sourcesContent":["import { isNumber } from '@antv/util';\nconst parseInt10 = (d) => (d ? parseInt(d) : 0);\n/**\n * Get the container's bounding size.\n * @param container dom element.\n * @returns the container width and height\n */\nfunction getContainerSize(container) {\n    const style = getComputedStyle(container);\n    const wrapperWidth = container.clientWidth || parseInt10(style.width);\n    const wrapperHeight = container.clientHeight || parseInt10(style.height);\n    const widthPadding = parseInt10(style.paddingLeft) + parseInt10(style.paddingRight);\n    const heightPadding = parseInt10(style.paddingTop) + parseInt10(style.paddingBottom);\n    return [wrapperWidth - widthPadding, wrapperHeight - heightPadding];\n}\n/**\n * Get the size of Graph.\n * @param container container of Graph\n * @returns Size of Graph\n */\nexport function sizeOf(container) {\n    if (!container)\n        return [0, 0];\n    let effectiveWidth = 640;\n    let effectiveHeight = 480;\n    const [containerWidth, containerHeight] = getContainerSize(container);\n    effectiveWidth = containerWidth || effectiveWidth;\n    effectiveHeight = containerHeight || effectiveHeight;\n    /** Minimum width */\n    const MIN_CHART_WIDTH = 1;\n    /** Minimum height */\n    const MIN_CHART_HEIGHT = 1;\n    return [\n        Math.max(isNumber(effectiveWidth) ? effectiveWidth : MIN_CHART_WIDTH, MIN_CHART_WIDTH),\n        Math.max(isNumber(effectiveHeight) ? effectiveHeight : MIN_CHART_HEIGHT, MIN_CHART_HEIGHT),\n    ];\n}\n//# sourceMappingURL=dom.js.map"],"names":["parseInt10","d","getContainerSize","container","style","wrapperWidth","wrapperHeight","widthPadding","heightPadding","sizeOf","effectiveWidth","effectiveHeight","containerWidth","containerHeight","MIN_CHART_WIDTH","MIN_CHART_HEIGHT","isNumber"],"mappings":";AACA,MAAMA,IAAa,CAACC,MAAOA,IAAI,SAASA,CAAC,IAAI;AAM7C,SAASC,EAAiBC,GAAW;AACjC,QAAMC,IAAQ,iBAAiBD,CAAS,GAClCE,IAAeF,EAAU,eAAeH,EAAWI,EAAM,KAAK,GAC9DE,IAAgBH,EAAU,gBAAgBH,EAAWI,EAAM,MAAM,GACjEG,IAAeP,EAAWI,EAAM,WAAW,IAAIJ,EAAWI,EAAM,YAAY,GAC5EI,IAAgBR,EAAWI,EAAM,UAAU,IAAIJ,EAAWI,EAAM,aAAa;AACnF,SAAO,CAACC,IAAeE,GAAcD,IAAgBE,CAAa;AACtE;AAMO,SAASC,EAAON,GAAW;AAC9B,MAAI,CAACA;AACD,WAAO,CAAC,GAAG,CAAC;AAChB,MAAIO,IAAiB,KACjBC,IAAkB;AACtB,QAAM,CAACC,GAAgBC,CAAe,IAAIX,EAAiBC,CAAS;AACpE,EAAAO,IAAiBE,KAAkBF,GACnCC,IAAkBE,KAAmBF;AAErC,QAAMG,IAAkB,GAElBC,IAAmB;AACzB,SAAO;AAAA,IACH,KAAK,IAAIC,EAASN,CAAc,IAAIA,IAAiBI,GAAiBA,CAAe;AAAA,IACrF,KAAK,IAAIE,EAASL,CAAe,IAAIA,IAAkBI,GAAkBA,CAAgB;AAAA,EACjG;AACA;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/g6/esm/utils/edge.js

@@ -0,0 +1,291 @@
+import { getNodeBBox as F, getBBoxSize as U, getNearestBoundarySide as N, getBBoxHeight as $, getBBoxWidth as Y } from "./bbox.js";
+import { isCollapsed as X } from "./collapsibility.js";
+import { getPortConnectionPoint as x, getAllPorts as K, getPortPosition as W, getNodeConnectionPoint as z } from "./element.js";
+import { idOf as P } from "./id.js";
+import { parsePoint as d, isHorizontal as tt, isCollinear as nt, moveTo as H } from "./point.js";
+import { freeJoin as et } from "./router/orth.js";
+import { distance as S, normalize as V, subtract as v, add as T, perpendicular as at, multiply as rt, manhattanDistance as Q } from "./vector.js";
+import w from "../../../util/esm/lodash/is-equal.js";
+import j from "../../../util/esm/lodash/is-number.js";
+const ot = {
+  top: 0,
+  bottom: 0,
+  left: Math.PI / 2,
+  right: Math.PI / 2,
+  "top-right": Math.PI / 4,
+  "right-top": Math.PI / 4,
+  "bottom-left": Math.PI / 4,
+  "left-bottom": Math.PI / 4,
+  "right-bottom": -Math.PI / 4,
+  "bottom-right": -Math.PI / 4,
+  "left-top": -Math.PI / 4,
+  "top-left": -Math.PI / 4
+};
+function st(e, t, r, a, n, o, c) {
+  var h;
+  let g = typeof t == "number" ? t : 0.5;
+  if (t === "start" && (g = 0), t === "end" && (g = 0.99), o && c) {
+    g = 0.5, a = 0, n = 0;
+    let I = (h = ot[c]) !== null && h !== void 0 ? h : 0;
+    Math.cos(I) < -1e-6 && (I += Math.PI);
+    const L = r && I !== 0, [B, E] = O(e, g, a, n, L ? I : void 0), _ = [["translate", B, E]];
+    return L && _.push(["rotate", I / Math.PI * 180]), { textAlign: "center", transform: _ };
+  }
+  const u = d(e.getPoint(g)), p = d(e.getPoint(g + 0.01));
+  let M = t === "start" ? "left" : t === "end" ? "right" : "center";
+  if (tt(u, p) || !r) {
+    const [I, L] = O(e, g, a, n);
+    return { transform: [["translate", I, L]], textAlign: M };
+  }
+  let i = Math.atan2(p[1] - u[1], p[0] - u[0]);
+  p[0] < u[0] && (M = M === "center" ? M : M === "left" ? "right" : "left", a *= -1, i += Math.PI);
+  const [R, m] = O(e, g, a, n, i), A = [
+    ["translate", R, m],
+    ["rotate", i / Math.PI * 180]
+  ];
+  return {
+    textAlign: M,
+    transform: A
+  };
+}
+function Ct(e, t, r, a, n) {
+  var o, c;
+  const h = ((o = e.badge) === null || o === void 0 ? void 0 : o.getGeometryBounds().halfExtents[0]) * 2 || 0, s = ((c = e.label) === null || c === void 0 ? void 0 : c.getGeometryBounds().halfExtents[0]) * 2 || 0;
+  return st(e.key, r, !0, (s ? (s / 2 + h / 2) * (t === "suffix" ? 1 : -1) : 0) + a, n);
+}
+function O(e, t, r, a, n) {
+  const [o, c] = d(e.getPoint(t));
+  let h = r, s = a;
+  return n && (h = r * Math.cos(n) - a * Math.sin(n), s = r * Math.sin(n) + a * Math.cos(n)), [o + h, c + s];
+}
+function Lt(e, t, r, a) {
+  if (w(e, t))
+    return e;
+  const n = v(t, e), o = [
+    e[0] + r * n[0],
+    e[1] + r * n[1]
+  ], c = V(at(n, !1));
+  return o[0] += a * c[0], o[1] += a * c[1], o;
+}
+function Tt(e) {
+  return j(e) ? [e, -e] : e;
+}
+function Et(e) {
+  return j(e) ? [e, 1 - e] : e;
+}
+function Rt(e, t, r) {
+  return [
+    ["M", e[0], e[1]],
+    ["Q", r[0], r[1], t[0], t[1]]
+  ];
+}
+function q(e, t, r) {
+  return [
+    ["M", e[0], e[1]],
+    [
+      "C",
+      r[0][0],
+      r[0][1],
+      r[1][0],
+      r[1][1],
+      t[0],
+      t[1]
+    ]
+  ];
+}
+function ct(e, t = 0, r = !1) {
+  const a = e.length - 1, n = e[0], o = e[a], c = e.slice(1, a), h = [["M", n[0], n[1]]];
+  return c.forEach((s, l) => {
+    const f = c[l - 1] || n, g = c[l + 1] || o;
+    if (!nt(f, s, g) && t) {
+      const [u, p] = ht(f, s, g, t);
+      h.push(["L", u[0], u[1]], ["Q", s[0], s[1], p[0], p[1]], ["L", p[0], p[1]]);
+    } else
+      h.push(["L", s[0], s[1]]);
+  }), h.push(["L", o[0], o[1]]), r && h.push(["Z"]), h;
+}
+function ht(e, t, r, a) {
+  const n = Q(e, t), o = Q(r, t), c = Math.min(a, Math.min(n, o) / 2), h = [
+    t[0] - c / n * (t[0] - e[0]),
+    t[1] - c / n * (t[1] - e[1])
+  ], s = [
+    t[0] - c / o * (t[0] - r[0]),
+    t[1] - c / o * (t[1] - r[1])
+  ];
+  return [h, s];
+}
+const lt = (e) => {
+  const t = Math.PI / 2, r = $(e) / 2, a = Y(e) / 2, n = Math.atan2(r, a) / 2, o = Math.atan2(a, r) / 2;
+  return {
+    top: [-t - o, -t + o],
+    "top-right": [-t + o, -n],
+    "right-top": [-t + o, -n],
+    right: [-n, n],
+    "bottom-right": [n, t - o],
+    "right-bottom": [n, t - o],
+    bottom: [t - o, t + o],
+    "bottom-left": [t + o, Math.PI - n],
+    "left-bottom": [t + o, Math.PI - n],
+    left: [Math.PI - n, Math.PI + n],
+    "top-left": [Math.PI + n, -t - o],
+    "left-top": [Math.PI + n, -t - o]
+  };
+};
+function k(e, t, r, a, n) {
+  const o = F(e), c = e.getCenter();
+  let h = a && W(a), s = n && W(n);
+  if (!h || !s) {
+    const l = lt(o), f = l[t][0], g = l[t][1], [u, p] = U(o), M = Math.max(u, p), i = T(c, [M * Math.cos(f), M * Math.sin(f), 0]), C = T(c, [M * Math.cos(g), M * Math.sin(g), 0]);
+    h = z(e, i), s = z(e, C), r || ([h, s] = [s, h]);
+  }
+  return [h, s];
+}
+function St(e, t, r, a, n, o) {
+  const c = e.getPorts()[n || o], h = e.getPorts()[o || n];
+  let [s, l] = k(e, t, r, c, h);
+  const f = J(e, s, l, a);
+  return c && (s = x(c, f[0])), h && (l = x(h, f.at(-1))), q(s, l, f);
+}
+function wt(e, t, r, a, n, o) {
+  const c = e.getPorts()[n || o], h = e.getPorts()[o || n];
+  let [s, l] = k(e, t, r, c, h);
+  if (w(s, l)) {
+    const b = J(e, s, l, a);
+    return c && (s = x(c, b[0])), h && (l = x(h, b.at(-1))), q(s, l, b);
+  }
+  const f = e.getCenter(), g = [(s[0] + l[0]) / 2, (s[1] + l[1]) / 2, 0], p = S(f, g) > 1e-6 ? V(v(g, f)) : [0, -1, 0], M = S(s, l), i = Math.max(Math.abs(a), 0.01), C = (M * M + 4 * i * i) / (8 * i), R = [g[0] + p[0] * i, g[1] + p[1] * i, 0], m = [g[0] + p[0] * (i - C), g[1] + p[1] * (i - C), 0], A = 2 * Math.PI, I = Math.atan2(s[1] - m[1], s[0] - m[0]), L = Math.atan2(l[1] - m[1], l[0] - m[0]), B = Math.atan2(R[1] - m[1], R[0] - m[0]), E = ((L - I) % A + A) % A, G = ((B - I) % A + A) % A <= E + 1e-6, y = G ? 1 : 0, Z = (G ? E : A - E) > Math.PI ? 1 : 0;
+  if (c) {
+    const b = [s[0] - m[0], s[1] - m[1], 0], D = y === 1 ? [-b[1], b[0], 0] : [b[1], -b[0], 0];
+    s = x(c, T(s, D));
+  }
+  if (h) {
+    const b = [l[0] - m[0], l[1] - m[1], 0], D = y === 1 ? [b[1], -b[0], 0] : [-b[1], b[0], 0];
+    l = x(h, T(l, D));
+  }
+  return [
+    ["M", s[0], s[1]],
+    ["A", C, C, 0, Z, y, l[0], l[1]]
+  ];
+}
+function J(e, t, r, a) {
+  const n = e.getCenter();
+  if (w(t, r)) {
+    const o = v(t, n), c = [
+      a * Math.sign(o[0]) || a / 2,
+      a * Math.sign(o[1]) || -a / 2,
+      0
+    ];
+    return [T(t, c), T(r, rt(c, [1, -1, 1]))];
+  }
+  return [
+    H(n, t, S(n, t) + a),
+    H(n, r, S(n, r) + a)
+  ];
+}
+function Bt(e, t, r, a, n, o, c) {
+  const h = K(e), s = h[o || c], l = h[c || o];
+  let [f, g] = k(e, r, a, s, l);
+  const u = ft(e, f, g, n);
+  return s && (f = x(s, u[0])), l && (g = x(l, u.at(-1))), ct([f, ...u, g], t);
+}
+function ft(e, t, r, a) {
+  const n = [], o = F(e);
+  if (w(t, r))
+    switch (N(t, o)) {
+      case "left":
+        n.push([t[0] - a, t[1]]), n.push([t[0] - a, t[1] + a]), n.push([t[0], t[1] + a]);
+        break;
+      case "right":
+        n.push([t[0] + a, t[1]]), n.push([t[0] + a, t[1] + a]), n.push([t[0], t[1] + a]);
+        break;
+      case "top":
+        n.push([t[0], t[1] - a]), n.push([t[0] + a, t[1] - a]), n.push([t[0] + a, t[1]]);
+        break;
+      case "bottom":
+        n.push([t[0], t[1] + a]), n.push([t[0] + a, t[1] + a]), n.push([t[0] + a, t[1]]);
+        break;
+    }
+  else {
+    const c = N(t, o), h = N(r, o);
+    if (c === h) {
+      const s = c;
+      let l, f;
+      switch (s) {
+        case "left":
+          l = Math.min(t[0], r[0]) - a, n.push([l, t[1]]), n.push([l, r[1]]);
+          break;
+        case "right":
+          l = Math.max(t[0], r[0]) + a, n.push([l, t[1]]), n.push([l, r[1]]);
+          break;
+        case "top":
+          f = Math.min(t[1], r[1]) - a, n.push([t[0], f]), n.push([r[0], f]);
+          break;
+        case "bottom":
+          f = Math.max(t[1], r[1]) + a, n.push([t[0], f]), n.push([r[0], f]);
+          break;
+      }
+    } else {
+      const s = (u, p) => ({
+        left: [p[0] - a, p[1]],
+        right: [p[0] + a, p[1]],
+        top: [p[0], p[1] - a],
+        bottom: [p[0], p[1] + a]
+      })[u], l = s(c, t), f = s(h, r), g = et(l, f, o);
+      n.push(l, g, f);
+    }
+  }
+  return n;
+}
+function _t(e, t) {
+  const r = /* @__PURE__ */ new Set(), a = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set();
+  return e.forEach((o) => {
+    t(o).forEach((h) => {
+      r.add(h), e.includes(h.source) && e.includes(h.target) ? a.add(h) : n.add(h);
+    });
+  }), { edges: Array.from(r), internal: Array.from(a), external: Array.from(n) };
+}
+function yt(e, t) {
+  const r = [];
+  let a = e;
+  for (; a; ) {
+    r.push(a);
+    const n = t(P(a));
+    if (n)
+      a = n;
+    else
+      break;
+  }
+  if (r.some((n) => {
+    var o;
+    return (o = n.style) === null || o === void 0 ? void 0 : o.collapsed;
+  })) {
+    const n = r.reverse().findIndex(X);
+    return r[n] || r.at(-1);
+  }
+  return e;
+}
+function Dt(e, t) {
+  return t || (e < 4 ? 10 : e === 4 ? 12 : e * 2.5);
+}
+export {
+  yt as findActualConnectNodeData,
+  wt as getArcLoopPath,
+  Dt as getArrowSize,
+  Ct as getBadgePositionStyle,
+  ht as getBorderRadiusPoints,
+  J as getCubicLoopControlPoints,
+  St as getCubicLoopPath,
+  q as getCubicPath,
+  Lt as getCurveControlPoint,
+  st as getLabelPositionStyle,
+  k as getLoopEndpoints,
+  ft as getPolylineLoopControlPoints,
+  Bt as getPolylineLoopPath,
+  ct as getPolylinePath,
+  Rt as getQuadraticPath,
+  lt as getRadians,
+  _t as getSubgraphRelatedEdges,
+  Tt as parseCurveOffset,
+  Et as parseCurvePosition
+};
+//# sourceMappingURL=edge.js.map