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

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

@@ -0,0 +1,292 @@
+import { getExpandedBBox, getBBoxSize, getBBoxSegments, isPointOnBBoxBoundary, isPointInBBox } from "../bbox.js";
+import { getLinesIntersection } from "../line.js";
+import { toVector2, manhattanDistance, add } from "../vector.js";
+import isNumber from "../../../../../../../@antv_util@3.3.11/node_modules/@antv/util/esm/lodash/is-number.js";
+const defaultCfg = {
+  enableObstacleAvoidance: false,
+  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: manhattanDistance
+};
+const keyOf = (point) => `${Math.round(point[0])}|||${Math.round(point[1])}`;
+function alignToGrid(p, gridSize) {
+  const align = (value) => Math.round(value / gridSize);
+  if (isNumber(p))
+    return align(p);
+  return p.map(align);
+}
+function getAngleDiff(angle1, angle2) {
+  const directionChange = Math.abs(angle1 - angle2);
+  return directionChange > Math.PI ? 2 * Math.PI - directionChange : directionChange;
+}
+function getDirectionAngle(p1, p2) {
+  const deltaX = p2[0] - p1[0];
+  const deltaY = p2[1] - p1[1];
+  if (!deltaX && !deltaY)
+    return 0;
+  return Math.atan2(deltaY, deltaX);
+}
+function getDirectionChange(current, neighbor, cameFrom, scaleStartPoint) {
+  const directionAngle = getDirectionAngle(current, neighbor);
+  const currentCameFrom = cameFrom[keyOf(current)];
+  const prev = !currentCameFrom ? scaleStartPoint : currentCameFrom;
+  const prevDirectionAngle = getDirectionAngle(prev, current);
+  return getAngleDiff(prevDirectionAngle, directionAngle);
+}
+const getObstacleMap = (nodes, options) => {
+  const { offset, gridSize } = options;
+  const obstacleMap = {};
+  nodes.forEach((item) => {
+    if (!item || item.destroyed || !item.isVisible())
+      return;
+    const bbox = getExpandedBBox(item.getRenderBounds(), offset);
+    for (let x = alignToGrid(bbox.min[0], gridSize); x <= alignToGrid(bbox.max[0], gridSize); x += 1) {
+      for (let y = alignToGrid(bbox.min[1], gridSize); y <= alignToGrid(bbox.max[1], gridSize); y += 1) {
+        obstacleMap[`${x}|||${y}`] = true;
+      }
+    }
+  });
+  return obstacleMap;
+};
+function estimateCost(from, anchors, distFunc) {
+  return Math.min(...anchors.map((anchor) => distFunc(from, anchor)));
+}
+function getNearestPoint(points, refPoint, distFunc) {
+  let nearestPoint = points[0];
+  let minDistance = distFunc(points[0], refPoint);
+  for (let i = 0; i < points.length; i++) {
+    const point = points[i];
+    const dis = distFunc(point, refPoint);
+    if (dis < minDistance) {
+      nearestPoint = point;
+      minDistance = dis;
+    }
+  }
+  return nearestPoint;
+}
+const getBoxPoints = (point, node, directions, options) => {
+  if (!node)
+    return [point];
+  const { directionMap, offset } = options;
+  const expandedBBox = getExpandedBBox(node.getRenderBounds(), offset);
+  const points = Object.keys(directionMap).reduce((res, directionKey) => {
+    if (directions.includes(directionKey)) {
+      const direction = directionMap[directionKey];
+      const [width, height] = getBBoxSize(expandedBBox);
+      const otherPoint = [point[0] + direction.stepX * width, point[1] + direction.stepY * height];
+      const segments = getBBoxSegments(expandedBBox);
+      for (let i = 0; i < segments.length; i++) {
+        const intersectP = getLinesIntersection([point, otherPoint], segments[i]);
+        if (intersectP && isPointOnBBoxBoundary(intersectP, expandedBBox)) {
+          res.push(intersectP);
+        }
+      }
+    }
+    return res;
+  }, []);
+  if (!isPointInBBox(point, expandedBBox)) {
+    points.push(point);
+  }
+  return points.map((point2) => alignToGrid(point2, options.gridSize));
+};
+const getControlPoints = (current, cameFrom, scaleStartPoint, endPoint, startPoints, scaleEndPoint, gridSize) => {
+  const controlPoints = [];
+  let pointZero = [
+    scaleEndPoint[0] === endPoint[0] ? endPoint[0] : current[0] * gridSize,
+    scaleEndPoint[1] === endPoint[1] ? endPoint[1] : current[1] * gridSize
+  ];
+  controlPoints.unshift(pointZero);
+  let _current = current;
+  let _currentCameFrom = cameFrom[keyOf(_current)];
+  while (_currentCameFrom) {
+    const prePoint = _currentCameFrom;
+    const point = _current;
+    const directionChange = getDirectionChange(prePoint, point, cameFrom, scaleStartPoint);
+    if (directionChange) {
+      pointZero = [
+        prePoint[0] === point[0] ? pointZero[0] : prePoint[0] * gridSize,
+        prePoint[1] === point[1] ? pointZero[1] : prePoint[1] * gridSize
+      ];
+      controlPoints.unshift(pointZero);
+    }
+    _currentCameFrom = cameFrom[keyOf(prePoint)];
+    _current = prePoint;
+  }
+  const realStartPoints = startPoints.map((point) => [point[0] * gridSize, point[1] * gridSize]);
+  const startPoint = getNearestPoint(realStartPoints, pointZero, manhattanDistance);
+  controlPoints.unshift(startPoint);
+  return controlPoints;
+};
+function aStarSearch(sourceNode, targetNode, nodes, config) {
+  const startPoint = toVector2(sourceNode.getCenter());
+  const endPoint = toVector2(targetNode.getCenter());
+  const options = Object.assign(defaultCfg, config);
+  const { gridSize } = options;
+  const obstacles = options.enableObstacleAvoidance ? nodes : [sourceNode, targetNode];
+  const obstacleMap = getObstacleMap(obstacles, options);
+  const scaleStartPoint = alignToGrid(startPoint, gridSize);
+  const scaleEndPoint = alignToGrid(endPoint, gridSize);
+  const startPoints = getBoxPoints(startPoint, sourceNode, options.startDirections, options);
+  const endPoints = getBoxPoints(endPoint, targetNode, options.endDirections, options);
+  startPoints.forEach((point) => delete obstacleMap[keyOf(point)]);
+  endPoints.forEach((point) => delete obstacleMap[keyOf(point)]);
+  const openList = {};
+  const closedList = {};
+  const cameFrom = {};
+  const gScore = {};
+  const fScore = {};
+  const sortedOpenSet = new SortedArray();
+  for (let i = 0; i < startPoints.length; i++) {
+    const firstStep = startPoints[i];
+    const key = keyOf(firstStep);
+    openList[key] = firstStep;
+    gScore[key] = 0;
+    fScore[key] = estimateCost(firstStep, endPoints, options.distFunc);
+    sortedOpenSet.add({
+      id: key,
+      value: fScore[key]
+    });
+  }
+  const endPointsKeys = endPoints.map((point) => keyOf(point));
+  let remainLoops = options.maximumLoops;
+  let current;
+  let curCost = Infinity;
+  for (const [id, value] of Object.entries(openList)) {
+    if (fScore[id] <= curCost) {
+      curCost = fScore[id];
+      current = value;
+    }
+  }
+  while (Object.keys(openList).length > 0 && remainLoops > 0) {
+    const minId = sortedOpenSet.minId(false);
+    if (minId) {
+      current = openList[minId];
+    } else {
+      break;
+    }
+    const key = keyOf(current);
+    if (endPointsKeys.includes(key)) {
+      return getControlPoints(current, cameFrom, scaleStartPoint, endPoint, startPoints, scaleEndPoint, gridSize);
+    }
+    delete openList[key];
+    sortedOpenSet.remove(key);
+    closedList[key] = true;
+    for (const dir of Object.values(options.directionMap)) {
+      const neighbor = add(current, [dir.stepX, dir.stepY]);
+      const neighborId = keyOf(neighbor);
+      if (closedList[neighborId])
+        continue;
+      const directionChange = getDirectionChange(current, neighbor, cameFrom, scaleStartPoint);
+      if (directionChange > options.maxAllowedDirectionChange)
+        continue;
+      if (obstacleMap[neighborId])
+        continue;
+      if (!openList[neighborId]) {
+        openList[neighborId] = neighbor;
+      }
+      const directionPenalties = options.penalties[directionChange];
+      const neighborCost = options.distFunc(current, neighbor) + (isNaN(directionPenalties) ? gridSize : directionPenalties);
+      const costFromStart = gScore[key] + neighborCost;
+      const neighborGScore = gScore[neighborId];
+      if (neighborGScore && costFromStart >= neighborGScore)
+        continue;
+      cameFrom[neighborId] = current;
+      gScore[neighborId] = costFromStart;
+      fScore[neighborId] = costFromStart + estimateCost(neighbor, endPoints, options.distFunc);
+      sortedOpenSet.add({
+        id: neighborId,
+        value: fScore[neighborId]
+      });
+    }
+    remainLoops -= 1;
+  }
+  return [];
+}
+class SortedArray {
+  constructor() {
+    this.arr = [];
+    this.map = {};
+    this.arr = [];
+    this.map = {};
+  }
+  _innerAdd(item, length) {
+    let low = 0, high = length - 1;
+    while (high - low > 1) {
+      const mid = Math.floor((low + high) / 2);
+      if (this.arr[mid].value > item.value) {
+        high = mid;
+      } else if (this.arr[mid].value < item.value) {
+        low = mid;
+      } else {
+        this.arr.splice(mid, 0, item);
+        this.map[item.id] = true;
+        return;
+      }
+    }
+    this.arr.splice(high, 0, item);
+    this.map[item.id] = true;
+  }
+  /**
+   * <zh/> 将新项添加到适当的索引位置
+   *
+   * <en/> Add the new item to the appropriate index
+   * @param item - <zh/> 新项 | <en/> new item
+   */
+  add(item) {
+    delete this.map[item.id];
+    const length = this.arr.length;
+    if (!length || this.arr[length - 1].value < item.value) {
+      this.arr.push(item);
+      this.map[item.id] = true;
+      return;
+    }
+    this._innerAdd(item, length);
+  }
+  remove(id) {
+    if (!this.map[id])
+      return;
+    delete this.map[id];
+  }
+  _clearAndGetMinId() {
+    let res;
+    for (let i = this.arr.length - 1; i >= 0; i--) {
+      if (this.map[this.arr[i].id])
+        res = this.arr[i].id;
+      else
+        this.arr.splice(i, 1);
+    }
+    return res;
+  }
+  _findFirstId() {
+    while (this.arr.length) {
+      const first = this.arr.shift();
+      if (this.map[first.id])
+        return first.id;
+    }
+  }
+  minId(clear) {
+    if (clear) {
+      return this._clearAndGetMinId();
+    } else {
+      return this._findFirstId();
+    }
+  }
+}
+export {
+  SortedArray,
+  aStarSearch,
+  estimateCost,
+  getNearestPoint
+};
+//# sourceMappingURL=shortest-path.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"shortest-path.js","sources":["../../../../../../../../../../../node_modules/.pnpm/@antv+g6@5.1.0/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":["point"],"mappings":";;;;AAIA,MAAM,aAAa;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,UAAU;AACd;AACA,MAAM,QAAQ,CAAC,UAAU,GAAG,KAAK,MAAM,MAAM,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,MAAM,CAAC,CAAC,CAAC;AAS1E,SAAS,YAAY,GAAG,UAAU;AAC9B,QAAM,QAAQ,CAAC,UAAU,KAAK,MAAM,QAAQ,QAAQ;AACpD,MAAI,SAAS,CAAC;AACV,WAAO,MAAM,CAAC;AAClB,SAAO,EAAE,IAAI,KAAK;AACtB;AASA,SAAS,aAAa,QAAQ,QAAQ;AAClC,QAAM,kBAAkB,KAAK,IAAI,SAAS,MAAM;AAChD,SAAO,kBAAkB,KAAK,KAAK,IAAI,KAAK,KAAK,kBAAkB;AACvE;AASA,SAAS,kBAAkB,IAAI,IAAI;AAC/B,QAAM,SAAS,GAAG,CAAC,IAAI,GAAG,CAAC;AAC3B,QAAM,SAAS,GAAG,CAAC,IAAI,GAAG,CAAC;AAC3B,MAAI,CAAC,UAAU,CAAC;AACZ,WAAO;AACX,SAAO,KAAK,MAAM,QAAQ,MAAM;AACpC;AAWA,SAAS,mBAAmB,SAAS,UAAU,UAAU,iBAAiB;AACtE,QAAM,iBAAiB,kBAAkB,SAAS,QAAQ;AAC1D,QAAM,kBAAkB,SAAS,MAAM,OAAO,CAAC;AAC/C,QAAM,OAAO,CAAC,kBAAkB,kBAAkB;AAClD,QAAM,qBAAqB,kBAAkB,MAAM,OAAO;AAC1D,SAAO,aAAa,oBAAoB,cAAc;AAC1D;AASA,MAAM,iBAAiB,CAAC,OAAO,YAAY;AACvC,QAAM,EAAE,QAAQ,SAAQ,IAAK;AAC7B,QAAM,cAAc,CAAA;AACpB,QAAM,QAAQ,CAAC,SAAS;AACpB,QAAI,CAAC,QAAQ,KAAK,aAAa,CAAC,KAAK,UAAS;AAC1C;AACJ,UAAM,OAAO,gBAAgB,KAAK,gBAAe,GAAI,MAAM;AAC3D,aAAS,IAAI,YAAY,KAAK,IAAI,CAAC,GAAG,QAAQ,GAAG,KAAK,YAAY,KAAK,IAAI,CAAC,GAAG,QAAQ,GAAG,KAAK,GAAG;AAC9F,eAAS,IAAI,YAAY,KAAK,IAAI,CAAC,GAAG,QAAQ,GAAG,KAAK,YAAY,KAAK,IAAI,CAAC,GAAG,QAAQ,GAAG,KAAK,GAAG;AAC9F,oBAAY,GAAG,CAAC,MAAM,CAAC,EAAE,IAAI;AAAA,MACjC;AAAA,IACJ;AAAA,EACJ,CAAC;AACD,SAAO;AACX;AAUO,SAAS,aAAa,MAAM,SAAS,UAAU;AAClD,SAAO,KAAK,IAAI,GAAG,QAAQ,IAAI,CAAC,WAAW,SAAS,MAAM,MAAM,CAAC,CAAC;AACtE;AAUO,SAAS,gBAAgB,QAAQ,UAAU,UAAU;AACxD,MAAI,eAAe,OAAO,CAAC;AAC3B,MAAI,cAAc,SAAS,OAAO,CAAC,GAAG,QAAQ;AAC9C,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACpC,UAAM,QAAQ,OAAO,CAAC;AACtB,UAAM,MAAM,SAAS,OAAO,QAAQ;AACpC,QAAI,MAAM,aAAa;AACnB,qBAAe;AACf,oBAAc;AAAA,IAClB;AAAA,EACJ;AACA,SAAO;AACX;AAQA,MAAM,eAAe,CAAC,OAAO,MAAM,YAAY,YAAY;AAEvD,MAAI,CAAC;AACD,WAAO,CAAC,KAAK;AACjB,QAAM,EAAE,cAAc,OAAM,IAAK;AACjC,QAAM,eAAe,gBAAgB,KAAK,gBAAe,GAAI,MAAM;AACnE,QAAM,SAAS,OAAO,KAAK,YAAY,EAAE,OAAO,CAAC,KAAK,iBAAiB;AACnE,QAAI,WAAW,SAAS,YAAY,GAAG;AACnC,YAAM,YAAY,aAAa,YAAY;AAC3C,YAAM,CAAC,OAAO,MAAM,IAAI,YAAY,YAAY;AAChD,YAAM,aAAa,CAAC,MAAM,CAAC,IAAI,UAAU,QAAQ,OAAO,MAAM,CAAC,IAAI,UAAU,QAAQ,MAAM;AAC3F,YAAM,WAAW,gBAAgB,YAAY;AAC7C,eAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACtC,cAAM,aAAa,qBAAqB,CAAC,OAAO,UAAU,GAAG,SAAS,CAAC,CAAC;AACxE,YAAI,cAAc,sBAAsB,YAAY,YAAY,GAAG;AAC/D,cAAI,KAAK,UAAU;AAAA,QACvB;AAAA,MACJ;AAAA,IACJ;AACA,WAAO;AAAA,EACX,GAAG,CAAA,CAAE;AACL,MAAI,CAAC,cAAc,OAAO,YAAY,GAAG;AACrC,WAAO,KAAK,KAAK;AAAA,EACrB;AACA,SAAO,OAAO,IAAI,CAACA,WAAU,YAAYA,QAAO,QAAQ,QAAQ,CAAC;AACrE;AACA,MAAM,mBAAmB,CAAC,SAAS,UAAU,iBAAiB,UAAU,aAAa,eAAe,aAAa;AAC7G,QAAM,gBAAgB,CAAA;AAEtB,MAAI,YAAY;AAAA,IACZ,cAAc,CAAC,MAAM,SAAS,CAAC,IAAI,SAAS,CAAC,IAAI,QAAQ,CAAC,IAAI;AAAA,IAC9D,cAAc,CAAC,MAAM,SAAS,CAAC,IAAI,SAAS,CAAC,IAAI,QAAQ,CAAC,IAAI;AAAA,EACtE;AACI,gBAAc,QAAQ,SAAS;AAC/B,MAAI,WAAW;AACf,MAAI,mBAAmB,SAAS,MAAM,QAAQ,CAAC;AAC/C,SAAO,kBAAkB;AACrB,UAAM,WAAW;AACjB,UAAM,QAAQ;AACd,UAAM,kBAAkB,mBAAmB,UAAU,OAAO,UAAU,eAAe;AACrF,QAAI,iBAAiB;AACjB,kBAAY;AAAA,QACR,SAAS,CAAC,MAAM,MAAM,CAAC,IAAI,UAAU,CAAC,IAAI,SAAS,CAAC,IAAI;AAAA,QACxD,SAAS,CAAC,MAAM,MAAM,CAAC,IAAI,UAAU,CAAC,IAAI,SAAS,CAAC,IAAI;AAAA,MACxE;AACY,oBAAc,QAAQ,SAAS;AAAA,IACnC;AACA,uBAAmB,SAAS,MAAM,QAAQ,CAAC;AAC3C,eAAW;AAAA,EACf;AAEA,QAAM,kBAAkB,YAAY,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,UAAU,MAAM,CAAC,IAAI,QAAQ,CAAC;AAC7F,QAAM,aAAa,gBAAgB,iBAAiB,WAAW,iBAAiB;AAChF,gBAAc,QAAQ,UAAU;AAChC,SAAO;AACX;AASO,SAAS,YAAY,YAAY,YAAY,OAAO,QAAQ;AAC/D,QAAM,aAAa,UAAU,WAAW,UAAS,CAAE;AACnD,QAAM,WAAW,UAAU,WAAW,UAAS,CAAE;AACjD,QAAM,UAAU,OAAO,OAAO,YAAY,MAAM;AAChD,QAAM,EAAE,SAAQ,IAAK;AACrB,QAAM,YAAY,QAAQ,0BAA0B,QAAQ,CAAC,YAAY,UAAU;AACnF,QAAM,cAAc,eAAe,WAAW,OAAO;AACrD,QAAM,kBAAkB,YAAY,YAAY,QAAQ;AACxD,QAAM,gBAAgB,YAAY,UAAU,QAAQ;AACpD,QAAM,cAAc,aAAa,YAAY,YAAY,QAAQ,iBAAiB,OAAO;AACzF,QAAM,YAAY,aAAa,UAAU,YAAY,QAAQ,eAAe,OAAO;AACnF,cAAY,QAAQ,CAAC,UAAU,OAAO,YAAY,MAAM,KAAK,CAAC,CAAC;AAC/D,YAAU,QAAQ,CAAC,UAAU,OAAO,YAAY,MAAM,KAAK,CAAC,CAAC;AAC7D,QAAM,WAAW,CAAA;AACjB,QAAM,aAAa,CAAA;AACnB,QAAM,WAAW,CAAA;AAEjB,QAAM,SAAS,CAAA;AAGf,QAAM,SAAS,CAAA;AACf,QAAM,gBAAgB,IAAI,YAAW;AACrC,WAAS,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;AACzC,UAAM,YAAY,YAAY,CAAC;AAC/B,UAAM,MAAM,MAAM,SAAS;AAC3B,aAAS,GAAG,IAAI;AAChB,WAAO,GAAG,IAAI;AACd,WAAO,GAAG,IAAI,aAAa,WAAW,WAAW,QAAQ,QAAQ;AAEjE,kBAAc,IAAI;AAAA,MACd,IAAI;AAAA,MACJ,OAAO,OAAO,GAAG;AAAA,IAC7B,CAAS;AAAA,EACL;AACA,QAAM,gBAAgB,UAAU,IAAI,CAAC,UAAU,MAAM,KAAK,CAAC;AAC3D,MAAI,cAAc,QAAQ;AAC1B,MAAI;AACJ,MAAI,UAAU;AACd,aAAW,CAAC,IAAI,KAAK,KAAK,OAAO,QAAQ,QAAQ,GAAG;AAChD,QAAI,OAAO,EAAE,KAAK,SAAS;AACvB,gBAAU,OAAO,EAAE;AACnB,gBAAU;AAAA,IACd;AAAA,EACJ;AACA,SAAO,OAAO,KAAK,QAAQ,EAAE,SAAS,KAAK,cAAc,GAAG;AACxD,UAAM,QAAQ,cAAc,MAAM,KAAK;AACvC,QAAI,OAAO;AACP,gBAAU,SAAS,KAAK;AAAA,IAC5B,OACK;AACD;AAAA,IACJ;AACA,UAAM,MAAM,MAAM,OAAO;AAEzB,QAAI,cAAc,SAAS,GAAG,GAAG;AAC7B,aAAO,iBAAiB,SAAS,UAAU,iBAAiB,UAAU,aAAa,eAAe,QAAQ;AAAA,IAC9G;AAEA,WAAO,SAAS,GAAG;AACnB,kBAAc,OAAO,GAAG;AACxB,eAAW,GAAG,IAAI;AAElB,eAAW,OAAO,OAAO,OAAO,QAAQ,YAAY,GAAG;AACnD,YAAM,WAAW,IAAI,SAAS,CAAC,IAAI,OAAO,IAAI,KAAK,CAAC;AACpD,YAAM,aAAa,MAAM,QAAQ;AACjC,UAAI,WAAW,UAAU;AACrB;AACJ,YAAM,kBAAkB,mBAAmB,SAAS,UAAU,UAAU,eAAe;AACvF,UAAI,kBAAkB,QAAQ;AAC1B;AACJ,UAAI,YAAY,UAAU;AACtB;AAEJ,UAAI,CAAC,SAAS,UAAU,GAAG;AACvB,iBAAS,UAAU,IAAI;AAAA,MAC3B;AACA,YAAM,qBAAqB,QAAQ,UAAU,eAAe;AAC5D,YAAM,eAAe,QAAQ,SAAS,SAAS,QAAQ,KAAK,MAAM,kBAAkB,IAAI,WAAW;AACnG,YAAM,gBAAgB,OAAO,GAAG,IAAI;AACpC,YAAM,iBAAiB,OAAO,UAAU;AACxC,UAAI,kBAAkB,iBAAiB;AACnC;AACJ,eAAS,UAAU,IAAI;AACvB,aAAO,UAAU,IAAI;AACrB,aAAO,UAAU,IAAI,gBAAgB,aAAa,UAAU,WAAW,QAAQ,QAAQ;AACvF,oBAAc,IAAI;AAAA,QACd,IAAI;AAAA,QACJ,OAAO,OAAO,UAAU;AAAA,MACxC,CAAa;AAAA,IACL;AACA,mBAAe;AAAA,EACnB;AACA,SAAO,CAAA;AACX;AAMO,MAAM,YAAY;AAAA,EACrB,cAAc;AACV,SAAK,MAAM,CAAA;AACX,SAAK,MAAM,CAAA;AACX,SAAK,MAAM,CAAA;AACX,SAAK,MAAM,CAAA;AAAA,EACf;AAAA,EACA,UAAU,MAAM,QAAQ;AACpB,QAAI,MAAM,GAAG,OAAO,SAAS;AAC7B,WAAO,OAAO,MAAM,GAAG;AACnB,YAAM,MAAM,KAAK,OAAO,MAAM,QAAQ,CAAC;AACvC,UAAI,KAAK,IAAI,GAAG,EAAE,QAAQ,KAAK,OAAO;AAClC,eAAO;AAAA,MACX,WACS,KAAK,IAAI,GAAG,EAAE,QAAQ,KAAK,OAAO;AACvC,cAAM;AAAA,MACV,OACK;AACD,aAAK,IAAI,OAAO,KAAK,GAAG,IAAI;AAC5B,aAAK,IAAI,KAAK,EAAE,IAAI;AACpB;AAAA,MACJ;AAAA,IACJ;AACA,SAAK,IAAI,OAAO,MAAM,GAAG,IAAI;AAC7B,SAAK,IAAI,KAAK,EAAE,IAAI;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,IAAI,MAAM;AAGN,WAAO,KAAK,IAAI,KAAK,EAAE;AACvB,UAAM,SAAS,KAAK,IAAI;AAGxB,QAAI,CAAC,UAAU,KAAK,IAAI,SAAS,CAAC,EAAE,QAAQ,KAAK,OAAO;AACpD,WAAK,IAAI,KAAK,IAAI;AAClB,WAAK,IAAI,KAAK,EAAE,IAAI;AACpB;AAAA,IACJ;AAGA,SAAK,UAAU,MAAM,MAAM;AAAA,EAC/B;AAAA,EACA,OAAO,IAAI;AACP,QAAI,CAAC,KAAK,IAAI,EAAE;AACZ;AACJ,WAAO,KAAK,IAAI,EAAE;AAAA,EACtB;AAAA,EACA,oBAAoB;AAChB,QAAI;AACJ,aAAS,IAAI,KAAK,IAAI,SAAS,GAAG,KAAK,GAAG,KAAK;AAC3C,UAAI,KAAK,IAAI,KAAK,IAAI,CAAC,EAAE,EAAE;AACvB,cAAM,KAAK,IAAI,CAAC,EAAE;AAAA;AAElB,aAAK,IAAI,OAAO,GAAG,CAAC;AAAA,IAC5B;AACA,WAAO;AAAA,EACX;AAAA,EACA,eAAe;AACX,WAAO,KAAK,IAAI,QAAQ;AACpB,YAAM,QAAQ,KAAK,IAAI,MAAK;AAC5B,UAAI,KAAK,IAAI,MAAM,EAAE;AACjB,eAAO,MAAM;AAAA,IACrB;AAAA,EACJ;AAAA,EACA,MAAM,OAAO;AACT,QAAI,OAAO;AACP,aAAO,KAAK,kBAAiB;AAAA,IACjC,OACK;AACD,aAAO,KAAK,aAAY;AAAA,IAC5B;AAAA,EACJ;AACJ;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,33 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const linear = (value, domain, range) => {
+  const [d0, d1] = domain;
+  const [r0, r1] = range;
+  if (d1 === d0)
+    return r0;
+  const ratio = (value - d0) / (d1 - d0);
+  return r0 + ratio * (r1 - r0);
+};
+const log = (value, domain, range) => {
+  const [d0, d1] = domain;
+  const [r0, r1] = range;
+  const ratio = Math.log(value - d0 + 1) / Math.log(d1 - d0 + 1);
+  return r0 + ratio * (r1 - r0);
+};
+const pow = (value, domain, range, exponent = 2) => {
+  const [d0, d1] = domain;
+  const [r0, r1] = range;
+  const ratio = Math.pow((value - d0) / (d1 - d0), exponent);
+  return r0 + ratio * (r1 - r0);
+};
+const sqrt = (value, domain, range) => {
+  const [d0, d1] = domain;
+  const [r0, r1] = range;
+  const ratio = Math.sqrt((value - d0) / (d1 - d0));
+  return r0 + ratio * (r1 - r0);
+};
+exports.linear = linear;
+exports.log = log;
+exports.pow = pow;
+exports.sqrt = sqrt;
+//# sourceMappingURL=scale.cjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"scale.cjs","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+g6@5.1.0/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":[],"mappings":";;AASY,MAAC,SAAS,CAAC,OAAO,QAAQ,UAAU;AAC5C,QAAM,CAAC,IAAI,EAAE,IAAI;AACjB,QAAM,CAAC,IAAI,EAAE,IAAI;AACjB,MAAI,OAAO;AACP,WAAO;AACX,QAAM,SAAS,QAAQ,OAAO,KAAK;AACnC,SAAO,KAAK,SAAS,KAAK;AAC9B;AAUY,MAAC,MAAM,CAAC,OAAO,QAAQ,UAAU;AACzC,QAAM,CAAC,IAAI,EAAE,IAAI;AACjB,QAAM,CAAC,IAAI,EAAE,IAAI;AACjB,QAAM,QAAQ,KAAK,IAAI,QAAQ,KAAK,CAAC,IAAI,KAAK,IAAI,KAAK,KAAK,CAAC;AAC7D,SAAO,KAAK,SAAS,KAAK;AAC9B;AAWY,MAAC,MAAM,CAAC,OAAO,QAAQ,OAAO,WAAW,MAAM;AACvD,QAAM,CAAC,IAAI,EAAE,IAAI;AACjB,QAAM,CAAC,IAAI,EAAE,IAAI;AACjB,QAAM,QAAQ,KAAK,KAAK,QAAQ,OAAO,KAAK,KAAK,QAAQ;AACzD,SAAO,KAAK,SAAS,KAAK;AAC9B;AAUY,MAAC,OAAO,CAAC,OAAO,QAAQ,UAAU;AAC1C,QAAM,CAAC,IAAI,EAAE,IAAI;AACjB,QAAM,CAAC,IAAI,EAAE,IAAI;AACjB,QAAM,QAAQ,KAAK,MAAM,QAAQ,OAAO,KAAK,GAAG;AAChD,SAAO,KAAK,SAAS,KAAK;AAC9B;;;;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,33 @@
+const linear = (value, domain, range) => {
+  const [d0, d1] = domain;
+  const [r0, r1] = range;
+  if (d1 === d0)
+    return r0;
+  const ratio = (value - d0) / (d1 - d0);
+  return r0 + ratio * (r1 - r0);
+};
+const log = (value, domain, range) => {
+  const [d0, d1] = domain;
+  const [r0, r1] = range;
+  const ratio = Math.log(value - d0 + 1) / Math.log(d1 - d0 + 1);
+  return r0 + ratio * (r1 - r0);
+};
+const pow = (value, domain, range, exponent = 2) => {
+  const [d0, d1] = domain;
+  const [r0, r1] = range;
+  const ratio = Math.pow((value - d0) / (d1 - d0), exponent);
+  return r0 + ratio * (r1 - r0);
+};
+const sqrt = (value, domain, range) => {
+  const [d0, d1] = domain;
+  const [r0, r1] = range;
+  const ratio = Math.sqrt((value - d0) / (d1 - d0));
+  return r0 + ratio * (r1 - r0);
+};
+export {
+  linear,
+  log,
+  pow,
+  sqrt
+};
+//# sourceMappingURL=scale.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"scale.js","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+g6@5.1.0/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":[],"mappings":"AASY,MAAC,SAAS,CAAC,OAAO,QAAQ,UAAU;AAC5C,QAAM,CAAC,IAAI,EAAE,IAAI;AACjB,QAAM,CAAC,IAAI,EAAE,IAAI;AACjB,MAAI,OAAO;AACP,WAAO;AACX,QAAM,SAAS,QAAQ,OAAO,KAAK;AACnC,SAAO,KAAK,SAAS,KAAK;AAC9B;AAUY,MAAC,MAAM,CAAC,OAAO,QAAQ,UAAU;AACzC,QAAM,CAAC,IAAI,EAAE,IAAI;AACjB,QAAM,CAAC,IAAI,EAAE,IAAI;AACjB,QAAM,QAAQ,KAAK,IAAI,QAAQ,KAAK,CAAC,IAAI,KAAK,IAAI,KAAK,KAAK,CAAC;AAC7D,SAAO,KAAK,SAAS,KAAK;AAC9B;AAWY,MAAC,MAAM,CAAC,OAAO,QAAQ,OAAO,WAAW,MAAM;AACvD,QAAM,CAAC,IAAI,EAAE,IAAI;AACjB,QAAM,CAAC,IAAI,EAAE,IAAI;AACjB,QAAM,QAAQ,KAAK,KAAK,QAAQ,OAAO,KAAK,KAAK,QAAQ;AACzD,SAAO,KAAK,SAAS,KAAK;AAC9B;AAUY,MAAC,OAAO,CAAC,OAAO,QAAQ,UAAU;AAC1C,QAAM,CAAC,IAAI,EAAE,IAAI;AACjB,QAAM,CAAC,IAAI,EAAE,IAAI;AACjB,QAAM,QAAQ,KAAK,MAAM,QAAQ,OAAO,KAAK,GAAG;AAChD,SAAO,KAAK,SAAS,KAAK;AAC9B;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,27 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+function getDescendantShapes(shape) {
+  const succeeds = [];
+  const traverse = (shape2) => {
+    if (shape2 === null || shape2 === void 0 ? void 0 : shape2.children.length) {
+      shape2.children.forEach((child) => {
+        succeeds.push(child);
+        traverse(child);
+      });
+    }
+  };
+  traverse(shape);
+  return succeeds;
+}
+function getAncestorShapes(shape) {
+  const ancestors = [];
+  let currentNode = shape.parentNode;
+  while (currentNode) {
+    ancestors.push(currentNode);
+    currentNode = currentNode.parentNode;
+  }
+  return ancestors;
+}
+exports.getAncestorShapes = getAncestorShapes;
+exports.getDescendantShapes = getDescendantShapes;
+//# sourceMappingURL=shape.cjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"shape.cjs","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+g6@5.1.0/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":["shape"],"mappings":";;AAOO,SAAS,oBAAoB,OAAO;AACvC,QAAM,WAAW,CAAA;AAEjB,QAAM,WAAW,CAACA,WAAU;AACxB,QAAIA,WAAU,QAAQA,WAAU,SAAS,SAASA,OAAM,SAAS,QAAQ;AACrE,MAAAA,OAAM,SAAS,QAAQ,CAAC,UAAU;AAC9B,iBAAS,KAAK,KAAK;AACnB,iBAAS,KAAK;AAAA,MAClB,CAAC;AAAA,IACL;AAAA,EACJ;AACA,WAAS,KAAK;AACd,SAAO;AACX;AAQO,SAAS,kBAAkB,OAAO;AACrC,QAAM,YAAY,CAAA;AAClB,MAAI,cAAc,MAAM;AACxB,SAAO,aAAa;AAChB,cAAU,KAAK,WAAW;AAC1B,kBAAc,YAAY;AAAA,EAC9B;AACA,SAAO;AACX;;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,27 @@
+function getDescendantShapes(shape) {
+  const succeeds = [];
+  const traverse = (shape2) => {
+    if (shape2 === null || shape2 === void 0 ? void 0 : shape2.children.length) {
+      shape2.children.forEach((child) => {
+        succeeds.push(child);
+        traverse(child);
+      });
+    }
+  };
+  traverse(shape);
+  return succeeds;
+}
+function getAncestorShapes(shape) {
+  const ancestors = [];
+  let currentNode = shape.parentNode;
+  while (currentNode) {
+    ancestors.push(currentNode);
+    currentNode = currentNode.parentNode;
+  }
+  return ancestors;
+}
+export {
+  getAncestorShapes,
+  getDescendantShapes
+};
+//# sourceMappingURL=shape.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"shape.js","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+g6@5.1.0/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":["shape"],"mappings":"AAOO,SAAS,oBAAoB,OAAO;AACvC,QAAM,WAAW,CAAA;AAEjB,QAAM,WAAW,CAACA,WAAU;AACxB,QAAIA,WAAU,QAAQA,WAAU,SAAS,SAASA,OAAM,SAAS,QAAQ;AACrE,MAAAA,OAAM,SAAS,QAAQ,CAAC,UAAU;AAC9B,iBAAS,KAAK,KAAK;AACnB,iBAAS,KAAK;AAAA,MAClB,CAAC;AAAA,IACL;AAAA,EACJ;AACA,WAAS,KAAK;AACd,SAAO;AACX;AAQO,SAAS,kBAAkB,OAAO;AACrC,QAAM,YAAY,CAAA;AAClB,MAAI,cAAc,MAAM;AACxB,SAAO,aAAa;AAChB,cAAU,KAAK,WAAW;AAC1B,kBAAc,YAAY;AAAA,EAC9B;AACA,SAAO;AACX;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,141 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+require("../constants/change.cjs");
+require("../constants/events/animation.cjs");
+require("../constants/events/canvas.cjs");
+require("../constants/events/combo.cjs");
+const common = require("../constants/events/common.cjs");
+require("../constants/events/container.cjs");
+require("../constants/events/edge.cjs");
+require("../constants/events/graph.cjs");
+require("../constants/events/history.cjs");
+require("../constants/events/node.cjs");
+require("../constants/registry.cjs");
+const pinch = require("./pinch.cjs");
+const isEqual = require("../../../../../../@antv_util@3.3.11/node_modules/@antv/util/esm/lodash/is-equal.cjs");
+const isString = require("../../../../../../@antv_util@3.3.11/node_modules/@antv/util/esm/lodash/is-string.cjs");
+const MODIFIER_KEYS = /* @__PURE__ */ new Set(["Control", "Alt", "Meta", "Shift"]);
+function isModifierKey(key) {
+  return MODIFIER_KEYS.has(key);
+}
+const lowerCaseKeys = (keys) => keys.map((key) => isString(key) ? key.toLocaleLowerCase() : key);
+class Shortcut {
+  constructor(emitter) {
+    this.map = /* @__PURE__ */ new Map();
+    this.boundHandlePinch = () => {
+    };
+    this.recordKey = /* @__PURE__ */ new Set();
+    this.onKeyDown = (event) => {
+      if (!(event === null || event === void 0 ? void 0 : event.key))
+        return;
+      this.recordKey.add(event.key);
+      this.trigger(event);
+    };
+    this.onKeyUp = (event) => {
+      if (!(event === null || event === void 0 ? void 0 : event.key))
+        return;
+      this.recordKey.delete(event.key);
+    };
+    this.onKeyDownWindow = (event) => {
+      if (!isModifierKey(event.key))
+        return;
+      this.recordKey.add(event.key);
+    };
+    this.onKeyUpWindow = (event) => {
+      if (!isModifierKey(event.key))
+        return;
+      this.recordKey.delete(event.key);
+    };
+    this.onWheel = (event) => {
+      this.triggerExtendKey(common.CommonEvent.WHEEL, event);
+    };
+    this.onDrag = (event) => {
+      this.triggerExtendKey(common.CommonEvent.DRAG, event);
+    };
+    this.handlePinch = (event, options) => {
+      this.triggerExtendKey(common.CommonEvent.PINCH, Object.assign(Object.assign({}, event), options));
+    };
+    this.onFocus = () => {
+      this.recordKey.clear();
+    };
+    this.emitter = emitter;
+    this.bindEvents();
+  }
+  bind(key, handler) {
+    if (key.length === 0)
+      return;
+    if (key.includes(common.CommonEvent.PINCH) && !this.pinchHandler) {
+      this.boundHandlePinch = this.handlePinch.bind(this);
+      this.pinchHandler = new pinch.PinchHandler(this.emitter, "pinchmove", this.boundHandlePinch);
+    }
+    this.map.set(key, handler);
+  }
+  unbind(key, handler) {
+    this.map.forEach((h, k) => {
+      if (isEqual(k, key)) {
+        if (!handler || handler === h)
+          this.map.delete(k);
+      }
+    });
+  }
+  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(key) {
+    const recordKeyList = lowerCaseKeys(Array.from(this.recordKey)).sort();
+    const keyList = lowerCaseKeys(key).sort();
+    return isEqual(recordKeyList, keyList);
+  }
+  bindEvents() {
+    var _a;
+    const { emitter } = this;
+    window.addEventListener(common.CommonEvent.KEY_DOWN, this.onKeyDownWindow);
+    window.addEventListener(common.CommonEvent.KEY_UP, this.onKeyUpWindow);
+    emitter.on(common.CommonEvent.KEY_DOWN, this.onKeyDown);
+    emitter.on(common.CommonEvent.KEY_UP, this.onKeyUp);
+    emitter.on(common.CommonEvent.WHEEL, this.onWheel);
+    emitter.on(common.CommonEvent.DRAG, this.onDrag);
+    (_a = globalThis.addEventListener) === null || _a === void 0 ? void 0 : _a.call(globalThis, "focus", this.onFocus);
+  }
+  trigger(event) {
+    this.map.forEach((handler, key) => {
+      if (this.match(key))
+        handler(event);
+    });
+  }
+  /**
+   * <zh/> 扩展 wheel, drag 操作
+   *
+   * <en/> Extend wheel, drag operations
+   * @param eventType - event name
+   * @param event - event
+   */
+  triggerExtendKey(eventType, event) {
+    this.map.forEach((handler, key) => {
+      if (key.includes(eventType)) {
+        if (isEqual(Array.from(this.recordKey), key.filter((k) => k !== eventType))) {
+          handler(event);
+        }
+      }
+    });
+  }
+  destroy() {
+    var _a, _b;
+    this.unbindAll();
+    this.emitter.off(common.CommonEvent.KEY_DOWN, this.onKeyDown);
+    this.emitter.off(common.CommonEvent.KEY_UP, this.onKeyUp);
+    window.removeEventListener(common.CommonEvent.KEY_DOWN, this.onKeyDownWindow);
+    window.removeEventListener(common.CommonEvent.KEY_UP, this.onKeyUpWindow);
+    this.emitter.off(common.CommonEvent.WHEEL, this.onWheel);
+    this.emitter.off(common.CommonEvent.DRAG, this.onDrag);
+    (_a = this.pinchHandler) === null || _a === void 0 ? void 0 : _a.off("pinchmove", this.boundHandlePinch);
+    (_b = globalThis.removeEventListener) === null || _b === void 0 ? void 0 : _b.call(globalThis, "focus", this.onFocus);
+  }
+}
+exports.Shortcut = Shortcut;
+//# sourceMappingURL=shortcut.cjs.map