@hkyhy/marsun-components-core 0.1.113 → 0.1.115

package/dist/node_modules/@antv/g6/esm/transforms/process-parallel-edges.js

@@ -0,0 +1,150 @@
+import { groupByChangeType as x, reduceDataChanges as B } from "../utils/change.js";
+import { idOf as E } from "../utils/id.js";
+import { BaseTransform as N } from "./base-transform.js";
+import { getEdgeEndsContext as L } from "./get-edge-actual-ends.js";
+import { isStyleEqual as M, reassignTo as S } from "./utils.js";
+import U from "../../../util/esm/lodash/is-empty.js";
+import z from "../../../util/esm/lodash/is-equal.js";
+import $ from "../../../util/esm/lodash/is-boolean.js";
+import R from "../../../util/esm/lodash/is-function.js";
+const q = "quadratic", G = 35, F = 50, j = [
+  "top",
+  "top-right",
+  "right",
+  "right-bottom",
+  "bottom",
+  "bottom-left",
+  "left",
+  "left-top"
+];
+class _ extends N {
+  constructor(d, h) {
+    super(d, Object.assign({}, _.defaultOptions, h)), this.cacheMergeStyle = /* @__PURE__ */ new Map(), this.getAffectedParallelEdges = (o) => {
+      const { add: { edges: i }, update: { nodes: n, edges: c, combos: u }, remove: { edges: m } } = o, { model: g } = this.context, s = /* @__PURE__ */ new Map(), l = (t, e) => {
+        g.getRelatedEdgesData(e).forEach((a) => !s.has(E(a)) && s.set(E(a), a));
+      };
+      n.forEach(l), u.forEach(l);
+      const r = (t) => {
+        const e = new Set(o.remove.edges.keys()), p = g.getEdgeData().filter((a) => !e.has(E(a))).map((a) => L(g, a));
+        Y(t, p).forEach((a) => {
+          const y = E(a);
+          s.has(y) || s.set(y, a);
+        });
+      };
+      if (m.size && m.forEach(r), i.size && i.forEach(r), c.size) {
+        const t = x(B(g.getChanges())).update.edges;
+        c.forEach((e) => {
+          var p;
+          r(e);
+          const a = (p = t.find((y) => E(y.value) === E(e))) === null || p === void 0 ? void 0 : p.original;
+          a && !w(e, a) && r(a);
+        });
+      }
+      U(this.options.edges) || s.forEach((t, e) => !this.options.edges.includes(e) && s.delete(e));
+      const f = g.getEdgeData().map(E);
+      return new Map([...s].sort((t, e) => f.indexOf(t[0]) - f.indexOf(e[0])));
+    }, this.applyBundlingStyle = (o, i, n) => {
+      var c, u;
+      const { edgeMap: m, reverses: g } = C(i), s = (c = this.options.loopMode) !== null && c !== void 0 ? c : "spread", l = (u = this.options.loopDistance) !== null && u !== void 0 ? u : n, r = /* @__PURE__ */ new Map();
+      m.forEach((f) => {
+        f.forEach((t, e, p) => {
+          var a, y;
+          const T = p.length, v = t.style || {};
+          if (t.source === t.target)
+            if (s === "nested") {
+              const b = v.loopPlacement || "top", P = `${t.source}-${b}`;
+              if (v.loopPlacement = b, v.loopDist === void 0) {
+                const A = (a = r.get(P)) !== null && a !== void 0 ? a : 0;
+                v.loopDist = G + A * l, r.set(P, A + 1);
+              }
+            } else {
+              const b = j.length;
+              v.loopPlacement = j[e % b], v.loopDist = Math.floor(e / b) * n + F;
+            }
+          else if (T === 1)
+            v.curveOffset = 0;
+          else {
+            const b = (e % 2 === 0 ? 1 : -1) * (g[`${t.source}|${t.target}|${e}`] ? -1 : 1);
+            v.curveOffset = T % 2 === 1 ? b * Math.ceil(e / 2) * n * 2 : b * (Math.floor(e / 2) * n * 2 + n);
+          }
+          const I = Object.assign(t, { type: q, style: v }), D = (y = this.context.element) === null || y === void 0 ? void 0 : y.getElement(E(t));
+          (!D || !M(I.style, D.attributes)) && S(o, D ? "update" : "add", "edge", I, !0);
+        });
+      });
+    }, this.resetEdgeStyle = (o) => {
+      const i = o.style || {}, n = this.cacheMergeStyle.get(E(o)) || {};
+      return Object.keys(n).forEach((c) => {
+        z(i[c], n[c]) && (o[c] ? i[c] = o[c] : delete i[c]);
+      }), Object.assign(o, { style: i });
+    }, this.applyMergingStyle = (o, i) => {
+      const { edgeMap: n, reverses: c } = C(i);
+      n.forEach((u) => {
+        var m;
+        if (u.length === 1) {
+          const s = u[0], l = (m = this.context.element) === null || m === void 0 ? void 0 : m.getElement(E(s)), r = this.resetEdgeStyle(s);
+          (!l || !M(r, l.attributes)) && S(o, l ? "update" : "add", "edge", r);
+          return;
+        }
+        const g = u.map(({ source: s, target: l, style: r = {} }, f) => {
+          const { startArrow: t, endArrow: e } = r, p = {}, [a, y] = c[`${s}|${l}|${f}`] ? ["endArrow", "startArrow"] : ["startArrow", "endArrow"];
+          return $(t) && (p[a] = t), $(e) && (p[y] = e), p;
+        }).reduce((s, l) => Object.assign(Object.assign({}, s), l), {});
+        u.forEach((s, l, r) => {
+          var f;
+          if (l !== 0) {
+            S(o, "remove", "edge", s);
+            return;
+          }
+          const t = Object.assign({}, R(this.options.style) ? this.options.style(r) : this.options.style, { childrenData: r });
+          this.cacheMergeStyle.set(E(s), t);
+          const e = Object.assign(Object.assign({}, s), { type: "line", style: Object.assign(Object.assign(Object.assign({}, s.style), g), t) }), p = (f = this.context.element) === null || f === void 0 ? void 0 : f.getElement(E(s));
+          (!p || !M(e.style, p.attributes)) && S(o, p ? "update" : "add", "edge", e, !0);
+        });
+      });
+    };
+  }
+  /**
+   * <zh/> 在每次绘制前处理平行边
+   *
+   * <en/> Process parallel edges before each drawing
+   * @param input
+   */
+  beforeDraw(d) {
+    const h = this.getAffectedParallelEdges(d);
+    return h.size === 0 || (this.options.mode === "bundle" ? this.applyBundlingStyle(d, h, this.options.distance) : this.applyMergingStyle(d, h)), d;
+  }
+}
+_.defaultOptions = {
+  mode: "bundle",
+  distance: 15,
+  // only valid for bundling mode
+  loopMode: "spread",
+  loopDistance: 15
+};
+const C = (O) => {
+  const d = /* @__PURE__ */ new Map(), h = /* @__PURE__ */ new Set(), o = {}, i = /* @__PURE__ */ new Map();
+  for (const [n, c] of O) {
+    if (h.has(n))
+      continue;
+    const { source: u, target: m } = c, g = `${u}-${m}`;
+    d.has(g) || (d.set(g, []), i.set(g, /* @__PURE__ */ new Set()));
+    const s = d.get(g), l = i.get(g);
+    s && l && !l.has(n) && (s.push(c), l.add(n), h.add(n));
+    for (const [r, f] of O)
+      if (!(h.has(r) || r === n) && w(c, f)) {
+        const t = d.get(g), e = i.get(g);
+        t && e && !e.has(r) && (t.push(f), e.add(r), u === f.target && m === f.source && (o[`${f.source}|${f.target}|${t.length - 1}`] = !0), h.add(r));
+      }
+  }
+  return { edgeMap: d, reverses: o };
+}, Y = (O, d, h) => d.filter((o) => w(o, O)), w = (O, d) => {
+  const { sourceNode: h, targetNode: o } = O.style || {}, { sourceNode: i, targetNode: n } = d.style || {};
+  return h === i && o === n || h === n && o === i;
+};
+export {
+  _ as ProcessParallelEdges,
+  Y as getParallelEdges,
+  C as groupByEndpoints,
+  w as isParallelEdges
+};
+//# sourceMappingURL=process-parallel-edges.js.map

package/dist/node_modules/@antv/g6/esm/transforms/process-parallel-edges.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"process-parallel-edges.js","sources":["../../../../../../node_modules/@antv/g6/esm/transforms/process-parallel-edges.js"],"sourcesContent":["import { isBoolean, isEmpty, isEqual, isFunction } from '@antv/util';\nimport { groupByChangeType, reduceDataChanges } from '../utils/change';\nimport { idOf } from '../utils/id';\nimport { BaseTransform } from './base-transform';\nimport { getEdgeEndsContext } from './get-edge-actual-ends';\nimport { isStyleEqual, reassignTo } from './utils';\nconst CUBIC_EDGE_TYPE = 'quadratic';\nconst INITIAL_NESTED_LOOP_DIST = 35;\nconst INITIAL_SPREAD_LOOP_DIST = 50;\nconst CUBIC_LOOP_PLACEMENTS = [\n    'top',\n    'top-right',\n    'right',\n    'right-bottom',\n    'bottom',\n    'bottom-left',\n    'left',\n    'left-top',\n];\n/**\n * <zh/> 处理平行边，即多条边共享同一源节点和目标节点\n *\n * <en/> Process parallel edges which share the same source and target nodes\n * @remarks\n * <zh/> 平行边（Parallel Edges）是指在图结构中，两个节点之间存在多条边。这些边共享相同的源节点和目标节点，但可能代表不同的关系或属性。为了避免边的重叠和混淆，提供了两种处理平行边的方式：(1) 捆绑模式（bundle）：将平行边捆绑在一起，通过改变曲率与其他边分开；(2) 合并模式（merge）：将平行边合并为一条聚合。\n *\n * <en/> Parallel Edges refer to multiple edges existing between two nodes in a graph structure. These edges share the same source and target nodes but may represent different relationships or attributes. To avoid edge overlap and confusion, two methods are provided for handling parallel edges: (1) Bundle Mode: Bundles parallel edges together and separates them from other edges by altering their curvature; (2) Merge Mode: Merges parallel edges into a single aggregated edge.\n */\nexport class ProcessParallelEdges extends BaseTransform {\n    constructor(context, options) {\n        super(context, Object.assign({}, ProcessParallelEdges.defaultOptions, options));\n        this.cacheMergeStyle = new Map();\n        /**\n         * <zh/> 获取受影响的平行边\n         *\n         * <en/> Get affected parallel edges\n         * @param input\n         */\n        this.getAffectedParallelEdges = (input) => {\n            const { add: { edges: edgesToAdd }, update: { nodes: nodesToUpdate, edges: edgesToUpdate, combos: combosToUpdate }, remove: { edges: edgesToRemove }, } = input;\n            const { model } = this.context;\n            const edges = new Map();\n            const addRelatedEdges = (_, id) => {\n                const relatedEdgesData = model.getRelatedEdgesData(id);\n                relatedEdgesData.forEach((edge) => !edges.has(idOf(edge)) && edges.set(idOf(edge), edge));\n            };\n            nodesToUpdate.forEach(addRelatedEdges);\n            combosToUpdate.forEach(addRelatedEdges);\n            const pushParallelEdges = (edge) => {\n                // 获取已被标记删除的边ID集合\n                // Get the set of edge IDs that have been marked for removal\n                const removedEdgeIds = new Set(input.remove.edges.keys());\n                // 过滤掉已删除的边，避免重定向后重新添加（修复combo收起时内部边变成loop边的问题）\n                // Filter out removed edges to prevent them from being re-added after redirection (fixes the issue where internal edges become loop edges when combo collapses)\n                const validEdgeData = model\n                    .getEdgeData()\n                    .filter((edge) => !removedEdgeIds.has(idOf(edge)))\n                    .map((edge) => getEdgeEndsContext(model, edge));\n                // 查找平行边并添加到处理列表，确保只处理有效的边\n                // Find parallel edges and add them to the processing list, ensuring only valid edges are processed\n                getParallelEdges(edge, validEdgeData, true).forEach((e) => {\n                    const id = idOf(e);\n                    if (!edges.has(id))\n                        edges.set(id, e);\n                });\n            };\n            if (edgesToRemove.size)\n                edgesToRemove.forEach(pushParallelEdges);\n            if (edgesToAdd.size)\n                edgesToAdd.forEach(pushParallelEdges);\n            if (edgesToUpdate.size) {\n                const changes = groupByChangeType(reduceDataChanges(model.getChanges())).update.edges;\n                edgesToUpdate.forEach((edge) => {\n                    var _a;\n                    pushParallelEdges(edge);\n                    // 当边的端点发生变化时，将原始边及其平行边一并添加到更新列表 | Add the original edge and its parallel edges to the update list when the endpoints of the edge change\n                    const originalEdge = (_a = changes.find((e) => idOf(e.value) === idOf(edge))) === null || _a === void 0 ? void 0 : _a.original;\n                    if (originalEdge && !isParallelEdges(edge, originalEdge)) {\n                        pushParallelEdges(originalEdge);\n                    }\n                });\n            }\n            if (!isEmpty(this.options.edges)) {\n                edges.forEach((_, id) => !this.options.edges.includes(id) && edges.delete(id));\n            }\n            // 按照用户指定的顺序排序，防止捆绑时的抖动\n            // Sort by user-set order to prevent jitter during bundling\n            const edgeIds = model.getEdgeData().map(idOf);\n            return new Map([...edges].sort((a, b) => edgeIds.indexOf(a[0]) - edgeIds.indexOf(b[0])));\n        };\n        this.applyBundlingStyle = (input, edges, distance) => {\n            var _a, _b;\n            const { edgeMap, reverses } = groupByEndpoints(edges);\n            const loopMode = (_a = this.options.loopMode) !== null && _a !== void 0 ? _a : 'spread';\n            const loopDistance = (_b = this.options.loopDistance) !== null && _b !== void 0 ? _b : distance;\n            // 嵌套模式下的位置计数：key = `${nodeId}-${placement}` | Placement counts for nested mode\n            const placementCounts = new Map();\n            edgeMap.forEach((arcEdges) => {\n                arcEdges.forEach((edge, i, edgeArr) => {\n                    var _a, _b;\n                    const length = edgeArr.length;\n                    const style = edge.style || {};\n                    if (edge.source === edge.target) {\n                        if (loopMode === 'nested') {\n                            // 嵌套模式：按位置分组，在每组内自动递增距离 | Nested mode: group by placement, auto-increment distance within each group\n                            const placement = style.loopPlacement || 'top';\n                            const key = `${edge.source}-${placement}`;\n                            style.loopPlacement = placement;\n                            // 仅在用户未手动设置 loopDist 时自动分配 | Only auto-assign loopDist when not already set by user\n                            if (style.loopDist === undefined) {\n                                const count = (_a = placementCounts.get(key)) !== null && _a !== void 0 ? _a : 0;\n                                style.loopDist = INITIAL_NESTED_LOOP_DIST + count * loopDistance;\n                                placementCounts.set(key, count + 1);\n                            }\n                        }\n                        else {\n                            // 分散模式（默认）：将自环边分散到 8 个位置 | Spread mode (default): distribute loops across 8 positions\n                            const len = CUBIC_LOOP_PLACEMENTS.length;\n                            style.loopPlacement = CUBIC_LOOP_PLACEMENTS[i % len];\n                            style.loopDist = Math.floor(i / len) * distance + INITIAL_SPREAD_LOOP_DIST;\n                        }\n                    }\n                    else if (length === 1) {\n                        style.curveOffset = 0;\n                    }\n                    else {\n                        const sign = (i % 2 === 0 ? 1 : -1) * (reverses[`${edge.source}|${edge.target}|${i}`] ? -1 : 1);\n                        style.curveOffset =\n                            length % 2 === 1\n                                ? sign * Math.ceil(i / 2) * distance * 2\n                                : sign * (Math.floor(i / 2) * distance * 2 + distance);\n                    }\n                    const mergedEdgeData = Object.assign(edge, { type: CUBIC_EDGE_TYPE, style });\n                    const element = (_b = this.context.element) === null || _b === void 0 ? void 0 : _b.getElement(idOf(edge));\n                    if (!element || !isStyleEqual(mergedEdgeData.style, element.attributes)) {\n                        reassignTo(input, element ? 'update' : 'add', 'edge', mergedEdgeData, true);\n                    }\n                });\n            });\n        };\n        this.resetEdgeStyle = (edge) => {\n            const style = edge.style || {};\n            const cacheStyle = this.cacheMergeStyle.get(idOf(edge)) || {};\n            Object.keys(cacheStyle).forEach((key) => {\n                if (isEqual(style[key], cacheStyle[key])) {\n                    if (edge[key]) {\n                        style[key] = edge[key];\n                    }\n                    else {\n                        delete style[key];\n                    }\n                }\n            });\n            return Object.assign(edge, { style });\n        };\n        this.applyMergingStyle = (input, edges) => {\n            const { edgeMap, reverses } = groupByEndpoints(edges);\n            edgeMap.forEach((edges) => {\n                var _a;\n                if (edges.length === 1) {\n                    const edge = edges[0];\n                    const element = (_a = this.context.element) === null || _a === void 0 ? void 0 : _a.getElement(idOf(edge));\n                    const edgeStyle = this.resetEdgeStyle(edge);\n                    if (!element || !isStyleEqual(edgeStyle, element.attributes)) {\n                        reassignTo(input, element ? 'update' : 'add', 'edge', edgeStyle);\n                    }\n                    return;\n                }\n                const mergedStyle = edges\n                    .map(({ source, target, style = {} }, i) => {\n                    const { startArrow, endArrow } = style;\n                    const newStyle = {};\n                    const [start, end] = reverses[`${source}|${target}|${i}`]\n                        ? ['endArrow', 'startArrow']\n                        : ['startArrow', 'endArrow'];\n                    if (isBoolean(startArrow))\n                        newStyle[start] = startArrow;\n                    if (isBoolean(endArrow))\n                        newStyle[end] = endArrow;\n                    return newStyle;\n                })\n                    .reduce((acc, style) => (Object.assign(Object.assign({}, acc), style)), {});\n                edges.forEach((edge, i, edges) => {\n                    var _a;\n                    if (i !== 0) {\n                        reassignTo(input, 'remove', 'edge', edge);\n                        return;\n                    }\n                    const parsedStyle = Object.assign({}, isFunction(this.options.style) ? this.options.style(edges) : this.options.style, { childrenData: edges });\n                    this.cacheMergeStyle.set(idOf(edge), parsedStyle);\n                    const mergedEdgeData = Object.assign(Object.assign({}, edge), { type: 'line', style: Object.assign(Object.assign(Object.assign({}, edge.style), mergedStyle), parsedStyle) });\n                    const element = (_a = this.context.element) === null || _a === void 0 ? void 0 : _a.getElement(idOf(edge));\n                    if (!element || !isStyleEqual(mergedEdgeData.style, element.attributes)) {\n                        reassignTo(input, element ? 'update' : 'add', 'edge', mergedEdgeData, true);\n                    }\n                });\n            });\n        };\n    }\n    /**\n     * <zh/> 在每次绘制前处理平行边\n     *\n     * <en/> Process parallel edges before each drawing\n     * @param input\n     */\n    beforeDraw(input) {\n        const edges = this.getAffectedParallelEdges(input);\n        if (edges.size === 0)\n            return input;\n        this.options.mode === 'bundle'\n            ? this.applyBundlingStyle(input, edges, this.options.distance)\n            : this.applyMergingStyle(input, edges);\n        return input;\n    }\n}\nProcessParallelEdges.defaultOptions = {\n    mode: 'bundle',\n    distance: 15, // only valid for bundling mode\n    loopMode: 'spread',\n    loopDistance: 15,\n};\n/**\n * <zh/> 优化的按照端点分组方法，时间复杂度O(n)\n *\n * <en/> Optimized method to group by endpoints, time complexity O(n)\n * @param edges - <zh/> 边集合 | <en/> Edges\n * @returns <zh/> 端点分组后的边集合 | <en/> Edges grouped by endpoints\n */\nexport const groupByEndpoints = (edges) => {\n    const edgeMap = new Map();\n    const processedEdgesSet = new Set();\n    const reverses = {};\n    const includedEdgesInGroup = new Map();\n    for (const [id, edge] of edges) {\n        if (processedEdgesSet.has(id))\n            continue;\n        const { source, target } = edge;\n        const sourceTarget = `${source}-${target}`;\n        if (!edgeMap.has(sourceTarget)) {\n            edgeMap.set(sourceTarget, []);\n            includedEdgesInGroup.set(sourceTarget, new Set());\n        }\n        const sourceTargetEdges = edgeMap.get(sourceTarget);\n        const includedEdges = includedEdgesInGroup.get(sourceTarget);\n        if (sourceTargetEdges && includedEdges && !includedEdges.has(id)) {\n            sourceTargetEdges.push(edge);\n            includedEdges.add(id);\n            processedEdgesSet.add(id);\n        }\n        for (const [otherId, sedge] of edges) {\n            if (processedEdgesSet.has(otherId) || otherId === id)\n                continue;\n            if (isParallelEdges(edge, sedge)) {\n                const groupEdges = edgeMap.get(sourceTarget);\n                const includedGroupEdges = includedEdgesInGroup.get(sourceTarget);\n                if (groupEdges && includedGroupEdges && !includedGroupEdges.has(otherId)) {\n                    groupEdges.push(sedge);\n                    includedGroupEdges.add(otherId);\n                    if (source === sedge.target && target === sedge.source) {\n                        reverses[`${sedge.source}|${sedge.target}|${groupEdges.length - 1}`] = true;\n                    }\n                    processedEdgesSet.add(otherId);\n                }\n            }\n        }\n    }\n    return { edgeMap, reverses };\n};\n/**\n * <zh/> 获取平行边\n *\n * <en/> Get parallel edges\n * @param edge - <zh/> 目标边 | <en/> Target edge\n * @param edges - <zh/> 边集合 | <en/> Edges\n * @param containsSelf - <zh/> 输出结果是否包含目标边 | <en/> Whether the output result contains the target edge\n * @returns <zh/> 平行边集合 | <en/> Parallel edges\n */\nexport const getParallelEdges = (edge, edges, containsSelf) => {\n    return edges.filter((e) => (containsSelf || idOf(e) !== idOf(edge)) && isParallelEdges(e, edge));\n};\n/**\n * <zh/> 判断两条边是否平行\n *\n * <en/> Determine whether two edges are parallel\n * @param edge1 - <zh/> 边1 | <en/> Edge 1\n * @param edge2 - <zh/> 边2 | <en/> Edge 2\n * @returns <zh/> 是否平行 | <en/> Whether is parallel\n */\nexport const isParallelEdges = (edge1, edge2) => {\n    const { sourceNode: src1, targetNode: tgt1 } = edge1.style || {};\n    const { sourceNode: src2, targetNode: tgt2 } = edge2.style || {};\n    return (src1 === src2 && tgt1 === tgt2) || (src1 === tgt2 && tgt1 === src2);\n};\n//# sourceMappingURL=process-parallel-edges.js.map"],"names":["CUBIC_EDGE_TYPE","INITIAL_NESTED_LOOP_DIST","INITIAL_SPREAD_LOOP_DIST","CUBIC_LOOP_PLACEMENTS","ProcessParallelEdges","BaseTransform","context","options","input","edgesToAdd","nodesToUpdate","edgesToUpdate","combosToUpdate","edgesToRemove","model","edges","addRelatedEdges","_","id","edge","idOf","pushParallelEdges","removedEdgeIds","validEdgeData","getEdgeEndsContext","getParallelEdges","e","changes","groupByChangeType","reduceDataChanges","_a","originalEdge","isParallelEdges","isEmpty","edgeIds","a","b","distance","_b","edgeMap","reverses","groupByEndpoints","loopMode","loopDistance","placementCounts","arcEdges","i","edgeArr","length","style","placement","key","count","len","sign","mergedEdgeData","element","isStyleEqual","reassignTo","cacheStyle","isEqual","edgeStyle","mergedStyle","source","target","startArrow","endArrow","newStyle","start","end","isBoolean","acc","parsedStyle","isFunction","processedEdgesSet","includedEdgesInGroup","sourceTarget","sourceTargetEdges","includedEdges","otherId","sedge","groupEdges","includedGroupEdges","containsSelf","edge1","edge2","src1","tgt1","src2","tgt2"],"mappings":";;;;;;;;;AAMA,MAAMA,IAAkB,aAClBC,IAA2B,IAC3BC,IAA2B,IAC3BC,IAAwB;AAAA,EAC1B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACJ;AAUO,MAAMC,UAA6BC,EAAc;AAAA,EACpD,YAAYC,GAASC,GAAS;AAC1B,UAAMD,GAAS,OAAO,OAAO,CAAA,GAAIF,EAAqB,gBAAgBG,CAAO,CAAC,GAC9E,KAAK,kBAAkB,oBAAI,IAAG,GAO9B,KAAK,2BAA2B,CAACC,MAAU;AACvC,YAAM,EAAE,KAAK,EAAE,OAAOC,EAAU,GAAI,QAAQ,EAAE,OAAOC,GAAe,OAAOC,GAAe,QAAQC,KAAkB,QAAQ,EAAE,OAAOC,EAAa,EAAE,IAAML,GACpJ,EAAE,OAAAM,MAAU,KAAK,SACjBC,IAAQ,oBAAI,IAAG,GACfC,IAAkB,CAACC,GAAGC,MAAO;AAE/B,QADyBJ,EAAM,oBAAoBI,CAAE,EACpC,QAAQ,CAACC,MAAS,CAACJ,EAAM,IAAIK,EAAKD,CAAI,CAAC,KAAKJ,EAAM,IAAIK,EAAKD,CAAI,GAAGA,CAAI,CAAC;AAAA,MAC5F;AACA,MAAAT,EAAc,QAAQM,CAAe,GACrCJ,EAAe,QAAQI,CAAe;AACtC,YAAMK,IAAoB,CAACF,MAAS;AAGhC,cAAMG,IAAiB,IAAI,IAAId,EAAM,OAAO,MAAM,MAAM,GAGlDe,IAAgBT,EACjB,YAAW,EACX,OAAO,CAACK,MAAS,CAACG,EAAe,IAAIF,EAAKD,CAAI,CAAC,CAAC,EAChD,IAAI,CAACA,MAASK,EAAmBV,GAAOK,CAAI,CAAC;AAGlD,QAAAM,EAAiBN,GAAMI,CAAmB,EAAE,QAAQ,CAACG,MAAM;AACvD,gBAAMR,IAAKE,EAAKM,CAAC;AACjB,UAAKX,EAAM,IAAIG,CAAE,KACbH,EAAM,IAAIG,GAAIQ,CAAC;AAAA,QACvB,CAAC;AAAA,MACL;AAKA,UAJIb,EAAc,QACdA,EAAc,QAAQQ,CAAiB,GACvCZ,EAAW,QACXA,EAAW,QAAQY,CAAiB,GACpCV,EAAc,MAAM;AACpB,cAAMgB,IAAUC,EAAkBC,EAAkBf,EAAM,YAAY,CAAC,EAAE,OAAO;AAChF,QAAAH,EAAc,QAAQ,CAACQ,MAAS;AAC5B,cAAIW;AACJ,UAAAT,EAAkBF,CAAI;AAEtB,gBAAMY,KAAgBD,IAAKH,EAAQ,KAAK,CAACD,MAAMN,EAAKM,EAAE,KAAK,MAAMN,EAAKD,CAAI,CAAC,OAAO,QAAQW,MAAO,SAAS,SAASA,EAAG;AACtH,UAAIC,KAAgB,CAACC,EAAgBb,GAAMY,CAAY,KACnDV,EAAkBU,CAAY;AAAA,QAEtC,CAAC;AAAA,MACL;AACA,MAAKE,EAAQ,KAAK,QAAQ,KAAK,KAC3BlB,EAAM,QAAQ,CAACE,GAAGC,MAAO,CAAC,KAAK,QAAQ,MAAM,SAASA,CAAE,KAAKH,EAAM,OAAOG,CAAE,CAAC;AAIjF,YAAMgB,IAAUpB,EAAM,YAAW,EAAG,IAAIM,CAAI;AAC5C,aAAO,IAAI,IAAI,CAAC,GAAGL,CAAK,EAAE,KAAK,CAACoB,GAAGC,MAAMF,EAAQ,QAAQC,EAAE,CAAC,CAAC,IAAID,EAAQ,QAAQE,EAAE,CAAC,CAAC,CAAC,CAAC;AAAA,IAC3F,GACA,KAAK,qBAAqB,CAAC5B,GAAOO,GAAOsB,MAAa;AAClD,UAAIP,GAAIQ;AACR,YAAM,EAAE,SAAAC,GAAS,UAAAC,MAAaC,EAAiB1B,CAAK,GAC9C2B,KAAYZ,IAAK,KAAK,QAAQ,cAAc,QAAQA,MAAO,SAASA,IAAK,UACzEa,KAAgBL,IAAK,KAAK,QAAQ,kBAAkB,QAAQA,MAAO,SAASA,IAAKD,GAEjFO,IAAkB,oBAAI,IAAG;AAC/B,MAAAL,EAAQ,QAAQ,CAACM,MAAa;AAC1B,QAAAA,EAAS,QAAQ,CAAC1B,GAAM2B,GAAGC,MAAY;AACnC,cAAIjB,GAAIQ;AACR,gBAAMU,IAASD,EAAQ,QACjBE,IAAQ9B,EAAK,SAAS,CAAA;AAC5B,cAAIA,EAAK,WAAWA,EAAK;AACrB,gBAAIuB,MAAa,UAAU;AAEvB,oBAAMQ,IAAYD,EAAM,iBAAiB,OACnCE,IAAM,GAAGhC,EAAK,MAAM,IAAI+B,CAAS;AAGvC,kBAFAD,EAAM,gBAAgBC,GAElBD,EAAM,aAAa,QAAW;AAC9B,sBAAMG,KAAStB,IAAKc,EAAgB,IAAIO,CAAG,OAAO,QAAQrB,MAAO,SAASA,IAAK;AAC/E,gBAAAmB,EAAM,WAAWhD,IAA2BmD,IAAQT,GACpDC,EAAgB,IAAIO,GAAKC,IAAQ,CAAC;AAAA,cACtC;AAAA,YACJ,OACK;AAED,oBAAMC,IAAMlD,EAAsB;AAClC,cAAA8C,EAAM,gBAAgB9C,EAAsB2C,IAAIO,CAAG,GACnDJ,EAAM,WAAW,KAAK,MAAMH,IAAIO,CAAG,IAAIhB,IAAWnC;AAAA,YACtD;AAAA,mBAEK8C,MAAW;AAChB,YAAAC,EAAM,cAAc;AAAA,eAEnB;AACD,kBAAMK,KAAQR,IAAI,MAAM,IAAI,IAAI,OAAON,EAAS,GAAGrB,EAAK,MAAM,IAAIA,EAAK,MAAM,IAAI2B,CAAC,EAAE,IAAI,KAAK;AAC7F,YAAAG,EAAM,cACFD,IAAS,MAAM,IACTM,IAAO,KAAK,KAAKR,IAAI,CAAC,IAAIT,IAAW,IACrCiB,KAAQ,KAAK,MAAMR,IAAI,CAAC,IAAIT,IAAW,IAAIA;AAAA,UACzD;AACA,gBAAMkB,IAAiB,OAAO,OAAOpC,GAAM,EAAE,MAAMnB,GAAiB,OAAAiD,GAAO,GACrEO,KAAWlB,IAAK,KAAK,QAAQ,aAAa,QAAQA,MAAO,SAAS,SAASA,EAAG,WAAWlB,EAAKD,CAAI,CAAC;AACzG,WAAI,CAACqC,KAAW,CAACC,EAAaF,EAAe,OAAOC,EAAQ,UAAU,MAClEE,EAAWlD,GAAOgD,IAAU,WAAW,OAAO,QAAQD,GAAgB,EAAI;AAAA,QAElF,CAAC;AAAA,MACL,CAAC;AAAA,IACL,GACA,KAAK,iBAAiB,CAACpC,MAAS;AAC5B,YAAM8B,IAAQ9B,EAAK,SAAS,CAAA,GACtBwC,IAAa,KAAK,gBAAgB,IAAIvC,EAAKD,CAAI,CAAC,KAAK,CAAA;AAC3D,oBAAO,KAAKwC,CAAU,EAAE,QAAQ,CAACR,MAAQ;AACrC,QAAIS,EAAQX,EAAME,CAAG,GAAGQ,EAAWR,CAAG,CAAC,MAC/BhC,EAAKgC,CAAG,IACRF,EAAME,CAAG,IAAIhC,EAAKgC,CAAG,IAGrB,OAAOF,EAAME,CAAG;AAAA,MAG5B,CAAC,GACM,OAAO,OAAOhC,GAAM,EAAE,OAAA8B,EAAK,CAAE;AAAA,IACxC,GACA,KAAK,oBAAoB,CAACzC,GAAOO,MAAU;AACvC,YAAM,EAAE,SAAAwB,GAAS,UAAAC,MAAaC,EAAiB1B,CAAK;AACpD,MAAAwB,EAAQ,QAAQ,CAACxB,MAAU;AACvB,YAAIe;AACJ,YAAIf,EAAM,WAAW,GAAG;AACpB,gBAAMI,IAAOJ,EAAM,CAAC,GACdyC,KAAW1B,IAAK,KAAK,QAAQ,aAAa,QAAQA,MAAO,SAAS,SAASA,EAAG,WAAWV,EAAKD,CAAI,CAAC,GACnG0C,IAAY,KAAK,eAAe1C,CAAI;AAC1C,WAAI,CAACqC,KAAW,CAACC,EAAaI,GAAWL,EAAQ,UAAU,MACvDE,EAAWlD,GAAOgD,IAAU,WAAW,OAAO,QAAQK,CAAS;AAEnE;AAAA,QACJ;AACA,cAAMC,IAAc/C,EACf,IAAI,CAAC,EAAE,QAAAgD,GAAQ,QAAAC,GAAQ,OAAAf,IAAQ,CAAA,EAAE,GAAIH,MAAM;AAC5C,gBAAM,EAAE,YAAAmB,GAAY,UAAAC,EAAQ,IAAKjB,GAC3BkB,IAAW,CAAA,GACX,CAACC,GAAOC,CAAG,IAAI7B,EAAS,GAAGuB,CAAM,IAAIC,CAAM,IAAIlB,CAAC,EAAE,IAClD,CAAC,YAAY,YAAY,IACzB,CAAC,cAAc,UAAU;AAC/B,iBAAIwB,EAAUL,CAAU,MACpBE,EAASC,CAAK,IAAIH,IAClBK,EAAUJ,CAAQ,MAClBC,EAASE,CAAG,IAAIH,IACbC;AAAA,QACX,CAAC,EACI,OAAO,CAACI,GAAKtB,MAAW,OAAO,OAAO,OAAO,OAAO,CAAA,GAAIsB,CAAG,GAAGtB,CAAK,GAAI,CAAA,CAAE;AAC9E,QAAAlC,EAAM,QAAQ,CAACI,GAAM2B,GAAG/B,MAAU;AAC9B,cAAIe;AACJ,cAAIgB,MAAM,GAAG;AACT,YAAAY,EAAWlD,GAAO,UAAU,QAAQW,CAAI;AACxC;AAAA,UACJ;AACA,gBAAMqD,IAAc,OAAO,OAAO,CAAA,GAAIC,EAAW,KAAK,QAAQ,KAAK,IAAI,KAAK,QAAQ,MAAM1D,CAAK,IAAI,KAAK,QAAQ,OAAO,EAAE,cAAcA,GAAO;AAC9I,eAAK,gBAAgB,IAAIK,EAAKD,CAAI,GAAGqD,CAAW;AAChD,gBAAMjB,IAAiB,OAAO,OAAO,OAAO,OAAO,IAAIpC,CAAI,GAAG,EAAE,MAAM,QAAQ,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO,CAAA,GAAIA,EAAK,KAAK,GAAG2C,CAAW,GAAGU,CAAW,EAAC,CAAE,GACtKhB,KAAW1B,IAAK,KAAK,QAAQ,aAAa,QAAQA,MAAO,SAAS,SAASA,EAAG,WAAWV,EAAKD,CAAI,CAAC;AACzG,WAAI,CAACqC,KAAW,CAACC,EAAaF,EAAe,OAAOC,EAAQ,UAAU,MAClEE,EAAWlD,GAAOgD,IAAU,WAAW,OAAO,QAAQD,GAAgB,EAAI;AAAA,QAElF,CAAC;AAAA,MACL,CAAC;AAAA,IACL;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,WAAW/C,GAAO;AACd,UAAMO,IAAQ,KAAK,yBAAyBP,CAAK;AACjD,WAAIO,EAAM,SAAS,MAEnB,KAAK,QAAQ,SAAS,WAChB,KAAK,mBAAmBP,GAAOO,GAAO,KAAK,QAAQ,QAAQ,IAC3D,KAAK,kBAAkBP,GAAOO,CAAK,IAClCP;AAAA,EACX;AACJ;AACAJ,EAAqB,iBAAiB;AAAA,EAClC,MAAM;AAAA,EACN,UAAU;AAAA;AAAA,EACV,UAAU;AAAA,EACV,cAAc;AAClB;AAQY,MAACqC,IAAmB,CAAC1B,MAAU;AACvC,QAAMwB,IAAU,oBAAI,IAAG,GACjBmC,IAAoB,oBAAI,IAAG,GAC3BlC,IAAW,CAAA,GACXmC,IAAuB,oBAAI,IAAG;AACpC,aAAW,CAACzD,GAAIC,CAAI,KAAKJ,GAAO;AAC5B,QAAI2D,EAAkB,IAAIxD,CAAE;AACxB;AACJ,UAAM,EAAE,QAAA6C,GAAQ,QAAAC,EAAM,IAAK7C,GACrByD,IAAe,GAAGb,CAAM,IAAIC,CAAM;AACxC,IAAKzB,EAAQ,IAAIqC,CAAY,MACzBrC,EAAQ,IAAIqC,GAAc,EAAE,GAC5BD,EAAqB,IAAIC,GAAc,oBAAI,IAAG,CAAE;AAEpD,UAAMC,IAAoBtC,EAAQ,IAAIqC,CAAY,GAC5CE,IAAgBH,EAAqB,IAAIC,CAAY;AAC3D,IAAIC,KAAqBC,KAAiB,CAACA,EAAc,IAAI5D,CAAE,MAC3D2D,EAAkB,KAAK1D,CAAI,GAC3B2D,EAAc,IAAI5D,CAAE,GACpBwD,EAAkB,IAAIxD,CAAE;AAE5B,eAAW,CAAC6D,GAASC,CAAK,KAAKjE;AAC3B,UAAI,EAAA2D,EAAkB,IAAIK,CAAO,KAAKA,MAAY7D,MAE9Cc,EAAgBb,GAAM6D,CAAK,GAAG;AAC9B,cAAMC,IAAa1C,EAAQ,IAAIqC,CAAY,GACrCM,IAAqBP,EAAqB,IAAIC,CAAY;AAChE,QAAIK,KAAcC,KAAsB,CAACA,EAAmB,IAAIH,CAAO,MACnEE,EAAW,KAAKD,CAAK,GACrBE,EAAmB,IAAIH,CAAO,GAC1BhB,MAAWiB,EAAM,UAAUhB,MAAWgB,EAAM,WAC5CxC,EAAS,GAAGwC,EAAM,MAAM,IAAIA,EAAM,MAAM,IAAIC,EAAW,SAAS,CAAC,EAAE,IAAI,KAE3EP,EAAkB,IAAIK,CAAO;AAAA,MAErC;AAAA,EAER;AACA,SAAO,EAAE,SAAAxC,GAAS,UAAAC,EAAQ;AAC9B,GAUaf,IAAmB,CAACN,GAAMJ,GAAOoE,MACnCpE,EAAM,OAAO,CAACW,MAAkDM,EAAgBN,GAAGP,CAAI,CAAC,GAUtFa,IAAkB,CAACoD,GAAOC,MAAU;AAC7C,QAAM,EAAE,YAAYC,GAAM,YAAYC,MAASH,EAAM,SAAS,CAAA,GACxD,EAAE,YAAYI,GAAM,YAAYC,MAASJ,EAAM,SAAS,CAAA;AAC9D,SAAQC,MAASE,KAAQD,MAASE,KAAUH,MAASG,KAAQF,MAASC;AAC1E;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/g6/esm/transforms/update-related-edge.js

@@ -0,0 +1,17 @@
+import { idOf as o } from "../utils/id.js";
+import { BaseTransform as E } from "./base-transform.js";
+class b extends E {
+  beforeDraw(e, r) {
+    const { stage: d } = r;
+    if (d === "visibility")
+      return e;
+    const { model: c } = this.context, { update: { nodes: f, edges: a, combos: n } } = e, s = (m, l) => {
+      c.getRelatedEdgesData(l).forEach((t) => !a.has(o(t)) && a.set(o(t), t));
+    };
+    return f.forEach(s), n.forEach(s), e;
+  }
+}
+export {
+  b as UpdateRelatedEdge
+};
+//# sourceMappingURL=update-related-edge.js.map

package/dist/node_modules/@antv/g6/esm/transforms/update-related-edge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"update-related-edge.js","sources":["../../../../../../node_modules/@antv/g6/esm/transforms/update-related-edge.js"],"sourcesContent":["import { idOf } from '../utils/id';\nimport { BaseTransform } from './base-transform';\n/**\n * 如果更新了节点 / combo，需要更新连接的边\n * If the node / combo is updated, the connected edge and the combo it is in need to be updated\n */\nexport class UpdateRelatedEdge extends BaseTransform {\n    beforeDraw(input, context) {\n        const { stage } = context;\n        if (stage === 'visibility')\n            return input;\n        const { model } = this.context;\n        const { update: { nodes, edges, combos }, } = input;\n        const addRelatedEdges = (_, id) => {\n            const relatedEdgesData = model.getRelatedEdgesData(id);\n            relatedEdgesData.forEach((edge) => !edges.has(idOf(edge)) && edges.set(idOf(edge), edge));\n        };\n        nodes.forEach(addRelatedEdges);\n        combos.forEach(addRelatedEdges);\n        return input;\n    }\n}\n//# sourceMappingURL=update-related-edge.js.map"],"names":["UpdateRelatedEdge","BaseTransform","input","context","stage","model","nodes","edges","combos","addRelatedEdges","_","id","edge","idOf"],"mappings":";;AAMO,MAAMA,UAA0BC,EAAc;AAAA,EACjD,WAAWC,GAAOC,GAAS;AACvB,UAAM,EAAE,OAAAC,EAAK,IAAKD;AAClB,QAAIC,MAAU;AACV,aAAOF;AACX,UAAM,EAAE,OAAAG,MAAU,KAAK,SACjB,EAAE,QAAQ,EAAE,OAAAC,GAAO,OAAAC,GAAO,QAAAC,EAAM,EAAE,IAAMN,GACxCO,IAAkB,CAACC,GAAGC,MAAO;AAE/B,MADyBN,EAAM,oBAAoBM,CAAE,EACpC,QAAQ,CAACC,MAAS,CAACL,EAAM,IAAIM,EAAKD,CAAI,CAAC,KAAKL,EAAM,IAAIM,EAAKD,CAAI,GAAGA,CAAI,CAAC;AAAA,IAC5F;AACA,WAAAN,EAAM,QAAQG,CAAe,GAC7BD,EAAO,QAAQC,CAAe,GACvBP;AAAA,EACX;AACJ;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,15 @@
+import { idOf as d } from "../utils/id.js";
+function m(e, r, s, c, n) {
+  const t = d(c), o = `${s}s`, f = n ? c : e.add[o].get(t) || e.update[o].get(t) || e.remove[o].get(t) || c;
+  Object.entries(e).forEach(([a, i]) => {
+    r === a ? i[o].set(t, f) : i[o].delete(t);
+  });
+}
+function O(e, r) {
+  return Object.keys(e).every((s) => e[s] === r[s]);
+}
+export {
+  O as isStyleEqual,
+  m as reassignTo
+};
+//# sourceMappingURL=utils.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"utils.js","sources":["../../../../../../node_modules/@antv/g6/esm/transforms/utils.js"],"sourcesContent":["import { idOf } from '../utils/id';\n/**\n * <zh/> 重新分配绘制任务\n *\n * <en/> Reassign drawing tasks\n * @param input - <zh/>绘制数据 | <en/>DrawData\n * @param type - <zh/>类型 | <en/>type\n * @param elementType - <zh/>元素类型 | <en/>element type\n * @param datum - <zh/>数据 | <en/>data\n * @param overwrite - <zh/>是否覆盖现有数据 | <en/>whether to overwrite existing data\n */\nexport function reassignTo(input, type, elementType, datum, overwrite) {\n    const id = idOf(datum);\n    const typeName = `${elementType}s`;\n    const exitsDatum = overwrite\n        ? datum\n        : input.add[typeName].get(id) || input.update[typeName].get(id) || input.remove[typeName].get(id) || datum;\n    Object.entries(input).forEach(([_type, value]) => {\n        if (type === _type)\n            value[typeName].set(id, exitsDatum);\n        else\n            value[typeName].delete(id);\n    });\n}\n/**\n * <zh/> 判断样式是否与原始样式一致\n *\n * <en/> Determine whether the style is consistent with the original style\n * @param style - <zh/> 样式 | <en/> style\n * @param originalStyle - <zh/> 原始样式 | <en/> original style\n * @returns <zh/> 是否一致 | <en/> Whether it is consistent\n */\nexport function isStyleEqual(style, originalStyle) {\n    return Object.keys(style).every((key) => style[key] === originalStyle[key]);\n}\n//# sourceMappingURL=utils.js.map"],"names":["reassignTo","input","type","elementType","datum","overwrite","id","idOf","typeName","exitsDatum","_type","value","isStyleEqual","style","originalStyle","key"],"mappings":";AAWO,SAASA,EAAWC,GAAOC,GAAMC,GAAaC,GAAOC,GAAW;AACnE,QAAMC,IAAKC,EAAKH,CAAK,GACfI,IAAW,GAAGL,CAAW,KACzBM,IAAaJ,IACbD,IACAH,EAAM,IAAIO,CAAQ,EAAE,IAAIF,CAAE,KAAKL,EAAM,OAAOO,CAAQ,EAAE,IAAIF,CAAE,KAAKL,EAAM,OAAOO,CAAQ,EAAE,IAAIF,CAAE,KAAKF;AACzG,SAAO,QAAQH,CAAK,EAAE,QAAQ,CAAC,CAACS,GAAOC,CAAK,MAAM;AAC9C,IAAIT,MAASQ,IACTC,EAAMH,CAAQ,EAAE,IAAIF,GAAIG,CAAU,IAElCE,EAAMH,CAAQ,EAAE,OAAOF,CAAE;AAAA,EACjC,CAAC;AACL;AASO,SAASM,EAAaC,GAAOC,GAAe;AAC/C,SAAO,OAAO,KAAKD,CAAK,EAAE,MAAM,CAACE,MAAQF,EAAME,CAAG,MAAMD,EAAcC,CAAG,CAAC;AAC9E;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,114 @@
+import { DEFAULT_ANIMATION_OPTIONS as O, DEFAULT_ELEMENTS_ANIMATION_OPTIONS as A } from "../constants/animation.js";
+import "../constants/change.js";
+import "../constants/events/animation.js";
+import "../constants/events/canvas.js";
+import "../constants/events/combo.js";
+import "../constants/events/common.js";
+import "../constants/events/container.js";
+import "../constants/events/edge.js";
+import "../constants/events/graph.js";
+import "../constants/events/history.js";
+import "../constants/events/node.js";
+import { ExtensionCategory as E } from "../constants/registry.js";
+import { getExtension as b } from "../registry/get.js";
+import { print as g } from "./print.js";
+import { themeOf as p } from "./theme.js";
+import N from "../../../util/esm/lodash/is-nil.js";
+import j from "../../../util/esm/lodash/is-equal.js";
+import m from "../../../util/esm/lodash/is-object.js";
+function $(e, o) {
+  if (Array.isArray(e) && e.length === 0)
+    return null;
+  const s = Array.isArray(e) ? e[0] : e, t = Array.isArray(e) ? e.slice(1) : o || [];
+  return new Proxy(s, {
+    get(i, n) {
+      return typeof i[n] == "function" && !["onframe", "onfinish"].includes(n) ? (...r) => {
+        i[n](...r), t.forEach((f) => {
+          var u;
+          return (u = f[n]) === null || u === void 0 ? void 0 : u.call(f, ...r);
+        });
+      } : n === "finished" ? Promise.all([s.finished, ...t.map((r) => r.finished)]) : Reflect.get(i, n);
+    },
+    set(i, n, r) {
+      return ["onframe", "onfinish"].includes(n) || t.forEach((f) => {
+        f[n] = r;
+      }), Reflect.set(i, n, r);
+    }
+  });
+}
+function B(e) {
+  const o = e.reduce((t, i) => (Object.entries(i).forEach(([n, r]) => {
+    t[n] === void 0 ? t[n] = [r] : t[n].push(r);
+  }), t), {});
+  Object.entries(o).forEach(([t, i]) => {
+    // 属性值必须在每一帧都存在 / property value must exist in every frame
+    (i.length !== e.length || // 属性值不能为空 / property value cannot be empty
+    i.some((n) => N(n)) || // 属性值必须不完全一致 / property value must not be exactly the same
+    // 属性值可以是保留属性 / property value can be the reserved property
+    i.every((n) => !["sourceNode", "targetNode", "childrenNode"].includes(t) && j(n, i[0]))) && delete o[t];
+  });
+  const s = Object.entries(o).reduce((t, [i, n]) => (n.forEach((r, f) => {
+    t[f] ? t[f][i] = r : t[f] = { [i]: r };
+  }), t), []);
+  return e.length !== 0 && s.length === 0 && s.push({ _: 0 }, { _: 0 }), s;
+}
+function G(e) {
+  switch (e) {
+    case "opacity":
+      return 1;
+    case "x":
+    case "y":
+    case "z":
+    case "zIndex":
+      return 0;
+    case "visibility":
+      return "visible";
+    case "collapsed":
+      return !1;
+    case "states":
+      return [];
+    default:
+      return;
+  }
+}
+function H(e, o) {
+  const { animation: s } = e;
+  if (s === !1 || o === !1)
+    return !1;
+  const t = Object.assign({}, O);
+  return m(s) && Object.assign(t, s), m(o) && Object.assign(t, o), t;
+}
+function I(e) {
+  if (typeof e == "string") {
+    const o = b(E.ANIMATION, e);
+    return o || (g.warn(`The animation of ${e} is not registered.`), []);
+  }
+  return e;
+}
+function J(e, o, s, t) {
+  var i, n;
+  const { animation: r } = e;
+  if (r === !1 || t === !1)
+    return [];
+  const f = (i = e == null ? void 0 : e[o]) === null || i === void 0 ? void 0 : i.animation;
+  if (f === !1)
+    return [];
+  const u = f == null ? void 0 : f[s];
+  if (u === !1)
+    return [];
+  const a = (n = p(e)[o]) === null || n === void 0 ? void 0 : n.animation, c = (d = []) => I(d).map((h) => Object.assign(Object.assign(Object.assign(Object.assign({}, A), m(r) && r), h), m(t) && t));
+  if (u)
+    return c(u);
+  if (!a)
+    return [];
+  const l = a[s];
+  return l === !1 ? [] : c(l);
+}
+export {
+  $ as createAnimationsProxy,
+  H as getAnimationOptions,
+  J as getElementAnimationOptions,
+  G as inferDefaultValue,
+  B as preprocessKeyframes
+};
+//# sourceMappingURL=animation.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"animation.js","sources":["../../../../../../node_modules/@antv/g6/esm/utils/animation.js"],"sourcesContent":["import { isEqual, isNil, isObject } from '@antv/util';\nimport { DEFAULT_ANIMATION_OPTIONS, DEFAULT_ELEMENTS_ANIMATION_OPTIONS, ExtensionCategory } from '../constants';\nimport { getExtension } from '../registry/get';\nimport { print } from './print';\nimport { themeOf } from './theme';\n/**\n * <zh/> 创建动画代理，对一个动画实例的操作同步到多个动画实例上\n *\n * <en/> create animation proxy, synchronize animation to multiple animation instances\n * @param args1 - <zh/> 源动画实例 | <en/> source animation instance\n * @param args2 - <zh/> 目标动画实例 | <en/> target animation instance\n * @returns <zh/> 动画代理 | <en/> animation proxy\n */\nexport function createAnimationsProxy(args1, args2) {\n    if (Array.isArray(args1) && args1.length === 0)\n        return null;\n    const sourceAnimation = Array.isArray(args1) ? args1[0] : args1;\n    const targetAnimations = Array.isArray(args1) ? args1.slice(1) : args2 || [];\n    return new Proxy(sourceAnimation, {\n        get(target, propKey) {\n            if (typeof target[propKey] === 'function' && !['onframe', 'onfinish'].includes(propKey)) {\n                return (...args) => {\n                    target[propKey](...args);\n                    targetAnimations.forEach((animation) => { var _a; return (_a = animation[propKey]) === null || _a === void 0 ? void 0 : _a.call(animation, ...args); });\n                };\n            }\n            if (propKey === 'finished') {\n                return Promise.all([sourceAnimation.finished, ...targetAnimations.map((animation) => animation.finished)]);\n            }\n            return Reflect.get(target, propKey);\n        },\n        set(target, propKey, value) {\n            // onframe 和 onfinish 特殊处理，不用同步到所有动画实例上\n            // onframe and onfinish are specially processed and do not need to be synchronized to all animation instances\n            if (!['onframe', 'onfinish'].includes(propKey)) {\n                targetAnimations.forEach((animation) => {\n                    animation[propKey] = value;\n                });\n            }\n            return Reflect.set(target, propKey, value);\n        },\n    });\n}\n/**\n * <zh/> 预处理关键帧，过滤掉无用动画的属性\n *\n * <en/> Preprocess keyframes, filter out the properties of useless animations\n * @param keyframes - <zh/> 关键帧 | <en/> keyframes\n * @returns <zh/> 关键帧 | <en/> keyframes\n */\nexport function preprocessKeyframes(keyframes) {\n    // 转化为 PropertyIndexedKeyframes 格式方便后续处理\n    // convert to PropertyIndexedKeyframes format for subsequent processing\n    const propertyIndexedKeyframes = keyframes.reduce((acc, kf) => {\n        Object.entries(kf).forEach(([key, value]) => {\n            if (acc[key] === undefined)\n                acc[key] = [value];\n            else\n                acc[key].push(value);\n        });\n        return acc;\n    }, {});\n    // 过滤掉无用动画的属性（属性值为 undefined、或者值完全一致）\n    // filter out useless animation properties (property value is undefined, or value is exactly the same)\n    Object.entries(propertyIndexedKeyframes).forEach(([key, values]) => {\n        if (\n        // 属性值必须在每一帧都存在 / property value must exist in every frame\n        values.length !== keyframes.length ||\n            // 属性值不能为空 / property value cannot be empty\n            values.some((value) => isNil(value)) ||\n            // 属性值必须不完全一致 / property value must not be exactly the same\n            // 属性值可以是保留属性 / property value can be the reserved property\n            values.every((value) => !['sourceNode', 'targetNode', 'childrenNode'].includes(key) && isEqual(value, values[0]))) {\n            delete propertyIndexedKeyframes[key];\n        }\n    });\n    // 将 PropertyIndexedKeyframes 转化为 Keyframe 格式\n    // convert PropertyIndexedKeyframes to Keyframe format\n    const output = Object.entries(propertyIndexedKeyframes).reduce((acc, [key, values]) => {\n        values.forEach((value, index) => {\n            if (!acc[index])\n                acc[index] = { [key]: value };\n            else\n                acc[index][key] = value;\n        });\n        return acc;\n    }, []);\n    // 如果处理后所有的属性都被过滤掉，则添加一个没有实际作用的属性用于触发动画\n    // If all properties are filtered out after processing, add a property that has no actual effect to trigger the animation\n    if (keyframes.length !== 0 && output.length === 0)\n        output.push(...[{ _: 0 }, { _: 0 }]);\n    return output;\n}\n/**\n * <zh/> 获取属性的默认值\n *\n * <en/> Get default value of attribute\n * @param name - <zh/> 属性名 | <en/> Attribute name\n * @returns <zh/> 属性默认值 | <en/> Attribute default value\n * @remarks\n * <zh/> 执行动画过程中，一些属性没有显式指定属性值，但实际上在 G 中存在属性值，因此通过该方法获取其实际默认值\n *\n * <en/> During the animation, some attributes do not explicitly specify the attribute value, but in fact there is an attribute value in G, so use this method to get the actual default value\n */\nexport function inferDefaultValue(name) {\n    switch (name) {\n        case 'opacity':\n            return 1;\n        case 'x':\n        case 'y':\n        case 'z':\n        case 'zIndex':\n            return 0;\n        case 'visibility':\n            return 'visible';\n        case 'collapsed':\n            return false;\n        case 'states':\n            return [];\n        default:\n            return undefined;\n    }\n}\n/**\n * <zh/> 获取动画配置\n *\n * <en/> Get global animation configuration\n * @param options - <zh/> G6 配置项（用于获取全局动画配置） | <en/> G6 configuration(used to get global animation configuration)\n * @param localAnimation - <zh/> 局部动画配置 | <en/> local animation configuration\n * @returns <zh/> 动画配置 | <en/> animation configuration\n */\nexport function getAnimationOptions(options, localAnimation) {\n    const { animation } = options;\n    if (animation === false || localAnimation === false)\n        return false;\n    const effectTiming = Object.assign({}, DEFAULT_ANIMATION_OPTIONS);\n    if (isObject(animation))\n        Object.assign(effectTiming, animation);\n    if (isObject(localAnimation))\n        Object.assign(effectTiming, localAnimation);\n    return effectTiming;\n}\n/**\n * <zh/> 获取动画配置\n *\n * <en/> Get animation configuration\n * @param options - <zh/> 动画配置项 | <en/> animation configuration\n * @returns <zh/> 动画配置 | <en/> animation configuration\n */\nfunction animationOf(options) {\n    if (typeof options === 'string') {\n        const animation = getExtension(ExtensionCategory.ANIMATION, options);\n        if (animation)\n            return animation;\n        print.warn(`The animation of ${options} is not registered.`);\n        return [];\n    }\n    return options;\n}\n/**\n * <zh/> 获取元素的动画\n *\n * <en/> Get element animation\n * @param options - <zh/> G6 配置项 | <en/> G6 configuration\n * @param elementType - <zh/> 元素类型 | <en/> element type\n * @param stage - <zh/> 动画阶段 | <en/> animation stage\n * @param localAnimation - <zh/> 局部动画配置 | <en/> local animation configuration\n * @returns <zh/> 动画时序配置 | <en/> animation timing configuration\n */\nexport function getElementAnimationOptions(options, elementType, stage, localAnimation) {\n    var _a, _b;\n    const { animation: globalAnimation } = options;\n    if (globalAnimation === false || localAnimation === false)\n        return [];\n    const userElementAnimation = (_a = options === null || options === void 0 ? void 0 : options[elementType]) === null || _a === void 0 ? void 0 : _a.animation;\n    if (userElementAnimation === false)\n        return [];\n    const useElementStageAnimation = userElementAnimation === null || userElementAnimation === void 0 ? void 0 : userElementAnimation[stage];\n    if (useElementStageAnimation === false)\n        return [];\n    // 优先级：用户局部动画配置 > 用户动画配置 > 全局动画配置 > 主题动画配置 > 默认动画配置\n    // Priority: user local animation configuration > user animation configuration > global animation configuration > theme animation configuration > default animation configuration\n    const themeElementAnimation = (_b = themeOf(options)[elementType]) === null || _b === void 0 ? void 0 : _b.animation;\n    const combine = (_ = []) => animationOf(_).map((animation) => (Object.assign(Object.assign(Object.assign(Object.assign({}, DEFAULT_ELEMENTS_ANIMATION_OPTIONS), (isObject(globalAnimation) && globalAnimation)), animation), (isObject(localAnimation) && localAnimation))));\n    if (useElementStageAnimation)\n        return combine(useElementStageAnimation);\n    if (!themeElementAnimation)\n        return [];\n    // 此时取决于主题动画配置\n    // At this time, it depends on the theme animation configuration\n    const themeElementStageAnimation = themeElementAnimation[stage];\n    if (themeElementStageAnimation === false)\n        return [];\n    return combine(themeElementStageAnimation);\n}\n//# sourceMappingURL=animation.js.map"],"names":["createAnimationsProxy","args1","args2","sourceAnimation","targetAnimations","target","propKey","args","animation","_a","value","preprocessKeyframes","keyframes","propertyIndexedKeyframes","acc","kf","key","values","isNil","isEqual","output","index","inferDefaultValue","name","getAnimationOptions","options","localAnimation","effectTiming","DEFAULT_ANIMATION_OPTIONS","isObject","animationOf","getExtension","ExtensionCategory","print","getElementAnimationOptions","elementType","stage","_b","globalAnimation","userElementAnimation","useElementStageAnimation","themeElementAnimation","themeOf","combine","_","DEFAULT_ELEMENTS_ANIMATION_OPTIONS","themeElementStageAnimation"],"mappings":";;;;;;;;;;;;;;;;;;AAaO,SAASA,EAAsBC,GAAOC,GAAO;AAChD,MAAI,MAAM,QAAQD,CAAK,KAAKA,EAAM,WAAW;AACzC,WAAO;AACX,QAAME,IAAkB,MAAM,QAAQF,CAAK,IAAIA,EAAM,CAAC,IAAIA,GACpDG,IAAmB,MAAM,QAAQH,CAAK,IAAIA,EAAM,MAAM,CAAC,IAAIC,KAAS,CAAA;AAC1E,SAAO,IAAI,MAAMC,GAAiB;AAAA,IAC9B,IAAIE,GAAQC,GAAS;AACjB,aAAI,OAAOD,EAAOC,CAAO,KAAM,cAAc,CAAC,CAAC,WAAW,UAAU,EAAE,SAASA,CAAO,IAC3E,IAAIC,MAAS;AAChB,QAAAF,EAAOC,CAAO,EAAE,GAAGC,CAAI,GACvBH,EAAiB,QAAQ,CAACI,MAAc;AAAE,cAAIC;AAAI,kBAAQA,IAAKD,EAAUF,CAAO,OAAO,QAAQG,MAAO,SAAS,SAASA,EAAG,KAAKD,GAAW,GAAGD,CAAI;AAAA,QAAG,CAAC;AAAA,MAC1J,IAEAD,MAAY,aACL,QAAQ,IAAI,CAACH,EAAgB,UAAU,GAAGC,EAAiB,IAAI,CAACI,MAAcA,EAAU,QAAQ,CAAC,CAAC,IAEtG,QAAQ,IAAIH,GAAQC,CAAO;AAAA,IACtC;AAAA,IACA,IAAID,GAAQC,GAASI,GAAO;AAGxB,aAAK,CAAC,WAAW,UAAU,EAAE,SAASJ,CAAO,KACzCF,EAAiB,QAAQ,CAACI,MAAc;AACpC,QAAAA,EAAUF,CAAO,IAAII;AAAA,MACzB,CAAC,GAEE,QAAQ,IAAIL,GAAQC,GAASI,CAAK;AAAA,IAC7C;AAAA,EACR,CAAK;AACL;AAQO,SAASC,EAAoBC,GAAW;AAG3C,QAAMC,IAA2BD,EAAU,OAAO,CAACE,GAAKC,OACpD,OAAO,QAAQA,CAAE,EAAE,QAAQ,CAAC,CAACC,GAAKN,CAAK,MAAM;AACzC,IAAII,EAAIE,CAAG,MAAM,SACbF,EAAIE,CAAG,IAAI,CAACN,CAAK,IAEjBI,EAAIE,CAAG,EAAE,KAAKN,CAAK;AAAA,EAC3B,CAAC,GACMI,IACR,CAAA,CAAE;AAGL,SAAO,QAAQD,CAAwB,EAAE,QAAQ,CAAC,CAACG,GAAKC,CAAM,MAAM;AAChE;AAAA,KAEAA,EAAO,WAAWL,EAAU;AAAA,IAExBK,EAAO,KAAK,CAACP,MAAUQ,EAAMR,CAAK,CAAC;AAAA;AAAA,IAGnCO,EAAO,MAAM,CAACP,MAAU,CAAC,CAAC,cAAc,cAAc,cAAc,EAAE,SAASM,CAAG,KAAKG,EAAQT,GAAOO,EAAO,CAAC,CAAC,CAAC,MAChH,OAAOJ,EAAyBG,CAAG;AAAA,EAE3C,CAAC;AAGD,QAAMI,IAAS,OAAO,QAAQP,CAAwB,EAAE,OAAO,CAACC,GAAK,CAACE,GAAKC,CAAM,OAC7EA,EAAO,QAAQ,CAACP,GAAOW,MAAU;AAC7B,IAAKP,EAAIO,CAAK,IAGVP,EAAIO,CAAK,EAAEL,CAAG,IAAIN,IAFlBI,EAAIO,CAAK,IAAI,EAAE,CAACL,CAAG,GAAGN,EAAK;AAAA,EAGnC,CAAC,GACMI,IACR,CAAA,CAAE;AAGL,SAAIF,EAAU,WAAW,KAAKQ,EAAO,WAAW,KAC5CA,EAAO,KAAS,EAAE,GAAG,EAAC,GAAI,EAAE,GAAG,EAAC,CAAG,GAChCA;AACX;AAYO,SAASE,EAAkBC,GAAM;AACpC,UAAQA,GAAI;AAAA,IACR,KAAK;AACD,aAAO;AAAA,IACX,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACD,aAAO;AAAA,IACX,KAAK;AACD,aAAO;AAAA,IACX,KAAK;AACD,aAAO;AAAA,IACX,KAAK;AACD,aAAO,CAAA;AAAA,IACX;AACI;AAAA,EACZ;AACA;AASO,SAASC,EAAoBC,GAASC,GAAgB;AACzD,QAAM,EAAE,WAAAlB,EAAS,IAAKiB;AACtB,MAAIjB,MAAc,MAASkB,MAAmB;AAC1C,WAAO;AACX,QAAMC,IAAe,OAAO,OAAO,CAAA,GAAIC,CAAyB;AAChE,SAAIC,EAASrB,CAAS,KAClB,OAAO,OAAOmB,GAAcnB,CAAS,GACrCqB,EAASH,CAAc,KACvB,OAAO,OAAOC,GAAcD,CAAc,GACvCC;AACX;AAQA,SAASG,EAAYL,GAAS;AAC1B,MAAI,OAAOA,KAAY,UAAU;AAC7B,UAAMjB,IAAYuB,EAAaC,EAAkB,WAAWP,CAAO;AACnE,WAAIjB,MAEJyB,EAAM,KAAK,oBAAoBR,CAAO,qBAAqB,GACpD,CAAA;AAAA,EACX;AACA,SAAOA;AACX;AAWO,SAASS,EAA2BT,GAASU,GAAaC,GAAOV,GAAgB;AACpF,MAAIjB,GAAI4B;AACR,QAAM,EAAE,WAAWC,EAAe,IAAKb;AACvC,MAAIa,MAAoB,MAASZ,MAAmB;AAChD,WAAO,CAAA;AACX,QAAMa,KAAwB9B,IAAKgB,KAAY,OAA6B,SAASA,EAAQU,CAAW,OAAO,QAAQ1B,MAAO,SAAS,SAASA,EAAG;AACnJ,MAAI8B,MAAyB;AACzB,WAAO,CAAA;AACX,QAAMC,IAA2BD,KAAyB,OAA0C,SAASA,EAAqBH,CAAK;AACvI,MAAII,MAA6B;AAC7B,WAAO,CAAA;AAGX,QAAMC,KAAyBJ,IAAKK,EAAQjB,CAAO,EAAEU,CAAW,OAAO,QAAQE,MAAO,SAAS,SAASA,EAAG,WACrGM,IAAU,CAACC,IAAI,CAAA,MAAOd,EAAYc,CAAC,EAAE,IAAI,CAACpC,MAAe,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO,CAAA,GAAIqC,CAAkC,GAAIhB,EAASS,CAAe,KAAKA,CAAe,GAAI9B,CAAS,GAAIqB,EAASH,CAAc,KAAKA,CAAc,CAAG;AAC3Q,MAAIc;AACA,WAAOG,EAAQH,CAAwB;AAC3C,MAAI,CAACC;AACD,WAAO,CAAA;AAGX,QAAMK,IAA6BL,EAAsBL,CAAK;AAC9D,SAAIU,MAA+B,KACxB,CAAA,IACJH,EAAQG,CAA0B;AAC7C;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,117 @@
+import "../../../g/dist/index.esm.js";
+import { isPoint as l } from "./is.js";
+import { isBetween as x } from "./math.js";
+import { parsePadding as w } from "./padding.js";
+import { AABB as h } from "../../../g-lite/dist/index.esm.js";
+import p from "../../../util/esm/lodash/clone.js";
+function X(t) {
+  return t.max[0] - t.min[0];
+}
+function Y(t) {
+  return t.max[1] - t.min[1];
+}
+function g(t) {
+  return [X(t), Y(t)];
+}
+function I(t, n) {
+  const o = l(t) ? d(t) : t.getShape("key").getBounds();
+  return n ? y(o, n) : o;
+}
+function d(t) {
+  const [n, o, m = 0] = t, e = new h();
+  return e.setMinMax([n, o, m], [n, o, m]), e;
+}
+function y(t, n) {
+  const [o, m, e, i] = w(n), [r, s, a] = t.min, [u, f, B] = t.max, c = new h();
+  return c.setMinMax([r - i, s - o, a], [u + m, f + e, B]), c;
+}
+function N(t) {
+  if (t.length === 0)
+    return new h();
+  if (t.length === 1)
+    return t[0];
+  const n = new h();
+  n.setMinMax(t[0].min, t[0].max);
+  for (let o = 1; o < t.length; o++) {
+    const m = t[o];
+    n.setMinMax([Math.min(n.min[0], m.min[0]), Math.min(n.min[1], m.min[1]), Math.min(n.min[2], m.min[2])], [Math.max(n.max[0], m.max[0]), Math.max(n.max[1], m.max[1]), Math.max(n.max[2], m.max[2])]);
+  }
+  return n;
+}
+function z(t, n) {
+  const [o, m] = t.min, [e, i] = t.max, [r, s] = n.min, [a, u] = n.max;
+  return o >= r && e <= a && m >= s && i <= u;
+}
+function M(t, n) {
+  return x(t[0], n.min[0], n.max[0]) && x(t[1], n.min[1], n.max[1]);
+}
+function A(t, n, o = !1) {
+  const { min: [m, e], max: [i, r] } = n, s = (t[1] === e || t[1] === r) && (o || x(t[0], m, i)), a = (t[0] === m || t[0] === i) && (o || x(t[1], e, r));
+  return s || a;
+}
+function T(t, n) {
+  return !M(t, n);
+}
+function Z(t, n) {
+  const { center: o } = n;
+  return t[0] === o[0] && t[1] === o[1];
+}
+function P(t, n) {
+  const [o, m] = t, [e, i] = n.min, [r, s] = n.max, a = o - e, u = r - o, f = m - i, B = s - m, c = Math.min(a, u, f, B);
+  return c === a ? "left" : c === u ? "right" : c === f ? "top" : c === B ? "bottom" : "left";
+}
+function q(t, n) {
+  const o = p(t);
+  if (M(t, n))
+    switch (P(t, n)) {
+      case "left":
+        o[0] = n.min[0];
+        break;
+      case "right":
+        o[0] = n.max[0];
+        break;
+      case "top":
+        o[1] = n.min[1];
+        break;
+      case "bottom":
+        o[1] = n.max[1];
+        break;
+    }
+  else {
+    const [m, e] = t, [i, r] = n.min, [s, a] = n.max;
+    o[0] = x(m, i, s) ? m : m < i ? i : s, o[1] = x(e, r, a) ? e : e < r ? r : a;
+  }
+  return o;
+}
+function E(t, n) {
+  const { center: o } = t, [m, e] = g(t), i = n === "up" || n === "down" ? o[0] : n === "right" ? o[0] - m / 6 : o[0] + m / 6, r = n === "left" || n === "right" ? o[1] : n === "down" ? o[1] - e / 6 : o[1] + e / 6;
+  return [i, r];
+}
+function H(t, n) {
+  let [o, m] = g(t);
+  return [o, m] = n === "up" || n === "down" ? [o, m] : [m, o], (Math.pow(m, 2) - Math.pow(Math.sqrt(Math.pow(o / 2, 2) + Math.pow(m, 2)) - o / 2, 2)) / (2 * m);
+}
+function W(t) {
+  const { min: [n, o], max: [m, e] } = t, i = [n, e], r = [m, e], s = [m, o], a = [n, o];
+  return [[i, r], [r, s], [s, a], [a, i]];
+}
+export {
+  Y as getBBoxHeight,
+  W as getBBoxSegments,
+  g as getBBoxSize,
+  X as getBBoxWidth,
+  N as getCombinedBBox,
+  y as getExpandedBBox,
+  H as getIncircleRadius,
+  q as getNearestBoundaryPoint,
+  P as getNearestBoundarySide,
+  I as getNodeBBox,
+  d as getPointBBox,
+  E as getTriangleCenter,
+  z as isBBoxInside,
+  Z as isPointBBoxCenter,
+  M as isPointInBBox,
+  A as isPointOnBBoxBoundary,
+  T as isPointOutsideBBox
+};
+//# sourceMappingURL=bbox.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"bbox.js","sources":["../../../../../../node_modules/@antv/g6/esm/utils/bbox.js"],"sourcesContent":["import { AABB } from '@antv/g';\nimport { clone } from '@antv/util';\nimport { isPoint } from './is';\nimport { isBetween } from './math';\nimport { parsePadding } from './padding';\n/**\n * <zh/> 获取包围盒的宽度\n *\n * <en/> Retrieves the width of a bounding box\n * @param bbox - <zh/> 包围盒 | <en/> Bounding box\n * @returns <zh/> 包围盒的宽度 | <en/> Width of box\n */\nexport function getBBoxWidth(bbox) {\n    return bbox.max[0] - bbox.min[0];\n}\n/**\n * <zh/> 获取包围盒的高度\n *\n * <en/> Retrieve the height of a bounding box\n * @param bbox - <zh/> 包围盒 | <en/> Bounding box\n * @returns <zh/> 包围盒的高度 | <en/> Height of box\n */\nexport function getBBoxHeight(bbox) {\n    return bbox.max[1] - bbox.min[1];\n}\n/**\n * <zh/> 获取包围盒的尺寸\n * @param bbox - <zh/> 包围盒 | <en/> Bounding box\n * @returns <zh/> 包围盒的尺寸 | <en/> Size of box\n */\nexport function getBBoxSize(bbox) {\n    return [getBBoxWidth(bbox), getBBoxHeight(bbox)];\n}\n/**\n * <zh/> 获取节点的包围盒，兼容节点为点的情况\n *\n * <en/> Get the bounding box of the node, compatible with the case where the node is a point\n * @param node - <zh/> 节点或者点 | <en/> node or point\n * @param padding - <zh/> 内边距 | <en/> padding\n * @returns <zh/> 包围盒 | <en/> bounding box\n */\nexport function getNodeBBox(node, padding) {\n    const bbox = isPoint(node) ? getPointBBox(node) : node.getShape('key').getBounds();\n    return padding ? getExpandedBBox(bbox, padding) : bbox;\n}\n/**\n * <zh/> 获取单点的包围盒\n *\n * <en/> Get the bounding box of a single point\n * @param point - <zh/> 点 | <en/> Point\n * @returns <zh/> 包围盒 | <en/> Bounding box\n */\nexport function getPointBBox(point) {\n    const [x, y, z = 0] = point;\n    const bbox = new AABB();\n    bbox.setMinMax([x, y, z], [x, y, z]);\n    return bbox;\n}\n/**\n * <zh/> 获取扩大后的包围盒\n *\n * <en/> Get the expanded bounding box\n * @param bbox - <zh/> 包围盒 | <en/> Bounding box\n * @param padding - <zh/> 内边距 | <en/> Padding\n * @returns <zh/> 扩大后的包围盒 | <en/> The expanded bounding box\n */\nexport function getExpandedBBox(bbox, padding) {\n    const [top, right, bottom, left] = parsePadding(padding);\n    const [minX, minY, minZ] = bbox.min;\n    const [maxX, maxY, maxZ] = bbox.max;\n    const eBbox = new AABB();\n    eBbox.setMinMax([minX - left, minY - top, minZ], [maxX + right, maxY + bottom, maxZ]);\n    return eBbox;\n}\n/**\n * <zh/> 计算整体包围盒\n *\n * <en/> Calculate the overall bounding box\n * @param bboxes - <zh/> 包围盒列表 | <en/> List of bounding boxes\n * @returns <zh/> 整体包围盒 | <en/> Overall bounding box\n */\nexport function getCombinedBBox(bboxes) {\n    if (bboxes.length === 0)\n        return new AABB();\n    if (bboxes.length === 1)\n        return bboxes[0];\n    const bbox = new AABB();\n    bbox.setMinMax(bboxes[0].min, bboxes[0].max);\n    for (let i = 1; i < bboxes.length; i++) {\n        const b2 = bboxes[i];\n        bbox.setMinMax([Math.min(bbox.min[0], b2.min[0]), Math.min(bbox.min[1], b2.min[1]), Math.min(bbox.min[2], b2.min[2])], [Math.max(bbox.max[0], b2.max[0]), Math.max(bbox.max[1], b2.max[1]), Math.max(bbox.max[2], b2.max[2])]);\n    }\n    return bbox;\n}\n/**\n * <zh/> 判断 bbox1 是否完全包含在 bbox2 内\n *\n * <en/> Determine whether bbox1 is completely contained in bbox2\n * @param bbox1 - <zh/> 目标包围盒 | <en/> Target bounding box\n * @param bbox2 - <zh/> 参考包围盒 | <en/> Reference bounding box\n * @returns <zh/> 如果 bbox1 完全包含在 bbox2 内返回 true，否则返回 false | <en/> Returns true if bbox1 is completely contained in bbox2, false otherwise\n */\nexport function isBBoxInside(bbox1, bbox2) {\n    const [minX1, minY1] = bbox1.min;\n    const [maxX1, maxY1] = bbox1.max;\n    const [minX2, minY2] = bbox2.min;\n    const [maxX2, maxY2] = bbox2.max;\n    return minX1 >= minX2 && maxX1 <= maxX2 && minY1 >= minY2 && maxY1 <= maxY2;\n}\n/**\n * <zh/> 判断点是否在给定的包围盒内\n *\n * <en/> Whether the point is contained in the given box\n * @param point - <zh/> 点 | <en/> Point\n * @param bbox - <zh/> 包围盒 | <en/> Bounding box\n * @returns  <zh/> 如果点在包围盒内返回 true，否则返回 false | <en/> Returns true if the point is inside the bounding box, false otherwise\n */\nexport function isPointInBBox(point, bbox) {\n    return isBetween(point[0], bbox.min[0], bbox.max[0]) && isBetween(point[1], bbox.min[1], bbox.max[1]);\n}\n/**\n * <zh/> 判断点是否在给定的包围盒的边界或边界的延长线上\n *\n * <en/> Whether the point is on the boundary or extension line of the given box\n * @param point - <zh/> 点 | <en/> Point\n * @param bbox - <zh/> 包围盒 | <en/> Bounding box\n * @param extended - <zh/> 是否判断边界的延长线 | <en/> Whether to judge the extension line of the boundary\n * @returns <zh/> 如果点在包围盒的边界或边界的延长线上返回 true，否则返回 false | <en/> Returns true if the point is on the boundary or extension line of the bounding box, false otherwise\n */\nexport function isPointOnBBoxBoundary(point, bbox, extended = false) {\n    const { min: [minX, minY], max: [maxX, maxY], } = bbox;\n    const onTopOrBottomLine = (point[1] === minY || point[1] === maxY) && (extended || isBetween(point[0], minX, maxX));\n    const onLeftOrRightLine = (point[0] === minX || point[0] === maxX) && (extended || isBetween(point[1], minY, maxY));\n    return onTopOrBottomLine || onLeftOrRightLine;\n}\n/**\n * <zh/> 判断点是否在给定的包围盒外\n *\n * <en/> Whether the point is outside the given box\n * @param point - <zh/> 点 | <en/> Point\n * @param bbox - <zh/> 包围盒 | <en/> Bounding box\n * @returns <zh/> 如果点在包围盒外返回 true，否则返回 false | <en/> Returns true if the point is outside the bounding box, false otherwise\n */\nexport function isPointOutsideBBox(point, bbox) {\n    return !isPointInBBox(point, bbox);\n}\n/**\n * <zh/> 判断点是否位于包围盒中心\n *\n * <en/> When the point is at the center of the bounding box\n * @param point - <zh/> 点 | <en/> Point\n * @param bbox - <zh/> 包围盒 | <en/> Bounding box\n * @returns <zh/> 如果点在包围盒中心返回 true，否则返回 false | <en/> Returns true if the point is at the center of the bounding box, false otherwise\n */\nexport function isPointBBoxCenter(point, bbox) {\n    const { center } = bbox;\n    return point[0] === center[0] && point[1] === center[1];\n}\n/**\n * <zh/> 获取包围盒上离点 `p` 最近的边\n *\n * <en/> Get a side of the boundary which is nearest to the point `p`\n * @param bbox - <zh/> 包围盒 | <en/> Bounding box\n * @param p - <zh/> 点 | <en/> Point\n * @returns <zh/> 离点 `p` 最近的边 | <en/> The side nearest to the point `p`\n */\nexport function getNearestBoundarySide(p, bbox) {\n    const [x, y] = p;\n    const [minX, minY] = bbox.min;\n    const [maxX, maxY] = bbox.max;\n    const left = x - minX;\n    const right = maxX - x;\n    const top = y - minY;\n    const bottom = maxY - y;\n    const min = Math.min(left, right, top, bottom);\n    return min === left ? 'left' : min === right ? 'right' : min === top ? 'top' : min === bottom ? 'bottom' : 'left';\n}\n/**\n * <zh/> 获取包围盒上离点 `p` 最近的边界点\n *\n * <en/> Get a point on the boundary nearest to the point `p`\n * @param bbox - <zh/> 包围盒 | <en/> Bounding box\n * @param p - <zh/> 点 | <en/> Point\n * @returns <zh/> 离点 `p` 最近的点 | <en/> The point nearest to the point `p`\n */\nexport function getNearestBoundaryPoint(p, bbox) {\n    const ref = clone(p);\n    if (isPointInBBox(p, bbox)) {\n        const side = getNearestBoundarySide(p, bbox);\n        switch (side) {\n            case 'left':\n                ref[0] = bbox.min[0];\n                break;\n            case 'right':\n                ref[0] = bbox.max[0];\n                break;\n            case 'top':\n                ref[1] = bbox.min[1];\n                break;\n            case 'bottom':\n                ref[1] = bbox.max[1];\n                break;\n        }\n    }\n    else {\n        const [x, y] = p;\n        const [minX, minY] = bbox.min;\n        const [maxX, maxY] = bbox.max;\n        ref[0] = isBetween(x, minX, maxX) ? x : x < minX ? minX : maxX;\n        ref[1] = isBetween(y, minY, maxY) ? y : y < minY ? minY : maxY;\n    }\n    return ref;\n}\n/**\n * The triangle center point of the bounding box\n * @param bbox - bounding box\n * @param direction - direction\n * @returns Point\n */\nexport function getTriangleCenter(bbox, direction) {\n    // todo 算法只对矩形有效\n    const { center } = bbox;\n    const [width, height] = getBBoxSize(bbox);\n    const x = direction === 'up' || direction === 'down'\n        ? center[0]\n        : direction === 'right'\n            ? center[0] - width / 6\n            : center[0] + width / 6;\n    const y = direction === 'left' || direction === 'right'\n        ? center[1]\n        : direction === 'down'\n            ? center[1] - height / 6\n            : center[1] + height / 6;\n    return [x, y];\n}\n/**\n * Get incircle radius\n * @param bbox - bounding box\n * @param direction - direction\n * @returns number\n */\nexport function getIncircleRadius(bbox, direction) {\n    let [w, h] = getBBoxSize(bbox);\n    [w, h] = direction === 'up' || direction === 'down' ? [w, h] : [h, w];\n    // 三角形的内切圆半径\n    return (Math.pow(h, 2) - Math.pow((Math.sqrt(Math.pow((w / 2), 2) + Math.pow(h, 2)) - w / 2), 2)) / (2 * h);\n}\n/**\n * <zh/> 获取包围盒的四条边，顺序依次为上、右、下、左\n *\n * <en/> Get the four segments of the bounding box, in order from top, right, bottom, left\n * @param bbox - <zh/> 包围盒 | <en/> Bounding box\n * @returns <zh/> 包围盒的四条边 | <en/> The four segments of the bounding box\n */\nexport function getBBoxSegments(bbox) {\n    const { min: [minX, minY], max: [maxX, maxY], } = bbox;\n    const topLeftCorner = [minX, maxY];\n    const topRightCorner = [maxX, maxY];\n    const bottomRightCorner = [maxX, minY];\n    const bottomLeftCorner = [minX, minY];\n    const top = [topLeftCorner, topRightCorner];\n    const right = [topRightCorner, bottomRightCorner];\n    const bottom = [bottomRightCorner, bottomLeftCorner];\n    const left = [bottomLeftCorner, topLeftCorner];\n    return [top, right, bottom, left];\n}\n//# sourceMappingURL=bbox.js.map"],"names":["getBBoxWidth","bbox","getBBoxHeight","getBBoxSize","getNodeBBox","node","padding","isPoint","getPointBBox","getExpandedBBox","point","x","y","z","AABB","top","right","bottom","left","parsePadding","minX","minY","minZ","maxX","maxY","maxZ","eBbox","getCombinedBBox","bboxes","i","b2","isBBoxInside","bbox1","bbox2","minX1","minY1","maxX1","maxY1","minX2","minY2","maxX2","maxY2","isPointInBBox","isBetween","isPointOnBBoxBoundary","extended","onTopOrBottomLine","onLeftOrRightLine","isPointOutsideBBox","isPointBBoxCenter","center","getNearestBoundarySide","p","min","getNearestBoundaryPoint","ref","clone","getTriangleCenter","direction","width","height","getIncircleRadius","w","h","getBBoxSegments","topLeftCorner","topRightCorner","bottomRightCorner","bottomLeftCorner"],"mappings":";;;;;;AAYO,SAASA,EAAaC,GAAM;AAC/B,SAAOA,EAAK,IAAI,CAAC,IAAIA,EAAK,IAAI,CAAC;AACnC;AAQO,SAASC,EAAcD,GAAM;AAChC,SAAOA,EAAK,IAAI,CAAC,IAAIA,EAAK,IAAI,CAAC;AACnC;AAMO,SAASE,EAAYF,GAAM;AAC9B,SAAO,CAACD,EAAaC,CAAI,GAAGC,EAAcD,CAAI,CAAC;AACnD;AASO,SAASG,EAAYC,GAAMC,GAAS;AACvC,QAAML,IAAOM,EAAQF,CAAI,IAAIG,EAAaH,CAAI,IAAIA,EAAK,SAAS,KAAK,EAAE,UAAS;AAChF,SAAOC,IAAUG,EAAgBR,GAAMK,CAAO,IAAIL;AACtD;AAQO,SAASO,EAAaE,GAAO;AAChC,QAAM,CAACC,GAAGC,GAAGC,IAAI,CAAC,IAAIH,GAChBT,IAAO,IAAIa,EAAI;AACrB,SAAAb,EAAK,UAAU,CAACU,GAAGC,GAAGC,CAAC,GAAG,CAACF,GAAGC,GAAGC,CAAC,CAAC,GAC5BZ;AACX;AASO,SAASQ,EAAgBR,GAAMK,GAAS;AAC3C,QAAM,CAACS,GAAKC,GAAOC,GAAQC,CAAI,IAAIC,EAAab,CAAO,GACjD,CAACc,GAAMC,GAAMC,CAAI,IAAIrB,EAAK,KAC1B,CAACsB,GAAMC,GAAMC,CAAI,IAAIxB,EAAK,KAC1ByB,IAAQ,IAAIZ,EAAI;AACtB,SAAAY,EAAM,UAAU,CAACN,IAAOF,GAAMG,IAAON,GAAKO,CAAI,GAAG,CAACC,IAAOP,GAAOQ,IAAOP,GAAQQ,CAAI,CAAC,GAC7EC;AACX;AAQO,SAASC,EAAgBC,GAAQ;AACpC,MAAIA,EAAO,WAAW;AAClB,WAAO,IAAId,EAAI;AACnB,MAAIc,EAAO,WAAW;AAClB,WAAOA,EAAO,CAAC;AACnB,QAAM3B,IAAO,IAAIa,EAAI;AACrB,EAAAb,EAAK,UAAU2B,EAAO,CAAC,EAAE,KAAKA,EAAO,CAAC,EAAE,GAAG;AAC3C,WAASC,IAAI,GAAGA,IAAID,EAAO,QAAQC,KAAK;AACpC,UAAMC,IAAKF,EAAOC,CAAC;AACnB,IAAA5B,EAAK,UAAU,CAAC,KAAK,IAAIA,EAAK,IAAI,CAAC,GAAG6B,EAAG,IAAI,CAAC,CAAC,GAAG,KAAK,IAAI7B,EAAK,IAAI,CAAC,GAAG6B,EAAG,IAAI,CAAC,CAAC,GAAG,KAAK,IAAI7B,EAAK,IAAI,CAAC,GAAG6B,EAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,IAAI7B,EAAK,IAAI,CAAC,GAAG6B,EAAG,IAAI,CAAC,CAAC,GAAG,KAAK,IAAI7B,EAAK,IAAI,CAAC,GAAG6B,EAAG,IAAI,CAAC,CAAC,GAAG,KAAK,IAAI7B,EAAK,IAAI,CAAC,GAAG6B,EAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AAAA,EACjO;AACA,SAAO7B;AACX;AASO,SAAS8B,EAAaC,GAAOC,GAAO;AACvC,QAAM,CAACC,GAAOC,CAAK,IAAIH,EAAM,KACvB,CAACI,GAAOC,CAAK,IAAIL,EAAM,KACvB,CAACM,GAAOC,CAAK,IAAIN,EAAM,KACvB,CAACO,GAAOC,CAAK,IAAIR,EAAM;AAC7B,SAAOC,KAASI,KAASF,KAASI,KAASL,KAASI,KAASF,KAASI;AAC1E;AASO,SAASC,EAAchC,GAAOT,GAAM;AACvC,SAAO0C,EAAUjC,EAAM,CAAC,GAAGT,EAAK,IAAI,CAAC,GAAGA,EAAK,IAAI,CAAC,CAAC,KAAK0C,EAAUjC,EAAM,CAAC,GAAGT,EAAK,IAAI,CAAC,GAAGA,EAAK,IAAI,CAAC,CAAC;AACxG;AAUO,SAAS2C,EAAsBlC,GAAOT,GAAM4C,IAAW,IAAO;AACjE,QAAM,EAAE,KAAK,CAACzB,GAAMC,CAAI,GAAG,KAAK,CAACE,GAAMC,CAAI,EAAC,IAAMvB,GAC5C6C,KAAqBpC,EAAM,CAAC,MAAMW,KAAQX,EAAM,CAAC,MAAMc,OAAUqB,KAAYF,EAAUjC,EAAM,CAAC,GAAGU,GAAMG,CAAI,IAC3GwB,KAAqBrC,EAAM,CAAC,MAAMU,KAAQV,EAAM,CAAC,MAAMa,OAAUsB,KAAYF,EAAUjC,EAAM,CAAC,GAAGW,GAAMG,CAAI;AACjH,SAAOsB,KAAqBC;AAChC;AASO,SAASC,EAAmBtC,GAAOT,GAAM;AAC5C,SAAO,CAACyC,EAAchC,GAAOT,CAAI;AACrC;AASO,SAASgD,EAAkBvC,GAAOT,GAAM;AAC3C,QAAM,EAAE,QAAAiD,EAAM,IAAKjD;AACnB,SAAOS,EAAM,CAAC,MAAMwC,EAAO,CAAC,KAAKxC,EAAM,CAAC,MAAMwC,EAAO,CAAC;AAC1D;AASO,SAASC,EAAuBC,GAAGnD,GAAM;AAC5C,QAAM,CAACU,GAAGC,CAAC,IAAIwC,GACT,CAAChC,GAAMC,CAAI,IAAIpB,EAAK,KACpB,CAACsB,GAAMC,CAAI,IAAIvB,EAAK,KACpBiB,IAAOP,IAAIS,GACXJ,IAAQO,IAAOZ,GACfI,IAAMH,IAAIS,GACVJ,IAASO,IAAOZ,GAChByC,IAAM,KAAK,IAAInC,GAAMF,GAAOD,GAAKE,CAAM;AAC7C,SAAOoC,MAAQnC,IAAO,SAASmC,MAAQrC,IAAQ,UAAUqC,MAAQtC,IAAM,QAAQsC,MAAQpC,IAAS,WAAW;AAC/G;AASO,SAASqC,EAAwBF,GAAGnD,GAAM;AAC7C,QAAMsD,IAAMC,EAAMJ,CAAC;AACnB,MAAIV,EAAcU,GAAGnD,CAAI;AAErB,YADakD,EAAuBC,GAAGnD,CAAI,GAC/B;AAAA,MACR,KAAK;AACD,QAAAsD,EAAI,CAAC,IAAItD,EAAK,IAAI,CAAC;AACnB;AAAA,MACJ,KAAK;AACD,QAAAsD,EAAI,CAAC,IAAItD,EAAK,IAAI,CAAC;AACnB;AAAA,MACJ,KAAK;AACD,QAAAsD,EAAI,CAAC,IAAItD,EAAK,IAAI,CAAC;AACnB;AAAA,MACJ,KAAK;AACD,QAAAsD,EAAI,CAAC,IAAItD,EAAK,IAAI,CAAC;AACnB;AAAA,IAChB;AAAA,OAES;AACD,UAAM,CAACU,GAAGC,CAAC,IAAIwC,GACT,CAAChC,GAAMC,CAAI,IAAIpB,EAAK,KACpB,CAACsB,GAAMC,CAAI,IAAIvB,EAAK;AAC1B,IAAAsD,EAAI,CAAC,IAAIZ,EAAUhC,GAAGS,GAAMG,CAAI,IAAIZ,IAAIA,IAAIS,IAAOA,IAAOG,GAC1DgC,EAAI,CAAC,IAAIZ,EAAU/B,GAAGS,GAAMG,CAAI,IAAIZ,IAAIA,IAAIS,IAAOA,IAAOG;AAAA,EAC9D;AACA,SAAO+B;AACX;AAOO,SAASE,EAAkBxD,GAAMyD,GAAW;AAE/C,QAAM,EAAE,QAAAR,EAAM,IAAKjD,GACb,CAAC0D,GAAOC,CAAM,IAAIzD,EAAYF,CAAI,GAClCU,IAAI+C,MAAc,QAAQA,MAAc,SACxCR,EAAO,CAAC,IACRQ,MAAc,UACVR,EAAO,CAAC,IAAIS,IAAQ,IACpBT,EAAO,CAAC,IAAIS,IAAQ,GACxB/C,IAAI8C,MAAc,UAAUA,MAAc,UAC1CR,EAAO,CAAC,IACRQ,MAAc,SACVR,EAAO,CAAC,IAAIU,IAAS,IACrBV,EAAO,CAAC,IAAIU,IAAS;AAC/B,SAAO,CAACjD,GAAGC,CAAC;AAChB;AAOO,SAASiD,EAAkB5D,GAAMyD,GAAW;AAC/C,MAAI,CAACI,GAAGC,CAAC,IAAI5D,EAAYF,CAAI;AAC7B,UAAC6D,GAAGC,CAAC,IAAIL,MAAc,QAAQA,MAAc,SAAS,CAACI,GAAGC,CAAC,IAAI,CAACA,GAAGD,CAAC,IAE5D,KAAK,IAAIC,GAAG,CAAC,IAAI,KAAK,IAAK,KAAK,KAAK,KAAK,IAAKD,IAAI,GAAI,CAAC,IAAI,KAAK,IAAIC,GAAG,CAAC,CAAC,IAAID,IAAI,GAAI,CAAC,MAAM,IAAIC;AAC7G;AAQO,SAASC,EAAgB/D,GAAM;AAClC,QAAM,EAAE,KAAK,CAACmB,GAAMC,CAAI,GAAG,KAAK,CAACE,GAAMC,CAAI,EAAC,IAAMvB,GAC5CgE,IAAgB,CAAC7C,GAAMI,CAAI,GAC3B0C,IAAiB,CAAC3C,GAAMC,CAAI,GAC5B2C,IAAoB,CAAC5C,GAAMF,CAAI,GAC/B+C,IAAmB,CAAChD,GAAMC,CAAI;AAKpC,SAAO,CAJK,CAAC4C,GAAeC,CAAc,GAC5B,CAACA,GAAgBC,CAAiB,GACjC,CAACA,GAAmBC,CAAgB,GACtC,CAACA,GAAkBH,CAAa,CACb;AACpC;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,21 @@
+import e from "../../../util/esm/lodash/get.js";
+import i from "../../../util/esm/lodash/set.js";
+const c = "cachedStyle", o = (t) => `__${t}__`;
+function f(t, r) {
+  const y = Array.isArray(r) ? r : [r];
+  e(t, c) || i(t, c, {}), y.forEach((a) => {
+    i(e(t, c), o(a), t.attributes[a]);
+  });
+}
+function n(t, r) {
+  return e(t, [c, o(r)]);
+}
+function u(t, r) {
+  return o(r) in (e(t, c) || {});
+}
+export {
+  f as cacheStyle,
+  n as getCachedStyle,
+  u as hasCachedStyle
+};
+//# sourceMappingURL=cache.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"cache.js","sources":["../../../../../../node_modules/@antv/g6/esm/utils/cache.js"],"sourcesContent":["import { get, set } from '@antv/util';\nconst CacheTargetKey = 'cachedStyle';\nconst getStyleCacheKey = (name) => `__${name}__`;\n/**\n * <zh/> 缓存图形样式\n *\n * <en/> Cache shape style\n * @param element - <zh/> 图形元素 | <en/> shape element\n * @param name - <zh/> 样式名 | <en/> style name\n */\nexport function cacheStyle(element, name) {\n    const names = Array.isArray(name) ? name : [name];\n    if (!get(element, CacheTargetKey))\n        set(element, CacheTargetKey, {});\n    names.forEach((n) => {\n        set(get(element, CacheTargetKey), getStyleCacheKey(n), element.attributes[n]);\n    });\n}\n/**\n * <zh/> 获取缓存的样式\n *\n * <en/> Get cached style\n * @param element - <zh/> 图形元素 | <en/> shape element\n * @param name - <zh/> 样式名 | <en/> style name\n * @returns <zh/> 样式值 | <en/> style value\n */\nexport function getCachedStyle(element, name) {\n    return get(element, [CacheTargetKey, getStyleCacheKey(name)]);\n}\n/**\n * <zh/> 是否有缓存的样式\n *\n * <en/> Whether there is a cached style\n * @param element - <zh/> 图形元素 | <en/> shape element\n * @param name - <zh/> 样式名 | <en/> style name\n * @returns <zh/> 是否有缓存的样式 | <en/> Whether there is a cached style\n */\nexport function hasCachedStyle(element, name) {\n    return getStyleCacheKey(name) in (get(element, CacheTargetKey) || {});\n}\n/**\n * <zh/> 设置缓存的样式\n *\n * <en/> Set cached style\n * @param element - <zh/> 图形元素 | <en/> shape element\n * @param name - <zh/> 样式名 | <en/> style name\n * @param value - <zh/> 样式值 | <en/> style value\n */\nexport function setCacheStyle(element, name, value) {\n    set(element, [CacheTargetKey, getStyleCacheKey(name)], value);\n}\n//# sourceMappingURL=cache.js.map"],"names":["CacheTargetKey","getStyleCacheKey","name","cacheStyle","element","names","get","set","n","getCachedStyle","hasCachedStyle"],"mappings":";;AACA,MAAMA,IAAiB,eACjBC,IAAmB,CAACC,MAAS,KAAKA,CAAI;AAQrC,SAASC,EAAWC,GAASF,GAAM;AACtC,QAAMG,IAAQ,MAAM,QAAQH,CAAI,IAAIA,IAAO,CAACA,CAAI;AAChD,EAAKI,EAAIF,GAASJ,CAAc,KAC5BO,EAAIH,GAASJ,GAAgB,EAAE,GACnCK,EAAM,QAAQ,CAACG,MAAM;AACjB,IAAAD,EAAID,EAAIF,GAASJ,CAAc,GAAGC,EAAiBO,CAAC,GAAGJ,EAAQ,WAAWI,CAAC,CAAC;AAAA,EAChF,CAAC;AACL;AASO,SAASC,EAAeL,GAASF,GAAM;AAC1C,SAAOI,EAAIF,GAAS,CAACJ,GAAgBC,EAAiBC,CAAI,CAAC,CAAC;AAChE;AASO,SAASQ,EAAeN,GAASF,GAAM;AAC1C,SAAOD,EAAiBC,CAAI,MAAMI,EAAIF,GAASJ,CAAc,KAAK;AACtE;","x_google_ignoreList":[0]}