@hkyhy/marsun-components-core 0.1.113 → 0.1.115

package/dist/node_modules/@antv/g6/esm/utils/router/orth.js

@@ -0,0 +1,132 @@
+import { getNodeBBox as M, isPointBBoxCenter as y, getNearestBoundaryPoint as F, isPointInBBox as O, getCombinedBBox as j, getBBoxHeight as C, getBBoxWidth as R, getNearestBoundarySide as q, isPointOutsideBBox as x, isPointOnBBoxBoundary as J } from "../bbox.js";
+import { isOrthogonal as k, moveTo as N, round as S } from "../point.js";
+import { toVector2 as w, distance as v, angle as G, subtract as K, toVector3 as z } from "../vector.js";
+import Q from "../../../../util/esm/lodash/is-equal.js";
+import X from "../../../../util/esm/lodash/difference.js";
+const Y = {
+  padding: 10
+};
+function it(n, t, e, s, c, p) {
+  const { padding: o } = Object.assign(Y, p), r = M(e, o), i = M(s, o), d = [n, ...c, t];
+  let l = null;
+  const u = [];
+  for (let h = 0, T = d.length; h < T - 1; h++) {
+    const E = h + 1, a = d[h], g = d[E], W = k(a, g);
+    let P = null;
+    if (h === 0)
+      if (E === T - 1)
+        if (r.intersects(i))
+          P = U(a, g, r, i);
+        else if (!y(a, r) && !y(g, i)) {
+          const A = F(a, r), L = F(g, i);
+          P = b(A, L, f(A, L)), P.points.unshift(A), P.points.push(L);
+        } else W || (P = $(a, g, r, i));
+      else
+        O(g, r) ? P = U(a, g, r, M(g, o), l) : W || (P = I(a, g, r));
+    else E === T - 1 ? O(a, i) ? P = U(a, g, M(a, o), i, l) : W || (P = V(a, g, i, l)) : W || (P = b(a, g, l));
+    P ? (u.push(...P.points), l = P.direction) : l = f(a, g), E < T - 1 && u.push(g);
+  }
+  return u.map(w);
+}
+const Z = {
+  N: "S",
+  S: "N",
+  W: "E",
+  E: "W"
+}, H = {
+  N: -Math.PI / 2,
+  S: Math.PI / 2,
+  E: 0,
+  W: Math.PI
+};
+function f(n, t) {
+  const [e, s] = n, [c, p] = t;
+  return e === c ? s > p ? "N" : "S" : s === p ? e > c ? "W" : "E" : null;
+}
+function _(n, t) {
+  return t === "N" || t === "S" ? C(n) : R(n);
+}
+function b(n, t, e) {
+  const s = [n[0], t[1]], c = [t[0], n[1]], p = f(n, s), o = f(n, c), r = e ? Z[e] : null, i = p === e || p !== r && o !== e ? s : c;
+  return { points: [i], direction: f(i, t) };
+}
+function I(n, t, e) {
+  if (y(n, e)) {
+    const s = D(n, t, e);
+    return { points: [s], direction: f(s, t) };
+  } else {
+    const s = F(n, e), p = ["left", "right"].includes(q(n, e)) ? [t[0], s[1]] : [s[0], t[1]];
+    return { points: [p], direction: f(p, t) };
+  }
+}
+function V(n, t, e, s) {
+  const c = y(t, e) ? t : F(t, e), p = [
+    [c[0], n[1]],
+    [n[0], c[1]]
+  ], o = p.filter((i) => x(i, e) && !J(i, e, !0)), r = o.filter((i) => f(i, n) !== s);
+  if (r.length > 0) {
+    const i = r.find((d) => f(n, d) === s) || r[0];
+    return {
+      points: [i],
+      direction: f(i, t)
+    };
+  } else {
+    const i = X(p, o)[0], d = N(t, i, _(e, s) / 2);
+    return {
+      points: [D(d, n, e), d],
+      direction: f(d, t)
+    };
+  }
+}
+function $(n, t, e, s) {
+  let c = I(n, t, e);
+  const p = z(c.points[0]);
+  if (O(p, s)) {
+    c = I(t, n, s);
+    const o = z(c.points[0]);
+    if (O(o, e)) {
+      const r = N(n, p, _(e, f(n, p)) / 2), i = N(t, o, _(s, f(t, o)) / 2), d = [(r[0] + i[0]) / 2, (r[1] + i[1]) / 2], l = I(n, d, e), u = V(d, t, s, l.direction);
+      c.points = [l.points[0], u.points[0]], c.direction = u.direction;
+    }
+  }
+  return c;
+}
+function U(n, t, e, s, c) {
+  const o = j([e, s]), r = v(t, o.center) > v(n, o.center), [i, d] = r ? [t, n] : [n, t], l = C(o) + R(o);
+  let u;
+  if (c) {
+    const E = [
+      i[0] + l * Math.cos(H[c]),
+      i[1] + l * Math.sin(H[c])
+    ];
+    u = N(F(E, o), E, 0.01);
+  } else
+    u = N(F(i, o), i, -0.01);
+  let h = D(u, d, o), T = [S(u, 2), S(h, 2)];
+  if (Q(S(u), S(h))) {
+    const E = G(K(u, i), [1, 0, 0]) + Math.PI / 2;
+    h = [d[0] + l * Math.cos(E), d[1] + l * Math.sin(E), 0], h = S(N(F(h, o), d, -0.01), 2);
+    const a = D(u, h, o);
+    T = [u, a, h];
+  }
+  return {
+    points: r ? T.reverse() : T,
+    direction: f(r ? u : h, t)
+  };
+}
+function D(n, t, e) {
+  let s = [n[0], t[1]];
+  return O(s, e) && (s = [t[0], n[1]]), s;
+}
+export {
+  D as freeJoin,
+  _ as getBBoxSize,
+  f as getDirection,
+  U as insideNode,
+  $ as nodeToNode,
+  I as nodeToPoint,
+  it as orth,
+  V as pointToNode,
+  b as pointToPoint
+};
+//# sourceMappingURL=orth.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"orth.js","sources":["../../../../../../../node_modules/@antv/g6/esm/utils/router/orth.js"],"sourcesContent":["import { difference, isEqual } from '@antv/util';\nimport { getBBoxHeight, getBBoxWidth, getCombinedBBox, getNearestBoundaryPoint, getNearestBoundarySide, getNodeBBox, isPointBBoxCenter, isPointInBBox, isPointOnBBoxBoundary, isPointOutsideBBox, } from '../bbox';\nimport { isOrthogonal, moveTo, round } from '../point';\nimport { angle, distance, subtract, toVector2, toVector3 } from '../vector';\nconst defaultOptions = {\n    padding: 10,\n};\n/**\n * <zh/> 获取两点之间的正交线段路径\n *\n * <en/> Get orthogonal line segments between two points\n * @param sourcePoint - <zh/> 起始点 | <en/> start point\n * @param targetPoint - <zh/> 终止点 | <en/> end point\n * @param sourceNode - <zh/> 起始节点 | <en/> source node\n * @param targetNode - <zh/> 终止节点 | <en/> target node\n * @param controlPoints - <zh/> 控制点 | <en/> control points\n * @param options - <zh/> 配置项 | <en/> options\n * @returns <zh/> 路径点集 | <en/> vertices\n */\nexport function orth(sourcePoint, targetPoint, sourceNode, targetNode, controlPoints, options) {\n    const { padding } = Object.assign(defaultOptions, options);\n    const sourceBBox = getNodeBBox(sourceNode, padding);\n    const targetBBox = getNodeBBox(targetNode, padding);\n    const points = [sourcePoint, ...controlPoints, targetPoint];\n    // direction of previous route segment\n    let direction = null;\n    const result = [];\n    for (let fromIdx = 0, len = points.length; fromIdx < len - 1; fromIdx++) {\n        const toIdx = fromIdx + 1;\n        const from = points[fromIdx];\n        const to = points[toIdx];\n        const isOrth = isOrthogonal(from, to);\n        let route = null;\n        if (fromIdx === 0) {\n            if (toIdx === len - 1) {\n                // source -> target\n                if (sourceBBox.intersects(targetBBox)) {\n                    route = insideNode(from, to, sourceBBox, targetBBox);\n                }\n                else if (!isPointBBoxCenter(from, sourceBBox) && !isPointBBoxCenter(to, targetBBox)) {\n                    const fromWithPadding = getNearestBoundaryPoint(from, sourceBBox);\n                    const toWithPadding = getNearestBoundaryPoint(to, targetBBox);\n                    route = pointToPoint(fromWithPadding, toWithPadding, getDirection(fromWithPadding, toWithPadding));\n                    route.points.unshift(fromWithPadding);\n                    route.points.push(toWithPadding);\n                }\n                else if (!isOrth) {\n                    route = nodeToNode(from, to, sourceBBox, targetBBox);\n                }\n            }\n            else {\n                // source -> point\n                if (isPointInBBox(to, sourceBBox)) {\n                    route = insideNode(from, to, sourceBBox, getNodeBBox(to, padding), direction);\n                }\n                else if (!isOrth) {\n                    route = nodeToPoint(from, to, sourceBBox);\n                }\n            }\n        }\n        else if (toIdx === len - 1) {\n            // point -> target\n            if (isPointInBBox(from, targetBBox)) {\n                route = insideNode(from, to, getNodeBBox(from, padding), targetBBox, direction);\n            }\n            else if (!isOrth) {\n                route = pointToNode(from, to, targetBBox, direction);\n            }\n        }\n        else if (!isOrth) {\n            // point -> point\n            route = pointToPoint(from, to, direction);\n        }\n        // set direction for next iteration\n        if (route) {\n            result.push(...route.points);\n            direction = route.direction;\n        }\n        else {\n            // orthogonal route and not looped\n            direction = getDirection(from, to);\n        }\n        if (toIdx < len - 1)\n            result.push(to);\n    }\n    return result.map(toVector2);\n}\n/**\n * Direction to opposites direction map\n */\nconst opposites = {\n    N: 'S',\n    S: 'N',\n    W: 'E',\n    E: 'W',\n};\n/**\n * Direction to radians map\n */\nconst radians = {\n    N: -Math.PI / 2,\n    S: Math.PI / 2,\n    E: 0,\n    W: Math.PI,\n};\n/**\n * <zh/> 获取两点之间的方向，从 `from` 到 `to` 的方向\n *\n * <en/> Get the direction between two points, the direction from `from` to `to`\n * @param from - <zh/> 起始点 | <en/> start point\n * @param to - <zh/> 终止点 | <en/> end point\n * @returns <zh/> 方向 | <en/> direction\n */\nexport function getDirection(from, to) {\n    const [fx, fy] = from;\n    const [tx, ty] = to;\n    if (fx === tx) {\n        return fy > ty ? 'N' : 'S';\n    }\n    if (fy === ty) {\n        return fx > tx ? 'W' : 'E';\n    }\n    return null;\n}\n/**\n * <zh/> 获取包围盒的尺寸，根据方向返回宽度或者高度\n *\n * <en/> Get the size of the bounding box, return the width or height according to the direction\n * @param bbox - <zh/> 包围盒 | <en/> bounding box\n * @param direction - <zh/> 方向 | <en/> direction\n * @returns <zh/> 尺寸 | <en/> size\n */\nexport function getBBoxSize(bbox, direction) {\n    return direction === 'N' || direction === 'S' ? getBBoxHeight(bbox) : getBBoxWidth(bbox);\n}\n/**\n * <zh/> 从一个点到另一个点计算正交路由\n *\n * <en/> Calculate orthogonal route from one point to another\n * @param from - <zh/> 起始点 | <en/> start point\n * @param to - <zh/> 终止点 | <en/> end point\n * @param direction - <zh/> 前一条线段的方向 | <en/> direction of the previous segment\n * @returns <zh/> 正交路由 | <en/> orthogonal route\n */\nexport function pointToPoint(from, to, direction) {\n    const p1 = [from[0], to[1]];\n    const p2 = [to[0], from[1]];\n    const d1 = getDirection(from, p1);\n    const d2 = getDirection(from, p2);\n    const opposite = direction ? opposites[direction] : null;\n    const p = d1 === direction || (d1 !== opposite && d2 !== direction) ? p1 : p2;\n    return { points: [p], direction: getDirection(p, to) };\n}\n/**\n * <zh/> 从节点到点计算正交路由\n *\n * <en/> Calculate orthogonal route from node to point\n * @param from - <zh/> 起始点 | <en/> start point\n * @param to - <zh/> 终止点 | <en/> end point\n * @param fromBBox - <zh/> 起始节点的包围盒 | <en/> bounding box of the start node\n * @returns <zh/> 正交路由 | <en/> orthogonal route\n */\nexport function nodeToPoint(from, to, fromBBox) {\n    if (isPointBBoxCenter(from, fromBBox)) {\n        const p = freeJoin(from, to, fromBBox);\n        return { points: [p], direction: getDirection(p, to) };\n    }\n    else {\n        const fromWithPadding = getNearestBoundaryPoint(from, fromBBox);\n        const isHorizontal = ['left', 'right'].includes(getNearestBoundarySide(from, fromBBox));\n        const p = isHorizontal ? [to[0], fromWithPadding[1]] : [fromWithPadding[0], to[1]];\n        return { points: [p], direction: getDirection(p, to) };\n    }\n}\n/**\n * <zh/> 从点到节点计算正交路由\n *\n * <en/> Calculate orthogonal route from point to node\n * @param from - <zh/> 起始点 | <en/> start point\n * @param to - <zh/> 终止点 | <en/> end point\n * @param toBBox - <zh/> 终止节点的包围盒 | <en/> bounding box of the end node\n * @param direction - <zh/> 前一条线段的方向 | <en/> direction of the previous segment\n * @returns <zh/> 正交路由 | <en/> orthogonal route\n */\nexport function pointToNode(from, to, toBBox, direction) {\n    const toWithPadding = isPointBBoxCenter(to, toBBox) ? to : getNearestBoundaryPoint(to, toBBox);\n    const points = [\n        [toWithPadding[0], from[1]],\n        [from[0], toWithPadding[1]],\n    ];\n    const freePoints = points.filter((p) => isPointOutsideBBox(p, toBBox) && !isPointOnBBoxBoundary(p, toBBox, true));\n    const freeDirectionPoints = freePoints.filter((p) => getDirection(p, from) !== direction);\n    if (freeDirectionPoints.length > 0) {\n        // Pick a point which bears the same direction as the previous segment.\n        const p = freeDirectionPoints.find((p) => getDirection(from, p) === direction) || freeDirectionPoints[0];\n        return {\n            points: [p],\n            direction: getDirection(p, to),\n        };\n    }\n    else {\n        // Here we found only points which are either contained in the element or they would create\n        // a link segment going in opposites direction from the previous one.\n        // We take the point inside element and move it outside the element in the direction the\n        // route is going. Now we can join this point with the current end (using freeJoin).\n        const p = difference(points, freePoints)[0];\n        const p2 = moveTo(to, p, getBBoxSize(toBBox, direction) / 2);\n        const p1 = freeJoin(p2, from, toBBox);\n        return {\n            points: [p1, p2],\n            direction: getDirection(p2, to),\n        };\n    }\n}\n/**\n * <zh/> 从节点到节点计算正交路由\n *\n * <en/> Calculate orthogonal route from node to node\n * @param from - <zh/> 起始点 | <en/> start point\n * @param to - <zh/> 终止点 | <en/> end point\n * @param fromBBox - <zh/> 起始节点的包围盒 | <en/> bounding box of the start node\n * @param toBBox - <zh/> 终止节点的包围盒 | <en/> bounding box of the end node\n * @returns <zh/> 正交路由 | <en/> orthogonal route\n */\nexport function nodeToNode(from, to, fromBBox, toBBox) {\n    let route = nodeToPoint(from, to, fromBBox);\n    const p1 = toVector3(route.points[0]);\n    if (isPointInBBox(p1, toBBox)) {\n        route = nodeToPoint(to, from, toBBox);\n        const p2 = toVector3(route.points[0]);\n        if (isPointInBBox(p2, fromBBox)) {\n            const fromBorder = moveTo(from, p1, getBBoxSize(fromBBox, getDirection(from, p1)) / 2);\n            const toBorder = moveTo(to, p2, getBBoxSize(toBBox, getDirection(to, p2)) / 2);\n            const midPoint = [(fromBorder[0] + toBorder[0]) / 2, (fromBorder[1] + toBorder[1]) / 2];\n            const startRoute = nodeToPoint(from, midPoint, fromBBox);\n            const endRoute = pointToNode(midPoint, to, toBBox, startRoute.direction);\n            route.points = [startRoute.points[0], endRoute.points[0]];\n            route.direction = endRoute.direction;\n        }\n    }\n    return route;\n}\n/**\n * <zh/> 在两个节点内部计算路由\n *\n * <en/> Calculate route inside two nodes\n * @param from - <zh/> 起始点 | <en/> start point\n * @param to - <zh/> 终止点 | <en/> end point\n * @param fromBBox - <zh/> 起始节点的包围盒 | <en/> bounding box of the start node\n * @param toBBox - <zh/> 终止节点的包围盒 | <en/> bounding box of the end node\n * @param direction - <zh/> 方向 | <en/> direction\n * @returns <zh/> 正交路由 | <en/> orthogonal route\n */\nexport function insideNode(from, to, fromBBox, toBBox, direction) {\n    const DEFAULT_OFFSET = 0.01;\n    const boundary = getCombinedBBox([fromBBox, toBBox]);\n    const reversed = distance(to, boundary.center) > distance(from, boundary.center);\n    const [start, end] = reversed ? [to, from] : [from, to];\n    const halfPerimeter = getBBoxHeight(boundary) + getBBoxWidth(boundary);\n    let p1;\n    if (direction) {\n        const ref = [\n            start[0] + halfPerimeter * Math.cos(radians[direction]),\n            start[1] + halfPerimeter * Math.sin(radians[direction]),\n        ];\n        // `getNearestBoundaryPoint` returns a point on the boundary, so we need to move it a bit to ensure it's outside the element and then get the correct `p2` via `freeJoin`.\n        p1 = moveTo(getNearestBoundaryPoint(ref, boundary), ref, DEFAULT_OFFSET);\n    }\n    else {\n        p1 = moveTo(getNearestBoundaryPoint(start, boundary), start, -DEFAULT_OFFSET);\n    }\n    let p2 = freeJoin(p1, end, boundary);\n    let points = [round(p1, 2), round(p2, 2)];\n    if (isEqual(round(p1), round(p2))) {\n        const rad = angle(subtract(p1, start), [1, 0, 0]) + Math.PI / 2;\n        p2 = [end[0] + halfPerimeter * Math.cos(rad), end[1] + halfPerimeter * Math.sin(rad), 0];\n        p2 = round(moveTo(getNearestBoundaryPoint(p2, boundary), end, -DEFAULT_OFFSET), 2);\n        const p3 = freeJoin(p1, p2, boundary);\n        points = [p1, p3, p2];\n    }\n    return {\n        points: reversed ? points.reverse() : points,\n        direction: reversed ? getDirection(p1, to) : getDirection(p2, to),\n    };\n}\n/**\n * <zh/> 返回一个点 `p`，使得线段 p,p1 和 p,p2 互相垂直，p 尽可能不在给定的包围盒内\n *\n * <en/> Returns a point `p` where lines p,p1 and p,p2 are perpendicular and p is not contained in the given box\n * @param p1 - <zh/> 点 | <en/> point\n * @param p2 - <zh/> 点 | <en/> point\n * @param bbox - <zh/> 包围盒 | <en/> bounding box\n * @returns <zh/> 点 | <en/> point\n */\nexport function freeJoin(p1, p2, bbox) {\n    let p = [p1[0], p2[1]];\n    if (isPointInBBox(p, bbox)) {\n        p = [p2[0], p1[1]];\n    }\n    return p;\n}\n//# sourceMappingURL=orth.js.map"],"names":["defaultOptions","orth","sourcePoint","targetPoint","sourceNode","targetNode","controlPoints","options","padding","sourceBBox","getNodeBBox","targetBBox","points","direction","result","fromIdx","len","toIdx","from","to","isOrth","isOrthogonal","route","insideNode","isPointBBoxCenter","fromWithPadding","getNearestBoundaryPoint","toWithPadding","pointToPoint","getDirection","nodeToNode","isPointInBBox","nodeToPoint","pointToNode","toVector2","opposites","radians","fx","fy","tx","ty","getBBoxSize","bbox","getBBoxHeight","getBBoxWidth","p1","p2","d1","d2","opposite","p","fromBBox","freeJoin","getNearestBoundarySide","toBBox","freePoints","isPointOutsideBBox","isPointOnBBoxBoundary","freeDirectionPoints","difference","moveTo","toVector3","fromBorder","toBorder","midPoint","startRoute","endRoute","boundary","getCombinedBBox","reversed","distance","start","end","halfPerimeter","ref","round","isEqual","rad","angle","subtract","p3"],"mappings":";;;;;AAIA,MAAMA,IAAiB;AAAA,EACnB,SAAS;AACb;AAaO,SAASC,GAAKC,GAAaC,GAAaC,GAAYC,GAAYC,GAAeC,GAAS;AAC3F,QAAM,EAAE,SAAAC,EAAO,IAAK,OAAO,OAAOR,GAAgBO,CAAO,GACnDE,IAAaC,EAAYN,GAAYI,CAAO,GAC5CG,IAAaD,EAAYL,GAAYG,CAAO,GAC5CI,IAAS,CAACV,GAAa,GAAGI,GAAeH,CAAW;AAE1D,MAAIU,IAAY;AAChB,QAAMC,IAAS,CAAA;AACf,WAASC,IAAU,GAAGC,IAAMJ,EAAO,QAAQG,IAAUC,IAAM,GAAGD,KAAW;AACrE,UAAME,IAAQF,IAAU,GAClBG,IAAON,EAAOG,CAAO,GACrBI,IAAKP,EAAOK,CAAK,GACjBG,IAASC,EAAaH,GAAMC,CAAE;AACpC,QAAIG,IAAQ;AACZ,QAAIP,MAAY;AACZ,UAAIE,MAAUD,IAAM;AAEhB,YAAIP,EAAW,WAAWE,CAAU;AAChC,UAAAW,IAAQC,EAAWL,GAAMC,GAAIV,GAAYE,CAAU;AAAA,iBAE9C,CAACa,EAAkBN,GAAMT,CAAU,KAAK,CAACe,EAAkBL,GAAIR,CAAU,GAAG;AACjF,gBAAMc,IAAkBC,EAAwBR,GAAMT,CAAU,GAC1DkB,IAAgBD,EAAwBP,GAAIR,CAAU;AAC5D,UAAAW,IAAQM,EAAaH,GAAiBE,GAAeE,EAAaJ,GAAiBE,CAAa,CAAC,GACjGL,EAAM,OAAO,QAAQG,CAAe,GACpCH,EAAM,OAAO,KAAKK,CAAa;AAAA,QACnC,MACK,CAAKP,MACNE,IAAQQ,EAAWZ,GAAMC,GAAIV,GAAYE,CAAU;AAAA;AAKvD,QAAIoB,EAAcZ,GAAIV,CAAU,IAC5Ba,IAAQC,EAAWL,GAAMC,GAAIV,GAAYC,EAAYS,GAAIX,CAAO,GAAGK,CAAS,IAEtEO,MACNE,IAAQU,EAAYd,GAAMC,GAAIV,CAAU;AAAA,QAI/C,CAAIQ,MAAUD,IAAM,IAEjBe,EAAcb,GAAMP,CAAU,IAC9BW,IAAQC,EAAWL,GAAMC,GAAIT,EAAYQ,GAAMV,CAAO,GAAGG,GAAYE,CAAS,IAExEO,MACNE,IAAQW,EAAYf,GAAMC,GAAIR,GAAYE,CAAS,KAGjDO,MAENE,IAAQM,EAAaV,GAAMC,GAAIN,CAAS;AAG5C,IAAIS,KACAR,EAAO,KAAK,GAAGQ,EAAM,MAAM,GAC3BT,IAAYS,EAAM,aAIlBT,IAAYgB,EAAaX,GAAMC,CAAE,GAEjCF,IAAQD,IAAM,KACdF,EAAO,KAAKK,CAAE;AAAA,EACtB;AACA,SAAOL,EAAO,IAAIoB,CAAS;AAC/B;AAIA,MAAMC,IAAY;AAAA,EACd,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AACP,GAIMC,IAAU;AAAA,EACZ,GAAG,CAAC,KAAK,KAAK;AAAA,EACd,GAAG,KAAK,KAAK;AAAA,EACb,GAAG;AAAA,EACH,GAAG,KAAK;AACZ;AASO,SAASP,EAAaX,GAAMC,GAAI;AACnC,QAAM,CAACkB,GAAIC,CAAE,IAAIpB,GACX,CAACqB,GAAIC,CAAE,IAAIrB;AACjB,SAAIkB,MAAOE,IACAD,IAAKE,IAAK,MAAM,MAEvBF,MAAOE,IACAH,IAAKE,IAAK,MAAM,MAEpB;AACX;AASO,SAASE,EAAYC,GAAM7B,GAAW;AACzC,SAAOA,MAAc,OAAOA,MAAc,MAAM8B,EAAcD,CAAI,IAAIE,EAAaF,CAAI;AAC3F;AAUO,SAASd,EAAaV,GAAMC,GAAIN,GAAW;AAC9C,QAAMgC,IAAK,CAAC3B,EAAK,CAAC,GAAGC,EAAG,CAAC,CAAC,GACpB2B,IAAK,CAAC3B,EAAG,CAAC,GAAGD,EAAK,CAAC,CAAC,GACpB6B,IAAKlB,EAAaX,GAAM2B,CAAE,GAC1BG,IAAKnB,EAAaX,GAAM4B,CAAE,GAC1BG,IAAWpC,IAAYsB,EAAUtB,CAAS,IAAI,MAC9CqC,IAAIH,MAAOlC,KAAckC,MAAOE,KAAYD,MAAOnC,IAAagC,IAAKC;AAC3E,SAAO,EAAE,QAAQ,CAACI,CAAC,GAAG,WAAWrB,EAAaqB,GAAG/B,CAAE,EAAC;AACxD;AAUO,SAASa,EAAYd,GAAMC,GAAIgC,GAAU;AAC5C,MAAI3B,EAAkBN,GAAMiC,CAAQ,GAAG;AACnC,UAAMD,IAAIE,EAASlC,GAAMC,GAAIgC,CAAQ;AACrC,WAAO,EAAE,QAAQ,CAACD,CAAC,GAAG,WAAWrB,EAAaqB,GAAG/B,CAAE,EAAC;AAAA,EACxD,OACK;AACD,UAAMM,IAAkBC,EAAwBR,GAAMiC,CAAQ,GAExD,IADe,CAAC,QAAQ,OAAO,EAAE,SAASE,EAAuBnC,GAAMiC,CAAQ,CAAC,IAC7D,CAAChC,EAAG,CAAC,GAAGM,EAAgB,CAAC,CAAC,IAAI,CAACA,EAAgB,CAAC,GAAGN,EAAG,CAAC,CAAC;AACjF,WAAO,EAAE,QAAQ,CAAC,CAAC,GAAG,WAAWU,EAAa,GAAGV,CAAE,EAAC;AAAA,EACxD;AACJ;AAWO,SAASc,EAAYf,GAAMC,GAAImC,GAAQzC,GAAW;AACrD,QAAMc,IAAgBH,EAAkBL,GAAImC,CAAM,IAAInC,IAAKO,EAAwBP,GAAImC,CAAM,GACvF1C,IAAS;AAAA,IACX,CAACe,EAAc,CAAC,GAAGT,EAAK,CAAC,CAAC;AAAA,IAC1B,CAACA,EAAK,CAAC,GAAGS,EAAc,CAAC,CAAC;AAAA,EAClC,GACU4B,IAAa3C,EAAO,OAAO,CAACsC,MAAMM,EAAmBN,GAAGI,CAAM,KAAK,CAACG,EAAsBP,GAAGI,GAAQ,EAAI,CAAC,GAC1GI,IAAsBH,EAAW,OAAO,CAACL,MAAMrB,EAAaqB,GAAGhC,CAAI,MAAML,CAAS;AACxF,MAAI6C,EAAoB,SAAS,GAAG;AAEhC,UAAMR,IAAIQ,EAAoB,KAAK,CAACR,MAAMrB,EAAaX,GAAMgC,CAAC,MAAMrC,CAAS,KAAK6C,EAAoB,CAAC;AACvG,WAAO;AAAA,MACH,QAAQ,CAACR,CAAC;AAAA,MACV,WAAWrB,EAAaqB,GAAG/B,CAAE;AAAA,IACzC;AAAA,EACI,OACK;AAKD,UAAM+B,IAAIS,EAAW/C,GAAQ2C,CAAU,EAAE,CAAC,GACpCT,IAAKc,EAAOzC,GAAI+B,GAAGT,EAAYa,GAAQzC,CAAS,IAAI,CAAC;AAE3D,WAAO;AAAA,MACH,QAAQ,CAFDuC,EAASN,GAAI5B,GAAMoC,CAAM,GAEnBR,CAAE;AAAA,MACf,WAAWjB,EAAaiB,GAAI3B,CAAE;AAAA,IAC1C;AAAA,EACI;AACJ;AAWO,SAASW,EAAWZ,GAAMC,GAAIgC,GAAUG,GAAQ;AACnD,MAAIhC,IAAQU,EAAYd,GAAMC,GAAIgC,CAAQ;AAC1C,QAAMN,IAAKgB,EAAUvC,EAAM,OAAO,CAAC,CAAC;AACpC,MAAIS,EAAcc,GAAIS,CAAM,GAAG;AAC3B,IAAAhC,IAAQU,EAAYb,GAAID,GAAMoC,CAAM;AACpC,UAAMR,IAAKe,EAAUvC,EAAM,OAAO,CAAC,CAAC;AACpC,QAAIS,EAAce,GAAIK,CAAQ,GAAG;AAC7B,YAAMW,IAAaF,EAAO1C,GAAM2B,GAAIJ,EAAYU,GAAUtB,EAAaX,GAAM2B,CAAE,CAAC,IAAI,CAAC,GAC/EkB,IAAWH,EAAOzC,GAAI2B,GAAIL,EAAYa,GAAQzB,EAAaV,GAAI2B,CAAE,CAAC,IAAI,CAAC,GACvEkB,IAAW,EAAEF,EAAW,CAAC,IAAIC,EAAS,CAAC,KAAK,IAAID,EAAW,CAAC,IAAIC,EAAS,CAAC,KAAK,CAAC,GAChFE,IAAajC,EAAYd,GAAM8C,GAAUb,CAAQ,GACjDe,IAAWjC,EAAY+B,GAAU7C,GAAImC,GAAQW,EAAW,SAAS;AACvE,MAAA3C,EAAM,SAAS,CAAC2C,EAAW,OAAO,CAAC,GAAGC,EAAS,OAAO,CAAC,CAAC,GACxD5C,EAAM,YAAY4C,EAAS;AAAA,IAC/B;AAAA,EACJ;AACA,SAAO5C;AACX;AAYO,SAASC,EAAWL,GAAMC,GAAIgC,GAAUG,GAAQzC,GAAW;AAE9D,QAAMsD,IAAWC,EAAgB,CAACjB,GAAUG,CAAM,CAAC,GAC7Ce,IAAWC,EAASnD,GAAIgD,EAAS,MAAM,IAAIG,EAASpD,GAAMiD,EAAS,MAAM,GACzE,CAACI,GAAOC,CAAG,IAAIH,IAAW,CAAClD,GAAID,CAAI,IAAI,CAACA,GAAMC,CAAE,GAChDsD,IAAgB9B,EAAcwB,CAAQ,IAAIvB,EAAauB,CAAQ;AACrE,MAAItB;AACJ,MAAIhC,GAAW;AACX,UAAM6D,IAAM;AAAA,MACRH,EAAM,CAAC,IAAIE,IAAgB,KAAK,IAAIrC,EAAQvB,CAAS,CAAC;AAAA,MACtD0D,EAAM,CAAC,IAAIE,IAAgB,KAAK,IAAIrC,EAAQvB,CAAS,CAAC;AAAA,IAClE;AAEQ,IAAAgC,IAAKe,EAAOlC,EAAwBgD,GAAKP,CAAQ,GAAGO,GAAK,IAAc;AAAA,EAC3E;AAEI,IAAA7B,IAAKe,EAAOlC,EAAwB6C,GAAOJ,CAAQ,GAAGI,GAAO,KAAe;AAEhF,MAAIzB,IAAKM,EAASP,GAAI2B,GAAKL,CAAQ,GAC/BvD,IAAS,CAAC+D,EAAM9B,GAAI,CAAC,GAAG8B,EAAM7B,GAAI,CAAC,CAAC;AACxC,MAAI8B,EAAQD,EAAM9B,CAAE,GAAG8B,EAAM7B,CAAE,CAAC,GAAG;AAC/B,UAAM+B,IAAMC,EAAMC,EAASlC,GAAI0B,CAAK,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,KAAK,KAAK;AAC9D,IAAAzB,IAAK,CAAC0B,EAAI,CAAC,IAAIC,IAAgB,KAAK,IAAII,CAAG,GAAGL,EAAI,CAAC,IAAIC,IAAgB,KAAK,IAAII,CAAG,GAAG,CAAC,GACvF/B,IAAK6B,EAAMf,EAAOlC,EAAwBoB,GAAIqB,CAAQ,GAAGK,GAAK,KAAe,GAAG,CAAC;AACjF,UAAMQ,IAAK5B,EAASP,GAAIC,GAAIqB,CAAQ;AACpC,IAAAvD,IAAS,CAACiC,GAAImC,GAAIlC,CAAE;AAAA,EACxB;AACA,SAAO;AAAA,IACH,QAAQuB,IAAWzD,EAAO,QAAO,IAAKA;AAAA,IACtC,WAAsBiB,EAAXwC,IAAwBxB,IAAuBC,GAAnB3B,CAAE;AAAA,EACjD;AACA;AAUO,SAASiC,EAASP,GAAIC,GAAIJ,GAAM;AACnC,MAAIQ,IAAI,CAACL,EAAG,CAAC,GAAGC,EAAG,CAAC,CAAC;AACrB,SAAIf,EAAcmB,GAAGR,CAAI,MACrBQ,IAAI,CAACJ,EAAG,CAAC,GAAGD,EAAG,CAAC,CAAC,IAEdK;AACX;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/g6/esm/utils/router/shortest-path.js

@@ -0,0 +1,195 @@
+import { getExpandedBBox as E, getBBoxSize as T, getBBoxSegments as Z, isPointOnBBoxBoundary as q, isPointInBBox as z } from "../bbox.js";
+import { getLinesIntersection as H } from "../line.js";
+import { toVector2 as Y, manhattanDistance as G, add as J } from "../vector.js";
+import K from "../../../../util/esm/lodash/is-number.js";
+const N = {
+  enableObstacleAvoidance: !1,
+  offset: 10,
+  maxAllowedDirectionChange: Math.PI / 2,
+  maximumLoops: 3e3,
+  gridSize: 5,
+  startDirections: ["top", "right", "bottom", "left"],
+  endDirections: ["top", "right", "bottom", "left"],
+  directionMap: {
+    right: { stepX: 1, stepY: 0 },
+    left: { stepX: -1, stepY: 0 },
+    bottom: { stepX: 0, stepY: 1 },
+    top: { stepX: 0, stepY: -1 }
+  },
+  penalties: { 0: 0, 90: 0 },
+  distFunc: G
+}, m = (e) => `${Math.round(e[0])}|||${Math.round(e[1])}`;
+function B(e, t) {
+  const n = (o) => Math.round(o / t);
+  return K(e) ? n(e) : e.map(n);
+}
+function Q(e, t) {
+  const n = Math.abs(e - t);
+  return n > Math.PI ? 2 * Math.PI - n : n;
+}
+function k(e, t) {
+  const n = t[0] - e[0], o = t[1] - e[1];
+  return !n && !o ? 0 : Math.atan2(o, n);
+}
+function $(e, t, n, o) {
+  const c = k(e, t), i = n[m(e)], r = k(i || o, e);
+  return Q(r, c);
+}
+const U = (e, t) => {
+  const { offset: n, gridSize: o } = t, c = {};
+  return e.forEach((i) => {
+    if (!i || i.destroyed || !i.isVisible())
+      return;
+    const s = E(i.getRenderBounds(), n);
+    for (let r = B(s.min[0], o); r <= B(s.max[0], o); r += 1)
+      for (let a = B(s.min[1], o); a <= B(s.max[1], o); a += 1)
+        c[`${r}|||${a}`] = !0;
+  }), c;
+};
+function L(e, t, n) {
+  return Math.min(...t.map((o) => n(e, o)));
+}
+function W(e, t, n) {
+  let o = e[0], c = n(e[0], t);
+  for (let i = 0; i < e.length; i++) {
+    const s = e[i], r = n(s, t);
+    r < c && (o = s, c = r);
+  }
+  return o;
+}
+const j = (e, t, n, o) => {
+  if (!t)
+    return [e];
+  const { directionMap: c, offset: i } = o, s = E(t.getRenderBounds(), i), r = Object.keys(c).reduce((a, u) => {
+    if (n.includes(u)) {
+      const g = c[u], [I, b] = T(s), l = [e[0] + g.stepX * I, e[1] + g.stepY * b], d = Z(s);
+      for (let P = 0; P < d.length; P++) {
+        const v = H([e, l], d[P]);
+        v && q(v, s) && a.push(v);
+      }
+    }
+    return a;
+  }, []);
+  return z(e, s) || r.push(e), r.map((a) => B(a, o.gridSize));
+}, tt = (e, t, n, o, c, i, s) => {
+  const r = [];
+  let a = [
+    i[0] === o[0] ? o[0] : e[0] * s,
+    i[1] === o[1] ? o[1] : e[1] * s
+  ];
+  r.unshift(a);
+  let u = e, g = t[m(u)];
+  for (; g; ) {
+    const l = g, d = u;
+    $(l, d, t, n) && (a = [
+      l[0] === d[0] ? a[0] : l[0] * s,
+      l[1] === d[1] ? a[1] : l[1] * s
+    ], r.unshift(a)), g = t[m(l)], u = l;
+  }
+  const I = c.map((l) => [l[0] * s, l[1] * s]), b = W(I, a, G);
+  return r.unshift(b), r;
+};
+function rt(e, t, n, o) {
+  const c = Y(e.getCenter()), i = Y(t.getCenter()), s = Object.assign(N, o), { gridSize: r } = s, a = s.enableObstacleAvoidance ? n : [e, t], u = U(a, s), g = B(c, r), I = B(i, r), b = j(c, e, s.startDirections, s), l = j(i, t, s.endDirections, s);
+  b.forEach((h) => delete u[m(h)]), l.forEach((h) => delete u[m(h)]);
+  const d = {}, P = {}, v = {}, D = {}, C = {}, S = new et();
+  for (let h = 0; h < b.length; h++) {
+    const f = b[h], M = m(f);
+    d[M] = f, D[M] = 0, C[M] = L(f, l, s.distFunc), S.add({
+      id: M,
+      value: C[M]
+    });
+  }
+  const R = l.map((h) => m(h));
+  let y = s.maximumLoops, x, w = 1 / 0;
+  for (const [h, f] of Object.entries(d))
+    C[h] <= w && (w = C[h], x = f);
+  for (; Object.keys(d).length > 0 && y > 0; ) {
+    const h = S.minId(!1);
+    if (h)
+      x = d[h];
+    else
+      break;
+    const f = m(x);
+    if (R.includes(f))
+      return tt(x, v, g, i, b, I, r);
+    delete d[f], S.remove(f), P[f] = !0;
+    for (const M of Object.values(s.directionMap)) {
+      const A = J(x, [M.stepX, M.stepY]), p = m(A);
+      if (P[p])
+        continue;
+      const _ = $(x, A, v, g);
+      if (_ > s.maxAllowedDirectionChange || u[p])
+        continue;
+      d[p] || (d[p] = A);
+      const F = s.penalties[_], V = s.distFunc(x, A) + (isNaN(F) ? r : F), O = D[f] + V, X = D[p];
+      X && O >= X || (v[p] = x, D[p] = O, C[p] = O + L(A, l, s.distFunc), S.add({
+        id: p,
+        value: C[p]
+      }));
+    }
+    y -= 1;
+  }
+  return [];
+}
+class et {
+  constructor() {
+    this.arr = [], this.map = {}, this.arr = [], this.map = {};
+  }
+  _innerAdd(t, n) {
+    let o = 0, c = n - 1;
+    for (; c - o > 1; ) {
+      const i = Math.floor((o + c) / 2);
+      if (this.arr[i].value > t.value)
+        c = i;
+      else if (this.arr[i].value < t.value)
+        o = i;
+      else {
+        this.arr.splice(i, 0, t), this.map[t.id] = !0;
+        return;
+      }
+    }
+    this.arr.splice(c, 0, t), this.map[t.id] = !0;
+  }
+  /**
+   * <zh/> 将新项添加到适当的索引位置
+   *
+   * <en/> Add the new item to the appropriate index
+   * @param item - <zh/> 新项 | <en/> new item
+   */
+  add(t) {
+    delete this.map[t.id];
+    const n = this.arr.length;
+    if (!n || this.arr[n - 1].value < t.value) {
+      this.arr.push(t), this.map[t.id] = !0;
+      return;
+    }
+    this._innerAdd(t, n);
+  }
+  remove(t) {
+    this.map[t] && delete this.map[t];
+  }
+  _clearAndGetMinId() {
+    let t;
+    for (let n = this.arr.length - 1; n >= 0; n--)
+      this.map[this.arr[n].id] ? t = this.arr[n].id : this.arr.splice(n, 1);
+    return t;
+  }
+  _findFirstId() {
+    for (; this.arr.length; ) {
+      const t = this.arr.shift();
+      if (this.map[t.id])
+        return t.id;
+    }
+  }
+  minId(t) {
+    return t ? this._clearAndGetMinId() : this._findFirstId();
+  }
+}
+export {
+  et as SortedArray,
+  rt as aStarSearch,
+  L as estimateCost,
+  W as getNearestPoint
+};
+//# sourceMappingURL=shortest-path.js.map

package/dist/node_modules/@antv/g6/esm/utils/router/shortest-path.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"shortest-path.js","sources":["../../../../../../../node_modules/@antv/g6/esm/utils/router/shortest-path.js"],"sourcesContent":["import { isNumber } from '@antv/util';\nimport { getBBoxSegments, getBBoxSize, getExpandedBBox, isPointInBBox, isPointOnBBoxBoundary } from '../bbox';\nimport { getLinesIntersection } from '../line';\nimport { add, manhattanDistance, toVector2 } from '../vector';\nconst defaultCfg = {\n    enableObstacleAvoidance: false,\n    offset: 10,\n    maxAllowedDirectionChange: Math.PI / 2,\n    maximumLoops: 3000,\n    gridSize: 5,\n    startDirections: ['top', 'right', 'bottom', 'left'],\n    endDirections: ['top', 'right', 'bottom', 'left'],\n    directionMap: {\n        right: { stepX: 1, stepY: 0 },\n        left: { stepX: -1, stepY: 0 },\n        bottom: { stepX: 0, stepY: 1 },\n        top: { stepX: 0, stepY: -1 },\n    },\n    penalties: { 0: 0, 90: 0 },\n    distFunc: manhattanDistance,\n};\nconst keyOf = (point) => `${Math.round(point[0])}|||${Math.round(point[1])}`;\n/**\n * <zh/> 将坐标对齐到网格\n *\n * <en/> Align to the grid\n * @param p - <zh/> 坐标 | <en/> point\n * @param gridSize - <zh/> 网格大小 | <en/> grid size\n * @returns <zh/> 对齐后的坐标 | <en/> aligned point\n */\nfunction alignToGrid(p, gridSize) {\n    const align = (value) => Math.round(value / gridSize);\n    if (isNumber(p))\n        return align(p);\n    return p.map(align);\n}\n/**\n * <zh/> 获取两个角度的变化方向，并确保小于 180 度\n *\n * <en/ >Get changed direction angle and make sure less than 180 degrees\n * @param angle1 - <zh/> 第一个角度 | <en/> the first angle\n * @param angle2 - <zh/> 第二个角度 | <en/> the second angle\n * @returns <zh/> 两个角度的变化方向 | <en/> changed direction angle\n */\nfunction getAngleDiff(angle1, angle2) {\n    const directionChange = Math.abs(angle1 - angle2);\n    return directionChange > Math.PI ? 2 * Math.PI - directionChange : directionChange;\n}\n/**\n * <zh/> 获取从 p1 指向 p2 的向量与 x 轴正方向之间的夹角，单位为弧度\n *\n * <en/> Get the angle between the vector from p1 to p2 and the positive direction of the x-axis, in radians\n * @param p1 - <zh/> 点 p1 | <en/> point p1\n * @param p2 - <zh/> 点 p2 | <en/> point p2\n * @returns <zh/> 夹角 | <en/> angle\n */\nfunction getDirectionAngle(p1, p2) {\n    const deltaX = p2[0] - p1[0];\n    const deltaY = p2[1] - p1[1];\n    if (!deltaX && !deltaY)\n        return 0;\n    return Math.atan2(deltaY, deltaX);\n}\n/**\n * <zh/> 获取两个点之间的方向变化\n *\n * <en/> Get direction change between two points\n * @param current - <zh/> 当前点 | <en/> current point\n * @param neighbor - <zh/> 邻居点 | <en/> neighbor point\n * @param cameFrom - <zh/> 来源点 | <en/> source point\n * @param scaleStartPoint - <zh/> 缩放后的起点 | <en/> scaled start point\n * @returns <zh/> 方向变化 | <en/> direction change\n */\nfunction getDirectionChange(current, neighbor, cameFrom, scaleStartPoint) {\n    const directionAngle = getDirectionAngle(current, neighbor);\n    const currentCameFrom = cameFrom[keyOf(current)];\n    const prev = !currentCameFrom ? scaleStartPoint : currentCameFrom;\n    const prevDirectionAngle = getDirectionAngle(prev, current);\n    return getAngleDiff(prevDirectionAngle, directionAngle);\n}\n/**\n * <zh/> 获取障碍物地图\n *\n * <en/> Get obstacle map\n * @param nodes - <zh/> 图上所有节点 | <en/> all nodes on the graph\n * @param options - <zh/> 路由配置 | <en/> router options\n * @returns <zh/> 障碍物地图 | <en/> obstacle map\n */\nconst getObstacleMap = (nodes, options) => {\n    const { offset, gridSize } = options;\n    const obstacleMap = {};\n    nodes.forEach((item) => {\n        if (!item || item.destroyed || !item.isVisible())\n            return;\n        const bbox = getExpandedBBox(item.getRenderBounds(), offset);\n        for (let x = alignToGrid(bbox.min[0], gridSize); x <= alignToGrid(bbox.max[0], gridSize); x += 1) {\n            for (let y = alignToGrid(bbox.min[1], gridSize); y <= alignToGrid(bbox.max[1], gridSize); y += 1) {\n                obstacleMap[`${x}|||${y}`] = true;\n            }\n        }\n    });\n    return obstacleMap;\n};\n/**\n * <zh/> 估算从起点到多个锚点的最小代价\n *\n * <en/> Estimate minimum cost from the starting point to multiple anchor points\n * @param from - <zh/> 起点 | <en/> source point\n * @param anchors - <zh/> 锚点 | <en/> anchor points\n * @param distFunc - <zh/> 距离函数 | <en/> distance function\n * @returns <zh/> 最小成本 | <en/> minimum cost\n */\nexport function estimateCost(from, anchors, distFunc) {\n    return Math.min(...anchors.map((anchor) => distFunc(from, anchor)));\n}\n/**\n * <zh/> 已知一个点集与一个参考点，从点集中找到距离参考点最近的点\n *\n * <en/> Given a set of points and a reference point, find the point closest to the reference point from the set of points\n * @param points - <zh/> 点集 | <en/> set of points\n * @param refPoint - <zh/> 参考点 | <en/> reference point\n * @param distFunc - <zh/> 距离函数 | <en/> distance function\n * @returns <zh/> 最近的点 | <en/> nearest point\n */\nexport function getNearestPoint(points, refPoint, distFunc) {\n    let nearestPoint = points[0];\n    let minDistance = distFunc(points[0], refPoint);\n    for (let i = 0; i < points.length; i++) {\n        const point = points[i];\n        const dis = distFunc(point, refPoint);\n        if (dis < minDistance) {\n            nearestPoint = point;\n            minDistance = dis;\n        }\n    }\n    return nearestPoint;\n}\n/**\n * Calculate the connection points on the expanded BBox\n * @param point\n * @param node\n * @param directions\n * @param options\n */\nconst getBoxPoints = (point, node, directions, options) => {\n    // create-edge 生成边的过程中，endNode 为 null\n    if (!node)\n        return [point];\n    const { directionMap, offset } = options;\n    const expandedBBox = getExpandedBBox(node.getRenderBounds(), offset);\n    const points = Object.keys(directionMap).reduce((res, directionKey) => {\n        if (directions.includes(directionKey)) {\n            const direction = directionMap[directionKey];\n            const [width, height] = getBBoxSize(expandedBBox);\n            const otherPoint = [point[0] + direction.stepX * width, point[1] + direction.stepY * height];\n            const segments = getBBoxSegments(expandedBBox);\n            for (let i = 0; i < segments.length; i++) {\n                const intersectP = getLinesIntersection([point, otherPoint], segments[i]);\n                if (intersectP && isPointOnBBoxBoundary(intersectP, expandedBBox)) {\n                    res.push(intersectP);\n                }\n            }\n        }\n        return res;\n    }, []);\n    if (!isPointInBBox(point, expandedBBox)) {\n        points.push(point);\n    }\n    return points.map((point) => alignToGrid(point, options.gridSize));\n};\nconst getControlPoints = (current, cameFrom, scaleStartPoint, endPoint, startPoints, scaleEndPoint, gridSize) => {\n    const controlPoints = [];\n    // append endPoint\n    let pointZero = [\n        scaleEndPoint[0] === endPoint[0] ? endPoint[0] : current[0] * gridSize,\n        scaleEndPoint[1] === endPoint[1] ? endPoint[1] : current[1] * gridSize,\n    ];\n    controlPoints.unshift(pointZero);\n    let _current = current;\n    let _currentCameFrom = cameFrom[keyOf(_current)];\n    while (_currentCameFrom) {\n        const prePoint = _currentCameFrom;\n        const point = _current;\n        const directionChange = getDirectionChange(prePoint, point, cameFrom, scaleStartPoint);\n        if (directionChange) {\n            pointZero = [\n                prePoint[0] === point[0] ? pointZero[0] : prePoint[0] * gridSize,\n                prePoint[1] === point[1] ? pointZero[1] : prePoint[1] * gridSize,\n            ];\n            controlPoints.unshift(pointZero);\n        }\n        _currentCameFrom = cameFrom[keyOf(prePoint)];\n        _current = prePoint;\n    }\n    // append startPoint\n    const realStartPoints = startPoints.map((point) => [point[0] * gridSize, point[1] * gridSize]);\n    const startPoint = getNearestPoint(realStartPoints, pointZero, manhattanDistance);\n    controlPoints.unshift(startPoint);\n    return controlPoints;\n};\n/**\n * Find the shortest path between a given source node to a destination node according to A* Search Algorithm：https://www.geeksforgeeks.org/a-search-algorithm/\n * @param sourceNode - <zh/> 源节点 | <en/> source node\n * @param targetNode - <zh/> 目标节点 | <en/> target node\n * @param nodes - <zh/> 图上所有节点 | <en/> all nodes on the graph\n * @param config - <zh/> 路由配置 | <en/> router options\n * @returns <zh/> 控制点数组 | <en/> control point array\n */\nexport function aStarSearch(sourceNode, targetNode, nodes, config) {\n    const startPoint = toVector2(sourceNode.getCenter());\n    const endPoint = toVector2(targetNode.getCenter());\n    const options = Object.assign(defaultCfg, config);\n    const { gridSize } = options;\n    const obstacles = options.enableObstacleAvoidance ? nodes : [sourceNode, targetNode];\n    const obstacleMap = getObstacleMap(obstacles, options);\n    const scaleStartPoint = alignToGrid(startPoint, gridSize);\n    const scaleEndPoint = alignToGrid(endPoint, gridSize);\n    const startPoints = getBoxPoints(startPoint, sourceNode, options.startDirections, options);\n    const endPoints = getBoxPoints(endPoint, targetNode, options.endDirections, options);\n    startPoints.forEach((point) => delete obstacleMap[keyOf(point)]);\n    endPoints.forEach((point) => delete obstacleMap[keyOf(point)]);\n    const openList = {};\n    const closedList = {};\n    const cameFrom = {};\n    // The movement cost to move from the starting point to the current point on the grid.\n    const gScore = {};\n    // The estimated movement cost to move from the starting point to the end point after passing through the current point.\n    // f = g + h\n    const fScore = {};\n    const sortedOpenSet = new SortedArray();\n    for (let i = 0; i < startPoints.length; i++) {\n        const firstStep = startPoints[i];\n        const key = keyOf(firstStep);\n        openList[key] = firstStep;\n        gScore[key] = 0;\n        fScore[key] = estimateCost(firstStep, endPoints, options.distFunc);\n        // Push start point to sortedOpenSet\n        sortedOpenSet.add({\n            id: key,\n            value: fScore[key],\n        });\n    }\n    const endPointsKeys = endPoints.map((point) => keyOf(point));\n    let remainLoops = options.maximumLoops;\n    let current;\n    let curCost = Infinity;\n    for (const [id, value] of Object.entries(openList)) {\n        if (fScore[id] <= curCost) {\n            curCost = fScore[id];\n            current = value;\n        }\n    }\n    while (Object.keys(openList).length > 0 && remainLoops > 0) {\n        const minId = sortedOpenSet.minId(false);\n        if (minId) {\n            current = openList[minId];\n        }\n        else {\n            break;\n        }\n        const key = keyOf(current);\n        // If currentNode is final, return the successful path\n        if (endPointsKeys.includes(key)) {\n            return getControlPoints(current, cameFrom, scaleStartPoint, endPoint, startPoints, scaleEndPoint, gridSize);\n        }\n        // Set currentNode as closed\n        delete openList[key];\n        sortedOpenSet.remove(key);\n        closedList[key] = true;\n        // Get the neighbor points of the next step\n        for (const dir of Object.values(options.directionMap)) {\n            const neighbor = add(current, [dir.stepX, dir.stepY]);\n            const neighborId = keyOf(neighbor);\n            if (closedList[neighborId])\n                continue;\n            const directionChange = getDirectionChange(current, neighbor, cameFrom, scaleStartPoint);\n            if (directionChange > options.maxAllowedDirectionChange)\n                continue;\n            if (obstacleMap[neighborId])\n                continue; // skip if intersects\n            // Add neighbor points to openList, and calculate the cost of each neighbor point\n            if (!openList[neighborId]) {\n                openList[neighborId] = neighbor;\n            }\n            const directionPenalties = options.penalties[directionChange];\n            const neighborCost = options.distFunc(current, neighbor) + (isNaN(directionPenalties) ? gridSize : directionPenalties);\n            const costFromStart = gScore[key] + neighborCost;\n            const neighborGScore = gScore[neighborId];\n            if (neighborGScore && costFromStart >= neighborGScore)\n                continue;\n            cameFrom[neighborId] = current;\n            gScore[neighborId] = costFromStart;\n            fScore[neighborId] = costFromStart + estimateCost(neighbor, endPoints, options.distFunc);\n            sortedOpenSet.add({\n                id: neighborId,\n                value: fScore[neighborId],\n            });\n        }\n        remainLoops -= 1;\n    }\n    return [];\n}\n/**\n * <zh/> 有序数组，按升序排列\n *\n * <en/> Sorted array, sorted in ascending order\n */\nexport class SortedArray {\n    constructor() {\n        this.arr = [];\n        this.map = {};\n        this.arr = [];\n        this.map = {};\n    }\n    _innerAdd(item, length) {\n        let low = 0, high = length - 1;\n        while (high - low > 1) {\n            const mid = Math.floor((low + high) / 2);\n            if (this.arr[mid].value > item.value) {\n                high = mid;\n            }\n            else if (this.arr[mid].value < item.value) {\n                low = mid;\n            }\n            else {\n                this.arr.splice(mid, 0, item);\n                this.map[item.id] = true;\n                return;\n            }\n        }\n        this.arr.splice(high, 0, item);\n        this.map[item.id] = true;\n    }\n    /**\n     * <zh/> 将新项添加到适当的索引位置\n     *\n     * <en/> Add the new item to the appropriate index\n     * @param item - <zh/> 新项 | <en/> new item\n     */\n    add(item) {\n        // 已经存在，先移除\n        // If exists, remove it\n        delete this.map[item.id];\n        const length = this.arr.length;\n        // 如果为空或者最后一个元素小于当前元素，直接添加到最后\n        // If empty or the last element is less than the current element, add to the end\n        if (!length || this.arr[length - 1].value < item.value) {\n            this.arr.push(item);\n            this.map[item.id] = true;\n            return;\n        }\n        // 按照升序排列，找到合适的位置插入\n        // Find the appropriate position to insert in ascending order\n        this._innerAdd(item, length);\n    }\n    remove(id) {\n        if (!this.map[id])\n            return;\n        delete this.map[id];\n    }\n    _clearAndGetMinId() {\n        let res;\n        for (let i = this.arr.length - 1; i >= 0; i--) {\n            if (this.map[this.arr[i].id])\n                res = this.arr[i].id;\n            else\n                this.arr.splice(i, 1);\n        }\n        return res;\n    }\n    _findFirstId() {\n        while (this.arr.length) {\n            const first = this.arr.shift();\n            if (this.map[first.id])\n                return first.id;\n        }\n    }\n    minId(clear) {\n        if (clear) {\n            return this._clearAndGetMinId();\n        }\n        else {\n            return this._findFirstId();\n        }\n    }\n}\n//# sourceMappingURL=shortest-path.js.map"],"names":["defaultCfg","manhattanDistance","keyOf","point","alignToGrid","p","gridSize","align","value","isNumber","getAngleDiff","angle1","angle2","directionChange","getDirectionAngle","p1","p2","deltaX","deltaY","getDirectionChange","current","neighbor","cameFrom","scaleStartPoint","directionAngle","currentCameFrom","prevDirectionAngle","getObstacleMap","nodes","options","offset","obstacleMap","item","bbox","getExpandedBBox","x","y","estimateCost","from","anchors","distFunc","anchor","getNearestPoint","points","refPoint","nearestPoint","minDistance","dis","getBoxPoints","node","directions","directionMap","expandedBBox","res","directionKey","direction","width","height","getBBoxSize","otherPoint","segments","getBBoxSegments","i","intersectP","getLinesIntersection","isPointOnBBoxBoundary","isPointInBBox","getControlPoints","endPoint","startPoints","scaleEndPoint","controlPoints","pointZero","_current","_currentCameFrom","prePoint","realStartPoints","startPoint","aStarSearch","sourceNode","targetNode","config","toVector2","obstacles","endPoints","openList","closedList","gScore","fScore","sortedOpenSet","SortedArray","firstStep","key","endPointsKeys","remainLoops","curCost","id","minId","dir","add","neighborId","directionPenalties","neighborCost","costFromStart","neighborGScore","length","low","high","mid","first","clear"],"mappings":";;;;AAIA,MAAMA,IAAa;AAAA,EACf,yBAAyB;AAAA,EACzB,QAAQ;AAAA,EACR,2BAA2B,KAAK,KAAK;AAAA,EACrC,cAAc;AAAA,EACd,UAAU;AAAA,EACV,iBAAiB,CAAC,OAAO,SAAS,UAAU,MAAM;AAAA,EAClD,eAAe,CAAC,OAAO,SAAS,UAAU,MAAM;AAAA,EAChD,cAAc;AAAA,IACV,OAAO,EAAE,OAAO,GAAG,OAAO,EAAC;AAAA,IAC3B,MAAM,EAAE,OAAO,IAAI,OAAO,EAAC;AAAA,IAC3B,QAAQ,EAAE,OAAO,GAAG,OAAO,EAAC;AAAA,IAC5B,KAAK,EAAE,OAAO,GAAG,OAAO,GAAE;AAAA,EAClC;AAAA,EACI,WAAW,EAAE,GAAG,GAAG,IAAI,EAAC;AAAA,EACxB,UAAUC;AACd,GACMC,IAAQ,CAACC,MAAU,GAAG,KAAK,MAAMA,EAAM,CAAC,CAAC,CAAC,MAAM,KAAK,MAAMA,EAAM,CAAC,CAAC,CAAC;AAS1E,SAASC,EAAYC,GAAGC,GAAU;AAC9B,QAAMC,IAAQ,CAACC,MAAU,KAAK,MAAMA,IAAQF,CAAQ;AACpD,SAAIG,EAASJ,CAAC,IACHE,EAAMF,CAAC,IACXA,EAAE,IAAIE,CAAK;AACtB;AASA,SAASG,EAAaC,GAAQC,GAAQ;AAClC,QAAMC,IAAkB,KAAK,IAAIF,IAASC,CAAM;AAChD,SAAOC,IAAkB,KAAK,KAAK,IAAI,KAAK,KAAKA,IAAkBA;AACvE;AASA,SAASC,EAAkBC,GAAIC,GAAI;AAC/B,QAAMC,IAASD,EAAG,CAAC,IAAID,EAAG,CAAC,GACrBG,IAASF,EAAG,CAAC,IAAID,EAAG,CAAC;AAC3B,SAAI,CAACE,KAAU,CAACC,IACL,IACJ,KAAK,MAAMA,GAAQD,CAAM;AACpC;AAWA,SAASE,EAAmBC,GAASC,GAAUC,GAAUC,GAAiB;AACtE,QAAMC,IAAiBV,EAAkBM,GAASC,CAAQ,GACpDI,IAAkBH,EAASpB,EAAMkB,CAAO,CAAC,GAEzCM,IAAqBZ,EADbW,KAAkBF,GACmBH,CAAO;AAC1D,SAAOV,EAAagB,GAAoBF,CAAc;AAC1D;AASA,MAAMG,IAAiB,CAACC,GAAOC,MAAY;AACvC,QAAM,EAAE,QAAAC,GAAQ,UAAAxB,EAAQ,IAAKuB,GACvBE,IAAc,CAAA;AACpB,SAAAH,EAAM,QAAQ,CAACI,MAAS;AACpB,QAAI,CAACA,KAAQA,EAAK,aAAa,CAACA,EAAK,UAAS;AAC1C;AACJ,UAAMC,IAAOC,EAAgBF,EAAK,gBAAe,GAAIF,CAAM;AAC3D,aAASK,IAAI/B,EAAY6B,EAAK,IAAI,CAAC,GAAG3B,CAAQ,GAAG6B,KAAK/B,EAAY6B,EAAK,IAAI,CAAC,GAAG3B,CAAQ,GAAG6B,KAAK;AAC3F,eAASC,IAAIhC,EAAY6B,EAAK,IAAI,CAAC,GAAG3B,CAAQ,GAAG8B,KAAKhC,EAAY6B,EAAK,IAAI,CAAC,GAAG3B,CAAQ,GAAG8B,KAAK;AAC3F,QAAAL,EAAY,GAAGI,CAAC,MAAMC,CAAC,EAAE,IAAI;AAAA,EAGzC,CAAC,GACML;AACX;AAUO,SAASM,EAAaC,GAAMC,GAASC,GAAU;AAClD,SAAO,KAAK,IAAI,GAAGD,EAAQ,IAAI,CAACE,MAAWD,EAASF,GAAMG,CAAM,CAAC,CAAC;AACtE;AAUO,SAASC,EAAgBC,GAAQC,GAAUJ,GAAU;AACxD,MAAIK,IAAeF,EAAO,CAAC,GACvBG,IAAcN,EAASG,EAAO,CAAC,GAAGC,CAAQ;AAC9C,WAAS,IAAI,GAAG,IAAID,EAAO,QAAQ,KAAK;AACpC,UAAMxC,IAAQwC,EAAO,CAAC,GAChBI,IAAMP,EAASrC,GAAOyC,CAAQ;AACpC,IAAIG,IAAMD,MACND,IAAe1C,GACf2C,IAAcC;AAAA,EAEtB;AACA,SAAOF;AACX;AAQA,MAAMG,IAAe,CAAC7C,GAAO8C,GAAMC,GAAYrB,MAAY;AAEvD,MAAI,CAACoB;AACD,WAAO,CAAC9C,CAAK;AACjB,QAAM,EAAE,cAAAgD,GAAc,QAAArB,EAAM,IAAKD,GAC3BuB,IAAelB,EAAgBe,EAAK,gBAAe,GAAInB,CAAM,GAC7Da,IAAS,OAAO,KAAKQ,CAAY,EAAE,OAAO,CAACE,GAAKC,MAAiB;AACnE,QAAIJ,EAAW,SAASI,CAAY,GAAG;AACnC,YAAMC,IAAYJ,EAAaG,CAAY,GACrC,CAACE,GAAOC,CAAM,IAAIC,EAAYN,CAAY,GAC1CO,IAAa,CAACxD,EAAM,CAAC,IAAIoD,EAAU,QAAQC,GAAOrD,EAAM,CAAC,IAAIoD,EAAU,QAAQE,CAAM,GACrFG,IAAWC,EAAgBT,CAAY;AAC7C,eAASU,IAAI,GAAGA,IAAIF,EAAS,QAAQE,KAAK;AACtC,cAAMC,IAAaC,EAAqB,CAAC7D,GAAOwD,CAAU,GAAGC,EAASE,CAAC,CAAC;AACxE,QAAIC,KAAcE,EAAsBF,GAAYX,CAAY,KAC5DC,EAAI,KAAKU,CAAU;AAAA,MAE3B;AAAA,IACJ;AACA,WAAOV;AAAA,EACX,GAAG,CAAA,CAAE;AACL,SAAKa,EAAc/D,GAAOiD,CAAY,KAClCT,EAAO,KAAKxC,CAAK,GAEdwC,EAAO,IAAI,CAACxC,MAAUC,EAAYD,GAAO0B,EAAQ,QAAQ,CAAC;AACrE,GACMsC,KAAmB,CAAC/C,GAASE,GAAUC,GAAiB6C,GAAUC,GAAaC,GAAehE,MAAa;AAC7G,QAAMiE,IAAgB,CAAA;AAEtB,MAAIC,IAAY;AAAA,IACZF,EAAc,CAAC,MAAMF,EAAS,CAAC,IAAIA,EAAS,CAAC,IAAIhD,EAAQ,CAAC,IAAId;AAAA,IAC9DgE,EAAc,CAAC,MAAMF,EAAS,CAAC,IAAIA,EAAS,CAAC,IAAIhD,EAAQ,CAAC,IAAId;AAAA,EACtE;AACI,EAAAiE,EAAc,QAAQC,CAAS;AAC/B,MAAIC,IAAWrD,GACXsD,IAAmBpD,EAASpB,EAAMuE,CAAQ,CAAC;AAC/C,SAAOC,KAAkB;AACrB,UAAMC,IAAWD,GACXvE,IAAQsE;AAEd,IADwBtD,EAAmBwD,GAAUxE,GAAOmB,GAAUC,CAAe,MAEjFiD,IAAY;AAAA,MACRG,EAAS,CAAC,MAAMxE,EAAM,CAAC,IAAIqE,EAAU,CAAC,IAAIG,EAAS,CAAC,IAAIrE;AAAA,MACxDqE,EAAS,CAAC,MAAMxE,EAAM,CAAC,IAAIqE,EAAU,CAAC,IAAIG,EAAS,CAAC,IAAIrE;AAAA,IACxE,GACYiE,EAAc,QAAQC,CAAS,IAEnCE,IAAmBpD,EAASpB,EAAMyE,CAAQ,CAAC,GAC3CF,IAAWE;AAAA,EACf;AAEA,QAAMC,IAAkBP,EAAY,IAAI,CAAClE,MAAU,CAACA,EAAM,CAAC,IAAIG,GAAUH,EAAM,CAAC,IAAIG,CAAQ,CAAC,GACvFuE,IAAanC,EAAgBkC,GAAiBJ,GAAWvE,CAAiB;AAChF,SAAAsE,EAAc,QAAQM,CAAU,GACzBN;AACX;AASO,SAASO,GAAYC,GAAYC,GAAYpD,GAAOqD,GAAQ;AAC/D,QAAMJ,IAAaK,EAAUH,EAAW,UAAS,CAAE,GAC7CX,IAAWc,EAAUF,EAAW,UAAS,CAAE,GAC3CnD,IAAU,OAAO,OAAO7B,GAAYiF,CAAM,GAC1C,EAAE,UAAA3E,EAAQ,IAAKuB,GACfsD,IAAYtD,EAAQ,0BAA0BD,IAAQ,CAACmD,GAAYC,CAAU,GAC7EjD,IAAcJ,EAAewD,GAAWtD,CAAO,GAC/CN,IAAkBnB,EAAYyE,GAAYvE,CAAQ,GAClDgE,IAAgBlE,EAAYgE,GAAU9D,CAAQ,GAC9C+D,IAAcrB,EAAa6B,GAAYE,GAAYlD,EAAQ,iBAAiBA,CAAO,GACnFuD,IAAYpC,EAAaoB,GAAUY,GAAYnD,EAAQ,eAAeA,CAAO;AACnF,EAAAwC,EAAY,QAAQ,CAAClE,MAAU,OAAO4B,EAAY7B,EAAMC,CAAK,CAAC,CAAC,GAC/DiF,EAAU,QAAQ,CAACjF,MAAU,OAAO4B,EAAY7B,EAAMC,CAAK,CAAC,CAAC;AAC7D,QAAMkF,IAAW,CAAA,GACXC,IAAa,CAAA,GACbhE,IAAW,CAAA,GAEXiE,IAAS,CAAA,GAGTC,IAAS,CAAA,GACTC,IAAgB,IAAIC,GAAW;AACrC,WAAS5B,IAAI,GAAGA,IAAIO,EAAY,QAAQP,KAAK;AACzC,UAAM6B,IAAYtB,EAAYP,CAAC,GACzB8B,IAAM1F,EAAMyF,CAAS;AAC3B,IAAAN,EAASO,CAAG,IAAID,GAChBJ,EAAOK,CAAG,IAAI,GACdJ,EAAOI,CAAG,IAAIvD,EAAasD,GAAWP,GAAWvD,EAAQ,QAAQ,GAEjE4D,EAAc,IAAI;AAAA,MACd,IAAIG;AAAA,MACJ,OAAOJ,EAAOI,CAAG;AAAA,IAC7B,CAAS;AAAA,EACL;AACA,QAAMC,IAAgBT,EAAU,IAAI,CAACjF,MAAUD,EAAMC,CAAK,CAAC;AAC3D,MAAI2F,IAAcjE,EAAQ,cACtBT,GACA2E,IAAU;AACd,aAAW,CAACC,GAAIxF,CAAK,KAAK,OAAO,QAAQ6E,CAAQ;AAC7C,IAAIG,EAAOQ,CAAE,KAAKD,MACdA,IAAUP,EAAOQ,CAAE,GACnB5E,IAAUZ;AAGlB,SAAO,OAAO,KAAK6E,CAAQ,EAAE,SAAS,KAAKS,IAAc,KAAG;AACxD,UAAMG,IAAQR,EAAc,MAAM,EAAK;AACvC,QAAIQ;AACA,MAAA7E,IAAUiE,EAASY,CAAK;AAAA;AAGxB;AAEJ,UAAML,IAAM1F,EAAMkB,CAAO;AAEzB,QAAIyE,EAAc,SAASD,CAAG;AAC1B,aAAOzB,GAAiB/C,GAASE,GAAUC,GAAiB6C,GAAUC,GAAaC,GAAehE,CAAQ;AAG9G,WAAO+E,EAASO,CAAG,GACnBH,EAAc,OAAOG,CAAG,GACxBN,EAAWM,CAAG,IAAI;AAElB,eAAWM,KAAO,OAAO,OAAOrE,EAAQ,YAAY,GAAG;AACnD,YAAMR,IAAW8E,EAAI/E,GAAS,CAAC8E,EAAI,OAAOA,EAAI,KAAK,CAAC,GAC9CE,IAAalG,EAAMmB,CAAQ;AACjC,UAAIiE,EAAWc,CAAU;AACrB;AACJ,YAAMvF,IAAkBM,EAAmBC,GAASC,GAAUC,GAAUC,CAAe;AAGvF,UAFIV,IAAkBgB,EAAQ,6BAE1BE,EAAYqE,CAAU;AACtB;AAEJ,MAAKf,EAASe,CAAU,MACpBf,EAASe,CAAU,IAAI/E;AAE3B,YAAMgF,IAAqBxE,EAAQ,UAAUhB,CAAe,GACtDyF,IAAezE,EAAQ,SAAST,GAASC,CAAQ,KAAK,MAAMgF,CAAkB,IAAI/F,IAAW+F,IAC7FE,IAAgBhB,EAAOK,CAAG,IAAIU,GAC9BE,IAAiBjB,EAAOa,CAAU;AACxC,MAAII,KAAkBD,KAAiBC,MAEvClF,EAAS8E,CAAU,IAAIhF,GACvBmE,EAAOa,CAAU,IAAIG,GACrBf,EAAOY,CAAU,IAAIG,IAAgBlE,EAAahB,GAAU+D,GAAWvD,EAAQ,QAAQ,GACvF4D,EAAc,IAAI;AAAA,QACd,IAAIW;AAAA,QACJ,OAAOZ,EAAOY,CAAU;AAAA,MACxC,CAAa;AAAA,IACL;AACA,IAAAN,KAAe;AAAA,EACnB;AACA,SAAO,CAAA;AACX;AAMO,MAAMJ,GAAY;AAAA,EACrB,cAAc;AACV,SAAK,MAAM,CAAA,GACX,KAAK,MAAM,CAAA,GACX,KAAK,MAAM,CAAA,GACX,KAAK,MAAM,CAAA;AAAA,EACf;AAAA,EACA,UAAU1D,GAAMyE,GAAQ;AACpB,QAAIC,IAAM,GAAGC,IAAOF,IAAS;AAC7B,WAAOE,IAAOD,IAAM,KAAG;AACnB,YAAME,IAAM,KAAK,OAAOF,IAAMC,KAAQ,CAAC;AACvC,UAAI,KAAK,IAAIC,CAAG,EAAE,QAAQ5E,EAAK;AAC3B,QAAA2E,IAAOC;AAAA,eAEF,KAAK,IAAIA,CAAG,EAAE,QAAQ5E,EAAK;AAChC,QAAA0E,IAAME;AAAA,WAEL;AACD,aAAK,IAAI,OAAOA,GAAK,GAAG5E,CAAI,GAC5B,KAAK,IAAIA,EAAK,EAAE,IAAI;AACpB;AAAA,MACJ;AAAA,IACJ;AACA,SAAK,IAAI,OAAO2E,GAAM,GAAG3E,CAAI,GAC7B,KAAK,IAAIA,EAAK,EAAE,IAAI;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,IAAIA,GAAM;AAGN,WAAO,KAAK,IAAIA,EAAK,EAAE;AACvB,UAAMyE,IAAS,KAAK,IAAI;AAGxB,QAAI,CAACA,KAAU,KAAK,IAAIA,IAAS,CAAC,EAAE,QAAQzE,EAAK,OAAO;AACpD,WAAK,IAAI,KAAKA,CAAI,GAClB,KAAK,IAAIA,EAAK,EAAE,IAAI;AACpB;AAAA,IACJ;AAGA,SAAK,UAAUA,GAAMyE,CAAM;AAAA,EAC/B;AAAA,EACA,OAAOT,GAAI;AACP,IAAK,KAAK,IAAIA,CAAE,KAEhB,OAAO,KAAK,IAAIA,CAAE;AAAA,EACtB;AAAA,EACA,oBAAoB;AAChB,QAAI3C;AACJ,aAASS,IAAI,KAAK,IAAI,SAAS,GAAGA,KAAK,GAAGA;AACtC,MAAI,KAAK,IAAI,KAAK,IAAIA,CAAC,EAAE,EAAE,IACvBT,IAAM,KAAK,IAAIS,CAAC,EAAE,KAElB,KAAK,IAAI,OAAOA,GAAG,CAAC;AAE5B,WAAOT;AAAA,EACX;AAAA,EACA,eAAe;AACX,WAAO,KAAK,IAAI,UAAQ;AACpB,YAAMwD,IAAQ,KAAK,IAAI,MAAK;AAC5B,UAAI,KAAK,IAAIA,EAAM,EAAE;AACjB,eAAOA,EAAM;AAAA,IACrB;AAAA,EACJ;AAAA,EACA,MAAMC,GAAO;AACT,WAAIA,IACO,KAAK,kBAAiB,IAGtB,KAAK,aAAY;AAAA,EAEhC;AACJ;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,23 @@
+const i = (s, c, a) => {
+  const [t, r] = c, [o, n] = a;
+  if (r === t)
+    return o;
+  const d = (s - t) / (r - t);
+  return o + d * (n - o);
+}, u = (s, c, a) => {
+  const [t, r] = c, [o, n] = a, d = Math.log(s - t + 1) / Math.log(r - t + 1);
+  return o + d * (n - o);
+}, h = (s, c, a, t = 2) => {
+  const [r, o] = c, [n, d] = a, e = Math.pow((s - r) / (o - r), t);
+  return n + e * (d - n);
+}, l = (s, c, a) => {
+  const [t, r] = c, [o, n] = a, d = Math.sqrt((s - t) / (r - t));
+  return o + d * (n - o);
+};
+export {
+  i as linear,
+  u as log,
+  h as pow,
+  l as sqrt
+};
+//# sourceMappingURL=scale.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"scale.js","sources":["../../../../../../node_modules/@antv/g6/esm/utils/scale.js"],"sourcesContent":["/**\n * <zh/> 将一个值从一个范围线性映射到另一个范围\n *\n * <en/> Linearly maps a value from one range to another range\n * @param value - <zh/> 需要映射的值 | <en/> The value to be mapped\n * @param domain - <zh/> 输入值的范围 [最小值, 最大值] | <en/> The input range [min, max]\n * @param range - <zh/> 输出值的范围 [最小值, 最大值] | <en/> The output range [min, max]\n * @returns <zh/> 映射后的值 | <en/> The mapped value\n */\nexport const linear = (value, domain, range) => {\n    const [d0, d1] = domain;\n    const [r0, r1] = range;\n    if (d1 === d0)\n        return r0;\n    const ratio = (value - d0) / (d1 - d0);\n    return r0 + ratio * (r1 - r0);\n};\n/**\n * <zh/> 将一个值从一个范围对数映射到另一个范围\n *\n * <en/> Logarithmically maps a value from one range to another range\n * @param value - <zh/> 需要映射的值 | <en/> The value to be mapped\n * @param domain - <zh/> 输入值的范围 [最小值, 最大值] | <en/> The input range [min, max]\n * @param range - <zh/> 输出值的范围 [最小值, 最大值] | <en/> The output range [min, max]\n * @returns <zh/> 映射后的值 | <en/> The mapped value\n */\nexport const log = (value, domain, range) => {\n    const [d0, d1] = domain;\n    const [r0, r1] = range;\n    const ratio = Math.log(value - d0 + 1) / Math.log(d1 - d0 + 1);\n    return r0 + ratio * (r1 - r0);\n};\n/**\n * <zh/> 将一个值从一个范围幂映射到另一个范围\n *\n * <en/> Maps a value from one range to another range\n * @param value - <zh/> 需要映射的值 | <en/> The value to be mapped\n * @param domain - <zh/> 输入值的范围 [最小值, 最大值] | <en/> The input range [min, max]\n * @param range - <zh/> 输出值的范围 [最小值, 最大值] | <en/> The output range [min, max]\n * @param exponent - <zh/> 幂指数 | <en/> The exponent\n * @returns <zh/> 映射后的值 | <en/> The mapped value\n */\nexport const pow = (value, domain, range, exponent = 2) => {\n    const [d0, d1] = domain;\n    const [r0, r1] = range;\n    const ratio = Math.pow((value - d0) / (d1 - d0), exponent);\n    return r0 + ratio * (r1 - r0);\n};\n/**\n * <zh/> 将一个值从一个范围平方根映射到另一个范围\n *\n * <en/> Maps a value from one range to another range using square root\n * @param value - <zh/> 需要映射的值 | <en/> The value to be mapped\n * @param domain - <zh/> 输入值的范围 [最小值, 最大值] | <en/> The input range [min, max]\n * @param range - <zh/> 输出值的范围 [最小值, 最大值] | <en/> The output range [min, max]\n * @returns <zh/> 映射后的值 | <en/> The mapped value\n */\nexport const sqrt = (value, domain, range) => {\n    const [d0, d1] = domain;\n    const [r0, r1] = range;\n    const ratio = Math.sqrt((value - d0) / (d1 - d0));\n    return r0 + ratio * (r1 - r0);\n};\n//# sourceMappingURL=scale.js.map"],"names":["linear","value","domain","range","d0","d1","r0","r1","ratio","log","pow","exponent","sqrt"],"mappings":"AASY,MAACA,IAAS,CAACC,GAAOC,GAAQC,MAAU;AAC5C,QAAM,CAACC,GAAIC,CAAE,IAAIH,GACX,CAACI,GAAIC,CAAE,IAAIJ;AACjB,MAAIE,MAAOD;AACP,WAAOE;AACX,QAAME,KAASP,IAAQG,MAAOC,IAAKD;AACnC,SAAOE,IAAKE,KAASD,IAAKD;AAC9B,GAUaG,IAAM,CAACR,GAAOC,GAAQC,MAAU;AACzC,QAAM,CAACC,GAAIC,CAAE,IAAIH,GACX,CAACI,GAAIC,CAAE,IAAIJ,GACXK,IAAQ,KAAK,IAAIP,IAAQG,IAAK,CAAC,IAAI,KAAK,IAAIC,IAAKD,IAAK,CAAC;AAC7D,SAAOE,IAAKE,KAASD,IAAKD;AAC9B,GAWaI,IAAM,CAACT,GAAOC,GAAQC,GAAOQ,IAAW,MAAM;AACvD,QAAM,CAACP,GAAIC,CAAE,IAAIH,GACX,CAACI,GAAIC,CAAE,IAAIJ,GACXK,IAAQ,KAAK,KAAKP,IAAQG,MAAOC,IAAKD,IAAKO,CAAQ;AACzD,SAAOL,IAAKE,KAASD,IAAKD;AAC9B,GAUaM,IAAO,CAACX,GAAOC,GAAQC,MAAU;AAC1C,QAAM,CAACC,GAAIC,CAAE,IAAIH,GACX,CAACI,GAAIC,CAAE,IAAIJ,GACXK,IAAQ,KAAK,MAAMP,IAAQG,MAAOC,IAAKD,EAAG;AAChD,SAAOE,IAAKE,KAASD,IAAKD;AAC9B;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,20 @@
+function c(r) {
+  const n = [], e = (t) => {
+    t != null && t.children.length && t.children.forEach((o) => {
+      n.push(o), e(o);
+    });
+  };
+  return e(r), n;
+}
+function s(r) {
+  const n = [];
+  let e = r.parentNode;
+  for (; e; )
+    n.push(e), e = e.parentNode;
+  return n;
+}
+export {
+  s as getAncestorShapes,
+  c as getDescendantShapes
+};
+//# sourceMappingURL=shape.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"shape.js","sources":["../../../../../../node_modules/@antv/g6/esm/utils/shape.js"],"sourcesContent":["/**\n * <zh/> 获取图形的所有子元素\n *\n * <en/> Get all the child elements of the shape\n * @param shape - <zh/> 图形元素 | <en/> shape\n * @returns <zh/> 子元素数组 | <en/> child elements array\n */\nexport function getDescendantShapes(shape) {\n    const succeeds = [];\n    // 遍历所有子元素，并将子元素的子元素加入到数组中\n    const traverse = (shape) => {\n        if (shape === null || shape === void 0 ? void 0 : shape.children.length) {\n            shape.children.forEach((child) => {\n                succeeds.push(child);\n                traverse(child);\n            });\n        }\n    };\n    traverse(shape);\n    return succeeds;\n}\n/**\n * <zh/> 获取图形的所有祖先元素\n *\n * <en/> Get all the ancestor elements of the shape\n * @param shape - <zh/> 图形元素 | <en/> shape\n * @returns <zh/> 祖先元素数组 | <en/> ancestor elements array\n */\nexport function getAncestorShapes(shape) {\n    const ancestors = [];\n    let currentNode = shape.parentNode;\n    while (currentNode) {\n        ancestors.push(currentNode);\n        currentNode = currentNode.parentNode;\n    }\n    return ancestors;\n}\n//# sourceMappingURL=shape.js.map"],"names":["getDescendantShapes","shape","succeeds","traverse","child","getAncestorShapes","ancestors","currentNode"],"mappings":"AAOO,SAASA,EAAoBC,GAAO;AACvC,QAAMC,IAAW,CAAA,GAEXC,IAAW,CAACF,MAAU;AACxB,IAAIA,KAAU,QAAoCA,EAAM,SAAS,UAC7DA,EAAM,SAAS,QAAQ,CAACG,MAAU;AAC9B,MAAAF,EAAS,KAAKE,CAAK,GACnBD,EAASC,CAAK;AAAA,IAClB,CAAC;AAAA,EAET;AACA,SAAAD,EAASF,CAAK,GACPC;AACX;AAQO,SAASG,EAAkBJ,GAAO;AACrC,QAAMK,IAAY,CAAA;AAClB,MAAIC,IAAcN,EAAM;AACxB,SAAOM;AACH,IAAAD,EAAU,KAAKC,CAAW,GAC1BA,IAAcA,EAAY;AAE9B,SAAOD;AACX;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,91 @@
+import "../constants/change.js";
+import "../constants/events/animation.js";
+import "../constants/events/canvas.js";
+import "../constants/events/combo.js";
+import { CommonEvent as o } from "../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 "../constants/registry.js";
+import { PinchHandler as l } from "./pinch.js";
+import s from "../../../util/esm/lodash/is-equal.js";
+import c from "../../../util/esm/lodash/is-string.js";
+const m = /* @__PURE__ */ new Set(["Control", "Alt", "Meta", "Shift"]);
+function h(r) {
+  return m.has(r);
+}
+const d = (r) => r.map((t) => c(t) ? t.toLocaleLowerCase() : t);
+class P {
+  constructor(t) {
+    this.map = /* @__PURE__ */ new Map(), this.boundHandlePinch = () => {
+    }, this.recordKey = /* @__PURE__ */ new Set(), this.onKeyDown = (i) => {
+      i != null && i.key && (this.recordKey.add(i.key), this.trigger(i));
+    }, this.onKeyUp = (i) => {
+      i != null && i.key && this.recordKey.delete(i.key);
+    }, this.onKeyDownWindow = (i) => {
+      h(i.key) && this.recordKey.add(i.key);
+    }, this.onKeyUpWindow = (i) => {
+      h(i.key) && this.recordKey.delete(i.key);
+    }, this.onWheel = (i) => {
+      this.triggerExtendKey(o.WHEEL, i);
+    }, this.onDrag = (i) => {
+      this.triggerExtendKey(o.DRAG, i);
+    }, this.handlePinch = (i, e) => {
+      this.triggerExtendKey(o.PINCH, Object.assign(Object.assign({}, i), e));
+    }, this.onFocus = () => {
+      this.recordKey.clear();
+    }, this.emitter = t, this.bindEvents();
+  }
+  bind(t, i) {
+    t.length !== 0 && (t.includes(o.PINCH) && !this.pinchHandler && (this.boundHandlePinch = this.handlePinch.bind(this), this.pinchHandler = new l(this.emitter, "pinchmove", this.boundHandlePinch)), this.map.set(t, i));
+  }
+  unbind(t, i) {
+    this.map.forEach((e, n) => {
+      s(n, t) && (!i || i === e) && this.map.delete(n);
+    });
+  }
+  unbindAll() {
+    this.map.clear();
+  }
+  /**
+   * Check whether the given keys are being held down currently.
+   * @param key - array of keys to check
+   * @returns true if the given keys are being held down, false otherwise.
+   */
+  match(t) {
+    const i = d(Array.from(this.recordKey)).sort(), e = d(t).sort();
+    return s(i, e);
+  }
+  bindEvents() {
+    var t;
+    const { emitter: i } = this;
+    window.addEventListener(o.KEY_DOWN, this.onKeyDownWindow), window.addEventListener(o.KEY_UP, this.onKeyUpWindow), i.on(o.KEY_DOWN, this.onKeyDown), i.on(o.KEY_UP, this.onKeyUp), i.on(o.WHEEL, this.onWheel), i.on(o.DRAG, this.onDrag), (t = globalThis.addEventListener) === null || t === void 0 || t.call(globalThis, "focus", this.onFocus);
+  }
+  trigger(t) {
+    this.map.forEach((i, e) => {
+      this.match(e) && i(t);
+    });
+  }
+  /**
+   * <zh/> 扩展 wheel, drag 操作
+   *
+   * <en/> Extend wheel, drag operations
+   * @param eventType - event name
+   * @param event - event
+   */
+  triggerExtendKey(t, i) {
+    this.map.forEach((e, n) => {
+      n.includes(t) && s(Array.from(this.recordKey), n.filter((a) => a !== t)) && e(i);
+    });
+  }
+  destroy() {
+    var t, i;
+    this.unbindAll(), this.emitter.off(o.KEY_DOWN, this.onKeyDown), this.emitter.off(o.KEY_UP, this.onKeyUp), window.removeEventListener(o.KEY_DOWN, this.onKeyDownWindow), window.removeEventListener(o.KEY_UP, this.onKeyUpWindow), this.emitter.off(o.WHEEL, this.onWheel), this.emitter.off(o.DRAG, this.onDrag), (t = this.pinchHandler) === null || t === void 0 || t.off("pinchmove", this.boundHandlePinch), (i = globalThis.removeEventListener) === null || i === void 0 || i.call(globalThis, "focus", this.onFocus);
+  }
+}
+export {
+  P as Shortcut
+};
+//# sourceMappingURL=shortcut.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"shortcut.js","sources":["../../../../../../node_modules/@antv/g6/esm/utils/shortcut.js"],"sourcesContent":["import { isEqual, isString } from '@antv/util';\nimport { CommonEvent } from '../constants';\nimport { PinchHandler } from './pinch';\nconst MODIFIER_KEYS = new Set(['Control', 'Alt', 'Meta', 'Shift']);\nfunction isModifierKey(key) {\n    return MODIFIER_KEYS.has(key);\n}\nconst lowerCaseKeys = (keys) => keys.map((key) => (isString(key) ? key.toLocaleLowerCase() : key));\nexport class Shortcut {\n    constructor(emitter) {\n        this.map = new Map();\n        this.boundHandlePinch = () => { };\n        this.recordKey = new Set();\n        this.onKeyDown = (event) => {\n            if (!(event === null || event === void 0 ? void 0 : event.key))\n                return;\n            this.recordKey.add(event.key);\n            this.trigger(event);\n        };\n        this.onKeyUp = (event) => {\n            if (!(event === null || event === void 0 ? void 0 : event.key))\n                return;\n            this.recordKey.delete(event.key);\n        };\n        this.onKeyDownWindow = (event) => {\n            if (!isModifierKey(event.key))\n                return;\n            this.recordKey.add(event.key);\n        };\n        this.onKeyUpWindow = (event) => {\n            if (!isModifierKey(event.key))\n                return;\n            this.recordKey.delete(event.key);\n        };\n        this.onWheel = (event) => {\n            this.triggerExtendKey(CommonEvent.WHEEL, event);\n        };\n        this.onDrag = (event) => {\n            this.triggerExtendKey(CommonEvent.DRAG, event);\n        };\n        this.handlePinch = (event, options) => {\n            this.triggerExtendKey(CommonEvent.PINCH, Object.assign(Object.assign({}, event), options));\n        };\n        this.onFocus = () => {\n            this.recordKey.clear();\n        };\n        this.emitter = emitter;\n        this.bindEvents();\n    }\n    bind(key, handler) {\n        if (key.length === 0)\n            return;\n        if (key.includes(CommonEvent.PINCH) && !this.pinchHandler) {\n            this.boundHandlePinch = this.handlePinch.bind(this);\n            this.pinchHandler = new PinchHandler(this.emitter, 'pinchmove', this.boundHandlePinch);\n        }\n        this.map.set(key, handler);\n    }\n    unbind(key, handler) {\n        this.map.forEach((h, k) => {\n            if (isEqual(k, key)) {\n                if (!handler || handler === h)\n                    this.map.delete(k);\n            }\n        });\n    }\n    unbindAll() {\n        this.map.clear();\n    }\n    /**\n     * Check whether the given keys are being held down currently.\n     * @param key - array of keys to check\n     * @returns true if the given keys are being held down, false otherwise.\n     */\n    match(key) {\n        // 排序\n        const recordKeyList = lowerCaseKeys(Array.from(this.recordKey)).sort();\n        const keyList = lowerCaseKeys(key).sort();\n        return isEqual(recordKeyList, keyList);\n    }\n    bindEvents() {\n        var _a;\n        const { emitter } = this;\n        // These window listeners are added purely to listen to modifier keys at the window level,\n        // and the key presses are only recorded into this.recordKey for the purpose of matching\n        // in the match() function. This allows just these keypresses alone to be registered\n        // before the canvas is focused, which prevents a problem where when shortcuts involving\n        // a modifier and clicking on the canvas are bound, match() will return false for that\n        // modifier key because the canvas has not been clicked (and therefore focused) yet.\n        window.addEventListener(CommonEvent.KEY_DOWN, this.onKeyDownWindow);\n        window.addEventListener(CommonEvent.KEY_UP, this.onKeyUpWindow);\n        emitter.on(CommonEvent.KEY_DOWN, this.onKeyDown);\n        emitter.on(CommonEvent.KEY_UP, this.onKeyUp);\n        emitter.on(CommonEvent.WHEEL, this.onWheel);\n        emitter.on(CommonEvent.DRAG, this.onDrag);\n        // 窗口重新获得焦点后清空按键，避免按键状态异常\n        // Clear the keys when the window regains focus to avoid abnormal key states\n        (_a = globalThis.addEventListener) === null || _a === void 0 ? void 0 : _a.call(globalThis, 'focus', this.onFocus);\n    }\n    trigger(event) {\n        this.map.forEach((handler, key) => {\n            if (this.match(key))\n                handler(event);\n        });\n    }\n    /**\n     * <zh/> 扩展 wheel, drag 操作\n     *\n     * <en/> Extend wheel, drag operations\n     * @param eventType - event name\n     * @param event - event\n     */\n    triggerExtendKey(eventType, event) {\n        this.map.forEach((handler, key) => {\n            if (key.includes(eventType)) {\n                if (isEqual(Array.from(this.recordKey), key.filter((k) => k !== eventType))) {\n                    handler(event);\n                }\n            }\n        });\n    }\n    destroy() {\n        var _a, _b;\n        this.unbindAll();\n        this.emitter.off(CommonEvent.KEY_DOWN, this.onKeyDown);\n        this.emitter.off(CommonEvent.KEY_UP, this.onKeyUp);\n        window.removeEventListener(CommonEvent.KEY_DOWN, this.onKeyDownWindow);\n        window.removeEventListener(CommonEvent.KEY_UP, this.onKeyUpWindow);\n        this.emitter.off(CommonEvent.WHEEL, this.onWheel);\n        this.emitter.off(CommonEvent.DRAG, this.onDrag);\n        (_a = this.pinchHandler) === null || _a === void 0 ? void 0 : _a.off('pinchmove', this.boundHandlePinch);\n        (_b = globalThis.removeEventListener) === null || _b === void 0 ? void 0 : _b.call(globalThis, 'focus', this.onFocus);\n    }\n}\n//# sourceMappingURL=shortcut.js.map"],"names":["MODIFIER_KEYS","isModifierKey","key","lowerCaseKeys","keys","isString","Shortcut","emitter","event","CommonEvent","options","handler","PinchHandler","h","k","isEqual","recordKeyList","keyList","_a","eventType","_b"],"mappings":";;;;;;;;;;;;;;AAGA,MAAMA,IAAgB,oBAAI,IAAI,CAAC,WAAW,OAAO,QAAQ,OAAO,CAAC;AACjE,SAASC,EAAcC,GAAK;AACxB,SAAOF,EAAc,IAAIE,CAAG;AAChC;AACA,MAAMC,IAAgB,CAACC,MAASA,EAAK,IAAI,CAACF,MAASG,EAASH,CAAG,IAAIA,EAAI,kBAAiB,IAAKA,CAAI;AAC1F,MAAMI,EAAS;AAAA,EAClB,YAAYC,GAAS;AACjB,SAAK,MAAM,oBAAI,IAAG,GAClB,KAAK,mBAAmB,MAAM;AAAA,IAAE,GAChC,KAAK,YAAY,oBAAI,IAAG,GACxB,KAAK,YAAY,CAACC,MAAU;AACxB,MAAMA,KAAU,QAAoCA,EAAM,QAE1D,KAAK,UAAU,IAAIA,EAAM,GAAG,GAC5B,KAAK,QAAQA,CAAK;AAAA,IACtB,GACA,KAAK,UAAU,CAACA,MAAU;AACtB,MAAMA,KAAU,QAAoCA,EAAM,OAE1D,KAAK,UAAU,OAAOA,EAAM,GAAG;AAAA,IACnC,GACA,KAAK,kBAAkB,CAACA,MAAU;AAC9B,MAAKP,EAAcO,EAAM,GAAG,KAE5B,KAAK,UAAU,IAAIA,EAAM,GAAG;AAAA,IAChC,GACA,KAAK,gBAAgB,CAACA,MAAU;AAC5B,MAAKP,EAAcO,EAAM,GAAG,KAE5B,KAAK,UAAU,OAAOA,EAAM,GAAG;AAAA,IACnC,GACA,KAAK,UAAU,CAACA,MAAU;AACtB,WAAK,iBAAiBC,EAAY,OAAOD,CAAK;AAAA,IAClD,GACA,KAAK,SAAS,CAACA,MAAU;AACrB,WAAK,iBAAiBC,EAAY,MAAMD,CAAK;AAAA,IACjD,GACA,KAAK,cAAc,CAACA,GAAOE,MAAY;AACnC,WAAK,iBAAiBD,EAAY,OAAO,OAAO,OAAO,OAAO,OAAO,CAAA,GAAID,CAAK,GAAGE,CAAO,CAAC;AAAA,IAC7F,GACA,KAAK,UAAU,MAAM;AACjB,WAAK,UAAU,MAAK;AAAA,IACxB,GACA,KAAK,UAAUH,GACf,KAAK,WAAU;AAAA,EACnB;AAAA,EACA,KAAKL,GAAKS,GAAS;AACf,IAAIT,EAAI,WAAW,MAEfA,EAAI,SAASO,EAAY,KAAK,KAAK,CAAC,KAAK,iBACzC,KAAK,mBAAmB,KAAK,YAAY,KAAK,IAAI,GAClD,KAAK,eAAe,IAAIG,EAAa,KAAK,SAAS,aAAa,KAAK,gBAAgB,IAEzF,KAAK,IAAI,IAAIV,GAAKS,CAAO;AAAA,EAC7B;AAAA,EACA,OAAOT,GAAKS,GAAS;AACjB,SAAK,IAAI,QAAQ,CAACE,GAAGC,MAAM;AACvB,MAAIC,EAAQD,GAAGZ,CAAG,MACV,CAACS,KAAWA,MAAYE,MACxB,KAAK,IAAI,OAAOC,CAAC;AAAA,IAE7B,CAAC;AAAA,EACL;AAAA,EACA,YAAY;AACR,SAAK,IAAI,MAAK;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAMZ,GAAK;AAEP,UAAMc,IAAgBb,EAAc,MAAM,KAAK,KAAK,SAAS,CAAC,EAAE,KAAI,GAC9Dc,IAAUd,EAAcD,CAAG,EAAE,KAAI;AACvC,WAAOa,EAAQC,GAAeC,CAAO;AAAA,EACzC;AAAA,EACA,aAAa;AACT,QAAIC;AACJ,UAAM,EAAE,SAAAX,EAAO,IAAK;AAOpB,WAAO,iBAAiBE,EAAY,UAAU,KAAK,eAAe,GAClE,OAAO,iBAAiBA,EAAY,QAAQ,KAAK,aAAa,GAC9DF,EAAQ,GAAGE,EAAY,UAAU,KAAK,SAAS,GAC/CF,EAAQ,GAAGE,EAAY,QAAQ,KAAK,OAAO,GAC3CF,EAAQ,GAAGE,EAAY,OAAO,KAAK,OAAO,GAC1CF,EAAQ,GAAGE,EAAY,MAAM,KAAK,MAAM,IAGvCS,IAAK,WAAW,sBAAsB,QAAQA,MAAO,UAAkBA,EAAG,KAAK,YAAY,SAAS,KAAK,OAAO;AAAA,EACrH;AAAA,EACA,QAAQV,GAAO;AACX,SAAK,IAAI,QAAQ,CAACG,GAAST,MAAQ;AAC/B,MAAI,KAAK,MAAMA,CAAG,KACdS,EAAQH,CAAK;AAAA,IACrB,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,iBAAiBW,GAAWX,GAAO;AAC/B,SAAK,IAAI,QAAQ,CAACG,GAAST,MAAQ;AAC/B,MAAIA,EAAI,SAASiB,CAAS,KAClBJ,EAAQ,MAAM,KAAK,KAAK,SAAS,GAAGb,EAAI,OAAO,CAACY,MAAMA,MAAMK,CAAS,CAAC,KACtER,EAAQH,CAAK;AAAA,IAGzB,CAAC;AAAA,EACL;AAAA,EACA,UAAU;AACN,QAAIU,GAAIE;AACR,SAAK,UAAS,GACd,KAAK,QAAQ,IAAIX,EAAY,UAAU,KAAK,SAAS,GACrD,KAAK,QAAQ,IAAIA,EAAY,QAAQ,KAAK,OAAO,GACjD,OAAO,oBAAoBA,EAAY,UAAU,KAAK,eAAe,GACrE,OAAO,oBAAoBA,EAAY,QAAQ,KAAK,aAAa,GACjE,KAAK,QAAQ,IAAIA,EAAY,OAAO,KAAK,OAAO,GAChD,KAAK,QAAQ,IAAIA,EAAY,MAAM,KAAK,MAAM,IAC7CS,IAAK,KAAK,kBAAkB,QAAQA,MAAO,UAAkBA,EAAG,IAAI,aAAa,KAAK,gBAAgB,IACtGE,IAAK,WAAW,yBAAyB,QAAQA,MAAO,UAAkBA,EAAG,KAAK,YAAY,SAAS,KAAK,OAAO;AAAA,EACxH;AACJ;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,10 @@
+function u(r = 0) {
+  if (typeof r == "number")
+    return [r, r, r];
+  const [n, t = n, o = n] = r;
+  return [n, t, o];
+}
+export {
+  u as parseSize
+};
+//# sourceMappingURL=size.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"size.js","sources":["../../../../../../node_modules/@antv/g6/esm/utils/size.js"],"sourcesContent":["/**\n * <zh/> 解析尺寸配置\n *\n * <en/> Parse size configuration\n * @param size - <zh/> 尺寸配置 | <en/> size configuration\n * @returns <zh/> 标准尺寸格式 | <en/> standard size format\n */\nexport function parseSize(size = 0) {\n    if (typeof size === 'number')\n        return [size, size, size];\n    const [x, y = x, z = x] = size;\n    return [x, y, z];\n}\n//# sourceMappingURL=size.js.map"],"names":["parseSize","size","x","y","z"],"mappings":"AAOO,SAASA,EAAUC,IAAO,GAAG;AAChC,MAAI,OAAOA,KAAS;AAChB,WAAO,CAACA,GAAMA,GAAMA,CAAI;AAC5B,QAAM,CAACC,GAAGC,IAAID,GAAGE,IAAIF,CAAC,IAAID;AAC1B,SAAO,CAACC,GAAGC,GAAGC,CAAC;AACnB;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,7 @@
+function e(t) {
+  return t.states || [];
+}
+export {
+  e as statesOf
+};
+//# sourceMappingURL=state.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"state.js","sources":["../../../../../../node_modules/@antv/g6/esm/utils/state.js"],"sourcesContent":["/**\n * <zh/> 获取元素的状态\n *\n * <en/> Get the state of the element\n * @param datum - <zh/> 元素数据 <en/> Element data\n * @returns <zh/> 状态列表 <en/> State list\n */\nexport function statesOf(datum) {\n    return datum.states || [];\n}\n//# sourceMappingURL=state.js.map"],"names":["statesOf","datum"],"mappings":"AAOO,SAASA,EAASC,GAAO;AAC5B,SAAOA,EAAM,UAAU,CAAA;AAC3B;","x_google_ignoreList":[0]}